An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms
|
|
- Wilfrid O’Brien’
- 5 years ago
- Views:
Transcription
1 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 An Optmzaton Approach for Path Synthess of Four-bar Grashof Mechansms A.S.M.Alhajj, J.Srnvas Abstract Ths paper presents an optmzaton scheme based on the prncple of harmonysearch for path synthess of Grashof four-bar mechansms. The objectve n ths work s to mnmze poston error defned by the coordnates of coupler pont subjected to satsfacton of constrants such as Grashof crteron and sequence on nput lnk angles n addton to geometrcal constrants on the desgn varables. A generalzed approach s formulated such that the mnmzaton of objectve s carred-out only after a feasble soluton has been obtaned. Two benchmark examples for path synthess wth and wthout prescrbed tmngs (nput lnk angles for each precson pont) are consdered to llustrate the effectveness of the method. Keywords: Path synthess, Poston error, Crank-rocker mechansm, Constraned- Optmzaton, Harmony search. Introducton Lnkages havng rgd members are exclusvely used n the area of mechancal engneerng for moton and energy transmsson from one or more nput members to output members. Four-bar lnkages are a class of smple but practcally mportant mechansms. Ther utlzaton ranges from smple devces, such as wndsheldwpng mechansms and door-closng mechansms to complcated rock crushers, sewng machnes, round balers and suspenson systems of automobles. Two basc concepts nvolved n the desgn of lnkages are: analyss and synthess. The term synthess refers to the process of obtanng lnkage parameters to obtan a requred task. In dmensonal synthess of lnkages, three dfferent problems are commonly seen. These nclude: moton-generaton, functon-generaton and path generaton. Desgn of a lnkage for generaton of a partcular path s relatvely a dffcult task. In fact, the problem of path synthess of a four-bar lnkage s to generate a mechansm whose coupler pont can trace the desred trajectory or target ponts. The path synthess of a four-bar lnkage has been actvely studed durng the past 50 years. There has been a large number of studes on ths topc usng a varety of methods. Analytcal soluton to the general problem of four-bar lnkage synthess wth more than fve precson ponts s a qute dffcult task. For such stuatons, a varety of numercal methods can be employed. One such approach s optmzaton, n whch a defned objectve functon n terms of lnkage varables s mnmzed under certan constrants. The most common objectve functon s poston error, A.S.M.Alhajj Department of Mechancal Engneerng, NIT-Rourkela, E-mal: ahmedme63@gmal.com J.Srnvas (Correspondng author) Department of Mechancal Engneerng, NIT-Rourkela, Rourkela , E-mal: srn07@yahoo.co.n
2 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 defned as the sum of the squares of the Eucldean dstance between the target and generated coupler ponts. Several authors descrbed the use of unconventonal optmzaton schemes for solvng path synthess problem of four-bar mechansms. Cabrera et al. [] ntated the applcaton of genetc algorthms (GA) for optmal synthess of four-bar lnkages. Later-on, evolutonary algorthms [], Genetc-fuzzy scheme [3], geometrc constraned programmng approach [4], ant-gradent algorthm [5], partcle swarm optmzaton (PSO) and dfferental evoluton [6], real-coded evolutonary algorthms [7] have been adopted for path synthess problem. Some works [8-9] hghlghted the use of meta-heurstc methods for mult-objectve Pareto optmum synthess of fourbar lnkages. Recently, there s a ganng nterest towards development of new optmzaton heurstcs that generate the outputs relatvely faster and accurate wth less number of nput parameters. Harmony search optmzaton s one such approach fndng ts applcatons n several engneerng problems. Implementaton of harmony search optmzaton (HSO) method n mechansm synthess has relatve merts over several exstng optmzaton schemes. Basc Synthess Procedure In path generaton problem of four-bar mechansm, synthess procedure s accomplshed by some precson ponts to be traced by the coupler pont P of the mechansm as shown n Fgure. Y A P C b 3 B c AC=L x PC=L y AB=b 4 X r a O d O Y r O y 0 x 0 0 X Fgure : Four-bar mechansm n global coordnate frame An optmzaton scheme may be adopted to fnd the set of dmensonal parameters of the mechansm, namely lnk lengths (a, b, c, d, L x, L y etc) and nput lnk angles ( ), so that the error between the precson ponts (representng the desred trajectory) and the actually traced ponts by the coupler s mnmzed. Whle mnmzng the error functon, there are number of constrants such as the Grashof condton, decreasng or ncreasng sequence of nput lnk angles and the range of desgn varables have to be satsfed. Ths forms a multvarable, constraned-nonlnear
3 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 optmzaton problem. Here, the objectve functon called trackng error (TE) s evaluated from the traced ponts (P x, P y ), (where =,,N) defned wth respect to global coordnate frame XOY. From Fg., the poston vector of the coupler pont P n reference frame X r O Y r can be expressed as a vector equaton: P r = a L x L y () whch can be expanded as: Pxr cos cos 3 sn 3 a L x L y () Pyr sn sn 3 cos 3 Here, the coupler lnk angle θ 3 s computed usng the followng vector loop equaton of the four-bar mechansm: a b c d 0 (3) Ths can be expressed n ts components wth respect to relatve coordnate frame X r O Y r as: a cos + b cos 3 c cos 4 d =0 (4) a sn + b sn 3 c sn 4 =0 (5) After elmnaton of 4, the unknown angle of θ 3 s computed for known values of nput lnk angle θ. Ths takes the followng form known as Freudensten s equaton: K cos 3 +K cos +K 3 =cos( - 3 ) (6) c d a b where K =d/a, K =d/b and K 3 = (7) ab From ths equaton, the two solutons (open and crossed) can be wrtten as:, 3 = tan - E E 4DF (8) D where D=cos -K +K cos +K 3, E=-sn and F=K +(K -)cos +K 3 (9) Fnally, the poston of coupler P, wth respect to global or world coordnate system XOY s defned by: Px cos 0 sn 0 Pxr x 0 P y sn 0 cos (0) 0 Pyr y 0 The coordnates are used to defne the followng objectve functon: N xd x Mnmze TE= [(P P ) (P P ) ] () where N s number of precson ponts specfed on the desred path and (P, P ) are gven set of desred precson pont coordnates. For effectve functonng of lnkage, one or several constrants on the dmensons are often posed. In ths work, the followng constrants are consdered: () Range for desgn varables: The magntudes of lnk lengths and coupler pont coordnates as well as jont angle ranges are restrcted between a low and hgh value. These are called sde or geometrc constrants. yd y xd yd 3
4 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 () Grashof crteron: Ths s the requrement that the nput ln k of lnka ge as a crank and the mechansm s ether crank-rocker or drag-lnk mecha nsm. Ths condton s wrtten as: (x mn x max ) 0 () ( a b c d) where x mn and x max are respectvely the mnmum and maxmum values of lnk lengths: a,b,c and d. If ths condton s not satsfed, a new desgn vector s selected. (3) Order of crank angles: As there s a possblty of a large combnaton of mechansms that would generate same coupler curve, we need to pose ether clockwse or antclockwse rotaton constrant on crank angle. Ths s especally mportant whle generatng paths wthout prescrbed tmngs, where the angle of crank for each coupler pont s also of concern. Ths ncreases the sze of desgn vector by ncludng as many crank angles as the number of gven precson ponts. If,,.. N are the requred crank angles, the order constrant s wrtten as: sgn( + - ) =sgn( - ) for all =,3,.,(N-) (3) Here sgn s sgn functon defned as sgn()=+ f 0, otherwse sgn()=-.if ths condton s not meetng, the soluton s rejected and new set of random varables are selected satsfyng the above two condtons. For handlng the objectve functon wth all these constrants, a dynamc objectve functon approach s adopted n ths paper. The orgnal problem s converted nto followng unconstraned b-objectve optmzaton problem: Mn (CV, TE), X={x,x, x n } S R n (4) where CV s constrant volaton f any and SR n s the search space defned by parameter bounds. Hence, we could mnmze TE only when CV becomes zero. When the set of varables les outsde the feasble regon (CV>0), t s not necessary to calculate objectve functon TE, resultng n reducton of computaton cost. 3 Proposed Optmzaton Scheme The Harmony Search (HS) algorthm, compared to other optmzng methods lke genetc algorthms, s very smple n dea and nvolves very few settng parameters as well as easy to execute. HS method was developed orgnally by Geem et al. [0] and later on several modfcatons have been suggested to mprove ts performance. The basc HS method apples the muscal procedure of seekng for the best state of harmony. The harmony n musc s smlar to soluton vector n the optmzaton problem and muscan s seekng for best harmony s comparable to global search system n ths optmzaton method. The basc steps of the approach are as follows: Step : Intalzng the problem and algorthm parameters: In ths step, the optmzaton problem s defned n terms of decson varables X and effectve objectve functon f(x). The parameters of algorthm are also desgnated n ths step. These are the harmony memory sze (HMS) or the number of soluton vectors n the harmony memory; harmony memory consderng rate (HMCR); ptch adjustment rate (PAR); number of decson varables (N) and the number of mprovsatons (NI) or stoppng base. The harmony memory (HM) s a memory locaton where all the soluton vectors are stored. Ths HM s smlar to the genetc pool n the genetc algorthm. The HMCR and PAR are parameters used to enhance the soluton vector and are defned later n Step 3. 4
5 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 Step : Intalzng the harmony memory: The HM matrx s ntally flled wth as many randomly generated soluton vectors as the HMS, as well as wth the correspondng functon values of each random vector, f(x). x x. x N f (X ) x x. x N f (X ) H M=..... (5)..... HMS HMS HMS HMS x x. x N f (X ) Step 3: Improvsng a new harmony: New Harmony vector, X={x, x,.., x N } s created from the HM based on the memory consderatons, ptch adjustments and randomzaton. For example, the value of frst varable x n new harmony-vector s created from any value n specfed HM range. The values of other varables are also selected lkewse. The HMCR, whch vares between 0 and, s the rate of choosng one value from the hstorcal values stored n HM, whle (-HMCR) s rate of randomly selectng one value from the possble range of values. Every component ob taned by memory consderaton s examned for condton of ptch-adjustment. Ths operaton uses the PAR parameter, n whch the ptch s adjusted as: Ptch adjustng decson for x = yes, wth probablty PAR =no, wth probablty -PAR (6) When the ptch adjustment decson for x s yes, x should be updated as: x bwrand( ), where bw=bw max exp(cgn) wth c=log e (bw mn /bw max )/NI, s an arbtrary dstance bandwdth n each generaton gn, whle rand() s a random number between 0 and. The constants bw mn and bw max are mnmum and maxmum values of bandwdth respectvely. The HMCR and PAR parameters help the algorthm to fnd globally and locally mproved solutons, respectvely. PAR and bw n the HS algorthm are found to be fne-tunng parameters of optmzed soluton vectors. In present task, just lke bandwdth, adaptve PAR values for each genera ton are employed. That s, PAR for generaton gn n terms of mnmum and maxmum ptch adjustment rates s: PAR=PAR mn + (PAR max -PAR mn ) gn/ni (7) Step 4: Updatng the harmony memory: In ths step, f the new Harmony vector X s better than the worst harmony n the HM n terms of the objectve functon value, the new harmony s ncluded n the HM and the worst exstng harmony s excluded from the HM. The HM s then sorted by the value of objectve functon. Step 5: Stoppng crteron: When the maxmum number of mprovsatons (NI) has reached, the computaton s termnated. Otherwse, steps 3 and 4 are repeated. 4 Numercal Smulatons The HS optmzaton scheme s mplemented n MATLAB envronment. The program employs two sub-functons for handlng constrants and objectve. Two cases are descrbed here for path synthess problem, one wthout and other wth prescrbed tmngs. Case : Path generaton wthout prescrbed tmng, 0 target ponts: The problem was proposed by Acharya and Mandal [6] and s defned as: Desgn varables (9 varables): X =[a, b, c, d, L x, L y, 0, x 0, y 0,,,., 9, 0 ] 5
6 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 Target ponts (Ten ponts): {P d }={(0,0),(7.66,5.4),(.736,7.878),(5,6.98), ( ,.736), ( ,7.638), (5, 3.078),(.736,.5),(7.66,4.8577),(0,0)} - Lmts of the varables: a, b, c, d [5,80]; L x, L y, x 0, y 0 [-80, 80]; 0,,, 0 [0, ] Fgure shows the ten target ponts and the coupler curve obtaned usng the harmony search method for ths case. The tme taken to run the program s just 0.09 seconds for 5,000 cycles. The convergence plot for ths case s llustrated n Fgure 3. Fgure : Coupler curve for case- Fgure 3: Ftness-convergence plot The sy ntheszed geometrc parameters and the correspondng values of the mean error are shown n Ta ble, together wth the avalable results. Table Desgn varables obtan ed and comparson wth avalable data Varable G A [6] PS O[6] G A-DE[7] HSO a b c d L x L y x y
7 5 th Natonal Conference on Machnes and Mechansms NaCoMM The trackng error s found to be.5 as aganst.8 n GA [6] for ths case. Case: Path generaton wth prescrbed tmng, 8 target ponts: Ths problem requres generatng a path along the 8 ponts and s proposed by Kunjur and Krshnamurthy (KK) []. It s defned as follows: Desgn varables (0 varables): X=[a, b, c, d, L x, L y,,x 0,Y 0, 0 ] -Target ponts: {P d }= {(0. 5,.),(0. 4,.),(0.3,.),(0.,.0),(0.,0.9),(0.005,0.75), (0.0,0.6),(0,0.5),(0,0.4),(0.03,0.3),(0.,0.5),(0.5,0.),(0.,0.3),(0.3,0.4),(0.4,0.5), (0.5,0.7),(0.6,0.9), (0.6,)} { }={, + 0 o }, (where =,, 7) -Lmts of the varables: a, b, c, d [5,50]; L x, L y, x 0, y 0 [-50, 50]; 0, [0, ] Table gves the parameters of the optmal mechansm generated by HSO algorthm and compares them wth results reported n lterature. The results show that the HSO soluton gves the smallest average e rror. Table Com paratve results for case Varable GA-DE[7] Cabrera[] KK[8] HSO a b c d L x L y x y Error Fg.4 shows the coupler curve generated by the optmal mechansm usng proposed HSO method along wth that of GA-DE approach [7]. 7
8 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 Fgure 4: Coupler curve for case (sold: HSO, dotted: GA-DE [7], : Desred) In both the cases, the algorthm parameters adopted are: NI=5000, HMS=30, HMCR=0.95, PAR max=0.9, PAR mn=0.4, bw mn=0.000, bw max=. The smulatons are conducted usng X-86 based PC wth Intel core- Duo, 3.0 GHz processor. 5 Conclusons Ths paper presented the results of path synthess of four-bar mechansm usng harmony search optmzaton method. Path trackng error was defned as objectve functon and constrants lke varable bounds, Grashof crteron and angle sequence at nput lnk were mposed. The algorthm resulted n near optmal solutons faster wth acceptable accuracy. The methodology may be extended for path synthess of hgher order lnkages (6-bar planar parallel mechansms) as well as to obtan dmensons of hybrd (to acheve both the desred path and moton) mechansms. References [] J.A. Cabrera, A. Smon and M. Prado, Optmal synthess of mechansms wth genetc algorthms, Mechansm and Machne Theory, vol. 37, pp , 00. [] A. Kanarachos, D. Koulochers and H. Vruzopoulos, Evolutonary algorthms wth determnstc mutaton operators used for the optmzaton of the trajectory of a four-bar mechansm, Mathematcs and Computer n Smulaton, vol.63, pp , 003. [3] M.A. Larb, A. Mlke, L. Romdhane and S. Zeghloul, A combned genetc algorthm fuzzy logc method (GA FL) n mechansm synthess, Mechansm and Machne Theory, vol.39, pp , 004. [4] E.C. Knzel, J.P. Schmedeler and G.R. Pennock, Knematc synthess for fntely separated postons usng geometrc constraned programmng, Journal of Mech.Desgn, Trans.ASME, vol.8, pp , 006. [5] A. Smal and N. Dab, Optmum synthess of hybrd-task mechansms usng ant-gradent search method, Mechansm and Machne Theory, vol.4, pp.5-30, 007. [6] S.K. Acharyya and M. Mandal, Performance of evolutonary algorthms for four-bar lnkage synthess, Mechansm and Machne Theory, vol.44, pp ,
9 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 [7] W.Y. Ln, A GA-DE hybrd evolutonary algorthm for path synthess of four-bar lnkage, Mechansm and Machne Theory, vol.45, pp , 00. [8] N.N. Zadeh, M. Felez, A. Jamal and M. Ganj, Pareto optmal synthess of four-bar mechansms for path generaton, Mechansm and Machne Theory, vol.44, pp.80-9, 009. [9] R.R. Bulatovc S.R. Dordevc, On the optmum synthess of four-bar lnkage usng dfferental evoluton and method of varable controlled devatons, Mechansm and Machne Theory, vol.44, pp.35-46, 009. [0] Z.W. Geem, J.H. Km and G.V. Loganathan, A new heurstc optmzaton algorthm: harmony search, Smulatons, Vol.76, pp.60 68, 00. [] S. Kunjur and S. Krshnamurty, Genetc algorthms n mechansm synthess, Journal of App. Mech. Rob. 4 () (997)
Step-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3)
Optmal synthess of a Path Generator Lnkage usng Non Conventonal Approach Mr. Monsh P. Wasnk 1, Prof. M. K. Sonpmple 2, Prof. S. K. Undrwade 3 1 M-Tech MED Pryadarshn College of Engneerng, Nagpur 2,3 Mechancal
More informationSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3:485-494 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand
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 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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationOptimum Synthesis of Mechanisms For Path Generation Using a New Curvature Based Deflection Based Objective Function
Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 67 Optmum Synthess of Mechansms For Path Generaton Usng a ew Curvature Based Deflecton
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 informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
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 informationKinematics of pantograph masts
Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
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 informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
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 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 informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
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 informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
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 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 informationImperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments
Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne
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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
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 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 informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
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 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 informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
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 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 informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
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 informationAdaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems
Proceedngs of the ASME 2 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 2 August 29-3, 2, Washngton, D.C., USA DETC2-47538 Adaptve Vrtual
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 informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationInverse kinematic Modeling of 3RRR Parallel Robot
ème Congrès Franças de Mécanque Lyon, 4 au 8 Août 5 Inverse knematc Modelng of RRR Parallel Robot Ouafae HAMDOUN, Fatma Zahra BAGHLI, Larb EL BAKKALI Modelng and Smulaton of Mechancal Systems Laboratory,
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 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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
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 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 information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
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 informationOptimization of machining fixture layout for tolerance requirements under the influence of locating errors
MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol. 2, No. 1, 2010, pp. 152-162 INTERNATIONAL JOURNAL OF ENGINEERING, SCIENCE AND TECHNOLOGY www.jest-ng.com 2010 MultCraft Lmted. All
More informationGenetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator
Genetc Tunng of Fuzzy Logc Controller for a Flexble-Lnk Manpulator Lnda Zhxa Sh Mohamed B. Traba Department of Mechancal Unversty of Nevada, Las Vegas Department of Mechancal Engneerng Las Vegas, NV 89154-407
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 informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationDesign for Reliability: Case Studies in Manufacturing Process Synthesis
Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
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 informationMulti-objective Design Optimization of MCM Placement
Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang
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 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 informationPose, Posture, Formation and Contortion in Kinematic Systems
Pose, Posture, Formaton and Contorton n Knematc Systems J. Rooney and T. K. Tanev Department of Desgn and Innovaton, Faculty of Technology, The Open Unversty, Unted Kngdom Abstract. The concepts of pose,
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 informationMultiobjective fuzzy optimization method
Buletnul Ştnţfc al nverstăţ "Poltehnca" dn Tmşoara Sera ELECTRONICĂ ş TELECOMNICAŢII TRANSACTIONS on ELECTRONICS and COMMNICATIONS Tom 49(63, Fasccola, 24 Multobjectve fuzzy optmzaton method Gabrel Oltean
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
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 informationCHAPTER 4 OPTIMIZATION TECHNIQUES
48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll
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 informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
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 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 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 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 informationWORKSPACE OPTIMIZATION OF ORIENTATIONAL 3-LEGGED UPS PARALLEL PLATFORMS
Proceedngs of DETC 02 ASME 2002 Desgn Engneerng Techncal Conferences and Computers and Informaton n Engneerng Conference Montreal, Canada, September 29-October 2, 2002 DETC2002/MECH-34366 WORKSPACE OPTIMIZATION
More informationROBOT KINEMATICS. ME Robotics ME Robotics
ROBOT KINEMATICS Purpose: The purpose of ths chapter s to ntroduce you to robot knematcs, and the concepts related to both open and closed knematcs chans. Forward knematcs s dstngushed from nverse knematcs.
More informationMulticriteria Decision Making
Multcrtera Decson Makng Andrés Ramos (Andres.Ramos@comllas.edu) Pedro Sánchez (Pedro.Sanchez@comllas.edu) Sonja Wogrn (Sonja.Wogrn@comllas.edu) Contents 1. Basc concepts 2. Contnuous methods 3. Dscrete
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
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 informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationMulti-objective Virtual Machine Placement for Load Balancing
Mult-obectve Vrtual Machne Placement for Load Balancng Feng FANG and Bn-Bn Qu,a School of Computer Scence & Technology, Huazhong Unversty Of Scence And Technology, Wuhan, Chna Abstract. The vrtual machne
More informationCable optimization of a long span cable stayed bridge in La Coruña (Spain)
Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
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 informationParallel manipulator robots design and simulation
Proceedngs of the 5th WSEAS Int. Conf. on System Scence and Smulaton n Engneerng, Tenerfe, Canary Islands, Span, December 16-18, 26 358 Parallel manpulator robots desgn and smulaton SAMIR LAHOUAR SAID
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 informationMIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method
MIED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part : the optmzaton method Joun Lampnen Unversty of Vaasa Department of Informaton Technology and Producton Economcs P. O. Box 700
More informationModeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study
Modelng Concave Globodal Cam wth Swngng Roller Follower: A Case Study Nguyen Van Tuong, and Premysl Pokorny Abstract Ths paper descrbes a computer-aded desgn for desgn of the concave globodal cam wth cylndrcal
More informationA Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers
62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers
More informationAdaptive Weighted Sum Method for Bi-objective Optimization
45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs & Materals Conference 19-22 Aprl 2004, Palm Sprngs, Calforna AIAA 2004-1680 Adaptve Weghted Sum Method for B-objectve Optmzaton Olver de Weck
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
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 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 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 informationON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR. Wu huapeng, Heikki handroos and Juha kilkki
ON THE DESIGN OF LARGE SCALE REDUNDANT PARALLEL MANIPULATOR Wu huapeng, Hekk handroos and Juha klkk Machne Automaton Lab, Lappeenranta Unversty of Technology LPR-5385 Fnland huapeng@lut.f, handroos@lut.f,
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 informationStructural Optimization Using OPTIMIZER Program
SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European
More information