Optimization of machining fixture layout for tolerance requirements under the influence of locating errors

Size: px
Start display at page:

Download "Optimization of machining fixture layout for tolerance requirements under the influence of locating errors"

Transcription

1 MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol. 2, No. 1, 2010, pp INTERNATIONAL JOURNAL OF ENGINEERING, SCIENCE AND TECHNOLOGY MultCraft Lmted. All rghts reserved Optmzaton of machnng fxture layout for tolerance requrements under the nfluence of locatng errors S. Vshnupryan 1*, M. C. Majumder 2, K. P. Ramachandran 1 1 Department of Mechancal and Industral Engneerng, Caledonan College of Engneerng, Muscat, OMAN 2 Department of Mechancal Engneerng, Natonal Insttute of Technology, Durgapur, INDIA * Correspondng Author: vshnu@caledonan.edu.om Abstract Dmensonal accuracy of workpart under machnng s strongly nfluenced by the layout of the fxturng elements lke locators and clamps. Setup or geometrcal errors n locators result n overall machnng error of the feature under consderaton. Therefore t s necessary to ensure that the layout s optmzed for the desred machnng tolerance for a gven devaton n the set up or geometry of the locator. Also, the locator layout should be capable of holdng the workpart n a unque poston durng machnng thus provdng determnstc locaton. Ths paper proposes a Genetc Algorthm (GA) based optmzaton method to arrve at a layout of error contanng locators for mnmum machnng error satsfyng the tolerance requrements and provdng determnstc locaton. A three dmensonal workpece under the locatng scheme s studed. Results ndcate that by optmally placng the error contanng locators the geometrc error component of the machnng error can be substantally reduced thus enablng complance to overall dmensonal requrements. Keywords: Machnng error, optmal layout, locator error, genetc algorthm 1. Introducton Fxtures form an ntegral part of the manufacturng process and are requred to hold the workpece n the desred poston. The fxture desgn should am at restranng unwanted movement of the workpece under the acton of cuttng forces throughout machnng. Dmensonal accuracy of the machned part thus depends on the desgn of the locators and the layout and can contrbute up to 20-60% of the overall machnng error of the workpece (Qn, 2008). The fxture should be capable of holdng the workpece n a unque poston for machnng. Ths condton s called determnstc locaton. Asada and Andry (1985) used the knematc model and concluded that a full rank Jacoban matrx s the necessary condton for determnstc postonng of the workpece. They also derved the condton for attachablty and detachablty of the workpece wthn a fxture. Ca et al. (1997) used a varatonal method for achevng robust fxture confguraton. A non lnear programmng method was used wth an objectve of mnmzng the postonal error of the workpece resultng from source errors at the locators. Ths work consdered the requrement for determnstc locaton but dd not present a model for the analyss of machnng error on a requred feature. Choudhur and De Meter (1999) presented a model to relate datum establshment errors to locator geometrc varablty. The work studed the effect of gven locator errors on the varaton of machnng feature under a partcular locatng scheme. Agan, determnstc locaton was not addressed and the effect of locator postons on the resultant machnng error was not dscussed. Rong et al. (2001) used three dfferent approaches of locatng and analyzed the postonal varaton of locatng ponts resultng from the error of the locators and the locatng features. The work however dd not address the ssue of determnstc locaton. Song and Rong (2005) dscussed the crtera for the locatng completeness. Some researchers optmzed the clampng force (L and Melkote,2001 a) or clampng sequence (Raghu and Melkote, 2004) to mnmze the workpece postonal error. (L and Melkote, 2001 b) optmzed the fxture layout to mnmze the workpece error. Snce the workpece s evaluated by ts complance to the specfed tolerance, nfluence of locator errors on the requred machnng tolerance receved much attenton n recent years. For example Wang (2002) studed the effect of fxel errors on the tolerance of crtcal dmensons. Ths work suggested employng a D optmalty model to obtan an optmal layout. Marn and

