The Shortest Path of Touring Lines given in the Plane
|
|
- Barbara Nelson
- 6 years ago
- Views:
Transcription
1 Send Orders for Reprnts to 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He 2,*, Ansheng Deng 1 and Tao Nng 3 1 College of Informaton Scence and Technology, Dalan Martme Unversty, Dalan, Laonng, , P.R. Chna; 2 Dept of Informaton and Scence, Dalan Insttute of Scence and Technology, Dalan, Laonng, , P.R. Chna; 3 Software College, Dalan Jaotong Unversty, Dalan, Laonng, , P.R. Chna Abstract: Gven two ponts p, q and a sequence of n lnes (n>1) n the plane, we want to fnd the shortest path of tourng all the gven lnes that starts at p and ends at q. In ths paper, we solve the problem by reducng t to the problem of fndng the shortest path that tours all the segments n a convex polygon from p to q. We frst ntroduce how to construct the convex polygon. Then, we propose the soluton to process the ntersectons of two adjacent segments by crossng over two segments. Fnally, based on rubber-band algorthm, a new algorthm s proposed whch can fnd the shortest path of tourng segments n a convex polygon, and the O(n 2 ) runnng tme can be obtaned for ths problem, whch mproves the prevous O(n 3 logn) tme. Our algorthm s smple and effcent. Keywords: Convex polygon, rubber-band algorthm, shortest path. 1. INTRODUCTION Path plannng s one of the central problem areas n computatonal geometry. The shortest tourng path problem s the most classcal example of path plannng, for example, fndng the shortest path of tourng a gven seres of obstacles between two ponts n the plane [1]. In ths paper, we focus on the soluton to fnd the shortest path of tourng gven lnes n the plane from p to q. The problem s as follows. Assume that there are two ponts p, q and n>1 lne l (for =1,2,, n) n a plane, we want to fnd the shortest path that tours all the gven lnes l from the start pont p to the end pont q, see Fg. (1). The problem gven above s abstracted from the shortest watchman route problem, and t s also the key to solve the shortest watchman route problem [2, 3]. The watchman route problem s derved from the well-known art gallery problem, and the goal s to fnd a shortest closed route n a smple polygon G such that one can see each pont n the polygon G from at least one pont of the route. Hakan Jonsson has presented an algorthm for fndng the shortest path that ntersects n lnes n the plane n O(n 5 ) tme [4]. No more optmal results have been reported recently. Many scholars have been studyng on the tourng segments problems and made some effectve results. For example, for the case n whch the gven segments don t ntersect, n 1984, D. T. Lee and F. P. Preparata proposed Funnel algorthm [5]. In 2007, Faje L and Renhard Kettle proposed rubber-band algorthm [6, 7] (denoted by R algorthm) wth K( ) O(n) tme, where K( )=(L 0 -L) /, L 0 s the ntal Fg. (1). The shortest path of tourng 5 lnes n the plane. shortest path length of tourng all segment set S, L s the actual shortest path, and n s the number of segments. In 2011, R algorthm s obtaned n O(n 2 ) tme by Wang and Huo by the experment. Furthermore, they mproved the algorthm and obtaned the O(n) tme by ntroducng dvde and conquer nto R algorthm [8]. For the case n whch the gven segments possbly ntersectng, the O(n 3 logn) tme algorthm for tourng a sequence of possbly ntersectng lne segments s known [9]. In our paper, the problem of fndng the shortest path for lnes can be converted to the problem of fndng the shortest path for segments n a convex polygon. We frst ntroduce how to construct the convex polygon. Then, on bass of R algorthm, a new algorthm s proposed whch processes the degradaton problem caused by the ntersecton by crossng over two segments when two adjacent segments ntersect. Fnally, we have mplemented t wth C++ program and obtaned the O(n 2 ) tme by experment. The result shows that the algorthm s effcent X/ Bentham Open
2 The Shortest Path of Tourng Lnes gven n the Plane The Open Cybernetcs & Systemcs Journal, 2015, Volume THE METHOD OF CONSTRUCTING CONVEX POLYGON We use OPT(L) to denote the shortest path of tourng gven lne set L from p to q, snce OPT(L) s the shortest path, the parts between consecutve ponts of tour L are lne segments. Moreover, snce a non-convex route n the plane s strctly longer than the boundary of ts convex hull, and the convex hull of a route ntersects any target lne, we conclude that OPT(L) s convex [4]. It mples that OPT(L) vsts each target lne n one of three ways. If the angle of OPT(L) comng nto a lne l wth l (ncomng angle) s equal to the angle of OPT(L) gong away from a lne l wth l (outgong angle), OPT(L) makes a perfect reflecton on the lne l (see Fg. 2a). If OPT(L) passes the lne l twce, OPT(L) makes a crossng contact wth l (see Fg. 2b). The case n whch OPT(L) shares a porton of lnes wth l can be thought of a specal reflecton (see Fg. 2c). Here, we respectvely take the startng pont p and the endng pont q as the ntersecton of two lnes, thus the number of lnes n set L s n+4. We bound the regon n the plane where OPT(L) vsts the set L, and consder the convex hull C of all crossngs(see Fg. 3a). For sets L contanng no parallel target lnes, t can be shown that OPT(L) les n C, and the pont p and q les n C or on the boundary of C. However, f there are parallel lnes n set L, OPT(L) may be not contaned n the convex hull C (see Fg. 4). Snce C s convex, each of ts tangents parttons the plane nto two half-planes of whch the actve half-plane totally contans C. We make all tangents of C that are normal to target lnes, denoted by the set N, and consder the ntersecton G of the actve halfplanes of all tangents n set N (see Fg. 3b), we can conclude OPT(L) s contaned n G [4]. Thus, we can reduce ths problem to compute the shortest path between p and q whch vsts segments n the convex polygon G. 3. COMPUTE THE SHORTEST PATH OF SEG- MENTS IN A CONVEX POLYGON For the case n whch the segments n a convex polygon are dsjont, the soluton has been descrbed n detal n references [6-8]. For the case n whch the segments possbly ntersect, a new algorthm has been ntroduced as follows. (a) (b) (c) Fg. (2). Three types of contacts between OPT(L) and a lne l. (a) The convex hull C 3.1. The Method of Dealng wth the Intersected Segments When the segments ntersect, suppose that the segment s ntersects wth s +1 at the pont C, and q -1 s the path pont on s -1 and s the path pont on s +2. There are three cases between q 1 q and the segments s +2 and s +1, whch are as follows. (b) The polygon G (shaded and contanng C) Fg. (3). Constructng convex polygon. Case 1 q 1 ntersects wth s and s +1 In ths case, obvously, q 1q+ 2 s the local shortest path, denoted by d, d = q 1, and the order of d passng through s and s +1 s the tourng order, f d frst passes through s, the tourng order s s and s +1, otherwse, that s s +1 and s, see Fg. (5). Fg. (4). OPT(L) s not contaned n C.
3 264 The Open Cybernetcs & Systemcs Journal, 2015, Volume 9 Wang et al. (a) (a) Reflecton pont les on s. (b) Fg. (5). q 1q+ 2 ntersects wth s and s +1. (b) Reflecton pont les on s +1. Fg. (7). q 1q doesn t ntersect wth s + 2 and s +1. Case 3 q 1 doesn t ntersect wth s and s +1 (a) Reflecton pont les on s (b) Reflecton pont les on s +1 Fg. (6). q 1q ntersects wth s + 2 or s +1. Case 2 q 1 ntersects wth s or s +1 In ths case, to fnd the shortest path, computng the reflecton pont r on the lne segment s or s +1 s needed (see Fg. 6). The approach n the teraton process s as follows. If q 1 q only ntersects wth s +2 or s +1, the reflecton pont r les on the segment whch does not ntersect wth q 1, d = rq 1 + r, and the tourng order s the order of d passng through s and s +1, f d frst passes through s, the tourng order s s and s +1, otherwse, that s s +1 and s. In ths case, there are two cases whch are shown n Fgs. (7) and (8). (1) the case of computng one reflecton The two segments can be vsted by computng a reflecton pont (see Fg. 7). In ths case, obvously, d = rq 1 + r, here, when d passes through s or s +1 twce, we can deal wth t as above, f d frst passes through s, the tourng order s s and s +1, otherwse, that s s +1 and s. (2) the case of computng two reflectons When the two segments can t be toured by computng a reflecton pont, t needs to compute two reflectons. The approach s as follows. We make the reflecton ponts, denoted by q' -1 and q' +2, of q -1 and wth respect to s and s +1 respectvely. In ths case, there are also three stuatons when computng the local shortest path, see Fg. (8). (1) f q ' 1 q ' +2 ntersects wth s at the pont q and ntersects wth s +1 at the pont q +1, and the two path ponts q and q +1 are on the same sde of q -1 and, they are the two reflectons and also the path ponts. If q 1 q does not ntersect wth q +1, d = q 1 q + q q +1 + q +1 s the local shortest path, and the order of d passng through s and s +1 s the tourng order (see Fg. 8a). Otherwse, we need to change the tourng order of s and s +1 n order to get the local shortest path, then d = q 1 q +1 + q +1 q + q, see Fg. (8b).
4 The Shortest Path of Tourng Lnes gven n the Plane The Open Cybernetcs & Systemcs Journal, 2015, Volume (a) (b) (c) (3) f q' 1q' + 2 doesn t pass the pont C and q' 1q' 2 on the dfferent sde of q 1C and Cq + 2, d = q 1C + Cq + 2, the path ponts q and q +1 also concde wth C, and the order of d passng through s and s +1 s the tourng order, see Fg. 8d). It can be proved as follows. In Fg. (8d), we select a pont q' on segment s and a pont q' +1 on s +1, snce q' 1 q' + q' q ' q' + 1q' + 2 = q 1 q' + q' q ' q' + 1q + 2, Cq ' 1 + Cq ' + 2 = Cq 1 + Cq + 2, obvously, + s q ' +2 q ' +1 + q ' +1 q ' + q ' q ' 1 > Cq ' Cq ' 1, then q ' +1 + q ' +1 q ' + q ' q 1 > Cq+ 2 + Cq 1, d = Cq + Cq follows Algorthm In ths paper, on bass of R algorthm, we apply a new algorthm to compute the shortest tourng path, wth crossng over two segments to process the ntersecton of them when these two segments ntersect. The algorthm s as follows. Assume that s nterests wth s +1, we can compute the path pont q on s and the path pont q +1 on s +1 accordng to the poston relaton between ponts and segments descred above. Next, we judge the poston relatonshp of s +1 and s +2, f s +1 s +2 =, we compute the path pont on s +2 and q +3 on s +3. Otherwse, we compute the path pont q +1 on s +1 and on s +2. The algorthm s composed of four functons whch are Man functon, UpdatePont functon, SkpOne functon and SkpTwo functon. Man functon calculates the shortest path by calculatng all the teraton process. UpdatePont functon calculates the shortest path n every teraton. SkpOne functon calculates the shortest path wth crossng over one segment. SkpTwo functon calculates the shortest path wth crossng over two segments. SkpTwo functon s the key to the algorthm. In reference [8], Man functon, UpdatePont functon, SkpOne functon have been descrbed n detal. Here, we manly gve the SkpTwo functon, t s descrbed below. SkpTwo ( q 1, s, s 1, q ) functon In ths functon, s and s +1 denote segments, q -1 and denote path ponts calculated on segments s -1 and s +2 respectvely. The functon s used to calculate the local optmal path of tourng s and s +1 from q -1 to, and the path ponts q and q +1 can be obtaned. (d) Fg. (8). q -1 and le on the same sde of s and s +1 (two reflecton ponts). (2) f q ' 1 q ' +2 passes the pont C, the reflecton ponts concde wth C and they are also the path ponts(q =q +1 =C), d = q 1 C + C, and the order of d passng through s and s +1 s the tourng order. We can make two auxlary ponts q' and q' +1 on s and s +1 and prove that easly, see Fg. (8c). Denote by r = q 1q+ 2, L the path calculated by SkpOne functon, and s ntersected wth s +1 at q. Case 1 q 1 ntersects wth s and s +1 If ( r s && r s +1 ), we consder that s ntersects wth r at c 1 and s +1 ntersects wth r at c 2 respectvely, let q = c 1 and q +1 = c 2, and f ( q 1 r 2 < q 1 r 1 ), call change ( s, s +1 ) and call change ( q, q +1 ). Case 2 q 1q+ 2 ntersects wth s or s +1
5 266 The Open Cybernetcs & Systemcs Journal, 2015, Volume 9 Wang et al. Fg. (9). The runnng result of 10 segments n a convex polygon. f ( r s r s+1 ) f ( r s ), call SkpOne ( q 1, s+1, q+2 ), and we consder that s ntersects wth L at c1 and s+1 ntersects wth L at c2 respectvely. Let q = c1, q+1 = c2 and rtmp = c2 q+2, else we compute the reflecton ponts, denoted by q'-1 and q'+2, of q-1 and q+2 wth respect to s and s+1 respectvely, let rtmp = q ' 1 q ' + 2, and denote s ntersectng wth rtmp at r1 and s +1 ntersectng wth rtmp at r2. f (q and q 1 le on the same sde of rtmp ), let q +1 = q = q. f ( rtmp s ), call chang ( s, s+1 ), else let q = c1 and q+1 = c2. and call change ( q, q+1 ). f ( r1q 1 else call SkpOne ( q 1, s, q + 2 ),we consder that s ntersects wth L at c1 and s +1 ntersects wth L at c2 respectvely. Let q = c1, q+1 = c2 and rtmp = c1q 1. f ( rtmp s+1 ) call change ( s, s+1 ), and call change ( q, q+1 ). Case 3 q 1q+2 doesn t ntersect wth s and s+1 Call SkpOne ( q 1, s, q+2 ). Denote by L ntersectng wth s at c1 and rtmp = c1q 1. f ( rtmp s+1 ), and the ntersecton s c2, then let q = c1, q+1 = c2, call change ( s, s+1 ) and call change ( q, q+1 ). else call SkpOne ( q 1, s+1, q+2 ). Denote by L ntersectng wth s+1 at c2, and rtmp = r2 q+2. f ( rtmp s ), and rtmp ntersects wth s at c1, q+1q+2 ), call change ( s, s+1 ) and call change ( q, q+1 ). 4. THE ANALYSIS OF RUNNING RESULT In ths paper, we have mplemented the algorthm wth C++ program. Here, we gve an example of tourng 10 segments n a convex polygon. In Fg. (9), the sold lnes are the segments whch the lnes ntersect wth the convex polygon, and the ntersectons are the endponts of segments. The path shown n dotted lnes s the shortest path of tourng the 10 lnes from S to T. We can see that the order of segments s from s1 to s10, whle the output order s dfferent from that of nput. Moreover, the three cases of path ponts and segments descrbed above have been contaned. q1, s3, s2, q6 s the case 1, q2, s6, s5, q7 s the case 2, and q7, s8, s10, T s the case 3. The runnng tme of the algorthm s complex and dffcult to analyze, so n ths paper, we adopt the method of analyss by runnng tme countng to analyze the algorthm s tme complexty. We have tested the algorthm applyng a large of segment sets (for example 500), and the segments number s 1000 n every segment set. Based on the results, we have got the fttng curve equaton of the algorthm, that s y= 1E-05x x , see Fg. (10). The results show that the algorthm s n O(n2) tme, and t s superor to
6 The Shortest Path of Tourng Lnes gven n the Plane The Open Cybernetcs & Systemcs Journal, 2015, Volume CONFLICT OF INTEREST The authors confrm that ths artcle content has no conflct of nterest. ACKNOWLEDGEMENTS Ths work s supported by the Natonal Natural Scence Foundaton of Chna (No , ), the General Project of Laonng Provnce Educaton Department (No. L ) and the General Project of Dalan Insttute of Scence and Technology (No. KYZ1416). REFERENCES Fg. (10). The fttng curve equaton of the algorthm. the O(n 3 logn) tme of reference [9]. It can be seen that our algorthm s effcent. CONCLUSION In ths paper, we convert the problem of computng the shortest tourng path for lnes to the problem of computng the shortest tourng path for segments n a convex polygon, and we present an algorthm for computng the shortest tourng path of segments n a convex polygon, especally, we have mplemented t. The result shows that our algorthm s effcent. Ths research has made prelmnary results. If the segments haven t been gven the order, t has been proved to be a NP hard problem, f we study the shortest path of tourng rays, whch s open and les n between the problems concernng lnes and segments. Those problems need to be further studed. [1] M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computatonal Geometry: Algorths and Applcatons, (3 rd ed.), Sprnger-Verlag Publshers: Berln, 2009, pp [2] X. Tan, Fast computaton of shortest watchman routes n smple polygons, Informaton Processng Letters, vol. 77, no. 1, pp , [3] A. Dumtrescu, J. S. B. Mtchell, and P.. yl sk, Watchman route for lne and segments, Algorthm Theory - SWAT 2012 Lecture Notes n Computer Scence, vol. 7357, pp , [4] H. Jonsson, The travelng salesman problem for lnes n the plane, Informaton Processng Letters, vol. 82, pp , [5] D. T. Lee, and F. P. Preparata, Eucldean shortest paths n the presence of rectlnear barrers, Networks, vol. 14, no. 3, pp , [6] F. L, and R. Klette, Exact and approxmate algorthms for the calculaton of shortest paths, IMA Journal of Management Mathematcs, vol. 17, no. 1, pp , [7] L. Fa-je, and K. Renhard, Shortest path algorthms for sequences of polygons, CAAI Transactons on Intellgent Systems, vol. 3, no. 1, pp , [8] L. Wang, L. Huo, and D. He, An mproved algorthm for eucldean shortest paths of vstng lne segments n the plane, Journal of Convergence Informaton Technology, vol. 6, no. 6, pp , [9] M. Dror, A. Efrat, A. Lubw and J.S.B. Mtchell, Tourng a sequence of polygons, In: Proceedngs 35 th Annual ACM Symposum Theory Computaton, Calforna, USA, 2003, pp Receved: September 16, 2014 Revsed: December 23, 2014 Accepted: December 31, 2014 Wang et al.; Lcensee Bentham Open. Ths s an open access artcle lcensed under the terms of the Creatve Commons Attrbuton Non-Commercal Lcense ( lcenses/by-nc/3.0/) whch permts unrestrcted, non-commercal use, dstrbuton and reproducton n any medum, provded the work s properly cted.
Fast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationOpen Access A New Algorithm for the Shortest Path of Touring Disjoint Convex Polygons
Send Orders for Reprnts to reprnts@benthamscence.ae 1364 The Open Automaton and Control Systems Journal, 2015, 7, 1364-1368 Open Access A New Algorthm for the Shortest Path of Tourng Dsjont Convex Polygons
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 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 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 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 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 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 informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
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 informationCluster 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 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 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 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 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 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 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 Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples
Xanpng Huang, Qng Tan, Janfe Mao, L Jang, Ronghua Lang The Theory and Applcaton of an Adaptve Movng Least Squares for Non-unform Samples Xanpng Huang, Qng Tan, Janfe Mao*, L Jang, Ronghua Lang College
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
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 informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
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 informationSecurity Vulnerabilities of an Enhanced Remote User Authentication Scheme
Contemporary Engneerng Scences, Vol. 7, 2014, no. 26, 1475-1482 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ces.2014.49186 Securty Vulnerabltes of an Enhanced Remote User Authentcaton Scheme Hae-Soon
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
More informationVectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
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 Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
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 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 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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationOpen Access Early Fire Smoke Image Segmentation in a Complex Large Space
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Constructon and Buldng Technology Journal, 2015, 9, 27-31 27 Open Access Early Fre Smoke Image Segmentaton n a Complex Large Space Hu Yan 1,2,*,
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationTouring a Sequence of Polygons
Tourng a Sequence of Polygon Mohe Dror Alon Efrat Anna Lubw Joe Mtchell Unverty of Arzona Unverty of Arzona Unverty of Waterloo Stony Brook Unverty Tourng Polygon Problem Gven: a equence of convex polygon,
More informationShadow Elimination of Moving Targets Base on a Novel Two-Step Algorithm
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal 2015 9 761-769 761 Open Access Shadow Elmnaton of Movng Targets Base on a Novel Two-Step Algorthm Lu Yng * Chongqng
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
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 informationLine Clipping by Convex and Nonconvex Polyhedra in E 3
Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz
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 informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
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 informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
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 informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationParallel Artificial Bee Colony Algorithm for the Traveling Salesman Problem
Parallel Artfcal Bee Colony Algorthm for the Travelng Salesman Problem Kun Xu, Mngyan Jang, Dongfeng Yuan The School of Informaton Scence and Engneerng Shandong Unversty, Jnan, 250100, Chna E-mal: xukun_sdu@163.com,
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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationAPPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION
An Open Access, Onlne Internatonal Journal Avalable at http://www.cbtech.org/pms.htm 2016 Vol. 6 (2) Aprl-June, pp. 11-17/Sh Research Artcle APPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION
More informationQuerying by sketch geographical databases. Yu Han 1, a *
4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,
More informationSolving the large scale knapsack feasibility problem using a distributed computation approach to integer programming
https://do.org/10.1186/s40535-017-0047-0 RESEARCH Open Access Solvng the large scale napsac feasblty problem usng a dstrbuted computaton approach to nteger programmng Zhengtan Wu 1,2*, Fuyuan Hu 1 and
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationObstacle-Aware Routing Problem in. a Rectangular Mesh Network
Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More informationA SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens
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 informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationComputing the Minimum Directed Distances Between Convex Polyhedra
JOURNAL OF INFORMAION COMUING SCIENCE DISANCES AND ENGINEERING BEWEEN CONVEX 15, 353-373 OLYHEDRA (1999) 353 Computng the Mnmum Drected Dstances Between Convex olyhedra Department of Electrcal Engneerng
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 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 informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationAn Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane
An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola
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 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 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 informationIncremental Learning with Support Vector Machines and Fuzzy Set Theory
The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
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 informationSolving some Combinatorial Problems in grid n-ogons
Solvng some Combnatoral Problems n grd n-ogons Antono L. Bajuelos, Santago Canales, Gregoro Hernández, Ana Mafalda Martns Abstract In ths paper we study some problems related to grd n-ogons. A grd n-ogon
More informationTask Scheduling for Directed Cyclic Graph. Using Matching Technique
Contemporary Engneerng Scences, Vol. 8, 2015, no. 17, 773-788 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ces.2015.56193 Task Schedulng for Drected Cyclc Graph Usng Matchng Technque W.N.M. Arffn
More informationA HOPFIED NEURAL NETWORK ALGORITHM FOR AUTOMATED NAME PLACEMENT FOR POINT FEATURE
A HOPFIED NEURAL NETWORK ALGORITHM FOR AUTOMATED NAME PLACEMENT FOR POINT FEATURE Fan Hong Zhang zuxun Du Daosheng The State key Lab. of,wtusm,39 Luoyu Road,Wuhan,Chna,430070 Tel: 86-07-87889, Fax:86-07-87643969
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationStraight Line Detection Based on Particle Swarm Optimization
Sensors & ransducers 013 b IFSA http://www.sensorsportal.com Straght Lne Detecton Based on Partcle Swarm Optmzaton Shengzhou XU, Jun IE College of computer scence, South-Central Unverst for Natonaltes,
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationApplication of Clustering Algorithm in Big Data Sample Set Optimization
Applcaton of Clusterng Algorthm n Bg Data Sample Set Optmzaton Yutang Lu 1, Qn Zhang 2 1 Department of Basc Subjects, Henan Insttute of Technology, Xnxang 453002, Chna 2 School of Mathematcs and Informaton
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
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 Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China
for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng
More informationBRDPHHC: A Balance RDF Data Partitioning Algorithm based on Hybrid Hierarchical Clustering
015 IEEE 17th Internatonal Conference on Hgh Performance Computng and Communcatons (HPCC), 015 IEEE 7th Internatonal Symposum on Cyberspace Safety and Securty (CSS), and 015 IEEE 1th Internatonal Conf
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 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 informationImprovement ofmanik et al. s remote user authentication scheme
Improvement ofmank et al. s remote user authentcaton scheme Abstract Jue-Sam Chou, a,yaln Chen b Jyun-Yu Ln c a Department of Informaton Management, Nanhua Unversty Chay, 622, Tawan schou@mal.nhu.edu.tw
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
More informationInsertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array
Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationCHAPTER 10: ALGORITHM DESIGN TECHNIQUES
CHAPTER 10: ALGORITHM DESIGN TECHNIQUES So far, we have been concerned wth the effcent mplementaton of algorthms. We have seen that when an algorthm s gven, the actual data structures need not be specfed.
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
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 informationNonlocal Mumford-Shah Model for Image Segmentation
for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:
More information