A Method to Improve Routing and Determining the Shortest Traveling Pathway between PADs in the Automatic Drilling of PCBs Based on Genetic Algorithm
|
|
- Shanon Holt
- 5 years ago
- Views:
Transcription
1 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 3 1 Computer Eng. Dept.Islamc Azad Unversty, Ardabl branch, Ardabl, Iran 2 Educaton & Internatonal Affas, Iran Telecom Research Center 3 Electrcal Eng. Dept.Islamc Azad Unversty, Ardabl branch, Ardabl, Iran Abstract Automatc drlls are wdely used n the process of manufacturng prnted crcut boards. After a crcut s desgned usng very advanced softwares, the pns for dfferent components and the nodes through whch the layers are connected are rgorously drlled by an automatc drll. At the present paper, a study s done on the functon of the automatc drlls of prnted crcut boards and the dffcultes brought about by ssues lke the sequence of drllng, the functonng tme of the devce, the devce deprecaton to optmze the total pathway of the head ral, and the response of the head ral along wth tracng the head ral s beng studed analytcally. The effectveness of the proposed method s demonstrated on 100 node test pattern through Absolute Error (AE), Mean Square Error (MSE), Mean Percentage of Absolute Error (MPAE) and Mean Regulaton (MR%) performance ndces. The result evaluaton shows that the proposed algorthm acheves good result performance. Moreover, ths newly developed strategy has a smple structures provde less deprecaton, arsen n the pace of whole system and a reducton n the error of head dsplacement, whch can be useful for the travelng pathway between PADs n the automatc drllng of prnted crcut boards. Keywords: Genetc algorthm, PCB Auto Drll, Routng pathway 1. Introducton At ndustry, for the desgn and manufacturng of the prnted crcut boards, the components are frst desgned and nstalled by a PCB Desgn softwares. These softwares export several output fles to be used by dfferent devces. The fles nclude a Pad_lst (lst of (x,y) coordnates of component pns), Va (place of connecton of layers together), Component_Lst (lst of components for assemblng machnes), solderng masks (mask for solderng gude, etc. Drllng the prnted crcut boards s a part of manufacturng electronc boards that s done by automatc drllng devces [1-2]. Ths devce operates on the x-y axes horzontally and vertcally, on the plane of the prnted crcut board. There s also a depth-orented movement along the z-axs through whch the drlled s lowered to punch the prnted crcut fber. The moton of the head-ral along the three axes s controlled by the stepwse motors. These devces receve the pad-lst from a PCB desgnng software and gude the drll through the specfed coordnates of the pns and the connecton nodes to punch the pad [3]. The head-rals at these devces usually move followng an unsorted lst of the software output whch requres a long pathway. Ths long pathway needs more tme to be completed and effects sooner devce so deprecaton and the systematc errors are aggravated. It s lke as a Travelng Salesman Problem (TSP) [4-5]. Thus t s mportant to mnmze the total pathway. There are several methods to mnmzng the total pathway whch are x-then-y method, Snakelke method, the mnmum dstance method [1-2]. The sortng done wth the x then y method s a smple and sutable procedure to enhance the pathway. However, t s stll necessary that one fnd the correspondng y coordnate of each step on the x axs and cross that. That s why the pathway would be a zgzag and long one. Usng the snakelke method, the extent of vbratons nvolved s reduced dramatcally. Nevertheless, there wll be blnd nodes. Therefore, the methods aforesad can not be relable enough to fulfll a sutable level of effcency at the system. To choose the best pathway, all the possble arrangements of nodes, that s, n! possble choces for the n nodes avalable should be consdered whch leads to a very tedous and tmeconsumng operaton and process specfc. Thus, optmzaton of travelng pathway s an mportant and essental step to word the desgn of prnted crcut boards. For ths reason and to overcome ths draw back a genetc algorthm (GA) s beng used for mnmze the total pathway [6]. To llustrate the effectveness of the proposed method a 100-node component s consdered as a test pattern. The results of proposed genetc algorthms
2 based travelng pathway (GATP) are compared wth tradtonal methods through some performance ndces. The performance ndces are chosen as Absolute Error (AE), Mean Square Error (MSE), Mean Percentage of Absolute Error (MPAE), and Mean Regulaton (MR%). Ths smulaton results show that proposed method not only acheve good result performance, but also t s superor to other classcal methods. Moreover the pathway s shorter, the devce deprecaton and the total functonal tme wll be mnmzed. Thus, t s recommended to mnmze travelng pathway n the automatc drllng of prnted crcut boards. n to other devces. Therefore, wth the same order of the pads, the same old long pathway wll be followed Sortng through the x-then-y method Usng the x-then-y method, the coordnates of every node s evaluated wth respect to an offset node and the coordnates are sorted wth sortng algorthms such as Selecton, Merge, Quck-sort or any other sortng 2. The Structure of the PCB Automatc drll A scheme of an automatc drll s shown n fg 1. It s seen that the devce operates on the two x and y axes whch are orthogonal and dsplaced by the step-motors along the axes. Wth a computer command sent to the x motor and the steps beng declared, the motor at ths axs rotates to the extent commanded and leads the head-ral to the desred place on the x axs. The same operaton s carred out for the y axs. The head-ral starts the dsplacements exactly on a node frst drlled and calbrated as the orgn (0,0) wth respect to the offset node. When guded to the pad area, the head-ral s lowered by the z motor and havng completed the drllng, the head rses up to be dsplaced on the x-y drecton headng the other pns. The control board of the devce s composed of the step-motor devces and moton censors (lnear moton decoder). Some devces have flm-encoders on the pathway whch alert the command crcut wth sendng feedbacks to check the sound performance of the motor. In such devces, the servo-motors are manly used n leu of the step-motors [2]. The dsplacement of the automatc headral from one node to another requres a movement along the x-y axes. The PCB desgn software gudes the headral through the pathway wth provdng the coordnates. The more exactly the next node s selected, the shorter wll be the pathway, that s, less deprecaton of the devce, less tme requred and regardng a drop n the number of steps or the step motons of the step-motor, the overall system wll be more accurate. 3. The proposed algorthm The PCB desgnng applcaton softwares, offer the nodal coordnates on the pad whch are the pns of the components to be nstalled. The coordnates may be assgned for a va whose order s the same as desgned, that s, how the crcut desgner arranges the components on the PCB accordng to whch the pads are lsted and fed Fg 1: The scheme of the automatc drll. algorthm on the x axs and the y coordnates correspondng to the x ones are dsplaced based on If (x > x j ) then exchange (P,P j ) (1) The relatonshp above P(x,y) and Pj(xj,yj) are two separate nodes of the lst beng dscussed Snakelke sortng Usng ths method, the x axs should be dvded nto n sectons. The axes are sorted y-then-x and x-then-y alternately. The ascendng-descendng strategy s carred out at the other axes as well. As the moton step x s dvded nto n sectons, the zgzag pathway s 1/n and the leaps (jumps) decease lkewse. Great care should be taken n the choce of n whch must not exceed a lmt and f t does, t wll result n a local optmzaton Sortng wth the mnmum dstance method The operaton begns wth drllng a (0,0) offset pont. The dstance between any node n relatve to an exstng node r s calculated usng equaton 2 and compared to the prevous values to fnd the mnmum value - the shortest path to the next node - and lst t. The node assumed s the node r and the nearest node to r s to be found: D 2 2 = ( xr xn) + ( yr yn) (2)
3 Usng ths method, the system s accelerated consderably and the pathway shrnks. Although the methods dscussed above offer a relatve mprovement, they are not able to mnmze the pathway. To ths end one should consder all the n! stuatons whch wll ncrease dramatcally wth the number of pads nvolved and wll be almost mpossble to be calculated. The genetc algorthm s used here to obvate ths obstacle. and as the genetc algorthm as a maxmzng process, one can choose the ftness functon to be the nverse of the objectve functon. To optmze the system usng the genetc algorthm, regardng the objectve functon selected n equaton 2, one can choose the ftness functon as 1 F = (3) D 3.4. The shortest pathway usng the genetc algorthm The genetc algorthm s a method based on a natural selecton mechansm whch s successfully used n many optmzaton problems. Ths algorthm holds several prortes [7]: - Instead of dealng wth the parameters, the algorthm deals wth a set of coded parameters. - In genetc algorthm a set of nodes are consdered, not a sngle node. - The genetc algorthm makes use of the data generated by the objectve functon tself, not usng ts dervatves or any other auxlary data. - The genetc algorthm avals from the probablstc functons rather than any specfc equaton. GA focuses on the avalable populaton to generate the chldren n the next generaton. The algorthm choce parents wth best characterstc and transfers them to the matng pool for the genetc algorthm. After the genetc operands are appled, based on Eltsm crteron, a number of parents and chldren are selected for the next generaton. Ths cycle of reproducton and natural selecton contnues untl one of the genetc termnaton crtera s satsfed. The flow chart of the genetc algorthm s shown n fg 2. Before proceedng wth the GA approach, there are two prelmnares to be fnshed [8]. Defnton of sutable Codng: To solve optmzaton problems wth the genetc algorthm, codng s of great mportance. Codng projects the parameters from a real doman to a soluton doman, n whch the problem s beng dealt wth usng the genetc algorthm. Each chromosome s consdered as a sample response n the soluton doman and s composed a number of genes. The number of genes depends on the number of varables ntended to be chosen. Fg.3 shows a sample codng to solve an optmzaton problem along the drll pathway. If n output nodes n the pad-lst are consdered, each gene of a chromosome can be taken as an ndex of a specfc node. As a result, the chromosome wll hold n bts of genes. Choce of ftness functon: For each chromosome of the populaton beng studed, a number of ftness s attrbuted Fg. 2: the flow chart of the genetc algorthm. Based on a flowchart on fg. 2 and the tow prelmnares carred out, the sequences of the genetc algorthm are: Generatng the ntal populaton: Several patterns (chromosomes) are selected out of the same set randomly. The number of these patterns or chromosomes whch s the number of populaton can be user defned. Evaluatng the objectve functon: At ths stage, based on the selected ftness functon, t s estmated that how ft (deservng) s every member of the populaton. 1 2 I J N Fg. 3: A sample chromosome n the soluton space.
4 Reproducton: Ths stage nvolves couplng the patterns randomly to be sent to the matng pool and reproduce the next generaton wth the genetc and reproductve operands. Crossover: Fg4 shows the process through whch chldren are produced usng the crossover operand. Frst each pattern s dvded nto 3 parts whle the edge elements receve (n/4) bts and the elements n between receve (2n/4) bts. Mutaton operaton: At ths stage the [2n/4] bts are * * Parent1 ( ) Parent2 ( ) Fg. 8 the moton of the drll s shown usng the Snakelke method. It s seen that the dstance of the nodes at every zgzag jump s reduced and the total pathway shrnks to 5574 unts. Fg. 9 The head-ral moton (pathway) s shown based on the nearest node to the exstng node method. It s observed that ths algorthm holds some errors whch orgnate from an accumulatve dstance from the blnd nodes and consequently the drll needs more tme to reach these nodes compares to the rest of the nodes. The total pathway on the test pattern based on ths method s 4785 unts. Chld1 ( ) Chld2 ( ) Fg. 5: the executon method of the mutaton operand. selected to be replaced by [n/8] at the left and rght edges, as shown n fg. 5. * * Before: ( ) After: ( ) Fg. 4: The executon method of the crossover operand. Eltsm: Among the populaton of the parents and the chldren, the chromosome of the next generaton s selected based on the ftness functon. Termnaton crteron: At ths stage t s decded whether the genetc algorthm stops or not. The crtera of termnaton at ths algorthm may be actve or passve. In the passve form, the number of stages of reproducton s decded by the user who chooses the number of generatons. In the actve crteron, f n a number of consecutve generatons no change happens (the number of these generatons s defned by the user), that s, the value of the ftness functon does not mprove, the algorthm termnates. 4. Smulaton To see how effectve the proposed algorthm n mnmzng the automatc drll s pathway s, the algorthm s appled on a group of test data whch are the output data of the PCB desgn softwares such as Protel, OrCAD, EasyPC and the lke. In fg. 6 the pattern test s shown wthout a sortng functon whch shows the pathway followed by the automatc head-ral to be unts. Fg. 7 rearranges (sorts) the test pattern based on the x-then-y method. As can be seen n the fgure the headral moton s zgzag and the total pathway s unts. Fg. 6: Explorng the pads based on the ntal lst. Fg. 7: exploraton of the pads based on the lst sorted by the x- then-y algorthm. Fg. 10 shows the convergence of the GA. That after 16 t oraton the algorthm reach the optmal value. In practcng the genetc algorthm the genetc parameter nvolved are provded n table 1. The results of pathway are shown n fg. 11. Accordng ths fgure total pathway usng ths method s 4172 unts.
5 Fg. 8: Exploraton of the pads based on the lst sorted by the Snakelke algorthm. Fg. 9: Exploraton of the pads based on the mnmum dstance algorthm. Fg. 11: Exploraton of pads based on the genetc algorthm. To demonstrate the performance robustness of the proposed method, the Absolute Error (AE), Mean Square Error (MSE), Mean Percentage of Absolute Error (MPAE) based on pathway characterstc are beng used as: ABSE = D G D K (4) ( DG DK ) MSE = n DG DK 100 DG MPAE = n 2 (5) where: : node number ndex n: total number of nodes present G: ndcates the genetc algorthm K: ndcates the other arrangement methods. K belongs to all the arrangement methods. Dg: The dstance of the ' th ' pont usng the genetc algorthm Dk: The dstance of the ' th ' pont usng other arrangement methods (6) The values of AE, MSE and MPAE are calculated for each method and lsted n table 2. Ths table shows that: Fg. 10: The convergence dagram of the genetc algorthm Max Gen P c P m Pop sze Actve condton generaton wth out mprovement Table 1: Genetc algorthm parameter. ABSE MSE MPAE No Sort x then y Snake mn dst Table2: The errors of dfferent algorthms beng compared to the genetc algorthm.
6 1. The x-then-y method holds less dstance error compared to the unsorted lst. 2. The snakelke method holds also holds less error compared to the x-then-y method. 3. The mn dstance method holds less error compared to the prevously mentoned methods. 4. usng the genetc algorthm may guarantee that a complete optmzed pathway could be found. As a result the drll wll move on a mnmzed pathway and ths s economc both regardng the devce deprecaton and tme. To evaluate the mprovement, the crteron MR% n equaton 7 s used and the result s provded n table 3. Ths table shows that usng the genetc algorthm mproves the optmzed result by 83.5%. D ( nosort) Dj( metods) j MR % = 100 (7) D ( nosort) MR% x then y 29.9 Snake 77.2 Mn Dst Genetc 83.5 Table. 3: Comparng the extent of mprovement. The above results show that n comparson wth other methods, the system performance s sgnfcantly mproved by GATP. 5. Conclusons In ths paper a new GA based travelng pathway s proposed to mnmze the movement of automatc drllng of prnted crcut boards. Ths strategy was chosen because of ncreasng complexty of optmzng problem for bgger boards. It should be noted that to acheve the desred level of robust performance, mnmzng the total pathway s very mportant. Thus to reduce the classcal method efforts and ncrease cost savng, a GA ha s been used to choose the best pathway. In ths work GA works offlne and s used to fnd the optmal total pathway. Ths proposed method can guarantee the optmum value of the ftness functon. The salent feature of the proposed method s that the desgn process s less demandng that other methods. The proposed GATP was tested on a 100-node pattern to demonstrate ts effectveness. Smulaton results show that the proposed s very effectve and acheve good robust performance. The system performance characterstcs n term of AE, MSE, MPAE and MR% ndces reveal that the GATP s promsng method for soluton of the travelng pathway between PADs n the automatc drllng of prnted crcut boards and superor to tradtonal methods. Ths s lead to the reducton n the dstances, mnmzaton and optmzaton of the reacton perod, the error and deprecaton of the system. Thus t s recommended to optmzaton total pathway travelng problem. References: [1] A.R. MohammadNaOranj, K. Nav, Desgn & Implement Smart Drll for PCB, MSc Tees, IAU Scence and Reaserch Branch, Tehran, IRAN, [2] A.R. MohammadNaOranj, K. Nav, Step Motors and Industral Automaton, Semnar, IAU Scence and Reaserch Branch, Tehran, IRAN, [3] R. B. Reese, OrCad Layout Plus PCB Tutoral, ECE, MSU, [4] E. Carter and C.T. Ragsdale, A new approach to solvng the multple travelng salesperson problem usng genetc algorthms, European Journal of Operatonal Research, 175(1) 16: , [5] Ch. Fa. Tsa, Ch. W. Tsa and Ch.Ch. Tseng, A new hybrd heurstc approach for solvng large travelng salesman problem, Informaton Scences, 166(1-4):67-81, [6] K. Katayama, H. Hrabayash, H. Narhsa, Performance analyss for crossover operators of genetc algorthm, Systems and Computers n Japan, 30(2): 20-30, [7] H. Shayegh, A. Jall and H.A. Shayanfar, Robust modfed GA based mult-stage fuzzy LFC, Energy Converson and Management, 48(5): , [8] H. Shayegh, H.A. Shayanfar and A. Jall, Mult-stage fuzzy PID power system automatc generaton controller n deregulated envronments, Energy Converson and Management, 47(18-19): , 2006.
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 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 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 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 informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More 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 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 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 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 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 informationOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2018; 8(3): 415-432 OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH
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 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 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 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 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 informationAn 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 informationAn Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem
118 An Effcent Genetc Algorthm Based Approach for the Mnmum Graph Bsecton Problem Zh-Qang Chen, Rong-Long WAG and Kozo OKAZAKI Faculty of Engneerng, Unversty of Fuku, Bunkyo 3-9-1,Fuku-sh, Japan 910-8507
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationA 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 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 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 informationAn 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 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 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 informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More 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 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 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 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 informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationInternational Journal of Industrial Engineering Computations
Internatonal Journal of Industral Engneerng Computatons 4 (2013) 51 60 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/jec
More informationCracking 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 informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationStudy on Multi-objective Flexible Job-shop Scheduling Problem considering Energy Consumption
Journal of Industral Engneerng and Management JIEM, 2014 7(3): 589-604 nlne ISSN: 2014-0953 Prnt ISSN: 2014-8423 http://dx.do.org/10.3926/jem.1075 Study on Mult-objectve Flexble Job-shop Schedulng Problem
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 informationObstacle-Aware Routing Problem in. a Rectangular Mesh Network
Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department
More informationMaximum 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 informationA 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 informationArash Motaghedi-larijani, Kamyar Sabri-laghaie & Mahdi Heydari *
Internatonal Journal of Industral Engneerng & Producton Research December 2010, Volume 21, Number 4 pp. 197-209 ISSN: 2008-4889 http://ijiepr.ust.ac.r/ Solvng Flexble Job Shop Schedulng wth Mult Objectve
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
More informationInvestigations of Topology and Shape of Multi-material Optimum Design of Structures
Advanced Scence and Tecnology Letters Vol.141 (GST 2016), pp.241-245 ttp://dx.do.org/10.14257/astl.2016.141.52 Investgatons of Topology and Sape of Mult-materal Optmum Desgn of Structures Quoc Hoan Doan
More informationAN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING
AN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING Fan Hong * Lu Kaun 2 Zhang Zuxun Natonal Laboratory of Informaton Engneerng n Surveyng Mappng and Remote Sensng of Wuhan Unversty
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 informationSciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network
Ismal Abdullah,, 2017, 1:1 ScFed Journal of Telecommuncaton Research Artcle Open Access Sngle Ftness Functon to Optmze Energy usng Genetc Algorthms for Wreless Sensor Network *1 Ismal Abdullah, 2 Kald
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 information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More 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 informationParallel 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 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 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 informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationReliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 3, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 168 Relable and Effcent Routng Usng Adaptve Genetc Algorthm n Packet Swtched
More informationK-means Optimization Clustering Algorithm Based on Hybrid PSO/GA Optimization and CS validity index
Orgnal Artcle Prnt ISSN: 3-6379 Onlne ISSN: 3-595X DOI: 0.7354/jss/07/33 K-means Optmzaton Clusterng Algorthm Based on Hybrd PSO/GA Optmzaton and CS valdty ndex K Jahanbn *, F Rahmanan, H Rezae 3, Y Farhang
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 informationPerformance Evaluation of an ANFIS Based Power System Stabilizer Applied in Multi-Machine Power Systems
Performance Evaluaton of an ANFIS Based Power System Stablzer Appled n Mult-Machne Power Systems A. A GHARAVEISI 1,2 A.DARABI 3 M. MONADI 4 A. KHAJEH-ZADEH 5 M. RASHIDI-NEJAD 1,2,5 1. Shahd Bahonar Unversty
More informationTHE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT
Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More 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 informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
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 informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
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 informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
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 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 informationSimple March Tests for PSF Detection in RAM
Smple March Tests for PSF Detecton n RAM Ireneusz Mroze Balysto Techncal Unversty Computer Scence Department Wejsa 45A, 5-35 Balysto POLAND mroze@.pb.balysto.pl Eugena Buslowsa Balysto Techncal Unversty
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationResearch of Modeling Complex Topology on Internet MIFUBA BABA SERGE 1 and Ye XU 1,a,*
2017 Internatonal Conference on Electronc and Informaton Technology (ICEIT 2017) ISBN: 978-1-60595-526-1 Research of Modelng Complex Topology on Internet MIFUBA BABA SERGE 1 and Ye XU 1,a,* 1 College of
More informationAN IMPROVED GENETIC ALGORITHM FOR RECTANGLES CUTTING & PACKING PROBLEM. Wang Shoukun, Wang Jingchun, Jin Yihui
Copyrght 2002 IFAC 5th Trennal World Congress, Barcelona, Span A IPROVED GEETIC ALGORITH FOR RECTAGLES CUTTIG & PACKIG PROBLE Wang Shouun, Wang Jngchun, Jn Yhu Tsnghua Unversty, Beng 00084, P. R. Chna
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationAssignment # 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 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 informationA Two-Stage Algorithm for Data Clustering
A Two-Stage Algorthm for Data Clusterng Abdolreza Hatamlou 1 and Salwan Abdullah 2 1 Islamc Azad Unversty, Khoy Branch, Iran 2 Data Mnng and Optmsaton Research Group, Center for Artfcal Intellgence Technology,
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 informationOPTIMAL SECTIONALIZERS PLACEMENT IN THE PRESENCE OF DISTRIBUTED GENERATION SOURCES BY BINARY DIFFERENTIAL EVOLUTIONARY ALGORITHM
OPTIMAL SECTIONALIZERS PLACEMENT IN THE PRESENCE OF DISTRIBUTED ENERATION SOURCES BY BINARY DIFFERENTIAL EVOLUTIONARY ALORITHM BABAK NAJAFI 1, NORADIN HADIMI 2, MOHAMMMAD KARIMI 1, PAYAM FARHADI 1 Key
More informationYuan Xu School of automation, Northwestern Polytechnical University, Xian , China. Huifeng Xue. Ailong Liu*
Rev. Téc. Ing. Unv. Zula. Vol. 39, Nº 7, 80-86, 2016 do:10.21311/001.39.7.10 A Parallel Genetc Algorthm for the Verfyng Smulaton of the Performance Prototype Yuan Xu School of automaton, Northwestern Polytechncal
More informationDecision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing
Decson Support for the Dynamc Reconfguraton of Machne Layout and Part Routng n Cellular Manufacturng Hao W. Ln and Tomohro Murata Abstract A mathematcal based approach s presented to evaluate the dynamc
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More 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 informationRoutability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2-layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationAn Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 9, NO. 12, Dec. 2015 4776 Copyrght c2015 KSII An Adaptve Vrtual Machne Locaton Selecton Mechansm n Dstrbuted Cloud Shukun Lu 1, Wea Ja 2 1 School
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationResearch on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization
, pp.367-378 http://dx.do.org/.14257/jmue.215..8.36 Research on Kruskal Crossover Genetc Algorthm for Mult- Objectve Logstcs Dstrbuton Path Optmzaton Yan Zhang 1,2, Xng-y Wu 1 and Oh-kyoung Kwon 2, a,
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
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 informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationDesign 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