2 153 Ferrera (2003) dscussed the effect of determnstc locator errors on profle tolerance of machned parts. Qn et al. (2006) dscussed an optmzaton methodology to mnmze the workpece postonal varaton. However machnng error s not dscussed. The same authors (2007) presented a method for locatng desgn based on the degrees of freedom constraned by the layout. Cases of complete, partal over and under over locatons were dscussed. Wang et al. (2007) analyzed the dfferent error components of the workpece surface. However ths study dd not dscuss the effect of locator layout on machnng error. Evolutonary technques for solvng optmzaton problems have been found to have a hgher probablty n fndng the global optmum values compared to tradtonal technques. GA s one such technque that fnds ncreased use n solvng optmzaton of locator layout problems. The task s to arrve at a partcular layout of fxture elements that provdes the mnmum error on the workpece (Kaya, 2005; Krshnakumar and Melkote, 2000; Padmanaban and Prabaharan, 2008). Smple two dmensonal cases are studed n these three works. The way of correlatng the layout optmzaton procedure to the tolerance on crtcal machnng features on the workpece s not dscussed. Chen et al. (2007) optmzed the locator layout to control the deformaton of a workpece. But geometrc errors of locators were not consdered. Whle the above mentoned studes have provded mportant and extensve concepts of fxture desgn they have one or more lmtatons such as not addressng the effect of locator geometrc errors on overall machnng error, condton for determnstc locaton and correlaton of layout optmzaton wth the crtcal machnng feature. Most of the above works employed tradtonal optmzaton methods that may not yeld the global optmum results. Snce the fnal machnng accuracy of the workpece depends on the correctness of the locators t s essental that the locators are machned to the requred accuracy and set up wthout any errors. However t s possble that errors are present n the form of dmenson or set up of the locators whch wll be transferred to the workpece thus causng devaton from the requred dmenson. Effect of locator error s comparable to the workpece elastc deformaton n case of low elastcty work parts. In the case of a rgd, bulky workpece the locator error s much more predomnant. Hence the locator layout s to be desgned optmally so as to mnmze the effect of the locator errors on the fnal machnng accuracy of the workpece. In ths paper, a GA based optmzaton of locator layout s attempted consderng the geometrc errors of locators satsfyng the condtons of tolerance requrements on the crtcal machnng feature whle ensurng determnstc locaton. Rest of the paper s organzed as follows. The source errors are revewed n Secton 2. Secton 3 gves a bref account of determnstc locaton and ts requrements. Concepts of GA and ts applcaton to the present work are dscussed n Secton 4. Secton 5 presents the numercal llustraton of the case studed. Results are dscussed n Secton 6. Major conclusons drawn n the study are presented n Secton 7 of the paper. 2. Source errors and resultant errors 2.1 Workpece postonal error Fxture elements (locators and clamps) are requred to hold the workpece n the desred poston throughout the machnng process. It goes wthout sayng that any devaton n these elements wll translate nto a faulty postonng of workpece thus resultng n machnng error. Locators may devate from the deal condton n two ways. Frst s n the form of the dmenson or shape of the locator whch s known as geometrcal error. The second s due to the wrong set up. In ths case the locator s correct n shape or dmenson but ts placement s ncorrect wthn the layout. Apart from these, the workpece locatng surface can also have devatons. These errors are part of the source errors and are llustrated n Fgure 1. Consder a fxture workpece system as shown n Fgure 2. We defne three co ordnates systems. The global co ordnate (GCS) system s fxed to the machne table, the workpece coordnate system (WCS) s fxed to the workpece and LCS s the locator coordnate system. At each contact pont the normal vector s denoted as n (n x, n y, n z ) and the source error n all the locators s collectvely wrtten as a vector. Note that ths denotes change n vector r c. As a result of these source errors the workpece poston and orentaton change, denoted by ΔX and ΔΘ. Now the workpece postonal error n GCS s wrtten as δp =[ ΔX ΔΘ ]=[δx, δy, δγ] T for 2 D δp =[ ΔX ΔΘ ]=[δx, δy, δz, δα, δβ, δγ] T for 3 D (1) Now the Jacoban matrx s defned as (Qn, 2008) T T T [ J J J ] T J = (2) m = 1 m denote the number of locators wth J = [ nx, ny, ny x nx y ] for 2D = [ n, n, n, n y n x, n z n x, n x n y ] J for 3 D (3) x y z z y x z The normal vectors n..n m are collectvely wrtten n the form of a normal vector matrx as N=dag (n 1 n 2. n m ) Now the followng relaton can be wrtten between source error and workpece postonal error + T δp = J N δs y x (4)

