Topology Design using LS-TaSC Version 2 and LS-DYNA
|
|
- Colin Roberts
- 6 years ago
- Views:
Transcription
1 Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool usng LS-DYNA for the analyss of nonlnear structural behavor. The focus s on ts capabltes, current development drectons, and ntegraton nto an ndustral desgn envronment. Examples of usng the new developments such as global constrants, geometrc defntons such as symmetry and castng drectons, and shells are gven. 1 Overvew The goal of topology optmzaton s to fnd the shape of a structure wth the maxmum utlty of the materal. For dynamc problems lke crashworthness smulatons, ths s acheved by desgnng for a unform nternal energy densty n the structure whle keepng the mass constraned. The overall LS-TaSC [1] process conssts of () the desgn problem defnton, () performng the desgn optmzaton teratvely usng LS-DYNA [2], and () post-processng the results. The topology desgn problem s defned by () the allowable geometrc doman, () how the part wll be used, and () propertes of the part such as manufacturng constrants. Addtonally, you have to specfy methodology requrements such as termnaton crtera and management of the LS-DYNA evaluatons. The nformaton s grouped usng the followng three headngs: Cases These store the load case data such as, the LS-DYNA nput deck and executable to use. The Cases data therefore contan the nformaton on how to smulate the use of part. Part The rest of the problem defnton data such as the part ID, geometrc defntons such as beng an extruson, and the desred mass s gven here. Constrants These constrants on the global behavor of the structure, such as the stffness and the complance. Completon These are methodology data such as the convergence crterons. The ntal parts specfy the desgn doman the optmum parts computed wll be nsde the boundares delmted by the ntal parts. The parts must be modeled usng sold or shell elements. The part may contan holes; a structured mesh s accordngly not requred and there s no node or element numberng conventon as n other approaches. Geometry constrants such as beng an extruson or a castng drecton may be specfed. The use of the part s descrbed by LS-DYNA nput deck. The desgn process ams for a unform nternal energy densty n the structure as computed by LS-DYNA usng ths nput deck. The fnal shape of the part s descrbed by the subset of the ntal elements used. The use of an element s controlled by changng the amount of materal n the element. Ths s acheved by assgnng a desgn varable to the densty of each element. The materal s parameterzed usng a so-called densty approach. In ths approach, a desgn varable s drectly lnked to the ndvdual materal element such that each cell has ts own materal model. The desgn varable x, also known as relatve densty, vares from 0 to 1 where 0 ndcates vod and 1 represents the full materal. The materal propertes correspondng to the values of desgn varables are obtaned usng an approprate nterpolaton model as descrbed n the manual [1].
2 2 Methodology The typcal goal of topology optmzaton s to obtan maxmum utlty of the materal. Obtanng unform nternal energy densty n the structure s used as the obectve for optmzaton. Ths follows the formulaton proposed by Patel [4], wth the resultng mplementaton beng smlar to the fully-stressed desgn and unform stran energy densty approaches (Haftka and Gurdal [5], Patnak and Hopkns [6]). The optmzaton problem s formulated as, mn x N subect to : L = = 1 N = 1 C x mn * ( U ( x ) U ), w (7) C x ρ( x ) V M l C u, 1.0. * = 1,2,..., J where U represents the nternal energy densty of the th element, V s the volume of th element, U * represents nternal energy densty set pont, and C s the th constrant. There are L load cases wth a total of J constrants. The superscrpts l and u represent lower and upper bounds on the constrants, respectvely. The change n the desgn varable of th varable ( x ) s computed as, where K s a scalng factor and s updated as, x t = K U t * * ( U )/ U. * U denotes the nternal energy densty set pont. The desgn varable x = x + x. t+ 1 t t 3 Control Parameters The algorthm, and therefore the fnal desgn, can be controlled usng some parameters: Mass Fracton The optmal desgn s created by deletng a fracton of the orgnal part. The Mass Fracton parameter controls the amount of mass preserved. The effect of dfferent values of ths parameter s shown n Fgure 1 usng the default value of the other parameters. Convergence Tolerance Parameter The analyss s termnated when the change n the Mass Redstrbuton (vew ths hstory n the vewer panel) for the teraton s less than the Convergence Tolerance. The Mass Redstrbuton can be nterpreted as the porton of materal moved n an teraton; f the Mass Redstrbuton s 1.0 (not actually possble), then all possble mass have been redstrbuted. Proxmty Tolerance Parameter Ths parameter descrbes a dstance controllng the neghborhood sze of the elements. The desgn varable at an element s updated usng the result at the element averaged together wth that of ts neghbors. Smaller values of ths parameter yeld fner-graned structures as show n Fgure 2.
3 Fgure 1 : The effect of the mass fracton bound. Dfferent desgns created usng dfferent mass fractons are shown. The mass fracton s the fracton of orgnal mass that must be kept. So for a mass fracton of 0.3, the software wll remove 70% of the orgnal structure. Fgure 2 Effect of the proxmty tolerance parameter. The mesh s 100 x 250. The small crcles show the neghborhood sze. A parameter value of zero results n a checkerboard pattern. 4 New capabltes n verson 2 The followng new capabltes were added for verson 2.
4 Global constrants The global constrants are used to constrant responses caused by the whole part, such as a dsplacement or reacton force. Ths s actually a method of computng the mass fracton, because the mass of the structure s ncreased or decreased untl the constrants are satsfed. Shells The thckness of shells can be redesgned to have a unform dstrbuton of the nternal energy densty. Unlke for the solds, a 0/1 behavor s not enforced, and the goal s therefore not to create a new geometry, but to fnd a thckness dstrbuton. Geometrc constrants and multple parts These are constrants on the fnal geometry allowng practcal parts, whch can be manufactured, to be desgned. The GUI nterface showng the defnton of multple parts and geometrc constrants s shown n Fgure 3. The dfferent types of geometry constrants are: o extrusons o castng, one sded o castng, two sded and o symmetry. Fgure 3 Dfferent parts, each wth multple geometry constrants, can be desgned smultaneously. Ths allows parts wth complex geometres to be desgned. 5 Collaboraton wth other CAE Companes Beta CAE Systems S.A., the author of the ANSA preprocessor, s lookng nto CAE work flow procedures ncorporatng LS-TaSC. In addton, Detrot Engneered Products, author of MeshWorks Morpher, s nvestgatng methods of usng ther mesh refnement technologes. Contact these partes for more nformaton. 6 Examples 6.1 Example wth global constrants together wth multple geometry defntons The problem as shown Fgure 4 conssts of a beam beng subected to two mpact load cases as shown.
5 The problem has two symmetry constrants and an extruson constrant. It s requred to be an extruson n the z-drecton and to be symmetrc about both the YZ and ZX plane as shown n the fgure. The problem also has two global constrants: for each load case t s requred that the dsplacement s less than 100 unts. The resultng optmal desgn s shown n Fgure 5 wth the hstores of the constrant values for the teratons as shown n Fgure 6. Fgure 4 Desgn problem wth two load cases and three geometrc constrants Fgure 5 Optmal desgn. The part s an extruson symmetrc about two planes.
6 Fgure 6 Constrant hstores. The fnal desgn requred a trade-off between the two constrants. Ths s because the goal of topology s to get a good concept desgn, not to satsfy the constrants exactly. 6.2 Castng example Ths example s a sold part to be manufactured as a castng, whch was accordngly mposed as a castng geometry defnton. Weght (materal) was to be removed from the structure to obtan the best use of the materal. The procedure accordngly computed an optmal desgn by strengthenng stressed regons of the structure and removng redundant materal. Alternatve, ths desgn procedure can also be vewed as computng a structure wth the best load path for the gven structural use. The geometry and loadng condtons for ths component are shown n Fgure 7. The FE model has about elements and a sngle lnear mplct load case as shown was consdered. Fgure 7: The ntal geometry and loadng condtons.
7 The convergence hstory for the multple-load example s shown n Fgure 8. The ntal and fnal structures are shown n Fgure 9, whle fnal desgn s shown n Fgure 9. The mass fracton specfed n the hstory s the amount of materal that the user specfed should be kept n ths case half (a mass fracton of 0.5) of the structure was scheduled to be retaned. The element fracton used s the fracton of the orgnal number of elements n the part used at any pont n the desgn cycle ths value wll therefore converge to close to the requested mass fracton. The mass redstrbuton s the fracton of the overall mass moved around n the desgn cycle a small number ndcates convergence of the procedure. Fgure 8: Convergence hstory. The problem s converged when the mass dstrbuton s nearly zero. At that tme the fracton of elements used s also close the requested mass fracton.
8 Fgure 9: Fnal desgn for castng problem. The outlne of the orgnal desgn s also shown. 6.3 Shell example The geometry and loadng condtons for the shell example are shown n Fgure 10. For a shell problem such as ths, the thckness of each shell element s a desgn varable. Fgure 10 The geometry and loadng condtons of the shell example. The left sde s bult-n, whle a downward load s appled to the rght, back corner. The fnal geometry wth the fnal thckness s shown n Fgure 11. Shell elements wth a thckness of less than 5% of the startng desgn were deleted n the fnal desgn. The fnal part s stronger on the sde where the load s appled and at the left rear where the bendng moment s the largest.
9 Fgure 11: The fnal geometry and thcknesses for the shell problem 7 Current Development Current mprovements and extensons are: Forgng geometry defnton. Ths s smlar to a castng defnton, except holes are not allowed to extend through the structure; nstead a web of a certan thckness must reman. See Fgure 12 for an example. Frequency constrant. The structure wll be forced to meetng basc frequency constrants. Support of more LS-DYNA materal models. The program used to only consder only *MAT_PIECEWISE_LINEAR_PLASTICITY. The user wll be able to use *MAT_ELASTIC as well as others materal models as requested by ndustry. Dfferent felds for the obectve. Currently the desgn s done to obtan a unform nternal energy densty. Ths extenson allows plastc strans and Von Mses stresses also to be consdered. Fgure 12 Forgng defnton desgn. Notce the web that s requred to use a forgng manufacturng process. 8 Summary LS-TaSC computes the shape of a structure wth the maxmum utlty of the materal. It has been developed for non-lnear structures analyzed n an ndustral envronment. The tool s also sutable for
10 large lnear problems. Ths tool has been extended to shells, global constrants, multple parts, symmetry, and extruson constrants. References [1] Lvermore Software Technology Corporaton, LS-TaSC : A Topology and Shape Computatons for LS-DYNA, User s Manual, Verson 1.0, Lvermore Software Technology Corporaton, Lvermore, CA, [2] Hallqust JO. LS-DYNA theoretcal manual, Lvermore Software Technology Corporaton, Lvermore, CA, [3] Goel T, Roux WJ, and Stander N. A Topology Optmzaton Tool for LS-DYNA users: LS- OPT/Topology. 7th European LS-DYNA Users Conference, Salzburg Austra, May [4] NM Patel, Crashworthness Desgn Usng Topology Optmzaton, PhD thess, Unversty of Notre Dame, [5] RT Haftka, Z Gurdal, MP Kamat, Elements of Structural Optmzaton, Kluwer Academc Publshers, Dordrecht, The Netherlands, 2 nd ed., [6] SN Patnak, DA Hopkns, Optmalty of Fully-Stressed Desgn, Computer Methods n Appled Mechancs and Engneerng, 165, , 1998.
LS-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 informationMULTISTAGE OPTIMIZATION OF AUTOMOTIVE CONTROL ARM THROUGH TOPOLOGY AND SHAPE OPTIMIZATION. 1 Duane Detwiler, 2 Emily Nutwell*, 2 Deepak Lokesha
6 th BETA CAE Internatonal Conference MULTISTAGE OPTIMIZATION OF AUTOMOTIVE CONTROL ARM THROUGH TOPOLOGY AND SHAPE OPTIMIZATION. 1 Duane Detwler, 2 Emly Nutwell*, 2 Deepak Lokesha 1 Honda R&D Amercas,
More informationAn Effective Curve Matching Metric for Parameter Identification using Partial Mapping
An Effectve Curve Matchng Metrc for Parameter Identfcaton usng Partal Mappng Katharna Wtowsk*, Markus Feucht, Nelen Stander *DYNAmore GmbH, Industrestrasse 2, 70565 Stuttgart, Germany Damler AG, EP/SPB,
More informationA Weight Balanced Multi-Objective Topology Optimization for Automotive Development
A Weght Balanced Mult-Objectve Topology Optmzaton for Automotve Development Nkola Aulg 1, Emly Nutwell 2, Stefan Menzel 1, Duane Detwler 3 1 Honda Research Insttute Europe GmbH, Offenbach/Man, Germany
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 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 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 informationMultiblock method for database generation in finite element programs
Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs
More informationShape Optimization of Shear-type Hysteretic Steel Damper for Building Frames using FEM-Analysis and Heuristic Approach
The Seventh Chna-Japan-Korea Jont Symposum on Optmzaton of Structural and Mechancal Systems Huangshan, June, 18-21, 2012, Chna Shape Optmzaton of Shear-type Hysteretc Steel Damper for Buldng Frames usng
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 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 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 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 informationAnalysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress
Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons
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 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 informationFinite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c
Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor
More informationTopology optimization considering the requirements of deep-drawn sheet metals
th World Congress on Structural and Multdscplnary Optmsaton 7 th - th, June 5, Sydney Australa Topology optmzaton consderng the requrements of deep-drawn sheet metals Robert Denemann, Axel Schumacher,
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 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 informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
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 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 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 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 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 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 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 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 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 informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
More 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 informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More 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 informationSpringback Reduction in Stamping of Front Side Member with a Response Surface Method
Sprngback Reducton n Stampng of Front Sde Member wth a Response Surface Method Jung-Han Song *, Hoon Huh *, Se-Ho Km **, Sung-Ho Park *** * Department of Mechancal Engneerng, Korea Advanced Insttute of
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 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 informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationKinematics of pantograph masts
Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More 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 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 informationInvestigations of Topology and Shape of Multi-material Optimum Design of Structures
Advanced Scence and Tecnology Letters Vol.141 (GST 2016), pp.241-245 ttp://dx.do.org/10.14257/astl.2016.141.52 Investgatons of Topology and Sape of Mult-materal Optmum Desgn of Structures Quoc Hoan Doan
More 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 informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More 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 informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
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 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 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 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 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 informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More 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 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 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 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 information陳申岳 S-Y. Chen, 2007, Gradient-Based Structural and CFD Global Shape Optimization with SmartDO and the Response Smoothing Technology, Proceeding of
陳申岳 S-Y. Chen, 2007, Gradent-Based Structural and CFD Global Shape Optmzaton wth SmartDO and the Response Smoothng Technology, Proceedng of the 7 th World Congress of Structural and Multdscplnary Optmzaton
More informationS.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?
S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert
More informationSAO: A Stream Index for Answering Linear Optimization Queries
SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples
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 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 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 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 informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More 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 informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationAdaptive Weighted Sum Method for Bi-objective Optimization
45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs & Materals Conference 19-22 Aprl 2004, Palm Sprngs, Calforna AIAA 2004-1680 Adaptve Weghted Sum Method for B-objectve Optmzaton Olver de Weck
More informationCollaborating components in mesh-based electronic packaging
Scentfc Programmng 12 (2004) 65 70 65 IOS Press Collaboratng components n mesh-based electronc packagng P. Chow a and C.-H. La b a Fujtsu Laboratores of Europe Lmted, Hayes Park Central, Hayes End Road,
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 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 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 informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More 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 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 informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
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 informationBoundary Condition Simulation for Structural Local Refined Modeling Using Genetic Algorithm
2016 Internatonal Conference on Artfcal Intellgence: Technques and Applcatons (AITA 2016) ISBN: 978-1-60595-389-2 Boundary Condton Smulaton for Structural Local Refned Modelng Usng Genetc Algorthm Zhong
More informationMultiobjective fuzzy optimization method
Buletnul Ştnţfc al nverstăţ "Poltehnca" dn Tmşoara Sera ELECTRONICĂ ş TELECOMNICAŢII TRANSACTIONS on ELECTRONICS and COMMNICATIONS Tom 49(63, Fasccola, 24 Multobjectve fuzzy optmzaton method Gabrel Oltean
More informationConcurrent models of computation for embedded software
Concurrent models of computaton for embedded software and hardware! Researcher overvew what t looks lke semantcs what t means and how t relates desgnng an actor language actor propertes and how to represent
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 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 informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
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 informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationCable optimization of a long span cable stayed bridge in La Coruña (Spain)
Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span
More informationCell Count Method on a Network with SANET
CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
More informationInterpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces
7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr
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 informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
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 informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More information