Free-Form Grid Shell Design Based On Genetic Algorithms
|
|
- Mervin French
- 7 years ago
- Views:
Transcription
1 Free-Form Grd Shell Desgn Based On Genetc Algorthms ABSTRACT Mlos Dmcc Stuttgart Unversty Jan Knppers Stuttgart Unversty In the 1st century, as free-form desgn grows n popularty, grd shells are becomng a unversal structural soluton, enablng the conflaton of structure and skn (façade) nto one sngle element (Kolarevc 003). Ths paper presents some of the results of a comprehensve research project focused on the automated desgn and optmzaton of grd structures over some predefned free form shape, wth the goal of generatng a stable and statcally effcent structure. It shows that by combnng desgn and FEM software n an teratve, Genetc Algorthmsbased optmzaton process, stress and deformaton n grd shell structures can be sgnfcantly reduced, materal can be saved and stablty enhanced. 7 acada 011 _proceedngs ntegraton through computaton
2 Fg. 1 1 Introducton At the end of the 0th century we wtnessed the appearance of the frst steel free-form grd shell structures entrely composed of unque structural members, snce there was no longer any substantal dfference n cost between producng 1000 unque objects and 1000 dentcal ones (Kolarevc 003). In the 1st century the feld of free-form grd shell structural desgn s beng developed further, but structural desgn and optmzaton technques are stll mostly based on the tral-and-error approach. In smpler terms, we developed a varety of technques that enable us to generate optcally acceptable trangular, quadrangular or hexagonal grds over a gven free-form surface, but when ther statcal effcency s brought to attenton there are no ready answers about how to optmze the grd. Ths paper shows how by changng the member dsposton,.e., by performng geometrcal and topologcal optmzaton of the grd shell, substantal dfferences n statcal performance can be acheved. In order to not lmt the creatvty of archtects, the dea was to generate the best structural soluton over some already defned shape. Instead of form-fndng we are tryng to fnd the best geometry and topology of a grd shell, whle keepng t on the specfc surface durng the process. The proposed method of structural optmzaton s constructed as a C++ based plug-n for Rhnoceros 3D, one of the man NURBS (Non Unform Ratonal B-Splnes) geometry based modelng tools used by archtects for free-form desgn today. The algorthm communcates teratvely wth FEM software for statc analyss. In ths case Oasys GSA commercal FEM software s used. Grd Formaton Before the optmzaton algorthm explanaton, the method of automatc grd generaton over a gven free-form NURBS surface has to be addressed. Ths s mportant n order to understand how dfferent grd shell solutons are generated n the process of fndng the most effcent one. For ths purpose, and wthn the presented research, the decson was made to use Vorono Dagrams (De Berg et al. 1997), for two man reasons. Frst, NURBS surfaces are mathematcally represented over two parameters (uv) and algorthms for Vorono dagram generaton n D (n plane) can be therefore mapped onto the surface, usng a drect xy-uv transformaton. Second, dependng on the dsposton of Vorono ponts, a large number of dfferent, natural lookng structures can be generated, but also structures wth a regular grd pattern (lke trangular, quadrangular and hexagonal). Therefore, Vorono ponts generated over a gven NURBS surface are basc varables. As depcted n Fgure 1, we take the surface, generate a Vorono dagram over t and what we do next s relax the Vorono structure. For the process of relaxaton the Force Densty Method (Gründg et al. 000) s expanded to work for any knd of grd, and addtonally to always keep the grd on the surface, whle relaxng t. By relaxng a Vorono structure we got foam-lke grd that we called Voronax (Vorono + Relax). The Voronax grd has polygons (cells) wth much more smlar corner angles and edge lengths, whch are, from a structural pont of vew, more acceptable for the grd shell desgn. The advantage of ths complexty s that Voronax grds can easly change ther densty, whle beng optcally smooth and structurally acceptable. They keep the topology of the Vorono dagram whch means that on average ther polygons have ~ 6 edges (Sack 1999; Urruta 1999). We can use that to see what dstrbuton of densty (dstrbuton of structural members) s statcally favorable. 3 Basc Plug-n Structure The goal of ths research s to make a unversal method for grd shell optmzaton; one that s adaptable, easly expandable and wth a large number of varables, (.e., wth an easy defnton of boundares and settngs wthn whch we want our soluton to be generated). Therefore a plug-n was developed so that the user can: Fgure 1. Vorono dagram and voronax structure 73 form, geometry and complexty
3 Fg. Fg. 3 Fg. 4 1) Choose the surface over whch the grd wll be generated ) Choose the basc pattern of the grd (e.g. Delaunay trangulaton (De Berg et al. 1997), quadrangular, Vorono, Voronax) 3) Set a support combnaton (e.g. all four edges, two edges, fully restraned, movable) 4) Set a load combnaton (any load combnaton defnable n FEM software) 5) Set materal propertes 6) Set cross-secton of the structural members 7) Defne the ftness functon (e.g. mnmze Von Mses stress, mnmze deformaton, maxmze load bucklng factor) 8) Defne one or more penalty functons (e.g. lmt the length of a member, lmt the sze of a polygon, lmt the stress generated n one member) 9) Set GAs parameters (e.g. crossover and mutaton probablty, number of ndvduals, number of generatons) Each one of these settngs (Fgure ) can be easly expanded and redefned. When they are chosen, the optmzaton process begns and the algorthm converges toward the best soluton for that [combnaton of nput settngs, whatever they are]. 4 Genetc Algorthms Fgure. Input parameters, expandable and changeable Fgure 3. Basc GAs loop Fgure 4. Basc loop for one grd shell soluton Genetc Algorthms (GAs) are chosen as a sutable method for mult-objectve and hghly nonlnear optmzaton. It s a stochastc method, based on the prncple of evoluton, wthn whch a random populaton of ndvduals s generated (grd shells n our case) at the begnnng. The best ndvduals, accordng to ther ftness, are then chosen for reproducton and wth specfc crossng technques, solutons are combned to brng new offsprng and n that way form a new generaton. The crossng methods ensure the hertage of good genes, thus enablng the whole process to converge toward the best ftness soluton. Specfc mutaton algorthms enable random alteraton of ndvduals n order to ntroduce dversty and ensure a better exploraton 74 acada 011 _proceedngs ntegraton through computaton
4 Fg. 5 of the search space, thus avodng convergence to local optma. Ths loop (Fgure 3) then contnues untl the satsfactory soluton s found. In our case, we are searchng for a grd shell structure wth mnmum materal usage (mnmum weght) and mnmum potental energy of the system. Grd shells can be evaluated optcally or statcally, accordng to the defned ftness functon, and n ths paper the focus s on the statcal optmzaton. More on the bascs of the Genetc Algorthms applcaton can be found n Genetc Algorthms n Search, Optmzaton and Machne Learnng (Goldberg 1989). 4.1 BASIC LOOP Genetc Algorthms work wth a chromosome representaton. In ths research the chromosome s formed as a strng of real-valued numbers whch are later on transformed nto the uv coordnates on the surface. Ths s done wth a specfc set of decodng functons. The uv coordnates are used to generate ponts from whch a Vorono dagram (over a gven surface) s calculated and eventually relaxed, resultng n a Voronax grd structure. Each grd shell n the algorthm goes through an eleven step process depcted n Fgure 4. Frst, the basc GAs operatons (selecton, crossng, mutaton) are performed, followed by the decodng part (or generaton) where the chromosome s transformed nto a grd shell and prepared for FEM statc analyss. Step 8 refers to an automatc call of the FEM software where the statc analyss of the generated grd shell s performed. When the needed results are obtaned (e.g. forces, moments, deformatons, etc.) the evaluaton accordng to the chosen ftness functon s carred out, and the soluton s penalzed f t volates any of the specfed constrants. The ftness value and the volaton of constrants are then combned and scaled nto one fnal ftness value of the generated ndvdual soluton. In a usual optmzaton there are 50 grd shells n a generaton, and the process lasts for generatons, thus sometmes generatng more than 30,000 solutons. All the solutons are kept n specfc text fles that enable ther recreaton,.e., extracton and drawng of any of the generated grd shells n the process. 5 Optmzaton In order to llustrate the optmzaton process, and what ts contrbuton s, a surface shown n Fgure 5 s chosen. It s a free-form vertcal wall, the edges of whch are restraned,.e., the structural jonts of the generated solutons on the edges are restraned from movement or rotaton n all drectons. In Fgure 5 we also see a basc cross-secton used for the optmzaton, the crcular hollow secton: CHS 193x5.0. The dea s to perform a geometrcal and topologcal optmzaton of the grd, and therefore all generated members have the same secton. In that way we can look for the mnmal stress or mnmal dsplacement soluton by changng the geometry and keepng the mass of the structure relatvely the same. The load appled s the selfweght of the structural members and a horzontal surface load. The horzontal load s appled by calculatng the surface of each cell (structural polygon), and dstrbutng t to the structural jonts (Fgure 5). Wthn the research, experments were done wth properly orented rectangular cross-sectons and wth proper wnd load (normal to the surface at all ponts). An optmzaton wth these settngs however ntroduces a dfferent set of problems whch are not the focus of ths paper, and that s why, for the presented optmzaton, the settngs were smplfed usng a crcular secton and horzontal load. Ths however has no effect on the effcency of the optmzaton process, snce t works for any knd of nput parameter combnaton. The most mportant part of the GAs optmzaton s the ftness functon. In ths case the goal s to mnmze Von Mses stress (σv) n the structure. For each structural member n the grd shell the smplfed verson of Von Mses stress (Equatons 1-4) s calculated at both of ts ends (denoted Fgure 5. Surface, cross-secton and load 75 form, geometry and complexty
5 as 0 and 1). Those values are summed up for all (n) structural members resultng n a ftness value (F(x)) for the entre structure, whch we are tryng to mnmze (Equaton 5). Eq. 1 σ = σ + + v x 3τ xy 3τ xz F M σ = ± M ± F τ = x y z y Eq. x Eq. 3 xy Eq. 4 A Wy Wz Ay τ xz Fz = A z Mnmze: Eq. 5 n F( x) = [ σ,,0 + σ,,1] = 1 v v Here we also ntroduce another ftness functon developed wthn the research, whch wll be used only for comparson purposes. Namely, for each jont n the structure ts dsplacement (movement) s calculated (d) as a vector n space, derved from the movements n all three (x,y,z) drectons (Equaton 6). The magntude of all jont movements s then summed up, resultng n a total dsplacement of the structure (Equaton 7). Fg. 6 Eq. 6 Eq. 7 d = x + y + z F( x) = n d = VORONAX OPTIMIZATION The Voronax pattern optmzaton s performed wth a 150 pont chromosome. That means that for each ndvdual soluton, 150 ponts are generated over a surface, turned nto a Vorono dagram, whch s then relaxed resultng n a Voronax grd structure. In Fgure 6 there are two graphs showng the convergence of the optmzaton process after 550 generatons (7,500 generated ndvdual grd shell solutons). The graph on the top shows the progress of the average ftness value n each generaton (calculated from 50 ndvduals). The graph bellow shows ftness values of the best ndvdual soluton (grd shell) n each generaton. It can be seen how both graphs show a constant descent of the total Von Mses stress generated n the structure and a steady convergence. In the mddle column, depcted from the front vew, there s: 1. The worst generated soluton, created randomly n one of the frst generatons, havng 113 GPa as the total amount of Von Mses stress and 13.4m of total jont dsplacement.. For comparson, a hexagonal structure s used, representng bascally a unform verson of the Voronax grd. The reason for ths s that Voronax keeps the topology of the Vorono structure after relaxaton, whch means that on average ts polygons have ~ 6 edges and jonts have a 3-member connecton (as n a hexagonal grd). Ths unformly dstrbuted grd only shows a slghtly better performance (101 GPa and 7.58m) than the worst generated soluton. 3. The best generated soluton from one of the latest generatons has the smallest amount of Von Mses stress generated n ts members (38 GPa),.e., three tmes smaller than the worst generated soluton and a 6 tmes smaller amount of dsplacement (.m). In Fgure 6, on the rght-hand sde, there s a colour analyss of ths Voronax grd soluton, showng the dstrbuton of the grd densty (from blue=sparse to red=dense). There s a number of dfferent ways of how ths nformaton can be used n grd shell desgn. Followng the advce of the GAs algorthm we can use dfferent technques, from controlled relaxaton to a combnaton of dfferent patterns, to acheve a statcally effcent desgn. The followng s an examnaton of such a desgn. 5. INTERPRETATION Fgure 6. Results of the optmzaton process We can generate a unform quadrangular structure over our free-form wall as shown on the left-hand sde n Fgure 7. Then we can try to nterpret the ntenton of the GAs optmzaton process. It can be seen that the best structural soluton offered has an enlarged grd densty around the convex parts 76 acada 011 _proceedngs ntegraton through computaton
6 Fg. 8. Fg. 7 (red area n two representatons n the mddle of Fgure 7 thus stffenng them up, and stretchng the cells over the dagonal between the two convex parts (yellow area). Usng ths nformaton we can try to generate a quadrangular structure wth a smlar number of jonts and members, as depcted on the rght-hand sde of the fgure. By dong so, we get a quadrangular structure wth 13% less generated stress and a 5% smaller amount of dsplacement. By combnng dfferent patterns (trangular, quadrangular, hexagonal) we can develop dfferent solutons, knowng the dstrbuton of grd densty (hence stffness) that produces optmal results accordng to the desred crtera. 6 Con c lu son Ths paper presents an automated method of grd shell optmzaton that offers optmal structural solutons over some gven free-form surface. The focus s on the fact that no approxmaton or pure tral and error method has to be nvolved n the structural desgn process f we use the proposed optmzaton method. The advantage of the Voronax structure s that t can be easly nterpreted most of the tme. For example, n Fgure 8, there are results of the optmzaton done over two flat vertcal surfaces, wth the same load combnaton appled as n the examples above (self-weght of the str-uctural members + horzontal load). In the example on the left, the jonts are restraned on four corners of the structure, and n the mddle of the surface edges on the structure depcted on the rght (restraned areas are marked red). For each opton the best soluton obtaned n an optmzaton process can be seen, and next to t a look through the last generaton s depcted. Namely, f we take all 50 solutons of one generaton and lne them up one behnd the other, we can get a comprehensve pcture of the ntenton of the optmzaton process. It can be seen how the center part n both cases has larger cells, stablzed wth the O-shaped formaton of denser cells n the case on the left and the X-shape formaton n the case on the rght. These experments are a part of the comprehensve research done wth dfferent shapes, ftness functons, penalty functons, support and load combnatons and dfferent patterns. Optmzatons are done not only as sngle-objectve but also as mult-objectve ones, showng that, dependng on the free-form shape and grd pattern, we can generate grd shells that have up to 6 tmes less Von Mses stress and up to 10 tmes less dsplacement when compared to a regular (unform) structure, generated wth the same number of structural members and over the same gven surface. R e f e re n c e s De Berg, M. et al Computatonal Geometry, Berln: Sprnger Verlag, Fg. 8 Goldberg, D Genetc Algorthms n Search, Optmzaton & Machne Learnng. Readng, Massachusetts: Addson Wesley. Gründg, L. et al A Hstory of the Prncpal Developments and Applcatons of the Force Densty Method n Germany Proceedngs of the IASS. Chana-Crete. Kolarevc, B Archtecture n the Dgtal Age Desgn and Manufacturng. NewYork: Spon Press. Sack J. R., and J. Urruta Handbook of Computatonal Geometry, North Holland. Fgure 7. Interpretaton of the GAs optmzaton Fgure 8. Dfferent support combnatons 77 form, geometry and complexty
The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationMooring Pattern Optimization using Genetic Algorithms
6th World Congresses of Structural and Multdscplnary Optmzaton Ro de Janero, 30 May - 03 June 005, Brazl Moorng Pattern Optmzaton usng Genetc Algorthms Alonso J. Juvnao Carbono, Ivan F. M. Menezes Luz
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationForm-finding of grid shells with continuous elastic rods
Page of 0 Form-fndng of grd shells wth contnuous elastc rods Jan-Mn L PhD student Insttute of Buldng Structures and Structural Desgn (tke), Unversty Stuttgart Stuttgar, Germany quantumamn@gmal.com Jan
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationAn Analysis of Dynamic Severity and Population Size
An Analyss of Dynamc Severty and Populaton Sze Karsten Wecker Unversty of Stuttgart, Insttute of Computer Scence, Bretwesenstr. 2 22, 7565 Stuttgart, Germany, emal: Karsten.Wecker@nformatk.un-stuttgart.de
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationImplementation of Deutsch's Algorithm Using Mathcad
Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"
More information21 Vectors: The Cross Product & Torque
21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationAn interactive system for structure-based ASCII art creation
An nteractve system for structure-based ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract Non-Photorealstc Renderng (NPR), whose am
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationRotation Kinematics, Moment of Inertia, and Torque
Rotaton Knematcs, Moment of Inerta, and Torque Mathematcally, rotaton of a rgd body about a fxed axs s analogous to a lnear moton n one dmenson. Although the physcal quanttes nvolved n rotaton are qute
More informationTesting and Debugging Resource Allocation for Fault Detection and Removal Process
Internatonal Journal of New Computer Archtectures and ther Applcatons (IJNCAA) 4(4): 93-00 The Socety of Dgtal Informaton and Wreless Communcatons, 04 (ISSN: 0-9085) Testng and Debuggng Resource Allocaton
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationGENETIC ALGORITHM FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY
Int. J. Mech. Eng. & Rob. Res. 03 Fady Safwat et al., 03 Research Paper ISS 78 049 www.jmerr.com Vol., o. 3, July 03 03 IJMERR. All Rghts Reserved GEETIC ALGORITHM FOR PROJECT SCHEDULIG AD RESOURCE ALLOCATIO
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationMining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System
Mnng Feature Importance: Applyng Evolutonary Algorthms wthn a Web-based Educatonal System Behrouz MINAEI-BIDGOLI 1, and Gerd KORTEMEYER 2, and Wllam F. PUNCH 1 1 Genetc Algorthms Research and Applcatons
More informationDamage detection in composite laminates using coin-tap method
Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The con-tap test has the
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationSolving Factored MDPs with Continuous and Discrete Variables
Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent
More informationLecture 2: Single Layer Perceptrons Kevin Swingler
Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationAn efficient constraint handling methodology for multi-objective evolutionary algorithms
Rev. Fac. Ing. Unv. Antoqua N. 49. pp. 141-150. Septembre, 009 An effcent constrant handlng methodology for mult-objectve evolutonary algorthms Una metodología efcente para manejo de restrccones en algortmos
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationAn Integrated Semantically Correct 2.5D Object Oriented TIN. Andreas Koch
An Integrated Semantcally Correct 2.5D Object Orented TIN Andreas Koch Unverstät Hannover Insttut für Photogrammetre und GeoInformaton Contents Introducton Integraton of a DTM and 2D GIS data Semantcs
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationSciences Shenyang, Shenyang, China.
Advanced Materals Research Vols. 314-316 (2011) pp 1315-1320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314-316.1315 Solvng the Two-Obectve Shop Schedulng Problem n MTO Manufacturng
More informationActivity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationA heuristic task deployment approach for load balancing
Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of
More informationCharacterization of Assembly. Variation Analysis Methods. A Thesis. Presented to the. Department of Mechanical Engineering. Brigham Young University
Characterzaton of Assembly Varaton Analyss Methods A Thess Presented to the Department of Mechancal Engneerng Brgham Young Unversty In Partal Fulfllment of the Requrements for the Degree Master of Scence
More informationBlending Roulette Wheel Selection & Rank Selection in Genetic Algorithms
Internatonal Journal of Machne Learnng and Computng, Vol. 2, o. 4, August 2012 Blendng Roulette Wheel Selecton & Rank Selecton n Genetc Algorthms Rakesh Kumar, Senor Member, IACSIT and Jyotshree, Member,
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationA Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
More informationwhere the coordinates are related to those in the old frame as follows.
Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product
More informationOptimal Choice of Random Variables in D-ITG Traffic Generating Tool using Evolutionary Algorithms
Optmal Choce of Random Varables n D-ITG Traffc Generatng Tool usng Evolutonary Algorthms M. R. Mosav* (C.A.), F. Farab* and S. Karam* Abstract: Impressve development of computer networks has been requred
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationECE544NA Final Project: Robust Machine Learning Hardware via Classifier Ensemble
1 ECE544NA Fnal Project: Robust Machne Learnng Hardware va Classfer Ensemble Sa Zhang, szhang12@llnos.edu Dept. of Electr. & Comput. Eng., Unv. of Illnos at Urbana-Champagn, Urbana, IL, USA Abstract In
More informationPatterns Antennas Arrays Synthesis Based on Adaptive Particle Swarm Optimization and Genetic Algorithms
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 1, Issue 1, No 2, January 213 ISSN (Prnt): 1694-784 ISSN (Onlne): 1694-814 www.ijcsi.org 21 Patterns Antennas Arrays Synthess Based on Adaptve
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationA Genetic Programming Based Stock Price Predictor together with Mean-Variance Based Sell/Buy Actions
Proceedngs of the World Congress on Engneerng 28 Vol II WCE 28, July 2-4, 28, London, U.K. A Genetc Programmng Based Stock Prce Predctor together wth Mean-Varance Based Sell/Buy Actons Ramn Rajaboun and
More informationImproved Mining of Software Complexity Data on Evolutionary Filtered Training Sets
Improved Mnng of Software Complexty Data on Evolutonary Fltered Tranng Sets VILI PODGORELEC Insttute of Informatcs, FERI Unversty of Marbor Smetanova ulca 17, SI-2000 Marbor SLOVENIA vl.podgorelec@un-mb.s
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationA COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM
A COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM Rana Hassan * Babak Cohanm Olver de Weck Massachusetts Insttute of Technology, Cambrdge, MA, 39 Gerhard Venter Vanderplaats Research
More informationA method for a robust optimization of joint product and supply chain design
DOI 10.1007/s10845-014-0908-5 A method for a robust optmzaton of jont product and supply chan desgn Bertrand Baud-Lavgne Samuel Bassetto Bruno Agard Receved: 10 September 2013 / Accepted: 21 March 2014
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 96-2628-E-009-026-MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationRealistic Image Synthesis
Realstc Image Synthess - Combned Samplng and Path Tracng - Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationInter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007.
Inter-Ing 2007 INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. UNCERTAINTY REGION SIMULATION FOR A SERIAL ROBOT STRUCTURE MARIUS SEBASTIAN
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationLearning with Imperfections A Multi-Agent Neural-Genetic Trading System. with Differing Levels of Social Learning
Proceedngs of the 4 IEEE Conference on Cybernetcs and Intellgent Systems Sngapore, 1-3 December, 4 Learnng wth Imperfectons A Mult-Agent Neural-Genetc Tradng System wth Dfferng Levels of Socal Learnng
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationSection 5.3 Annuities, Future Value, and Sinking Funds
Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationA machine vision approach for detecting and inspecting circular parts
A machne vson approach for detectng and nspectng crcular parts Du-Mng Tsa Machne Vson Lab. Department of Industral Engneerng and Management Yuan-Ze Unversty, Chung-L, Tawan, R.O.C. E-mal: edmtsa@saturn.yzu.edu.tw
More informationFuzzy Control of HVAC Systems Optimized by Genetic Algorithms
Appled Intellgence 18, 155 177, 2003 c 2003 Kluwer Academc Publshers. Manufactured n The Netherlands. Fuzzy Control of HVAC Systems Optmzed by Genetc Algorthms RAFAEL ALCALÁ Department of Computer Scence,
More informationSOLVING CARDINALITY CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM BY BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM
SOLVIG CARDIALITY COSTRAIED PORTFOLIO OPTIMIZATIO PROBLEM BY BIARY PARTICLE SWARM OPTIMIZATIO ALGORITHM Aleš Kresta Klíčová slova: optmalzace portfola, bnární algortmus rojení částc Key words: portfolo
More informationExamensarbete. Rotating Workforce Scheduling. Caroline Granfeldt
Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/
More informationSCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS
SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS Magdalena Rogalska 1, Wocech Bożeko 2,Zdzsław Heduck 3, 1 Lubln Unversty of Technology, 2- Lubln, Nadbystrzycka 4., Poland. E-mal:rogalska@akropols.pol.lubln.pl
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationAnt Colony Optimization for Economic Generator Scheduling and Load Dispatch
Proceedngs of the th WSEAS Int. Conf. on EVOLUTIONARY COMPUTING, Lsbon, Portugal, June 1-18, 5 (pp17-175) Ant Colony Optmzaton for Economc Generator Schedulng and Load Dspatch K. S. Swarup Abstract Feasblty
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationDescriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications
CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationDistributed Multi-Target Tracking In A Self-Configuring Camera Network
Dstrbuted Mult-Target Trackng In A Self-Confgurng Camera Network Crstan Soto, B Song, Amt K. Roy-Chowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationTowards a Formal Framework for Multi-Objective Multi-Agent Planning
Towards a Formal Framework for Mult-Objectve Mult-Agent Plannng Abdel-Illah Mouaddb, Matheu Boussard, Maroua Bouzd Maréchal Jun, Campus II BP 5186 Computer Scence Department 14032 Caen Cedex, France (mouaddb,mboussar,bouzd@nfo.uncaen.fr
More informationNumber of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000
Problem Set 5 Solutons 1 MIT s consderng buldng a new car park near Kendall Square. o unversty funds are avalable (overhead rates are under pressure and the new faclty would have to pay for tself from
More informationComplex Service Provisioning in Collaborative Cloud Markets
Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zöller, Stefan Schulte, Ralf Stenmetz: Complex Servce Provsonng n Collaboratve Cloud Markets. In: W. Abramowcz et al. (Eds.): Proceedngs of the 4th European
More informationHowHow to Find the Best Online Stock Broker
A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION Helena Vasconcelos INESC Porto hvasconcelos@nescportopt J N Fdalgo INESC Porto and FEUP jfdalgo@nescportopt
More information