3 154 where J + s a Moore Penrose nverse matrx of J. Ideal poston of locator Actual poston of locator Ideal poston of workpece Actual poston of workpece Ideal dmenson of locator Actual dmenson of locator Desred poston of workpece Actual poston of workpece (a) (b) Fgure 1. Source errors n locatng (a) Set up errors (b) Dmensonal errors {GCS} Workpece δrw δθw {WCS} rc w n rw rc rl Contact pont Locator '' {LCS} Fgure 2. Coordnate systems and postonal error {GCS} {WCS} Workpece rp rc w rw rc rl rp w {LCS} Fgure 3. Machnng error P Locator '' 2.2 Machnng error Effect of the source errors results n the workpece postonal error δp as dscussed earler. If the processng datum and the locatng datum do not concde, t s called datum error (δdt). Ths error, combned wth the workpece postonal error result n what s called the machnng error δm of the workpece. Machnng error denotes the relatve moton of the cuttng tool wth respect to the processng datum. In a workpece ths machnng error can be depcted as the change n r p as shown n Fgure 3. Note that r p denotes the locaton of the processng datum n GCS. If the WCS and GCS are dentcally orented and the datum related error s neglected the followng relatonshp can be wrtten. δm=b δp (5) where B s the poston matrx of the processng pont and s gven by z y B = z 0 x y x 0

4 155 wth x, y and z beng the coordnates of the pont consdered. 3. Determnstc locaton When postoned n a fxture the workpece surface s made to contact all the locators. Determnstc locaton s sad to be acheved f the workpece s held n a unque poston when all fxture elements are made to contact the workpece surface. In other words determnstc locaton means that the workpece cannot make an nfntesmal moton whle mantanng contact wth all the locators. Asada and Andry (1985) showed that for determnstc locaton the Jacoban matrx should have a full rank. In other words, for determnstc locaton, rank (J)= 3 for 2D rank (J)=6 for 3D (6) 4. GA based fxture layout optmzaton 4.1 Workng of GA Tradtonal optmzaton technques based on mathematcal prncples suffer from many lmtatons that nclude dependence of convergence on the chosen ntal soluton, gettng stuck to a sub optmal soluton, problem specfc nature of the algorthms and neffcent handlng of problems wth dscrete varables (Deb, 2005). New evolutonary technques are found to perform better n ths context compared to tradtonal methods. One such technque s the GA. GA s a computerzed search and optmzaton algorthm based on the mechancs of natural genetcs and selecton. GA operates on a populaton of potental solutons applyng the prncples of survval of the fttest to produce better approxmaton solutons. At each generaton, a new set of approxmaton s created by the process of selectng ndvduals accordng to ther level of ftness n the problem doman and breedng them together usng operators borrowed from the natural genetcs. Ths process leads to the evaluaton of populaton of ndvduals that they were created from just as n natural adaptaton. The workng of GA s as follows. a. Intalzaton and representaton A populaton of solutons s created randomly. Each entry n the populaton s called a chromosome. The populaton thus generated wll contan N P number of chromosomes where N P s the populaton sze specfed. N P =50 n ths work. The chromosome can be represented usng bnary or real codng. In the present problem, real varable codng s used. Length of a chromosome depends on the number of varables used n the problem. Varables n ths problem are the locator coordnates. Ths study consders the locatng scheme hence there are sx locators wth X,Y and Z coordnates to be determned. So the problem s of dmenson 18. b. Evaluaton of ftness Each chromosome s evaluated for ts ftness. The ftness functon F(x) s derved from the objectve functon f(x) of the problem. For maxmzaton problems, ftness functon s the same as the objectve functon. For mnmzaton problems the ftness functon s defned as 1 F( x) = 1+ f ( x) (7) c. Testng for termnaton crtera The algorthm can be termnated by specfyng dfferent condtons lke the number of generatons, specfc objectve value, mprovement of objectve functon n successve generatons etc. The GA keeps searchng the soluton space for the best soluton. After certan number of generatons, the chromosomes become smlar. Beyond a certan pont n tme, a condton wll be reached that no better soluton can be found. Hence to save tme, certan number of generatons be specfed so as to stop the search. Otherwse the algorthm wll keep runnng wthout fndng any better soluton. In the present work, the algorthm has been programmed to stop f the objectve functon value remans same for 50 consecutve generatons. Ths s called stall generatons Ns. If the condton s not satsfed a new generaton s formed and the process repeats tll the maxmum number of generatons (N G ) s reached. In ths work, N G =150. d. Creaton of new generaton GA essentally performs three operatons to create a new generaton. These are Reproducton, Cross over and Mutaton. Reproducton: At ths stage parent chromosomes are selected from the populaton based on ther ftness and a matng pool formed. The probablty of a chromosome for selecton depends on ts ftness F.The probablty for selectng the th chromosome

