An Efficient Algorithm for Minimum Vertex Cover Problem
|
|
- Esther Nelson
- 5 years ago
- Views:
Transcription
1 An Effcent Algorthm for Mnmum Vertex Cover Problem Rong Long Wang Zheng Tang Xn Shun Xu Member Non-member Non-member Paper An effcent parallel algorthm for solvng the mnmum vertex cover problem usng bnary neural network s presented. The proposed algorthm whch s desgned to fnd the smallest vertex cover of a graph, uses the bnary neural network to get a near-smallest vertex cover of the graph, and adjusts the balance between the constrant term and the cost term of the energy functon to help the network escape from the state of the near-smallest vertex cover to the state of the smallest vertex cover or better one. The proposed algorthm s tested on a large number of random graphs and benchmark graphs. The smulaton results show that the proposed algorthm s very satsfactory and better than prevous works for solvng the mnmum vertex cover problem. Keywords: Vertex cover, Bnary neural network, Local mnmum, NP-complete problem 1. Introducton The goal of the mnmum vertex cover problem s to fnd a smallest subset C of the vertces of an undrected graph G such that all edges of G are adjacent to at least one vertex n the set C. The mnmum vertex cover problem s of central mportance n computer scence. It s very ntractable (1). In 1972, Karp (2) showed that the vertex cover problem s NP-complete. Furthermore, the mnmum vertex cover problem remans NPcomplete even for certan restrcted graphs, for example, the bounded degree graphs (3). Because the mnmum vertex cover problem has many mportant practcal applcatons, especally n multple sequence algnments for computatonal bochemstry (4) (5), the problem has been wdely studed by many researchers. Garey and Johnson (6) presented a smple approxmaton algorthm based on maxmal matchng for the general graphs. Hochbaum (7) presented an algorthm of approxmaton rato 2 2/d for graphs of degree bounded by d. Monen and Speckenmeyer (8) mproved ths bound to 2 (loglogn)/(2logn). On the sparse graphs, Berman and Fujto (9) presented an approxmaton algorthm for graphs of degree bounded by 3, whose approxmaton rato s bounded by 7/6 +e. The parameterzed algorthms are well known methods. The frst fxedparameter tractable algorthm for k-vertex cover problem (gven a graph G and a parameter k, decdng f G has a vertex cover of k vertces), was done by Fellows (10). Buss (11) developed the fxed-parameter tractable algorthm of runnng tme O(kn +2 k k 2k+2 ) for ths problem. More recently, parameterzed algorthms for the k-vertex cover problem have further drawn researchers Faculty of Engneerng, Fuku Unversty, Fuku-sh, Japan Faculty of Engneerng, Toyama Unversty, Toyama-sh, Japan attenton, and contnuous mprovements on the problem have been developed. Buss s algorthm was mproved to O(kn+2 k k 2 ) by Downey and Fellows (12). Chen et al (13). presented an O(kn k k 2 ) tme algorthm for ths problem. Recently, Dehne et al (14). have reported that they used fxed parameter tractable algorthm to solve the mnmum vertex cover problem on coarse-graned parallel machnes successfully. Khur et al (1). presented an evolutonary heurstc for the mnmum vertex cover problem. Despte many algorthms were presented for the problem, the problem s a well-known NP-complete (2),no tractable algorthm s known for solvng t. Furthermore, few parallel algorthms have been proposed to solve the problem. A possble parallel algorthm for solvng such optmzaton problems was ntroduced by Hopfeld and Tank (15), whch found a good soluton to some optmzaton problems n a reasonable amount of tme. Usng the neural network technques, Yuan et al (16). presented a parallel algorthm based on the Hopfeld network for the mnmum vertex cover problem. In ther algorthm, n order to help the network fnd the global mnmum, they ntroduced a specal term whch had dfferent values accordng to the degree of vertces. Although t was effectve for small graphs, the rate to get the mnmum vertex cover was very low for large graphs, and performance of the algorthm becomes poorer wth problem scale becomng large. In ths paper, for effcently solvng the mnmum vertex cover problem, we propose a new neural network algorthm. The proposed algorthm uses the bnary neural network to get a near-smallest vertex cover of the graph, and adjusts the balance between the constrant term and the cost term of the energy functon to help the network escape from the state of the near-smallest vertex cover to the state of the smallest vertex cover or better one. We show ts effectveness by extensve computa IEEJ Trans. EIS, Vol.124, No.7, 2004
2 An Effcent Algorthm for Vertex Cover Problem where s the logcal OR, X means the complement of X and d j ( =1, 2,,N,j =1, 2,,N) s element of the adjacency matrx of graph G. d j has only two values (1 or 0) whch express f the connecton between vertex and j exsts or not. In other words, f (, j) exsts, then d j s 1 else d j s 0. For example, for the graph of Fgure 1, we have the followng adjacency matrx. D = Fg. 1. A graph wth 10 vertces and 18 edges. tonal experments on a large number of random graphs and benchmark graphs (14). The performance of the proposed algorthm s compared wth Yuan s algorthm (16). The smulaton results show that the proposed algorthm can fnd better solutons than Yuan s algorthm. 2. Formulaton Let G =(V,E) be an undrected graph, a set V V s a vertex cover of G, f for every edge (, j) E, ether V or j V or both, j V. A vertex cover s mnmal or optmal f t has mnmum sze,.e., f there s no vertex cover that has fewer vertexes. The goal of the mnmum vertex cover problem s to fnd a mnmum vertex cover. Fgure 1 shows a graph wth 10 vertces and 18 edges, where the black vertces ndcate the mnmum vertex cover of the graph. In general, an N-vertex M-edge mnmum vertex cover problem can be mapped onto a bnary neural network wth N 2 neurons. In ths work, we show a new bnary neural network representaton. In the new representaton, only N neurons are used for the N-vertex M-edge mnmum vertex cover problem. The output (v =1or v = 0) of the neuron ( =1,,N) expresses f the -vertex s n the cover or not, respectvely. { 1 f vertex s n the cover v = (1) 0 otherwse Thus the number of vertces n the cover can be expressed by: E 1 = v (2) Because the vertex cover must nclude at least one vertex of edge (, j), the constraned condton of the mnmum vertex cover problem can be wrtten as: E 2 = d j v v j (3) Thus, the problem can be mathematcally transformed nto the followng optmzaton problem. ( Mnmze E 1 = ) v (4) Subject E 2 = d j v v j =0 (5) j When we follow the mappng procedure by neural network, the energy functon for the mnmum vertex cover s gven by: E = A v + B d j v v j (6) where A, B are coeffcents. Because the relatons between Boolean representaton and the arthmetc representaton for three typcal functons are as followng: X =1 X X Y = X + Y XY X Y = XY (7) The energy functon can be expanded as: E = A v + B d j (v v j v v j ) +B d j (8) As n the energy functon E, the last term s a constant, the energy can be rewrtten as: E = A v + B d j (v v j v v j ) (9) The network can fnd the soluton of the problem by seekng the local mnmum of the energy functon E usng the followng equatons: u (t) = E = w j v j + I (10) j C
3 where w j s weght of a synaptc connecton from the j-th neuron to the -th one, I s external nput of -th neuron and s also called threshold. Each neuron updates ts nput value u based on the moton equaton. Specfcally, the value u (t +1)atteraton step (t + 1) s gven by: u (t +1)=u (t)+ u (t) (11) The output v s updated from u usng a non-lnear functon called neuron model. In the bnary neural network, the followng McCulloch-Ptts (17) bnary neuron model has been used as the nput/output functon: { 1 f u > 0 v = (12) 0 otherwse Each neuron updates ts nput potental accordng to the updatng rule (Eq.(11)) and sends ts output n response to the nput accordng to the nput/output functon (Eq.(12)). All neurons operate n parallel and each adjusts ts own state to the states of all the others; n consequence, the network converges to a fnal confguraton. In ths way, we can fnd the soluton to the mnmum vertex cover problem smply by observng the fnal confguraton that the network converged. Unfortunately, because the network wll attempt to take the best path to the nearest mnmum, whether global or local, the qualty of the soluton s not very good. 3. Method for Escapng Local Mnma In ths secton, we propose a method to help the network escape from the state of the near-smallest vertex cover to the state of the smallest vertex cover or better one. We rewrte the Eq.(9) as follow: and E = AE 1 + BE 2 (13) E 1 = E 2 = v (14) d j (v v j v v j ) (15) j We analyze the characterstcs of the bnary neural network n a mnmum. We use E to denote the varaton of energy of the network wth the state change of neuron. It s well known that a local mnmum always satsfes E 0 for =1, 2,..., N (16) The varaton of energy of the network wth the state change of any neuron can be wrtten as: E =(A E 1 + B E 2 ) v =(A + B E 2 ) v (17) From Eq.(15) we have: E 2 =2 j d j (v 1) (18) Because d j and v j are equal to 0 or 1, thus we have: 2k E 2 0 (19) where k s the number of vertces connected to vertex. To make the energy value of the neural network decrease wth the state change of at least one neuron, we can have the followng rule from Eq.(17): (1) Select one neuron that satsfes the followng equaton: E 2 < 0 (20) It s worth to note that a neuron wth Eq.(20) certanly exst because n a local mnmum, E 0 (Eq.(17)) and for every fred neuron, v s -1. (2) f v > 0(v = 0) and E 0, thus A B E 2, then we modfy parameter A accordng to the followng rule: A new = B E 2 δ<a (21) Otherwse( v < 0,v = 1), A new = B E 2 + δ<a (22) where δ s a small postve constant and usng Eq.(20) we can see that the modfed parameter A new wll be postve. After modfcaton, the parameter set becomes A new, B, and wth the state change of the neuron, the varaton of energy of the network can be descrbed by the followng formula by applyng Eq.(21),(22) nto Eq.(17). { δ v for v E = > 0 (23) δ v for v < 0 It s evdent that E (Eq.(23)) s smaller than zero. The dervatves of Eq.(23) show that the energy of the network decreases wth the state change of the neuron by the above rule (Eq.(21) and (22)). Thus, we can see that by adjustng the balance between the constrant term and the cost term of the energy functon, the local mnmum that the network falls nto s elmnated. 4. Algorthm The followng procedure descrbes the proposed algorthm for the general mnmum vertex cover problem n synchronous parallel mode. In order to reduce the computaton tme we set the maxmum number of the teraton step, when the teraton step exceeds the maxmum one, the network s consdered as fallng nto a convergence state. Ths rule s usually used n the bnary neural networks. If the targ cost s the target total cost set by the user as expected one, we have: 1496 IEEJ Trans. EIS, Vol.124, No.7, 2004
4 An Effcent Algorthm for Vertex Cover Problem Table 1. The smulaton results for the random graphs. Propose Algorthm Graph Algorthm of Yuan et al. wthout the modfcaton of A wth the modfcaton of A Ver. Edg. Den. Cover CPU (s) Cover Cover CPU (s) (1) Set the parameter δ to 0.01 and ntal parameters A, B to 1.0. (2) Intalze the state of the network. (3) Update the neural network n synchronous parallel mode wth current parameter set untl the network converges to a stable state or the teraton step exceeds the maxmum one. (4) Check the network, f targ cost s reached, then termnates ths procedure. (5) Select one neuron wth satsfyng Eq.(20) (6) Use rule (Eq. (21) and (22)) to compute the new parameter A. (7) Go to the step 3. It s worth to note that about the condton of termnaton, though t could requre more CPU tme for some problems, approprate tunng of targ cost s useful n the practcal smulaton. 5. Smulaton Results In order to assess the effectveness of the proposed algorthm, extensve smulatons were carred out on two types of graphs: the randomly generated graphs and the benchmark graphs for the vertex cover problem. The algorthm was mplemented on PC Staton (Pentum4 1.8GHz). The frst type of graph s random graph (18). The random graph s defned n terms of two parameters, n and d. The parameter n specfes the number of vertces n the graph; the parameter d, 0<d<1, s the edge densty. Wth parameters n and d, the number of edges of the graph wll be dn(n 1)/2. We generated 14 such graphs to test the proposed method. The method of Yuan et al (15). was also executed for comparson. For each of nstances, 100 smulaton runs were performed. Informaton on the test graphs as well as all results was shown n Table 1. The results that we recorded for each graph were the best solutons by the algorthm of Yuan et al., and by the proposed algorthm. For readers reference, the computaton tmes to obtan the best soluton and the solutons found by the proposed algorthm wthout the modfcaton of parameter A were also gven n Table 1. The computaton tme was the average of 100 Table 2. The ncrease rato of computaton tme aganst the problem sze. Graph Edge densty: 0.15 Edge densty: 0.25 Vertex Edges Increase rato edges Increase rato % % % % % % % % % % % % smulatons. In general, wth the ncrease of the sze of the problem, the computatonal cost wll ncrease. In Table 2, we showed the ncrease rato of computaton tme aganst the problem sze (numbers of edges) under the graphs of same edge densty. The ncrease rato s defned by: ncrement of CPU rato = 100 (24) ncrement of edges From the Table 2, we can see that although the computatonal cost ncrease wth the ncrease of the task sze, the ncrease rato s very small. The expermental results can be summarzed as follows: (1) The soluton qualty of the proposed algorthm s much better that of Yuan et al s method. (2) The soluton found by the proposed algorthm wth the modfcaton of A s much better than that wthout the modfcaton of A. In other words, the method for escapng local mnma n the proposed algorthm s very effcent. (3) The computaton tme of proposed algorthm s about or less than 4 second even for relatvely large random graphs up to 300 vertces. Besdes, although the computatonal cost ncrease wth the ncrease of the task sze, the ncrease rato s very small. The computatonal cost for each graph s reasonable. To see f the proposed algorthm can fnd optmal solutons, we test the proposed algorthm on some benchmark graphs wth known answers. The problem of generatng benchmark graphs for NP-hard combnatoral problems has been nvestgated n (19) (20). Procedures for C
5 Table 3. The smulaton results for benchmark graphs. Algorthm of Yuan et al. Proposed Algorthm Graph Ver. Edg. k Vertex Cover CPU (s) Vertex Cover CPU (s) RG RG G RG RG RG RG RG RG RG generatng benchmark graphs wth known answers were descrbed n (21).In (22) the generatng procedures for vertex cover were evaluated expermentally on several approxmaton algorthms. In (14), some graphs generated by (22) were used to test ther algorthm for the vertex cover problem. Here we used some of these graphs n (14) to test the proposed algorthm. The results were shown n Table 3 where k refers the sze of the optmal soluton. In Table 3 the solutons and the computaton tme of the proposed algorthm were gven. From Table 3, we can see that the proposed algorthm could fnd optmal solutons for each benchmark graph. 6. Concluson We have proposed an effcent parallel algorthm for solvng the mnmum vertex cover problem usng bnary neural network. The proposed algorthm has two phases. The frst phase uses the neural network to decrease the energy and fnd a near-mnmum vertex cover. The second phase adjusts the balance between terms of energy functon, thus makng the network escape from the local mnmum vertex cover. The proposed algorthm was tested on a large number of random graphs and benchmark graphs and compared wth Yuan s algorthm. The expermental results ndcated that the proposed algorthm s better than prevous works and can fnd optmal or near optmal solutons. (Manuscrpt receved June 19, 2003, revsed Nov. 17, 2003) References ( 1 ) S. Khur and T. Back: An evolutonary heurstc for the mnmum vertex cover problem, J. Kunze and H. Stoyan, edtors, KI-94 Workshops (Extended Abstracts), pp.83 84, Bonn (1994). ( 2 ) R. M. Karp: Reducblty among combnatoral problems, Complexty of Computer Computaton, Plenum Press, New York, pp (1972). ( 3 ) M. R. Garey, D. S. Johnson, and L. Stockmeyer: Some smplfed NP-complete graph problems, Theoretcal Computer Scence, Vol.1, pp (1976). ( 4 ) R. Nedermeer and P. Rossmanth: Upper bounds for vertex cover further mproved, Proceedngs of the 16th Symposum on Theoretcal Aspects n Computer Scence (STACS 99), Sprnger-Verlag LNCS 1563, pp (1999). ( 5 ) U. Stege: Resolvng Conflcts from Problems n Computatonal Bology. Ph.D. thess, No.13364, ETH Zurch (2000). ( 6 ) M.R. Garey and D.S. Johnson: Computers and Intractablty: A Gude to the Theory of NP-completeness. San Francsco: Freeman (1979). ( 7 ) D. S. Hochbaum: Effcent bounds for the stable set, vertex cover and set packng problems, Dscrete Appl. Mathematcs, Vol.6, pp (1983). ( 8 ) B. Monen and E. Speckenmeyer: Ramsey numbers and an approxmaton algorthm for the vertex cover problem, Acta Informatca, Vol.22, pp (1985). ( 9 ) P. Berman and T. Fujto: On approxmaton propertes of the ndependent set problem for low degree graphs, Theory of Computng Syst., Vol.32, pp (1999). (10) M. R. Fellows: On the complexty of vertex cover problems, Techncal report, Computer Scence Department, Unversty of New Mexco (1988). (11) J.F. Buss and J. Goldsmth: Nondetermnsm wthn P. SIAM Journal on Computng, Vol.22, pp (1993). (12) R.G. Downey and M.R. Fellows: Fxed parameter tractablty and completeness II: completeness for W[1], Theoretcal Computer Scence, Vol.141, pp (1995). (13) J. Chen, I. A. Kanj, and W. Ja: Vertex cover: further observatons and further mprovements, 25th nternatonal Workshop on Graph- Theoretcal Concepts n Computer Scence (WG 99), LNCS, pp (1999). (14) F. Dehne, et al.: Solvng large FPT problems on coarse graned parallel machnes, Avalable: carleton.ca/ fpt/papers/ndex.htm. (15) J.J. Hopfeld and D.W. Tank: Neural computaton of decsons n optmzaton problems, Bo. Cybern., No.52, pp (1985). (16) S. Y. Yuan and S. Y. Kuo: A new technque for optmzaton problems n graph theory, IEEE Trans. on Computers, Vol.47, pp (1998). (17) W. S. McCulloch and W. H. Ptts: A logcal calculus of deas mmanent n nervous actvty, Bull. Math. Bophys, Vol.5, pp (1943). (18) D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon: Optmzaton by smulated annealng: An expermental evaluaton; Part 1, graph parttonng, Operatons Research, Vol.37, No.6, pp (1989). (19) B. Krshnamurthy: Constructng test cases for parttonng heurstcs. IEEE Trans. on Computers, Vol.36, pp (1987). (20) B.N. Khoury, P.M. Pardalos, and D.-Z. Du: A test generator for the stener problem n graphs, ACM Trans. on Mathematcal Software, Vol.19, pp (1993). (21) L.A. Sanchs: Generatng hard and dverse test sets for NPhard graph problems, Dscrete Appl. Mathematcs, Vol.58, pp (1995). (22) L.A. Sanchs: Test case constructon for the vertex cover problem, DIMACS Seres n Dscrete Mathematcs and Theoretcal Computer Scence, Vol.15, pp (1994) IEEJ Trans. EIS, Vol.124, No.7, 2004
6 An Effcent Algorthm for Vertex Cover Problem Rong Long Wang (Member) receved a B.S. degree from Hangzhe teacher s college, Zhejang, Chna and an M.S. degree from Laonng Unversty, Laonng, Chna n 1987 and 1990, respectvely. He receved hs D.E. degree from Toyama Unversty, Toyama, Japan n From 1990 to 1998, he was an Instructor n Benx Unversty, Laonng, Chna. In 2003, he joned Unversty of Fuku, Fuku Japan, where he s currently an Instructor n Department of Electrcal and Electroncs Engneerng. Hs current research nterests nclude genetc algorthm, neural networks, and optmzaton problems. Xn Shun XU (Non-member) receved a B.S. degree from Shandong Normal Unversty, Shandong, Chna and a M.S. degree from Shandong Unversty, Shandong, Chna n 2000 and Now he s workng toward the Ph.D. degree at Toyama Unversty, Japan. Hs man research nterests are neural networks and optmzatons Zheng Tang (Non-member) receved a B.S. degree from Zhejang Unversty, Zhejang, Chna n 1982 and an M.S. degree and a D.E. degree from Tsnghua Unversty, Bejng, Chna n 1984 and 1988, respectvely. From 1988 to 1989, he was an Instructor n the Insttute of Mcroelectroncs at Tsnhua Unversty. From 1990 to 1999, he was an Assocate Professor n the Department of Electrcal and Electronc Engneerng, Myazak Unversty, Myazak, Japan. In 2000, he joned Toyama Unversty, Toyama, Japan, where he s currently a Professor n the Department of Intellectual Informaton Systems. Hs current research nterests nclude ntellectual nformaton technology, neural networks, and optmzatons. C
A Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More 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 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 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 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 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 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 informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More 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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More 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 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 information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More 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 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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More 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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
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 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 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 informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More 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 informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More 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 informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More 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 informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More 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 informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
More informationSome 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More 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 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 informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More 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 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 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 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 informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
More 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 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 informationthe nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an
On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationA 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 informationNOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING
Journal of Theoretcal and Appled Informaton Technology 27 JATIT. All rghts reserved. www.jatt.org NOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING Fatma A. Newagy, Yasmne A. Fahmy, and
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
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 informationInternational Journal of Mathematical Archive-3(11), 2012, Available online through ISSN
Internatonal Journal of Mathematcal rchve-(), 0, 477-474 valable onlne through www.jma.nfo ISSN 9 5046 FUZZY CRITICL PTH METHOD (FCPM) BSED ON SNGUNST ND CHEN RNKING METHOD ND CENTROID METHOD Dr. S. Narayanamoorthy*
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationOn Embedding and NP-Complete Problems of Equitable Labelings
IOSR Journal o Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 39-765X Volume, Issue Ver III (Jan - Feb 5), PP 8-85 wwwosrjournalsorg Ombeddng and NP-Complete Problems o Equtable Labelngs S K Vadya, C M Barasara
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 informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More 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 informationPARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM
PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/ KNAPSACK PROBLEM Josef Schwarz Jří Očenáše Brno Unversty of Technology Faculty of Engneerng and Computer Scence Department of Computer Scence
More informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More 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 informationMIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method
MIED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part : the optmzaton method Joun Lampnen Unversty of Vaasa Department of Informaton Technology and Producton Economcs P. O. Box 700
More informationAn Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
IEMS Vol. 10, No. 3, pp. 221-231, September 2011. An Optmzaton Algorthm for Mnmum Connected Domnatng Set Problem n Wreless Sensor Network Namsu Ahn Defense Agency for Technology and Qualty 275-18, Boksu-dong,
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
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 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 informationAnt Colony Optimization Applied to Minimum Weight Dominating Set Problem
Ant Colony Optmzaton Appled to Mnmum Weght Domnatng Set Problem Raa JOVANOVIC Mlan TUBA Dana SIMIAN Texas AM Unversty Faculty of Computer Scence Department of Computer Scence at Qatar Megatrend Unversty
More informationSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3:485-494 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationTPL-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 informationTheoretical Computer Science
Theoretcal Computer Scence 481 (2013) 74 84 Contents lsts avalable at ScVerse ScenceDrect Theoretcal Computer Scence journal homepage: www.elsever.com/locate/tcs Increasng the mnmum degree of a graph by
More informationy 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 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 informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
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 informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationComplex System Reliability Evaluation using Support Vector Machine for Incomplete Data-set
Internatonal Journal of Performablty Engneerng, Vol. 7, No. 1, January 2010, pp.32-42. RAMS Consultants Prnted n Inda Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set
More informationThree supervised learning methods on pen digits character recognition dataset
Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru
More informationFitting: 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