Hiding data in images by simple LSB substitution
|
|
- Aubrie Conley
- 5 years ago
- Views:
Transcription
1 Pattern Recognton 37 (004) Hdng data n mages by smple LSB substtuton Ch-Kwong Chan, L.M. Cheng Department of Computer Engneerng and Informaton Technology, Cty Unversty of Hong Kong, Hong Kong Receved 17 May 00; receved n revsed form 11 July 003; accepted 11 August 003 Abstract In ths paper, a data hdng scheme by smple LSB substtuton s proposed. By applyng an optmal pxel adjustment process to the stego-mage obtaned by the smple LSB substtuton method, the mage qualty of the stego-mage can be greatly mproved wth low extra computatonal complexty. The worst case mean-square-error between the stego-mage and the cover-mage s derved. Expermental results show that the stego-mage s vsually ndstngushable from the orgnal cover-mage. The obtaned results also show a sgncant mprovement wth respect to a prevous work.? 003 Pattern Recognton Socety. Publshed by Elsever Ltd. All rghts reserved. Keywords: Data hdng; LSB substtuton 1. Introducton Data hdng s a method of hdng secret messages nto a cover-meda such that an unntended observer wll not be aware of the exstence of the hdden messages. In ths paper, 8-bt grayscale mages are selected as the covermeda. These mages are called cover-mages. Cover-mages wth the secret messages embedded n them are called stego-mages. For data hdng methods, the mage qualty refers to the qualty of the stego-mages. In the lterature, many technques about data hdng have been proposed [1 5]. One of the common technques s based on manpulatng the least-sgncant-bt (LSB) planes by drectly replacng the LSBs of the cover-mage wth the message bts. LSB methods typcally acheve hgh capacty. Wang et al. [6] proposed to embed secret messages n the moderately sgncant bt of the cover-mage. A genetc algorthm s developed to nd an optmal substtuton matrx for the embeddng of the secret messages. They also proposed to use a local pxel adjustment process (LPAP) to mprove the mage qualty of the stego-mage. Unfortunately, Correspondng author. E-mal address: kwong.chan@alumn.ctyu.edu.hk (C.-K. Chan). snce the local pxel adjustment process only consders the last three least sgncant bts and the fourth bt but not on all bts, the local pxel adjustment process s obvously not optmal. The weakness of the local pxel adjustment process s ponted out n Ref. [7]. As the local pxel adjustment process modes the LSBs, the technque cannot be appled to data hdng schemes based on smple LSB substtuton. Recently, Wang et al. [8] further proposed a data hdng scheme by optmal LSB substtuton and genetc algorthm. Usng the proposed algorthm, the worst mean-square-error (WMSE) between the cover-mage and the stego-mage s shown to be 1 of that obtaned by the smple LSB substtuton method. In ths paper, a data hdng scheme by smple LSB substtuton wth an optmal pxel adjustment process (OPAP) s proposed. The basc concept of the OPAP s based on the technque proposed n Ref. [7]. The operatons of the OPAP s generalzed. The WMSE between the cover-mage and the stego-mage s derved. It s shown that the WMSE obtaned by the OPAP could be less than 1 of that obtaned by the smple LSB substtuton method. Expermental results demonstrate that enhanced mage qualty can be obtaned wth low extra computatonal complexty. The results obtaned also show better performance than the optmal substtuton method descrbed n Ref. [8] /$30.00? 003 Pattern Recognton Socety. Publshed by Elsever Ltd. All rghts reserved. do: /j.patcog
2 470 C.-K. Chan, L.M. Cheng / Pattern Recognton 37 (004) The rest of the paper s organzed as follows. Secton brey descrbes the smple LSB substtuton. In Secton 3, the optmal pxel adjustment process s descrbed and the performance s analyzed. Expermental results are gven n Secton 4. Fnally, Secton 5 concludes ths paper. Table 1 Worst PSNR for k = 1 5 by smple LSB substtuton k PSNR Data hdng by smple LSB substtuton In ths secton, the general operatons of data hdng by smple LSB substtuton method s descrbed. Let C be the orgnal 8-bt grayscale cover-mage of M c N c pxels represented as C = {x j 0 6 M c; 0 6 j N c; x j {0; 1;:::;55}}: (1) M be the n-bt secret message represented as M = {m 0 6 n; m {0; 1}}: () Suppose that the n-bt secret message M s to be embedded nto the k-rghtmost LSBs of the cover-mage C. Frstly, the secret message M s rearranged to form a conceptually k-bt vrtual mage M represented as M = {m 0 6 n ;m {0; 1;:::; k 1}}; (3) where n M c N c. The mappng between the n-bt secret message M = {m } and the embedded message M = {m } can be dened as follows: k 1 m = m k+j k 1 j : j=0 Secondly, a subset of n pxels {x l1 ;x l ;:::;x ln } s chosen from the cover-mage C n a predened sequence. The embeddng process s completed by replacng the k LSBs of x l by m. Mathematcally, the pxel value x l of the chosen pxel for storng the k-bt message m s moded to form the stego-pxel x l as follows: x l = x l x l mod k + m : (4) In the extracton process, gven the stego-mage S, the embedded messages can be readly extracted wthout referrng to the orgnal cover-mage. Usng the same sequence as n the embeddng process, the set of pxels {x l 1 ;x l ;:::;x l n } storng the secret message bts are selected from the stego-mage. The k LSBs of the selected pxels are extracted and lned up to reconstruct the secret message bts. Mathematcally, the embedded message bts m can be recovered by m = x l mod k : (5) Suppose that all the pxels n the cover-mage are used for the embeddng of secret message by the smple LSB substtuton method. Theoretcally, n the worst case, the PSNR of the obtaned stego-mage can be computed by 55 PSNR worst =10 log 10 WMSE 55 =10 log 10 db: (6) ( k 1) Table 1 tabulates the worst PSNR for some k = 1 5. It could be seen that the mage qualty of the stego-mage s degraded drastcally when k Optmal pxel adjustment process In ths secton, an optmal pxel adjustment process (OPAP) s proposed to enhance the mage qualty of the stego-mage obtaned by the smple LSB substtuton method. The basc concept of the OPAP s based on the technque proposed n Ref. [7]. Let p, p and p be the correspondng pxel values of the th pxel n the cover-mage C, the stego-mage C obtaned by the smple LSB substtuton method and the re- ned stego-mage obtaned after the OPAP. Let = p p be the embeddng error between p and p. Accordng to the embeddng process of the smple LSB substtuton method descrbed n Secton, p s obtaned by the drect replacement of the k least sgncant bts of p wth k message bts, therefore, k k : (7) The value of can be further segmented nto three ntervals, such that Interval 1: k 1 k ; Interval : k k 1 ; Interval 3: k k 1 : (8) Based on the three ntervals, the OPAP, whch mod- es p to form the stego-pxel p, can be descrbed as follows: Case 1( k 1 k ): If p k, then p = p k ; otherwse p = p ; Case ( k k 1 ): p = p ; Case 3( k k 1 ): If p 56 k, then p = p + k ; otherwse p = p.
3 C.-K. Chan, L.M. Cheng / Pattern Recognton 37 (004) Let = p p be the embeddng error between p and. can be computed as follows: Case 1( k 1 k and p k ) p = p p = p k p = k k 1 k k k k 1 0: Case ( k 1 k and p k ) = p p = p p = k 1 k : Case 3( k k 1 ) = p p = p p = k k 1 : Case 4( k k 1 and p 56 k ) = p p = p + k p = + k k + k k 1 + k 0 k 1 : Case 5( k k 1 and p 56 k ) = p p = p p = k k 1 : From the above ve cases, t can be seen that the absolute value of may fall nto the range k 1 k only when p k (Case ) and p 56 k (Case 5); whle for other possble values of p, falls nto the range k 1. Because p s obtaned by the drect replacement of the k LSBs of p wth the message bts, p k and p 56 k are equvalent to p k and p 56 k, respectvely. In general, for grayscale natural mages, when k 6 4, the number of pxels wth pxel values smaller than k or greater than 56 k s nsgnfcant. As a result, t could be estmated that the absolute embeddng error between pxels n the cover-mage and n the stego-mage obtaned after the proposed OPAP s lmted to Combnng Eqs. (6) and (10), we have WMSE = (k 1 ) ( k 1) WMSE = WMSE when k =1; 4 WMSE when k =; 9 16 WMSE when k =3; WMSE when k =4: 5 (11) Eq. (11) reveals that WMSE 1 WMSE, for k ; and WMSE 1 WMSE when k = 4. Ths result also shows 4 that the WMSE obtaned by the OPAP s better than that obtaned by the optmal substtuton method proposed n Ref. [8] n whch WMSE = 1 WMSE. Moreover, the optmal pxel adjustment process only requres a checkng of the embeddng error between the orgnal cover-mage and the stego-mage obtaned by the smple LSB substtuton method to form the nal stego-mage. The extra computatonal cost s very small compared wth Wang s method [8] whch requres huge computaton for the genetc algorthm to nd an optmal substtuton matrx. 4. Expermental results Ths secton presents expermental results obtaned for two cover-mage sets. The rst set of cover-mages conssts of four standard grayscale mages, Lena, Baboon, Jet and Scene, each of pxels, as depcted n Fg. 1. The second set conssts of 1000 randomly k 1 : (9) Let WMSE and WMSE be the worst case mean-squareerror between the stego-mage and the cover-mage obtaned by the smple LSB substtuton method and the proposed method wth OPAP, respectvely. Accordng to Eq. (9) WMSE can be derved by WMSE 1 = M c N c M c N c 1 =0 ( k 1 ) =( k 1 ) : (10) Fg. 1. The rst set cover-mages of sze pxels.
4 47 C.-K. Chan, L.M. Cheng / Pattern Recognton 37 (004) Fg.. Test mage used as the second set of secret message. generated grayscale mages. There are two set of secret messages. The rst set of secret message conssts of 1000 randomly generated message of k bts, where k refers to the number of LSBs n the cover mage pxels that are used to hold the secret data bts. For example, suppose that the last two LSBs of the cover mage pxels are used to hold the secret data, then the secret data s of sze = bts. The second set conssts of the reduced-szed mages of the grayscale mage T as shown n Fg.. The reduced-szed mages are of sze pxels (for 4-bt nserton), pxels (for 3-bt nserton), pxels (for -bt nserton) and pxels (for 1-bt nserton), respectvely. The results of embeddng the rst set of secret messages nto the rst set of cover-mages are lsted n Table. Referrng to Table, the column labeled OPAP s our proposed method wth the optmal pxel adjustment process; the column labeled LSB s the smple LSB substtuton method; and the column labeled OLSB n the optmal LSB substtuton method proposed n Ref. [8]. For the OPAP and LSB methods, the obtaned PSNR values are the average values of embeddng the 1000 sets random messages nto the cover-mages. For the OLSB method, for k =1;, the obtaned PSNR values are the average values of embeddng the 1000 sets random messages nto the cover-mages, for k = 3, the obtaned PSNR values are the average values of embeddng the 10 out of 1000 sets random messages nto the cover-mages whle for k = 4, no experments are conducted due to the large number of searchng space for the optmal substtuton matrx. The results reveal that our proposed method has much better performance than the LSB and OLSB methods for k = 4. The results of embeddng the reduced-szed mage of Fg. nto the rst set of cover-mages are lsted n Table 3. The results also reveal that our proposed method has much better performance than the LSB and OLSB methods for k = 4. Table 4 also shows the percentage of cover mage pxels assocated wth the ve cases: Case 1 ( k 1 k and p k ); Case ( k 1 k and p k ); Case 3 ( k k 1 ); Case 4 ( k k 1 and p 56 k ); Case 5 ( k k 1 and p 56 k ): (1) Table The results of embeddng the random messages nto the rst set of cover-mages Cover mage k OPAP LSB OLSB Lena Baboon Jet Scene
5 C.-K. Chan, L.M. Cheng / Pattern Recognton 37 (004) Table 3 The results of embeddng the reduced-szed mage of Fg. nto the rst set of cover-mages Cover mage k OPAP LSB OLSB Lena Baboon Jet Scene Table 4 The percentage of cover mage pxels assocated wth the ve cases (Eq. (1)) when the reduced-szed mages of Fg. are embedded nto the cover-mages Cover mage k Case 1 (%) Case (%) Case 3 (%) Case 4 (%) Case 5 Lena Baboon Jet Scene when the reduced-szed mages of Fg. are embedded nto the cover-mages. For llustratve purpose, Fg. 3 shows a par of stego-mages obtaned by embeddng the reduced-szed mage T of sze pxels nto the cover-mage Lena of sze pxels usng the smple LSB method and the proposed OPAP method. From Fg. 3(a) (stego-mage obtaned by the smple LSB-substtuton method), one can see some false contours appearng on the shoulder of Lena. The unwanted artfacts may arse suspcon and defeat the purpose of steganography. However, there s no such artfacts appearng on the stego-mage (Fg. 3(b)) obtaned by the proposed method. The vsual qualty of stego-mages obtaned by the proposed method are much better than that of obtaned by the smple LSB-substtuton method. To further evaluate the performance of the proposed method, the reduced-szed mage of Fg. are embedded nto 1000 sets randomly generated cover-mages and the obtaned average PSNR values are lsted n Table 5. The
6 474 C.-K. Chan, L.M. Cheng / Pattern Recognton 37 (004) (a) (b) Fg. 3. Stego-mages obtaned by (a) Smple LSB-substtuton method; (b) proposed method, where the secret-mage s of sze pxels (4-bt nserton). Table 5 The results of embeddng the reduced-szed mage of Fg. nto the second set of cover-mages Cover mage k OPAP LSB Random results show that smlar PSNR values can be obtaned for derent type of cover-mages. 5. Concluson In ths paper, a data hdng method by smple LSB substtuton wth an optmal pxel adjustment process s proposed. The mage qualty of the stego-mage can be greatly mproved wth low extra computatonal complexty. Extensve experments show the eectveness of the proposed method. The results obtaned also show sgncant mprovement than the method proposed n Ref. [8] wth respect to mage qualty and computatonal ecency. References [1] A.Z. Trkel, R.G. Van Schyndel, C.F. Osborne, A dgtal watermark, Proceedngs of ICIP 1994, Austn Conventon Center, Austn, Texas, Vol. II, 1994, pp [] W. Bender, N. Mormoto, A. Lu, Technques for data hdng, IBM Syst. J. 35 (3/4) (1996) [3] T.S. Chen, C.C. Chang, M.S. Hwang, A vrtual mage cryptosystem based upon vector quantzaton, IEEE Trans. Image Process. 7 (10) (1998) [4] L.M. Marvel, C.G. Boncelet, C.T. Retter, Spread spectrum mage steganography, IEEE Trans. Image Process. 8 (8) (1999) [5] K.L. Chung, C.H. Shen, L.C. Chang, A novel SVD- and VQ-based mage hdng scheme, Pattern Recognton Lett. (9) (001) [6] Ran-Zan Wang, Ch-Fang Ln, Ja-Chen Ln, Hdng data n mages by optmal moderately sgncant-bt replacement, IEE Electron. Lett. 36 (5) (000) [7] Ch-Kwong Chan, L.M. Cheng, Improved hdng data n mages by optmal moderately sgncant-bt replacement, IEE Electron. Lett. 37 (16) (001) [8] Ran-Zan Wang, Ch-Fang Ln, Ja-Chen Ln, Image hdng by optmal LSB substtuton and genetc algorthm, Pattern Recognton 34 (3) (001) About the Author CHI-KWONG CHAN receved the B.Eng. and M.Phl. degrees n Electronc Engneerng and the Ph.D. degree n Computer Engneerng and Informaton Technology from Cty Unversty of Hong Kong n 1996, 1999, and 003, respectvely. Hs research nterests nclude securty, mage processng, neural networks, and FPGA mplementaton. About the Author L.M. CHENG receved the B.Sc. degree n Physcs and Computer Scence and the Ph.D. degree from Kng s College London (prevously Queen Elzabeth College), Unversty of London n 1979 and 198, respectvely. He had been employed as a research fellow at Kng s College, London, Prncpal Engneer of ERA Technology Ltd. UK, and Project Manager and Senor Consultant at Logca Space and Defence Systems Ltd. UK. He joned Cty Unversty of Hong Kong n 1989 and s now an Assocate Professor at the Cty Unversty of Hong Kong. Hs research nterests nclude mage processng, securty, and neural network.
Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationCONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION
CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala
More informationNovel Pre-Compression Rate-Distortion Optimization Algorithm for JPEG 2000
Novel Pre-Compresson Rate-Dstorton Optmzaton Algorthm for JPEG 2000 Yu-We Chang, Hung-Ch Fang, Chung-Jr Lan, and Lang-Gee Chen DSP/IC Desgn Laboratory, Graduate Insttute of Electroncs Engneerng Natonal
More informationA New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane
A New Scramblng Evaluaton Scheme based on Spatal Dstrbuton Entropy and Centrod Dfference of Bt-plane Lang Zhao *, Avshek Adhkar Kouch Sakura * * Graduate School of Informaton Scence and Electrcal Engneerng,
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationScroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator
Latest Trends on Crcuts, Systems and Sgnals Scroll Generaton wth Inductorless Chua s Crcut and Wen Brdge Oscllator Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * Abstract An nductorless Chua
More informationImproved Lossless Data Hiding for JPEG Images Based on Histogram Modification
Copyrght 2018 Tech Scence Press CMC, vol.55, no.3, pp.495-507, 2018 Improved Lossless Data Hdng for JPEG Images Based on Hstogram Modfcaton Yang Du 1, Zhaoxa Yn 1, 2, * and Xnpeng Zhang 3 Abstract: Ths
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationA Novel Feistel Cipher Involving a Bunch of Keys supplemented with Modular Arithmetic Addition
(IJACSA) Internatonal Journal of Advanced Computer Scence Applcatons, A Novel Festel Cpher Involvng a Bunch of Keys supplemented wth Modular Arthmetc Addton Dr. V.U.K Sastry Dean R&D, Department of Computer
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationOdd/Even Scroll Generation with Inductorless Chua s and Wien Bridge Oscillator Circuits
Watcharn Jantanate, Peter A. Chayasena, Sarawut Sutorn Odd/Even Scroll Generaton wth Inductorless Chua s and Wen Brdge Oscllator Crcuts Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * School
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationRotation Invariant Shape Contexts based on Feature-space Fourier Transformation
Fourth Internatonal Conference on Image and Graphcs Rotaton Invarant Shape Contexts based on Feature-space Fourer Transformaton Su Yang 1, Yuanyuan Wang Dept of Computer Scence and Engneerng, Fudan Unversty,
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationUnified Subspace Analysis for Face Recognition
Unfed Subspace Analyss for Face Recognton Xaogang Wang and Xaoou Tang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, Hong Kong {xgwang, xtang}@e.cuhk.edu.hk Abstract PCA, LDA
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationReversible Data Hiding Based on Two-level HDWT Coefficient Histograms
Reversble Data Hdng Based on Two-level HDWT Coeffcent Hstograms Xu-Ren Luo 1, Chen-Hu Jerry Ln 2 and Te-Lung Y 3 1 Department of Electrcal and Electronc Engneerng, Chung Cheng Insttute of Technology, Natonal
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationAn LSB Data Hiding Technique Using Natural Numbers
An LSB Data Hdng Technque Usng Natural Numbers Sandan Dey (1), Aj Abraham (), Sugata Sanyal (3) 1 Anshn Software Prvate Lmted, Kolata 700091 Centre for Quantfable Qualty of Servce n Communcaton Systems
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationCryptanalysis of pairing-free certificateless authenticated key agreement protocol
Cryptanalyss of parng-free certfcateless authentcated key agreement protocol Zhan Zhu Chna Shp Development Desgn Center CSDDC Wuhan Chna Emal: zhuzhan0@gmal.com bstract: Recently He et al. [D. He J. Chen
More informationThe Digital Fingerprinting Method for Static Images Based on Weighted Hamming Metric and on Weighted Container Model
Journal of Computer and Communcatons, 04,, -6 Publshed Onlne July 04 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.436/cc.04.906 The Dgtal Fngerprntng Method for Statc Images Based on Weghted
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationRegularized Discriminant Analysis for Face Recognition
1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationEXPANSIVE MAPPINGS. by W. R. Utz
Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs
More informationOn the Repeating Group Finding Problem
The 9th Workshop on Combnatoral Mathematcs and Computaton Theory On the Repeatng Group Fndng Problem Bo-Ren Kung, Wen-Hsen Chen, R.C.T Lee Graduate Insttute of Informaton Technology and Management Takmng
More informationA New Metric for Quality Assessment of Digital Images Based on Weighted-Mean Square Error 1
A New Metrc for Qualty Assessment of Dgtal Images Based on Weghted-Mean Square Error Proceedngs of SPIE, vol. 4875, 2002 Kawen Zhang, Shuozhong Wang, and Xnpen Zhang School of Communcaton and Informaton
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationImproved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationA Network Intrusion Detection Method Based on Improved K-means Algorithm
Advanced Scence and Technology Letters, pp.429-433 http://dx.do.org/10.14257/astl.2014.53.89 A Network Intruson Detecton Method Based on Improved K-means Algorthm Meng Gao 1,1, Nhong Wang 1, 1 Informaton
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationA Self-embedding Robust Digital Watermarking Algorithm with Blind Detection
Sensors & Transducers Vol 77 Issue 8 August 04 pp 50-55 Sensors & Transducers 04 by IFSA Publshng S L http://wwwsensorsportalcom A Self-embeddng Robust Dgtal Watermarkng Algorthm wth Blnd Detecton Gong
More informationDesigning of Combined Continuous Lot By Lot Acceptance Sampling Plan
Internatonal Journal o Scentc Research Engneerng & Technology (IJSRET), ISSN 78 02 709 Desgnng o Combned Contnuous Lot By Lot Acceptance Samplng Plan S. Subhalakshm 1 Dr. S. Muthulakshm 2 1 Research Scholar,
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationOptimum Reversible Information Hiding Based on Adaptive Joint Processing
Internatonal Forum on Energy, Envronment and Sustanable Development (IFEESD 2016 Optmum Reversble Informaton Hdng Based on Adaptve Jont Processng Zhe Mao1,a, Ynfa Zhang1, Ln Zhou1, and Tnglong Du2 1 Department
More informationMath Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
Math Revew CptS 223 dvanced Data Structures Larry Holder School of Electrcal Engneerng and Computer Scence Washngton State Unversty 1 Why do we need math n a data structures course? nalyzng data structures
More informationA Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling
Proceedngs of the World Congress on Engneerng and Computer Scence 007 WCECS 007, October 4-6, 007, San Francsco, USA A Fast Fractal Image Compresson Algorthm Usng Predefned Values for Contrast Scalng H.
More informationOrientation Model of Elite Education and Mass Education
Proceedngs of the 8th Internatonal Conference on Innovaton & Management 723 Orentaton Model of Elte Educaton and Mass Educaton Ye Peng Huanggang Normal Unversty, Huanggang, P.R.Chna, 438 (E-mal: yepeng@hgnc.edu.cn)
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationMULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN
MULTISPECTRAL IMAGE CLASSIFICATION USING BACK-PROPAGATION NEURAL NETWORK IN PCA DOMAIN S. Chtwong, S. Wtthayapradt, S. Intajag, and F. Cheevasuvt Faculty of Engneerng, Kng Mongkut s Insttute of Technology
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationParameter Estimation for Dynamic System using Unscented Kalman filter
Parameter Estmaton for Dynamc System usng Unscented Kalman flter Jhoon Seung 1,a, Amr Atya F. 2,b, Alexander G.Parlos 3,c, and Klto Chong 1,4,d* 1 Dvson of Electroncs Engneerng, Chonbuk Natonal Unversty,
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationA Single-Machine Deteriorating Job Scheduling Problem of Minimizing the Makespan with Release Times
A Sngle-Machne Deteroratng Job Schedulng Problem of Mnmzng the Makespan wth Release Tmes Wen-Chung Lee, Chn-Cha Wu, and Yu-Hsang Chung Abstract In ths paper, we study a sngle-machne deteroratng ob schedulng
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationA Novel Fuzzy logic Based Impulse Noise Filtering Technique
Internatonal Journal of Advanced Scence and Technology A Novel Fuzzy logc Based Impulse Nose Flterng Technque Aborsade, D.O Department of Electroncs Engneerng, Ladoke Akntola Unversty of Tech., Ogbomoso.
More informationCOMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,
COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,
More informationLow Complexity Soft-Input Soft-Output Hamming Decoder
Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg
More informationMemory ecient adaptation of vector quantizers to time-varying channels
Sgnal Processng 83 (3) 59 58 www.elsever.com/locate/sgpro Memory ecent adaptaton of vector quantzers to tme-varyng channels orbert Gortz a;,jorg Klewer b a Insttute for Communcatons Engneerng (LT), Munch
More informationIntegrating Neural Networks and PCA for Fast Covert Surveillance
Integratng Neural Networks and PCA for Fast Covert Survellance Hazem M. El-Bakry, and Mamoon H. Mamoon Faculty of Computer Scence & Informaton Systems, Mansoura Unversty, EGYPT E-mal: helbakry0@yahoo.com
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationBounds for Spectral Radius of Various Matrices Associated With Graphs
45 5 Vol.45, No.5 016 9 AVANCES IN MATHEMATICS (CHINA) Sep., 016 o: 10.11845/sxjz.015015b Bouns for Spectral Raus of Varous Matrces Assocate Wth Graphs CUI Shuyu 1, TIAN Guxan, (1. Xngzh College, Zhejang
More informationMDL-Based Unsupervised Attribute Ranking
MDL-Based Unsupervsed Attrbute Rankng Zdravko Markov Computer Scence Department Central Connectcut State Unversty New Brtan, CT 06050, USA http://www.cs.ccsu.edu/~markov/ markovz@ccsu.edu MDL-Based Unsupervsed
More informationHardware Implementation of Multiple Vector Quantization Decoder
54 IJCSNS Internatonal Journal of Computer Scence and Networ Securty, VOL.8 No., November 008 Hardware Implementaton of Multple Vector Quantzaton Decoder Nortaa Shge, Hrom Myajma, Shngo Hashguch, Mchharu
More informationhalftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach
olorant-based drect bnary search» halftonng Journal of Electronc Iagng, vol., no. 4, Oct. 22 Je-Ho Lee and Jan P. Allebach School of Electrcal Engneerng & oputer Scence Kyungpook Natonal Unversty Abstract
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationNatural Images, Gaussian Mixtures and Dead Leaves Supplementary Material
Natural Images, Gaussan Mxtures and Dead Leaves Supplementary Materal Danel Zoran Interdscplnary Center for Neural Computaton Hebrew Unversty of Jerusalem Israel http://www.cs.huj.ac.l/ danez Yar Wess
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationAn Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors
An Algorthm to Solve the Inverse Knematcs Problem of a Robotc Manpulator Based on Rotaton Vectors Mohamad Z. Al-az*, Mazn Z. Othman**, and Baker B. Al-Bahr* *AL-Nahran Unversty, Computer Eng. Dep., Baghdad,
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationAN ADAPTIVE WATERMARKING ALGORITHM FOR DEM BASED ON DFT
AN ADAPTIVE WATERMARKING ALGORITHM FOR DEM BASED ON DFT Changqng Zhu 1 Zhwe Wang 2 Y Long 1 Chengsong Yang 2 1 Key Laboratory of Vrtual Geographc Envronment, Nanjng Normal Unversty, Nanjng 210054;2 Insttute
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationMulti-Scale Weighted Nuclear Norm Image Restoration: Supplementary Material
Mult-Scale Weghted Nuclear Norm Image Restoraton: Supplementary Materal 1. We provde a detaled dervaton of the z-update step (Equatons (9)-(11)).. We report the deblurrng results for the ndvdual mages
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More information