5 156 F p = (8) N P j=1 where N P denotes the populaton sze. In reproducton, good chromosomes n a populaton are assgned a larger number of copes to form the matng pool. In ths study the rank based Roulette wheel selecton method s adopted for selectng chromosomes for reproducton. Cross over: The crossover operaton nvolves n two chromosomes exchangng certan part of ther genetc nformaton to produce new chromosomes. To retan some goodness already present n the matng pool only a certan percentage of chromosomes are nvolved n cross over. Ths s gven by the value of cross over probablty p c. Cross over operaton for real and bnary codng are done dfferently. In bnary codng sngle pont crossover, multpont crossover and unform crossover are commonly used technques. In real value codng the methods of cross over nclude dscrete cross over, lne cross over and ntermedate cross over. Dscrete cross over s used n ths study. Mutaton: After cross over s performed, the chromosomes undergo mutaton. Ths operator makes local changes n a chromosome to hopefully create a better chromosome. Smlar to the cross over operaton a random number s generated and f the number s less than the mutaton probablty p m (p m = 0.02 n ths work) mutaton s performed. Otherwse the chromosome s unchanged. In ths work an Incremental operator s used for mutaton. The ncremental operator works as follows. An ncrement value δ s chosen dependng on the problem doman and bounds. A partcular varable n the chromosome s chosen randomly. Mutaton operator ether adds or subtracts ths value from the varable to form a new chromosome Let a b c be the strng before mutaton. The strng after mutaton can be a+ δ b c or a- δ b c Flowchart shown n Fgure 5 outlnes the GA process. Smple Genetc Algorthm ( ) { ntal Populaton; evaluate populaton; Whle termnaton crteron not reached { reproducton; perform crossover and mutaton; evaluate populaton; } } Fgure 4. Genetc algorthm 4.2 Applcaton of GA to layout optmzaton As stated earler ths work consders the source error present n the locators n form of geometry and set up. When a workpece s loaded nto ths fxture and machned t results n devaton of the actual dmensons from the desred ones. Wth the manufacturng tolerances (mtol) beng specfed t s mandatory that the devatons should le below the tolerance specfcatons. The nfluence of source error of a locator on the overall machnng error depends on ts poston n the layout. The objectve s to fnd the locaton of each error contanng locator so as to mnmze the resultant error. In ths context the problem statement can be made as follows. Arrve at a determnstc layout whch, for gven source errors results n the least dmensonal error of the crtcal machnng feature whle complyng wth the tolerance requrements.in other words, Determne L x,y,z () so as to mnmze δx z y δm j = δy = B j δp = z x { J N T δs} (9) δz y x 0 wth [ ] T j δ s = δs1... δs subject to (x,y,z) max (x,y,z) (x,y,z) mn

