Design for Reliability: Case Studies in Manufacturing Process Synthesis
|
|
- Anissa Gilmore
- 5 years ago
- Views:
Transcription
1 Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng author: Tel: , Fax: , emal: yly@columba.edu Keywords: Response surface methodology (RSM), propagaton of error (POE), robust desgn Abstract: The task of manufacturng process desgn s to determne a set of process parameters for a manufacturng task. The desgn s normally carred out to optmze process performance, such as, to mnmze dscrepancy from a prescrbed shape or to maxmze producton effcency. An optmal desgn, however, s often not the most robust or relable desgn because nevtable uncertantes n nput varables may cause unacceptable devatons from the optmal pont. Robust desgn s therefore needed to acheve compromse between optmzaton and robustness. Such a methodology s llustrated n case studes nvolvng process desgn of laser formng of sheet metal, n whch a set of parameters ncludng laser scannng paths, laser power, and scannng speed s determned for a prescrbed shape. Response surface methodology s used as an optmzaton tool. The propagaton of error technque s bult nto the desgn process as an addtonal response to be optmzed va desrablty functon and hence make the desgn robust. The results are also valdated expermentally.. Introducton Compared wth conventonal formng technques, laser formng of sheet metal does not requre hard toolng or external forces and hence, can ncrease process flexblty and reduce the cost of the formng process when low to medum producton volume s concerned. Many efforts have been made on studyng the mechansms and modelng of the process. Magee, et al. (998) revewed lteratures avalable up to 998. More recently, selected ssues related to extendng laser formng to more practcal applcatons started beng addressed. For nstance, repeated scannng s necessary to obtan the magntude of deformaton that practcal parts requre, and hence coolng effects durng and between consecutve scans become crtcal (Cheng & Yao, ). A vast majorty of work on laser formng ncludng the ones mentoned above can be consdered as solvng the drect problem. Such a problem s typcally formulated based on physcal laws such as heat transfer and elastcty/plastcty theores. To apply the laser formng process to real world problems, however, the nverse problem needs to be addressed. Solvng the nverse problem analytcally or numercally s dffcult, f not mpossble, for the followng reasons. Frstly, no physcal laws are readly avalable to establsh governng equatons leadng to nverse soluton. Secondly, to manpulate ether the soluton to the drect problem or the underlyng dfferental equatons leadng to a soluton to the nverse problem s also mpossble because of the complexty nvolved. Thrdly, whle the soluton to the drect problem s unque, the soluton to the nverse problem s certanly mult-valued. Gven the understandng that numercal or analytcal solutons to the nverse problem are less lkely, emprcal and heurstc approaches have been attempted. A genetc algorthm (GA) based approach was proposed by Shmzu, (997) as an optmzaton engne to solve the nverse problem of the laser formng process. In hs study, a set of arbtrarly chosen heat process condtons for a dome shape was encoded nto strngs of bnary bts, whch evolve over generatons followng the natural selecton scheme. One of the mportant process parameters, heatng path postons, was assumed gven. To apply GA, t s necessary to specfy crossover rate and mutaton rate but ther selecton suffers from lack of rgorous crtera. The objectve of ths paper s to develop a more systematc and relable methodology to solve the nverse problem n laser formng for a class of shapes. A response surface methodology (RSM) based approach s attempted as an optmzaton tool. Dscrete desgn varables are properly dealt wth n the optmzaton process. Propagaton of error (POE) technque s bult nto the desgn process as an addtonal response to be optmzed va a desrablty functon and hence make the desgn more robust. Experments and at places fnte element method (FEM) are used to enable and valdate the optmzaton process. The proposed approach s appled to two cases to demonstrate ts valdty.. Problem Descrpton As shown n Fg., rectangular sheet metal s to be formed nto 3D shapes by parallel laser rradaton. The 3D shape can be vewed as shape generated by a D generatrx n the y-z plane extruded n the x drecton Therefore for ths class of 3D shapes, the nverse desgn problem can be treated as a D curve desgn problem.
2 Fg. Schematc of a class of shapes to be laser formed, lnear parallel scannng paths on a rectangular plate. As shown n Fg., the parameters needs to be determned nclude number of scannng paths, N, postons of laser scannng paths d, laser powers p, beam scannng velocty v and laser spot dameter D b. The approach presented n ths paper, however, s not restrcted to monotonc cases. A non-monotonc generatrx can be smlarly dealt wth usng dfferent beam spot szes for dfferent paths. The objectve functon s to mnmze the dfference between a possble soluton shape and the prescrbed shape, that s Mnmze: h = k = ( z z ) / k () s p where z s and z p are the z coordnates of correspondng ponts on the generatrx of the possble soluton shape and the prescrbed shape, respectvely, and k s the number of ponts. It wll be seen that values of the objectve functon h, n fact, serves as responses n the optmzaton process. In addton, f a pont n the possble soluton shape has a smaller z value than the correspondng pont of the prescrbed shape, the dstance s defned as negatve; otherwse t s postve. When the sum of the dstances s postve, the objectve (or response) s consdered postve; otherwse, t s negatve. The fnal desgn of a product requres not only to be optmal, but also robust, namely, nsenstve to the varaton of nput varables. In laser formng process, the achevable accuracy of formng s lmted by numerous uncertantes. Hennge, et al. (997) nvestgated nfluencng uncertantes n laser formng based on analyzng error propagaton and found varatons n power and couplng coeffcent are most nfluental factors on the varaton of deformaton. In ths paper, the nfluence of laser power on the robustness of the optmal desgn wll be addressed n a robust desgn phase based on desrablty consderaton. In ths study, square plates of sze mm are used. The materal used s AISI low carbon steel. The laser system used s a 5W CO laser. In all the experments, the laser beam dameter s set to 4 mm, the beam movng velocty s kept constant at 5mm/s. A coordnate measurng machne (CMM) s used to measure the coordnates of the deformed plates. 3. RESPONSE SURFACE METHODOLOGY AND OPTIMAL DESIGN Response surface methodology (RSM) s a collecton of statstcal and mathematcal technques useful for developng, mprovng, and optmzng process (Myers, et al. 995). Applcatons of RSM comprse two phases. In the frst phase the response surface functon s based on a factoral desgn, approxmated by a frst-order regresson model (Eq. ), and complete wth steepest ascent/descent search, untl t shows sgnfcant lack of ft wth experment data. After reachng the vcnty of the optmum, the second phase of the response surface functon s approxmated by a hgher order regresson functon such as a second-order one shown n Eq. 3. T yˆ = b + b x + ε () T T yˆ = b + b x + x b x + ε (3) T where ŷ and x = [ x, x,..., x n ] are estmated response and decson varable vector, respectvely, ε s the fttng error whch s assumed to be normally dstrbuted, and b o, b, and b are coeffcents determned usng the least square method. If one or more of the decson varables are ntegers, the optmum problem s consdered as a dscrete problem, whch can be dealt wth methods such as the branch-and-bound method (Taha, 987). The steepest lne search starts wth the ntal desgn ponts of q nteger varables and n-q non-nteger varables. The next teraton starts by arbtrarly choosng a desgn pont from one of the q ntegers varables, the ths remanng
3 q- desgn ponts of nteger varables of next movement are determned based on the coeffcent from Eq. and the branch-and-bound method. After reachng the vcnty of optmum, the response surface s approxmated by a hgher regresson order wth q ntegers determned from prevous teraton and n-q non-nteger factors. At ths stage, the problem can be solved as a regular one wth n-q contnuous varables. 4. DESIRABILITY AND ROBUST DESIGN Desrablty based robust desgn s a tool to fnd controllable factor settngs that optmze the objectve yet mnmze the response varaton of the desgn (Kraber, et al., 996). The transmtted varaton of responses from nput varables can then be reduced by movng the optmal soluton to a flatter part of the response surface. The varaton transmtted to the response can be determned by the error propagaton equaton POE = whereσˆ n n yˆ yˆ yˆ / ˆ σ ( y = σ + σ j + σ e ) (4) x = x < j x j y s the model-predcted standard devaton of the response or known as propagaton of error (POE), the varance of decson varable x, σ k e = ε j / j= df σ j s the covarance between x and x j, and σ s σ e s the resdual varance,, df s the resdual degree of freedom. To reduce varance n the response, POE (Eq. 4) should be mnmzed therefore can be treated as an addtonal response bult nto the desgn process. The smultaneous optmzaton of several responses (n ths case, y n Eq. 3 and ˆσ y n Eq. 4) s the essence of the desrablty based robust desgn (Kraber, et al., 996 and Derrnger et al., 98). For each response ŷ, a desrablty functon D ( ŷ ) assgns a value between and to the possble values of ŷ, wth D ( ŷ ) = representng a completely undesrable value of ŷ and D ( ŷ ) = representng the deal response value. The ndvdual desrabltes are then combned usng the geometrc mean, whch gves the overall desrablty D D y D y D y / m = ( ( ˆ ) ( ˆ )... ( ˆ )) m m (5) where m s the number of responses. The maxmum of D represents the hghest combned desrablty of the responses. Dependng on whether a partcular response ŷ s to be maxmzed, mnmzed, or assgned to a target value, dfferent desrablty functons D ( ŷ ) are to be used. Let L, U and T be the lower, upper, and target values desred for response ŷ, where L T U. If a response s of the target s best, ts desrablty functon s expressed as: r yˆ L L yˆ T T L s yˆ U (6) D ( yˆ ) = T yˆ U T U yˆ > U or yˆ < L where the exponents r and s determne how strctly the target value s desred. The desrablty functon can be defned smlarly f a response s to be mnmzed or maxmzed. As seen from Eqs. 3 and 4, ŷ s a contnuous functon of x, t follows that D and D are pecewse, contnuous functon of x. The above numercal optmzaton problem reduces to a general non-lnear problem. However, as seen from equaton (5) and (6), the dervatve of D s not contnuous. Therefore drect search methods need to be appled to fnd the optmal value of D. Downhll smplex method (Mller, ) s chosen n ths study. An mplementaton of the algorthm s Desgn-Expert by Stat-Ease, Inc, whch s used n the paper. 5. APPROACH TO BENDING ANGLE ATTAINMENT In the steepest ascent/descent search and RSM process, a large number of experments are requred to obtan bendng angles under dfferent condtons, whch s tme consumng and costly and thus poses a serous lmtaton to the method. If the total deformaton of a sheet generated by the parallel laser scans can be obtaned by summng deformatons generated by these scans, a much smaller number of experments wll suffce. In other
4 words, f deformatons caused by scans at dfferent d (Fg. ) can be consdered ndependent each other, only experments wth sngle scannng paths are needed. Ths s expermentally and numercally valdated by Lu & Yao (). Fg., adopted from Cheng & Yao. (), s for the square plate under dfferent laser power level at scannng velocty of 5 mm/s. The scannng was done at y= and the bendng angle s assumed to be the same f scannng s done at a non-zero y value. A lne s ftted through the data ponts to allow nterpolaton n between Bendng angle (degree) v=5mm/s D b =4mm Power (W) Fg. Expermental results of bendng angle nduced by a sngle scan on a square plate (Cheng & Yao, ). 6. RESULTS AND DISCUSSIONS 6. Case : In ths case, the desrable shape (Fg. 3) s gven n terms of the followng process parameters: number of scan paths N=6 and laser power p =p=7w. The scan paths are equally spaced. The way the prescrbed shape s specfed s to facltate n ths frst case comparson of desgn result wth the prescrpton. The task here s to fnd power p and number of scan paths N to mnmze the dfference between the shape formed usng the found condton and that usng the prescrbed condton (Eq. ). Optmal desgn To apply RSM, an ntal desgn pont, N=4 and p=6w, s arbtrarly chosen. The correspondng ntal shape s shown n Fg. 3. A two-level factoral desgn s conducted wth half wdth N= and p=3w. As outlned n Secton 5, bendng angles under the factoral desgn condtons are obtaned from nterpolatng the expermental results shown n Fg.. To mmc the formng process repeatablty characterstcs, normally dstrbuted random numbers are generated and added to each bendng angle value. The standard devaton of the random numbers are chosen as the same as that shown n Fg. n the form of error bars. A frst-order regresson model s ftted based on the factoral desgn and the drecton of the steepest descent s determned from the coeffcents of the regresson model. At each movement along the steepest descent drecton, the response obtaned from regresson model s compared wth that based on the expermental result to examne f ths model s stll vald. The percentage dscrepances of the comparson at the ntal pont and frst movement along the path are.4% and.%, respectvely, whch are consdered to ndcate that the drecton of steepest descent path s vald at these ponts. The responses h at these ponts are -.36 and -.98, respectvely accordng to Eq.. After the next movement along the path (N=6 and p=664w), however, the percentage dscrepancy ncreases to 5.87%, whch ndcates that the drecton s no longer vald at ths pont (a tolerance of 5% s chosen as a lack of ft). Hence, another -level factoral desgn s conducted based on ths pont and a new steepest descent path s calculated. The new ntal pont (N=6 and p=664w) and the next pont along the new path (N=7 and p=696w) have responses h = -.5 and., respectvely. The change of sgn s clearly ndcatve of overshootng, that s, the possble soluton shape s bent more than the prescrbed shape. Ths ndcates that the optmum condton s n the vcnty of the last movement and normally a 3-level factoral desgn needs to be consdered. In ths case, however, the desgn varable N s subject to nteger constrant and the soluton must le on ether N=6 or 7. Therefore the branch-and-bound approach s appled. Three-level sngle-factor (p) desgns are conducted separately at N=6 and N=7. The quadratc equaton for N=6 s found as 5 h = 3.57 p.3933p +. (7) Solvng the equaton for zero response gves the optmal solutons p=7w for N=6 and p=67w for N=7. Ths ndcates that multple solutons are possble. An addtonal objectve functon, such as, one mnmzes producton tme screens out the soluton (p=67w for N=7). The optmzaton result (N=6 and p=7w) agrees very well wth the prescrbed value, (N=6 and p=7w). The optmzaton process towards the prescrbed shape s shown n Fg. 3, whch ncludes prescrbed shape, ntal desgn, some ntermedate shapes and fnal desgn. Robust desgn To make the desgn more robust propagaton of error (POE) s calculated based on Eqs. 4 and 7, 4 and assumed power standard devaton σ p =6W as POE = 4.9 p. 36. The response h s scaled to a desrablty functon D ranged from [,] accordng to Eq. 6 because the response problem s of the target s the
5 Fg. 3 Case Desgn evoluton towards the prescrbed shape best type, where T = (target), L s set as.5, and U +.5 to ensure the robust desgn s not off the optmal soluton too much. The POE s also scaled to a desrablty functon D accordng to Eq. 7 because the POE problem s of the mnmzaton type, where T s set as.4 (for p=65w) and U.68 (for p=7w) accordng to Eq. 7. The overall desrablty D s then expressed as the geometry mean of D and D usng Eq. 7. As seen n Fg. 4, the overall desrablty functon D s a contnuous, nonlnear, pecewse functon, and the maxmum value of desrablty,.4, s found at p=698w, where the POE value s lower than that at the optmal soluton (p=7w), and the response value s.3. At the optmal soluton, the desrablty s about.33 and response s obvously zero. The robust desgn therefore balances between the response and POE. In ths case, the robust desgn does not dffer much from the optmal soluton but the desgn process s generally applcable. 6. Case : In ths case, the desred shape s prescrbed n terms of a generatrx that s a second order y y polynomal z = 4( ) + ( ), as shown n Fg. 5, ts curvature ncreases wth y. It s obvous that evenly spaced 4 4 scannng paths are no longer approprate, ths resultng n a large number of desgn varables and makng the RSM based optmal desgn less feasble. As seen from Fg. 5, however, the curvature of the gven profle decreases monotoncally. Snce the trend of spacng between adjacent laser paths s closely related to the curvature of the prescrbed shape, the followng control functon s proposed to relate all d s, m d = 4( ) (8) N where d specfes the poston of the th laser path, m s the desgn varable to be determned, and N s number of laser scan paths. In ths case, N s set as 7. The problem, therefore, becomes to determne the value of laser power p and exponent m to acheve the gven profle. The same process as n the prevous case starts wth arbtrarly choosng an ntal desgn at m=. and p=65w wth half wdth of. and 3W, respectvely. The response functon s found as h= m+.73p-.3m -.4* -6 p +.5mp. Snce mult-solutons correspondng to zero response. Thus, another objectve functon, POE, s used to obtan the most desred soluton. Suppose the varatons n m and p are. and 6W, respectvely, the POE s constructed as POE=(9.38* -8 p -6.87* -5 p-3.* -5 mp+.9* -3 m+.m +.).5, n whch the resdual varance of.75 s ncluded. h and POE are agan scaled to desrablty functons ranged between [,] wth h constraned between [-.5,.5]. The overall desrablty D s then calculated. The desrablty n two-dmensonal cont-our s plotted n Fg. 9. As seen from Fg. 9, the most desrable value s.83 correspondng to p=69w and m=.7. Wth ths m value and Eq. 8, laser path postons, d s, are calculated and plotted n form of crosses n Fg. 5, along wth the fnal robust soluton and prescrbed shape. As expected, laser path locatons become coarser wth decreasng curvature of the prescrbed shape. The profle based on the robust soluton agrees wth the prescrbed profle. Laser formng experments were conducted under the condton determned by the robust desgn and the results were plotted n Fg. 5. As seen, the expermental result shows a good ft wth the predcted one. 7. CONCLUSIONS It s shown that the proposed optmal and robust desgn schemes are feasble and effectve for the class of shapes consdered. Integer desgn varables are effectvely dealt wth by usng standard methods such as the
6 . Response h POE (σ p =6W) Desrablty Desrablty Response (mm) Desrablty Robust Soluton p=698w POE (mm).6.. Desrablty -.4 RSM Soluton p=7w Power (W) Fg. 4 Relatonshp of response, POE and desrablty. (Standard devaton n laser power σ = W ). z (mm) Prescrbed Shape Prescrbed Shape Curvature Robust Soluton (m=.7, p=69w) Laser Path Poston Expermental Result 3 4 y (mm) Prescrbed Shape Curvature (* -3 /mm) Fg. 5 Comparson of the robust soluton and the prescrbed shape (case ). branch-and-bound method and by ntegratng wth RSM. To reduce the number of desgn varables, the laser path postons are specfed by proper selecton of control functons. The predcted results agree wth the expermental ones. REFERENCES Cheng, J., and Yao, Y.L., (), Coolng effects n multscan laser formng, J. of Manufact. Process, Vol. 3, pp Derrnger, G., and Such, R., (98), "Smultaneous optmzaton of several response varables,'' Journal of Qualty Technology, Vol., pp Hennge, T., Holzer, S., and Vollertsen, F., (997), On the workng accuracy of laser bendng, Journal of Materals Processng Technology, Vol. 7, pp Kraber, S.L., and Whtcomb, P.J., (996), Robust desgn-reducng transmtted varaton, 5 th Annual Qualty Congress, Indanapols, IN. Lu,C., and Yao, Y.L., (), Optmal and robust desgn of laser formng process, F-5, Transacton of NAMRC/SME. Magee, J., Watkns, K.G., and Steen, W. M., (998), Advances n laser formng, J. of Laser Applcatons, Vol., No. 6, pp Mller, R.E., (), Optmzaton Foundatons and Applcatons, John Wley & Sons, New York. Myers, R.H., and Montgomery, D.C., (995), Response Surface Methodology, John Wley & Son, New York. Shmzu, H., (997), A heatng process algorthm for metal formng by a movng heat source, M.S. thess, M.I.T. Taha, H.A., (987), Operatons Research, Macmllan Publshng Company, New York. 6 4 p 6
Support Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More 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 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 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 informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More 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 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 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 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 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 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 informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More 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 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 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 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 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 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 informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationThe 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 informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
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 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 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 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 informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More 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 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 informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
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 informationCONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal
CONCURRENT OPTIMIZATION OF MUTI RESPONCE QUAITY CHARACTERISTICS BASED ON TAGUCHI METHOD Ümt Terz*, Kasım Baynal *Department of Industral Engneerng, Unversty of Kocael, Vnsan Campus, Kocael, Turkey +90
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 informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More 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 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 informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationMulti-posture kinematic calibration technique and parameter identification algorithm for articulated arm coordinate measuring machines
Mult-posture knematc calbraton technque and parameter dentfcaton algorthm for artculated arm coordnate measurng machnes Juan-José AGUILAR, Jorge SANTOLARIA, José-Antono YAGÜE, Ana-Crstna MAJARENA Department
More 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 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 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 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 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 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 informationA Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers
62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers
More 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 informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More 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 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 informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
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 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 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 informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
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 informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
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 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 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 informationCHAPTER 4 OPTIMIZATION TECHNIQUES
48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll
More 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 informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
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 informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationThe Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding
Internatonal Journal of Operatons Research Internatonal Journal of Operatons Research Vol., No., 9 4 (005) The Man-hour Estmaton Models & Its Comparson of Interm Products Assembly for Shpbuldng Bn Lu and
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
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 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 informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationA Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves
A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017
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 informationGeneral Vector Machine. Hong Zhao Department of Physics, Xiamen University
General Vector Machne Hong Zhao (zhaoh@xmu.edu.cn) Department of Physcs, Xamen Unversty The support vector machne (SVM) s an mportant class of learnng machnes for functon approach, pattern recognton, and
More informationENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS
ENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS Zpeng LI*, Ren SHENG Yellow Rver Conservancy Techncal Insttute, School of Mechancal Engneerng, Henan 475000, Chna. Correspondng
More informationStep-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3)
Optmal synthess of a Path Generator Lnkage usng Non Conventonal Approach Mr. Monsh P. Wasnk 1, Prof. M. K. Sonpmple 2, Prof. S. K. Undrwade 3 1 M-Tech MED Pryadarshn College of Engneerng, Nagpur 2,3 Mechancal
More informationMulticriteria Decision Making
Multcrtera Decson Makng Andrés Ramos (Andres.Ramos@comllas.edu) Pedro Sánchez (Pedro.Sanchez@comllas.edu) Sonja Wogrn (Sonja.Wogrn@comllas.edu) Contents 1. Basc concepts 2. Contnuous methods 3. Dscrete
More informationVery simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)
Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
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 informationSolving Route Planning Using Euler Path Transform
Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n
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 information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
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 informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
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 informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More 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 informationStructural Optimization Using OPTIMIZER Program
SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European
More informationA Modelling and a New Hybrid MILP/CP Decomposition Method for Parallel Continuous Galvanizing Line Scheduling Problem
ISIJ Internatonal, Vol. 58 (2018), ISIJ Internatonal, No. 10 Vol. 58 (2018), No. 10, pp. 1820 1827 A Modellng and a New Hybrd MILP/CP Decomposton Method for Parallel Contnuous Galvanzng Lne Schedulng Problem
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 informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
More informationRelevance Assignment and Fusion of Multiple Learning Methods Applied to Remote Sensing Image Analysis
Assgnment and Fuson of Multple Learnng Methods Appled to Remote Sensng Image Analyss Peter Bajcsy, We-Wen Feng and Praveen Kumar Natonal Center for Supercomputng Applcaton (NCSA), Unversty of Illnos at
More information