6 157 δx (or) δy (or) δz mtol where =1:6 j=a,b,c In executon, layouts are generated randomly (ntal populaton) wth the bounds specfed for each locator. Magntude of source error n each locator s specfed by the user. Each of these locators s frst checked for the condton of determnstc locaton dscussed n Secton 3. Wth these nputs the GA runs for the specfed number of generatons and arrves at the optmal layout the layout wth least machnng error of the feature consdered. Flow chart shown n Fgure 5 explans the method adopted. 5. Numercal llustraton To llustrate the above mentoned procedure, a rectangular block studed by Qn et al. (2008) s presented. A through slot s to be mlled on a workpece of dmensons 220 mm 122 mm 112 mm. The crtcal machnng feature n ths case s the dstance between the far edge of the workpece and the slot, shown as 25±0.006 n Fgure 7. Snce the workpece s located based on the locatng prncple there are sx locators n total. The normal vectors and the assumed errors n each locator are gven n Table 1. Usng equaton (9) the overall machnng error s computed at the three processng datum ponts A,B and C whose coordnates are (220,122,112), (110,122,112), (0,122,112) respectvely. For each layout the maxmum of errors among A, B and C are calculated and GA s used to arrve at the mnmum of ths maxmum error. Correspondng layout s the optmal layout. In the present case GA s run for 10 tmes and optmal layouts are obtaned. Table 2 shows the layouts and error values correspondng to each run. It can be seen that among the 10 runs, run 10 gves the least value of error ( mm). The convergence pattern of GA correspondng to ths run s shown n Fgure 8. Comparng the error values wth the requred tolerance on the crtcal dmenson (0.006 mm) t can be seen that all the layouts are vald for the present case (maxmum error beng mm n Run 1). Table 1 Normal vectors and errors n locators Locator Normal vector Source error (mm) Postonal constrants used n optmzaton 6. Results and dscusson L 1 (0,0,1) x 10, 101 y 62, z=0 L 2 (0,0,1) x 125.5, 101 y 62, z=0 L 3 (0,0,1) x 66, 59 y 10,z=0 L 4 (0,-1,0) x 20, y= 122, z=56 L 5 (0,-1,0) x 95, y= 122, z=56 L 6 (1,0,0) x=0, 102 y 30, z=56 The machnng error s of the form δx δm j = δy z δ j The vector conssts of machnng error n the X, Y and Z drectons. However n ths study the machnng error relates to the devaton of the dstance of the slot from the top edge of the workpece shown as 25± Hence the Y component of the machnng error, δy s of nterest. For each layout generated δm j s computed usng Equaton (5) and GA s nvoked to arrve at the mnmum machnng error. Many GA runs are performed and the results of 10 such runs are gven n Table 2. The least machnng error vares from a mnmum of mm (Run 10) to a maxmum of mm (Run 1). Other values of machnng error are near dentcal. Interestngly Run 2, Run 3 and Run 6 have exactly same value of machnng error ( mm). Ths proves that the fxture optmzaton problems are multmodal n nature. For the same or near the same objectve value (δy n ths case) the layouts are dfferent. Ths means that gven the locator error and bounds on locator postons, f dfferent layouts are possble for the same machnng error. Ths provdes the user wth the flexblty of choosng layouts wthout mposng too much restrcton.

7 158 The relatve mpact of each locator error on the resultant machnng error s worth consderng. For dong ths, the layout wth the least error, the one obtaned n Run 10 s taken. Frst, error of locator 1 s ncreased n steps of 10% tll the error value s doubled. Error values of all other locators reman the same as gven n Table1. Change of wth ncreasng error value of locator 1 s computed. The process s repeated for other locators whle keepng same the error of all but that locator. The results are plotted n Fgure 7. It can be seen that effect of locator 4 s more pronounced followed by locator 3 and locator 2. Locator 5 has lttle mpact on the change of the machnng error whle the nfluence of locator 6 s not seen to affect the machnng error. Ths means that locator 4 should be produced wth strcter tolerance or should be set up more precsely snce the mpact of t s seen to be more consderable than others. As the optmzaton process contnues, chromosomes tend to become smlar. Because of ths the objectve functon, n ths case the machnng error, tends to reman at a value wthout any further mprovement. The objectve functon s then sad to have converged. As dscussed n Secton 4 the optmzaton process s termnated based on ether the number of stall generatons or the maxmum number of generatons. Fgure 8 shows the convergence of GA. Fgure 8a corresponds to run 10 that returned the least error among the 10 runs. It can be seen that the machnng error value steadly falls for the frst 96 generatons and remans unchanged thereafter. Snce the stall generaton value has been specfed as 50, the process contnues for further 50 generatons and stops at generaton number 146. As mentoned earler, the least machnng error obtaned n the process s mm. To study the effect of ncrease n populaton sze, GA s run wth N P ncreased to 70 and the correspondng convergence pattern s shown n Fgure 8b. The least error obtaned here s mm after 148 teratons. Table 2 GA based optmal poston of locators and correspondng machnng error G.A Run Locator 1 Locator 2 Locator 3 Locator 4 Locator 5 Locator 6 x y z x y z X y z x y z x y z x y z Least error (mm) *

8 159 GA parameters Populaton of layouts Consder generaton, layout j Jacoban matrx J No Determnstc? j= j+1 Yes Fnd δm ya,δm yb, δm yc Errors of locators (δm y ) j = max( δm ya,δm yb, δm yc ) No j=n P? Yes (δm y ) = mn ( δm y ) j=1:np N S reached? Yes Termnate, store results = N G? =+1 No No Yes Termnate, store results Genetc operators Fgure 5. Flow chart of the analyss

9 160 A 25±0.006 B C Z L5 L4 L2 X Y L6 L1 L3 Fgure 6. Workpece fxture system under study Fgure 7. Effect of ncrease n locator error Fgure 8a.Convergence of GA (N P =50)

10 161 Fgure 8b.Convergence of GA (N P =70) 7. Conclusons Snce the locator error s an mportant factor contrbutng to the overall machnng error mnmzaton of the contrbuton of locator error reduces the machnng error. In ths work an attempt has been made for optmzng the fxture layout takng nto consderaton the effect locator errors. Determnstc locaton s ensured throughout the optmzaton process and mnmal machnng error s arrved at complyng wth the machnng tolerance specfcaton. Ths also provdes the user wth a flexblty n choosng the layout accordng to the requrements. Also, for a gven machnng tolerance on workpece, f the mnmum possble error can be found for a gven set of locator errors, workng backward, t s possble to determne the allowable tolerance on the locator. Ths may be advantageous n cases where a less strct tolerance on locator wll be acceptable thus reducng the cost of manufacture of locators. The model presented here s generc n the sense that the same can be appled to any crtcal feature of the workpece by choosng approprate datum ponts. Future work wll nclude the determnaton of the components of machnng error caused by machnng and clampng forces. The fxture layout would be optmzed so as to mnmze the overall machnng error. In ths work the locators are assumed to contan error n ther normal drecton. A quadratc model would help analyze the case of locators wth errors along the tangental drectons also. References Asada,H, Andre B Knematc analyss of workpart fxturng for flexble assembly wth automatcally reconfgurable fxtures, Journal of Robotc Automaton, Vol.2, pp Ca,W; Jack Hu, S ; Yuan, J.X.1997.A varatonal method of robust fxture confguraton desgn for 3D workpeces, Journal of Manufacturng Scence and Engneerng, Vol.119, pp Chen W., N L., Xue J Deformaton control through fxture layout desgn and clampng force optmzaton, Internatonal Journal of Advanced Manufacturng Technology, Vol.31, pp Choudhur, S.A ; De Meter, E.C Tolerance analyss of machnng fxture locators, Journal of Manufacturng Scence and Engneerng, Vol.121, pp Deb K Optmzaton for engneerng desgn-algorthms and examples, Prentce Hall of Inda, New Delh. Kaya, N Machnng fxture locatng and clampng poston optmzaton usng genetc algorthms, Internatonal Journal of Computers n Industry, Vol. 57, pp Krshnakumar K, Melkote S.N Machnng fxture layout optmzaton usng the genetc algorthm, Internatonal Journal of Machne Tools and Manufacture, Vol. 40,pp L,B, Melkote S.N. 2001a. Fxture clampng force optmzaton and ts mpact on workpece locaton accuracy, Journal of Advanced Manufacturng Technology, Vol.17, pp L,B, Melkote S.N Improved workpece locaton accuracy through fxture layout optmzaton, Internatonal Journal of Advanced Manufacturng Technology, Vol. 39, pp L,B, Melkote S.N. 2001b. Optmal fxture desgn accountng for the effect of workpece dynamcs, Internatonal Journal of Advanced Manufacturng Technology, Vol.18, pp Marn R.A., Ferrera P.M Analyss of the nfluence of fxture locator errors on the complance of work part features to geometrc tolerance specfcatons, Journal of Manufacturng Scence and Engneerng, Vol.125, pp

11 162 Padmanaban,K.P, Prabhaharan, G Dynamc analyss on optmal placement of fxturng elements usng evolutonary technques, Internatonal Journal of Producton Research, Vol. 46, pp Qn, G.H, Zhang, W.H, Wan, M A mathematcal approach to analyss and optmal desgn of a fxture locatng scheme, Internatonal Journal of Advanced Manufacturng Technology, Vol.29, pp Qn,G.H, Zhang W.; Wu Z.; Wan M Systematc modelng of workpece fxture geometrc default and complance for the predcton of workpece machnng error, Journal of Manufacturng Scence and Engneerng, Vol. 129, pp Qn,G.H, Zhang W., Wan M A machnng-dmenson based approach to locatng scheme desgn, Journal of Manufacturng Scence and Engneerng Vol.130, pp Raghu A., Melkote S.N Analyss of the effects of fxture clampng sequence on part locaton errors, Internatonal Journal of Machne Tools and Manufacture, Vol. 44, pp Rong, Y, Hu, W, Kang Y, Zhang,Y, Yen D.W Locatng error analyss and tolerance assgnment for computer aded fxture desgn, Internatonal Journal of Producton Research, Vol. 39, pp Song, H ; Rong, Y Locatng completeness evaluaton and revson n fxture plan, Robotcs and Computer Integrated Manufacturng, Vol.2, pp Wang, M Tolerance analyss for fxture layout desgn, Assembly Automaton, Vol. 22, pp Wang,Y; Chen, X ; Gndy, N Surface error decomposton for fxture development, Internatonal Journal of Advanced Manufacturng Technology, Vol.31, pp Bographcal notes S. Vshnupryan s currently servng as a Lecturer n the Department of Mechancal and Industral engneerng, Caledonan College of Engneerng, Muscat, Sultanate of Oman. An M. Tech n Machne Desgn from the Indan Insttute of Technology, Madras, he has around ffteen years of teachng experence and currently pursung Ph D n the Natonal Insttute of Technology, Durgapur, Inda. He has co authored text books on Desgn of machne elements and Desgn of Transmsson systems. Dr. M C Majumder s a Professor n the Department of Mechancal Engneerng and Member Secretary of the Senate, Natonal Insttute of Technology, Durgapur, Inda. He has a PhD from the Indan Insttute of Technology, Kharagpur, Inda. He has guded many Ph D scholars. Hs prme area of research s Trbology. Dr. K. P. Ramachandran s currently the Assocate Dean (Post Graduate Studes & Research), Caledonan College of Engneerng, Muscat, Sultanate of Oman. He has a experence of 25 years n engneerng nsttutons and as a consultant for many ndustres. He has research nterest n the vbraton nstrumentaton & measurement, analyss and control, condton montorng of rotatng machnery. He has been conferred Sr C.V. Raman award for the best techncal paper publshed n the journal of Vbraton & Acoustcs (1997). He s n the edtoral board and techncal revewer for nternatonal journals and conferences. He has guded PhD students n the area of condton montorng and mantenance management. Receved January 2010 Accepted February 2010 Fnal acceptance n revsed form March 2010

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information

Support Vector Machines

Support 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 information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

CS 534: Computer Vision Model Fitting

CS 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 information

CHAPTER 4 OPTIMIZATION TECHNIQUES

CHAPTER 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 information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The 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 information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Smoothing Spline ANOVA for variable screening

Smoothing 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x 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 information

An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms

An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms 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

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 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 information

Problem Set 3 Solutions

Problem 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 information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A 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 information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A 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 information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-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 information

Multi-objective Design Optimization of MCM Placement

Multi-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 information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew 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 information

A Novel Approach for an Early Test Case Generation using Genetic Algorithm and Dominance Concept based on Use cases

A Novel Approach for an Early Test Case Generation using Genetic Algorithm and Dominance Concept based on Use cases Alekhya Varkut et al, / (IJCSIT) Internatonal Journal of Computer Scence and Informaton Technologes, Vol. 3 (3), 2012,4218-4224 A Novel Approach for an Early Test Case Generaton usng Genetc Algorthm and

More information

Active Contours/Snakes

Active 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 information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving 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 information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 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 information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite 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 information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

A Method to Improve Routing and Determining the Shortest Traveling Pathway between PADs in the Automatic Drilling of PCBs Based on Genetic Algorithm

A Method to Improve Routing and Determining the Shortest Traveling Pathway between PADs in the Automatic Drilling of PCBs Based on Genetic Algorithm A Method to Improve Routng and Determnng the Shortest Travelng Pathway between PADs n the Automatc Drllng of PCBs Based on Genetc Algorthm A.R. MohammadnaOranj 1 A. Khademzadeh 2 A. Jall Iran 3 H. Ebrahman

More information

Kinematics of pantograph masts

Kinematics 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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Wishing you all a Total Quality New Year!

Wishing 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 information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

Load-Balanced Anycast Routing

Load-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 information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Step-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3)

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 information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-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 information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis 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 information

Programming in Fortran 90 : 2017/2018

Programming 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 information

Solving two-person zero-sum game by Matlab

Solving 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 information

OPTIMIZING CNC TURNING PROCESS USING REAL CODED GENETIC ALGORITHM AND DIFFERENTIAL EVOLUTION

OPTIMIZING CNC TURNING PROCESS USING REAL CODED GENETIC ALGORITHM AND DIFFERENTIAL EVOLUTION Transacton on Evolutonary algorthm and Contnuous Optmzaton ISSN: 9-87 Onlne Publcaton, June 0 www.pcoglobal.com/gjto.htm GA-O3/GJTO OPTIMIZING CNC TURNING PROCESS USING REAL CODED GENETIC ALGORITHM AND

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range 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 information

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,

More information

Numerical model describing optimization of fibres winding process on open and closed frame

Numerical model describing optimization of fibres winding process on open and closed frame Journal of Physcs: Conference Seres PAPER OPEN ACCESS Numercal model descrbng optmzaton of fbres wndng process on open and closed frame To cte ths artcle: M Petr et al 06 J Phys: Conf Ser 738 0094 Vew

More information

The Codesign Challenge

The 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 information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum 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 information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

K-means and Hierarchical Clustering

K-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 information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Quick error verification of portable coordinate measuring arm

Quick error verification of portable coordinate measuring arm Quck error verfcaton of portable coordnate measurng arm J.F. Ouang, W.L. Lu, X.H. Qu State Ke Laborator of Precson Measurng Technolog and Instruments, Tanjn Unverst, Tanjn 7, Chna Tel.: + 86 [] 7-8-99

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An 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 information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course 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 information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Multi-posture kinematic calibration technique and parameter identification algorithm for articulated arm coordinate measuring machines

Multi-posture kinematic calibration technique and parameter identification algorithm for articulated arm coordinate measuring machines Mult-posture knematc calbraton technque and parameter dentfcaton algorthm for artculated arm coordnate measurng machnes Juan-José AGUILAR, Jorge SANTOLARIA, José-Antono YAGÜE, Ana-Crstna MAJARENA Department

More information

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design 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 information

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

Feature Selection for Target Detection in SAR Images

Feature Selection for Target Detection in SAR Images Feature Selecton for Detecton n SAR Images Br Bhanu, Yngqang Ln and Shqn Wang Center for Research n Intellgent Systems Unversty of Calforna, Rversde, CA 95, USA Abstract A genetc algorthm (GA) approach

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-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 information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

More information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- 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 information

A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING

A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods

More information

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study

Modeling 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 information

Pose, Posture, Formation and Contortion in Kinematic Systems

Pose, 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 information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

Related-Mode Attacks on CTR Encryption Mode

Related-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 information

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

EVALUATION 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 information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting 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 information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

WORKSPACE OPTIMIZATION OF ORIENTATIONAL 3-LEGGED UPS PARALLEL PLATFORMS

WORKSPACE 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 information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

S1 Note. Basis functions.

S1 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 information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL 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 information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

Cable 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 information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers

A 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 information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting 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 information

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments

Imperialist 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 information

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks

GA-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 information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation 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 information

Histogram based Evolutionary Dynamic Image Segmentation

Histogram based Evolutionary Dynamic Image Segmentation Hstogram based Evolutonary Dynamc Image Segmentaton Amya Halder Computer Scence & Engneerng Department St. Thomas College of Engneerng & Technology Kolkata, Inda amya_halder@ndatmes.com Arndam Kar and

More information

GSLM Operations Research II Fall 13/14

GSLM 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 information