Planar truss bridge optimization by dynamic programming and linear programming
|
|
- James Hugo Bradford
- 5 years ago
- Views:
Transcription
1 IABSE-JSCE Jon Conference on Advances n Brdge Engneerng-III, Augus 1-, 015, Dhaka, Bangladesh. ISBN: Amn, Oku, Bhuyan, Ueda (eds.) Planar russ brdge opmzaon by dynamc programmng and lnear programmng P.K.M. Monruzzaman Unversy of Brsh Columba, Vancouver, V6T 1Z4, Canada Tanmoy Bswas Bangladesh Unversy of Engneerng and Technology, Dhaka 1000, Bangladesh Ahmed Shrwa Suleyman Demrel Unversy, Ispara, Turkey Tamanna Tabassum Bangladesh Unversy, Dhaka 107, Bangladesh ABSTRACT: The obecve of he curren sudy s wo-fold. Frs, mnmze he cos of a brdge by deermnng he opmal number and locaon of he pers. Second, mnmze he wegh, sze and cos of he russ for he ndvdual spans deermned n he pror sep. There are hree man caegores nvoke o opmze a russ srucure, namely, szng, shape and opology opmzaon. The am of he curren sudy s o opmze he opology of a planar russ whle mananng he exernal force s balanced n all consdered degree of freedoms and meeng up he Euler bucklng and maeral srengh sasfacory. Two cung-edge opmzaon echnques, namely, dynamc programmng and lnear programmng were employed n hs sudy. In one hand, dynamc programmng s an approach for makng a sequence of decsons n an opmal way for a gven recursve problem. In dynamc programmng, a problem s generally dvded no sages ha gve he bes oucome based on he prevous decson. On he oher hand, lnear programmng s a mehod for opmzng a scenaro ha can be descrbed mahemacally by lnear relaonshps. Resuls showed ha he adoped sraegy can deermne he opmal brdge confguraon boh n small and large scale very well. 1 INTRODUCTION Opmzaon s a echnque used o selec he bes opon from avalable alernaves, subec o ceran condons. There are many dfferen programmng mehods used o opmze a varey of problems. Two ha were used n hs sudy are dynamc programmng (DP) and lnear programmng (LP). DP s an approach for makng a sequence of decsons n an opmal way. A a basc level s akng a small par of a problem, fndng an opmal oucome for ha small par, expandng he problem by a small amoun, and solvng agan, unl he expanded problem encompasses he orgnal problem (Snedovch 010). By hen racng back he opmal decson aken a each sep, he opmal decson for he whole can be found. In dynamc programmng, a problem s generally dvded no sages. Sages can be hough of as a new small problem o be solved ha bulds on he prevous soluon. Each sage hen has a number of saes, decsons and decson updaes. On he oher hand, LP s a mehod for opmzng a scenaro ha can be descrbed mahemacally by lnear relaonshps. Many problems can be formulaed and solved n hs syle of programmng. One example s russ opmzaon, whch ulzes LP, or n some cases nework flow programmng, o opmze wegh or sze or cos of he russ srucure. LP s he mos successful and mos ofen used echnque for solvng russ problem because of s sysem of equaons deal wh member dmensons ha bounds o lnear doman (L e al. 009; Raeev & Krshnamoorhy 199; & Raham e al. 008). The obecve of hs sudy s wo-fold. One s o mnmze he cos of a brdge by deermnng he opmal locaon of he pers. Second s o mnmze he wegh of he russ for ndvdual spans deermned n he prevous sep. 31
2 313 BRIDGE SPAN OPTIMIZATION.1 Dynamc Programmng- Overvew Dynamc Programmng s an approach for opmzng mulsage decson processes. I s based on Bellman s Prncple of Opmaly: an opmal polcy has he propery ha, regardless of he decsons aken o ener a parcular sae n a parcular sage, he remanng decsons mus consue an opmal polcy for leavng ha sae (Snedovch 010). A mulsage decson process s a process ha can be separaed no a number of sequenal seps, or sages, whch may be compleed n one or more ways. The opons for compleng he sages are called decsons. A polcy s a sequence of decsons, one for each sage of he process. The condon of he process a a gven sage s called he sae a ha sage; each decson effecs a ranson from he curren sae o a sae assocaed wh he nex sage. I s o be noed ha a mulsage decson process s fne f here are only a fne number of sages n he process and a fne number of saes assocaed wh each sage (Snedovch 010). Mulsage decson processes have reurns assocaed wh each decson whch vary wh sages and saes. The obecve n analyzng such decson processes s o deermne an opmal polcy, one ha resuls n he bes oal reurn. Thus, DP s a mehod o solve opmzaon problem conanng a specfc obecve.. Conex of he Presen Sudy The conex of he DP par for hs sudy s o desgn a brdge n erms of number of pers and per spacng whch mnmzes he oal cos. The brdge span was consdered as a 150 m lengh and he bedrock profle across he ravne a he brdge se s assumed from a rver bed profle found n GoogleEarh ha was locaed over Narayangan, Bangladesh. The model ncludes boh cos consrans and spaal consrans. The spaal consrans are: he brdge may have no more han 5 pers and no ndvdual span may exceed 500 m. The cos consrans ensure ha a mnmum cos confguraon would be chosen. Smplfed cos esmang formulae are avalable for ndvdual spans of decks and for pers. The cos of a sngle span s assumed proporonal o he square of he span and s gven by: Cos of deck span= DCons 1 + DCons *(span lengh) (1) where DCons 1 and DCons are gven consans as assumed a value of 0000 and, respecvely. The cos of a sngle per s assumed proporonal o s hegh and s gven by: Cos of per= PCons 1 + PCons *(per hegh) () where PCons 1 and PCons are gven consans as assumed a value of and 11000, respecvely..3 Model Assumpons The assumpons made durng he problem formulaon are largely presen n he cos funcons. The cos coeffcens deermne how he model chooses he mos economcal per locaons because of he weghs assgned o per deph and span lengh. Changng hese would have been a sgnfcan mpac on he resul obaned. The choce of lm for he span lengh o 500 m s anoher scope of he sudy, ergo a shorer maxmum lengh would end up wh a dfferen per confguraon resul..4 Defne sages and Sage Numberng A sage was conssed of one deck span and he supporng per a he lef hand (LH) end of hs span. Sage numberng was consdered from lef o rgh wh he lef hand abumen ncluded n sage 1 and he rgh hand (RH) abumen ncluded n sage 7 (Fg. 1a)..5 Defne Saes Sae for a sage was consdered a posve cener lne locaon for a per and was noed from RH abumen. In hs way, an nerval of 50 m was assumed beween dscree sae values. For example, Sae 1 would correspond o he locaon of he RH abumen. Sae 1 (a 1000 m from RH) wll correspond o he locaon of he LH abumen (Fg. 1a)..6 Defne Decson Varable A a parcular sage and sae,.e. for a gven per and cener lne locaon, he decson choce would be he lengh of span o he nex per o he rgh (Fg. 1a).
3 .7 Sae Transformaon Equaon Gven a sae and a decson (.e. span o he nex per o he rgh), sae ransformaon equaon would be he span lengh resulng from he dfference beween sae (secon.5) and decson varable (secon.6)..8 Sage Reurn Funcon One sage cos wll be he sum of he per cos and deck cos. The mnmum cos n a sae would be he decson of ha parcular sage..9 Recurson Equaon The same formulaon s adoped for all of he sages sared from Sage 7 o Sage 1. Per a) (b) Fgure 1. a) Problem defnon and opmal locaons for pers accordng o he DP model, b) DP opmzed per locaon.10 DP Resul The dynamc programmng model yelded a wo-per brdge as he opmal resul, wh he pers locaed a x = 50 m and x = 750 m (Fgure 1b). Gven he profle of he rver bed, here are no obvously shallow locaons o place pers ha mnmze per hegh, so he resul has been domnaed by span lengh and an aemp o have as few pers as possble. Ths mean he opmal spans measured 300 m, 00 m and 500 m, agan from rgh o lef. The decson makes sense, because he deeper secons of he rver are assocaed wh hgher coss because of per hegh. The model has herefore chosen o place one per a he maxmum possble span lengh o avod havng pers n he deepes par of he rver and hen has chosen a balance beween span cos and per cos o place he second per. 3 PLANAR TRUSS OPTIMIZATION There are hree man caegores nvoke o opmze a russ srucure:. Shape opmzaon (varables are nodal coordnaes). Szng opmzaon (varables are cross-seconal areas of he members) and. Topology opmzaon (varables are he locaon of lnks n whch connec nodes). The am of hs sudy s o do opology opmzaon. In hs secon he applcaon of LP for opmzaon of planar russ has been dscussed. A generalzed model whch could be exended o any confguraon has been modelled n a programmng language, namely, AMPL (Appled Mahemacal Programmng Language). The model se up was frs valdaed for a smple russ confguraon. Ths was laer exended o opmze a large scale russ problem. A srucure s called o be a planar russ f s (Hbbeler 1998& Popov1998): exernally (geomerc) sable, and has rmembers [ and r are number of ons and suppor reacons, respecvely]. 314
4 LP Problem Formulaon Then defnon of he srucural analyss problem o solve he russ srucure by LP s descrbed as follows (Ghasem e al. 1997; L e al. 009; Raeev & Krshnamoorhy 199; Raham e al. 008; & Rasmussen & Solpe 008). enson n member {, n doman se A lengh vecor for member {, un vecor for member {, u mnmze subeced o Reformulaed LP formulaon : mnmze ; Compreson - Tenson p poson vecor for on f exernal force vecor for on l u u ; subeced o l, A { l {, A : {, A, : {, A u 0 f l u Bucklng load for member {,, P u ; 1,,..., n f ; crcal, x x y y p p p p 1,,..., n EI K l e ; I Momen of nera and K 1 e (3) (4) (5) (6) (7) (8) (9) (10) (11) (1) 3. Example Problem Workng of he model has been dscussed n hs secon wh he help of a smple confguraon.. A grd sysem was consdered as llusraed n Fgure a. There are 7 nodes sarng from 0 o 6 along x drecon and 5 nodes sarng from 0 o 4 along y drecon. Each node s equally spaced a a dsance of 1m apar.. A load of 5 kn s appled a Pon P (3, 0). The confguraon s arrved on such ha he russ s smple suppored a nodes of (0, 0) and (6, 0).. The maeral properes of he members are consdered as follows: modulus of elascy, E=x10 5 N/mm, densy = kg/m 3 and maxmum allowable sress =50 N/mm. v. Arcs are defned such ha he nodes are conneced n all possble ways (Fg. b). v. No force balance equaon was appled a anchored ons. 3.3 Obecve Funcon The obecve of hs LP formulaon s o mnmze he wegh of he srucure and arrve on an opmal confguraon wh he area of cross-secon for he members beng used (Equaon 10). Snce he force depends on he area of cross-secon, he obecve funcon s defned as mnmzng he oal absolue force.
5 3.4 Consrans The consrans for he opmzaon are. Sasfy he equlbrum equaon ha s sum of forces along x drecon a every node should be zero (Equaon 11). Smlarly he sum of he forces along y drecon should be zero.. An addonal consran s added such ha he crcal member sze does no go beyond 1000 mm due o have maeral s physcal lm.. Forces of he members would be governed by he sably of member relang o Euler bucklng (Equaon 1) and srengh of he maeral up o elasc sage. a) Fgure. a) Node defnon and b) search doman (b) 3.5 LP Resul Fgure 3 shows he srucure ha s obaned afer opmzaon algorhm runs. The resuls obaned are abulaed n Table 1. The frs wo columns shows he sarng node of each member and he hrd and fourh column shows he end node of each member. The ffh column gves he force n each member connecng he wo nodes. Fgure 3. Opmal russ confguraon whn nodes boundary (6 x 4) 3.6 Model Assumpons. Decson varables ha s he cross secon are of he russ members are connuous.. The russ was consdered havng smply suppored boundary condons. 316
6 Pros of he Model. The model s smple and easy o use. The user s requred o specfy he coordnaes for load and suppor condons.. The model s capable o handle complex and large srucural problems whou losng accuracy and/or demandng more compuaonal power. 3.8 Cons of he Model. Snce he cross-secons are consdered as connuous, he model mgh no he precse represenaon for a real case scenaro.. The LP problem solved based on smple suppored russ confguraon. Ths canno be used for srucures ha are no smply suppored.. The russ desgn problem ha we have formulaed presumes ha he russ srucure self s no affeced by s own wegh. Table 1. Bar forces n he opmzed russ srucure. Node1 Node Force n Members x y x y (kn) CONCLUSIONS The sudy was nvesgaed he opmum number of pers and per spacng whch mnmzes he oal cos of a brdge consrucon. The dynamc programmng model was yelded a wo-per brdge as he opmal resul. In DP formulaon he cos funcon for pers consders only he hegh. A more realsc cos funcon would have a erm relang span lengh o per dameer and consequenly would effec on cos behavor. As a follow-up sep, he applcaon of lnear programmng for opmzaon of planar russ sued for he span lengh deermned by DP has been dscussed n hs sudy. A generalzed LP model whch could be exended o any confguraon has been modelled n a programmng language, namely, AMPL. Resuls showed ha he adoped sraegy can deermne he opmal brdge confguraon boh n small and large scale very effcenly n erms of compuaonal cos and accuracy. REFERENCES Ghasem, M; Hnon, E &Wood, R Opmzaon of russes usng genec algorhms for dscree and connuous varables, Journal of Engneerng Compuaons, 1997; 16: Hbbeler, R Srucural Analyss, Fourh edon. Prence Hall publcaon. L, LJ; Huang, ZB & Lu, F A heursc parcle swarm opmzaon mehod for russ srucures wh dscree varables, Journal of Compuers and Srucures, 009;87: Popov, E Engneerng Mechancs of Solds. Prence Hall publcaon. Raham, H; Kaveh, A & Gholpour, Y Szng, geomery and opology opmzaon of russes va force mehod and genec algorhm, Journal of Engneerng Srucures, 008; 30: Raeev, S & Krshnamoorhy, CS Dscree opmzaon of srucures usng genec algorhms, Journal of Srucural Engneerng, 199; 118(5):
7 Rasmussen, MH & Solpe, M Global opmzaon of dscree russ opology desgn problems usng a parallel cu-and-branch mehod, Journal of Compuers and Srucures, 008; 86: Toppng, B Shape opmzaon of skeleal srucures: A revew. Journal of Srucural Engneerng, 109, Snedovch, M Dynamc Programmng: Foundaons and Prncples, Taylor & Francs publcaon. 318
Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationV.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationNotes on the stability of dynamic systems and the use of Eigen Values.
Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon
More information2.1 Constitutive Theory
Secon.. Consuve Theory.. Consuve Equaons Governng Equaons The equaons governng he behavour of maerals are (n he spaal form) dρ v & ρ + ρdv v = + ρ = Conservaon of Mass (..a) d x σ j dv dvσ + b = ρ v& +
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationAnisotropic Behaviors and Its Application on Sheet Metal Stamping Processes
Ansoropc Behavors and Is Applcaon on Shee Meal Sampng Processes Welong Hu ETA-Engneerng Technology Assocaes, Inc. 33 E. Maple oad, Sue 00 Troy, MI 48083 USA 48-79-300 whu@ea.com Jeanne He ETA-Engneerng
More informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationVolatility Interpolation
Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local
More informationJ i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.
umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationOrdinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s
Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class
More informationThe Dynamic Programming Models for Inventory Control System with Time-varying Demand
The Dynamc Programmng Models for Invenory Conrol Sysem wh Tme-varyng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 84-236-352-5459 E-mal: rnh.h@due.edu.vn
More informationM. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria
IOSR Journal of Mahemacs (IOSR-JM e-issn: 78-578, p-issn: 9-765X. Volume 0, Issue 4 Ver. IV (Jul-Aug. 04, PP 40-44 Mulple SolonSoluons for a (+-dmensonalhroa-sasuma shallow waer wave equaon UsngPanlevé-Bӓclund
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationCubic Bezier Homotopy Function for Solving Exponential Equations
Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.
More informationReactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times
Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationExistence and Uniqueness Results for Random Impulsive Integro-Differential Equation
Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationA Tour of Modeling Techniques
A Tour of Modelng Technques John Hooker Carnege Mellon Unversy EWO Semnar February 8 Slde Oulne Med neger lnear (MILP) modelng Dsuncve modelng Knapsack modelng Consran programmng models Inegraed Models
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationDual Approximate Dynamic Programming for Large Scale Hydro Valleys
Dual Approxmae Dynamc Programmng for Large Scale Hydro Valleys Perre Carpener and Jean-Phlppe Chanceler 1 ENSTA ParsTech and ENPC ParsTech CMM Workshop, January 2016 1 Jon work wh J.-C. Alas, suppored
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as
More informationModeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts
nernaonal ournal of Appled Engneerng Research SSN 0973-4562 Volume 13, Number 10 (2018) pp. 8708-8713 Modelng and Solvng of Mul-Produc nvenory Lo-Szng wh Suppler Selecon under Quany Dscouns Naapa anchanaruangrong
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationChapter 2 Linear dynamic analysis of a structural system
Chaper Lnear dynamc analyss of a srucural sysem. Dynamc equlbrum he dynamc equlbrum analyss of a srucure s he mos general case ha can be suded as akes no accoun all he forces acng on. When he exernal loads
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationDEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL
DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationIncluding the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.
Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample
More informationLet s treat the problem of the response of a system to an applied external force. Again,
Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem
More informationIntroduction to. Computer Animation
Inroducon o 1 Movaon Anmaon from anma (la.) = soul, spr, breah of lfe Brng mages o lfe! Examples Characer anmaon (humans, anmals) Secondary moon (har, cloh) Physcal world (rgd bodes, waer, fre) 2 2 Anmaon
More information. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.
Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons
More informationScattering at an Interface: Oblique Incidence
Course Insrucor Dr. Raymond C. Rumpf Offce: A 337 Phone: (915) 747 6958 E Mal: rcrumpf@uep.edu EE 4347 Appled Elecromagnecs Topc 3g Scaerng a an Inerface: Oblque Incdence Scaerng These Oblque noes may
More informationPerformance Analysis for a Network having Standby Redundant Unit with Waiting in Repair
TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen
More informationPart II CONTINUOUS TIME STOCHASTIC PROCESSES
Par II CONTINUOUS TIME STOCHASTIC PROCESSES 4 Chaper 4 For an advanced analyss of he properes of he Wener process, see: Revus D and Yor M: Connuous marngales and Brownan Moon Karazas I and Shreve S E:
More informationISSN MIT Publications
MIT Inernaonal Journal of Elecrcal and Insrumenaon Engneerng Vol. 1, No. 2, Aug 2011, pp 93-98 93 ISSN 2230-7656 MIT Publcaons A New Approach for Solvng Economc Load Dspach Problem Ansh Ahmad Dep. of Elecrcal
More informationPHYS 705: Classical Mechanics. Canonical Transformation
PHYS 705: Classcal Mechancs Canoncal Transformaon Canoncal Varables and Hamlonan Formalsm As we have seen, n he Hamlonan Formulaon of Mechancs,, are ndeenden varables n hase sace on eual foong The Hamlon
More informationSolving the multi-period fixed cost transportation problem using LINGO solver
Inernaonal Journal of Pure and Appled Mahemacs Volume 119 No. 12 2018, 2151-2157 ISSN: 1314-3395 (on-lne verson) url: hp://www.pam.eu Specal Issue pam.eu Solvng he mul-perod fxed cos ransporaon problem
More informationAPOC #232 Capacity Planning for Fault-Tolerant All-Optical Network
APOC #232 Capacy Plannng for Faul-Toleran All-Opcal Nework Mchael Kwok-Shng Ho and Kwok-wa Cheung Deparmen of Informaon ngneerng The Chnese Unversy of Hong Kong Shan, N.T., Hong Kong SAR, Chna -mal: kwcheung@e.cuhk.edu.hk
More informationLecture 2 M/G/1 queues. M/G/1-queue
Lecure M/G/ queues M/G/-queue Posson arrval process Arbrary servce me dsrbuon Sngle server To deermne he sae of he sysem a me, we mus now The number of cusomers n he sysems N() Tme ha he cusomer currenly
More informationChapter Lagrangian Interpolation
Chaper 5.4 agrangan Inerpolaon Afer readng hs chaper you should be able o:. dere agrangan mehod of nerpolaon. sole problems usng agrangan mehod of nerpolaon and. use agrangan nerpolans o fnd deraes and
More informationNew M-Estimator Objective Function. in Simultaneous Equations Model. (A Comparative Study)
Inernaonal Mahemacal Forum, Vol. 8, 3, no., 7 - HIKARI Ld, www.m-hkar.com hp://dx.do.org/.988/mf.3.3488 New M-Esmaor Objecve Funcon n Smulaneous Equaons Model (A Comparave Sudy) Ahmed H. Youssef Professor
More informationCH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC
CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal
More informationComparison of Differences between Power Means 1
In. Journal of Mah. Analyss, Vol. 7, 203, no., 5-55 Comparson of Dfferences beween Power Means Chang-An Tan, Guanghua Sh and Fe Zuo College of Mahemacs and Informaon Scence Henan Normal Unversy, 453007,
More information. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.
Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are
More informationPolitical Economy of Institutions and Development: Problem Set 2 Due Date: Thursday, March 15, 2019.
Polcal Economy of Insuons and Developmen: 14.773 Problem Se 2 Due Dae: Thursday, March 15, 2019. Please answer Quesons 1, 2 and 3. Queson 1 Consder an nfne-horzon dynamc game beween wo groups, an ele and
More informationHandout # 6 (MEEN 617) Numerical Integration to Find Time Response of SDOF mechanical system Y X (2) and write EOM (1) as two first-order Eqs.
Handou # 6 (MEEN 67) Numercal Inegraon o Fnd Tme Response of SDOF mechancal sysem Sae Space Mehod The EOM for a lnear sysem s M X DX K X F() () X X X X V wh nal condons, a 0 0 ; 0 Defne he followng varables,
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and
More informationNational Exams December 2015 NOTES: 04-BS-13, Biology. 3 hours duration
Naonal Exams December 205 04-BS-3 Bology 3 hours duraon NOTES: f doub exss as o he nerpreaon of any queson he canddae s urged o subm wh he answer paper a clear saemen of any assumpons made 2 Ths s a CLOSED
More informationMath 128b Project. Jude Yuen
Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally
More informationMEEN Handout 4a ELEMENTS OF ANALYTICAL MECHANICS
MEEN 67 - Handou 4a ELEMENTS OF ANALYTICAL MECHANICS Newon's laws (Euler's fundamenal prncples of moon) are formulaed for a sngle parcle and easly exended o sysems of parcles and rgd bodes. In descrbng
More informationNATIONAL UNIVERSITY OF SINGAPORE PC5202 ADVANCED STATISTICAL MECHANICS. (Semester II: AY ) Time Allowed: 2 Hours
NATONAL UNVERSTY OF SNGAPORE PC5 ADVANCED STATSTCAL MECHANCS (Semeser : AY 1-13) Tme Allowed: Hours NSTRUCTONS TO CANDDATES 1. Ths examnaon paper conans 5 quesons and comprses 4 prned pages.. Answer all
More informationGenetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems
Genec Algorhm n Parameer Esmaon of Nonlnear Dynamc Sysems E. Paeraks manos@egnaa.ee.auh.gr V. Perds perds@vergna.eng.auh.gr Ah. ehagas kehagas@egnaa.ee.auh.gr hp://skron.conrol.ee.auh.gr/kehagas/ndex.hm
More informationFI 3103 Quantum Physics
/9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon
More informationALLOCATING TOLERANCES FOR VEE-GROOVE FIBER ALIGNMENT
ALLOCATING TOLERANCES FOR VEE-GROOVE FIBER ALIGNMENT Maheu Barraa and R. Ryan Vallance Precson Sysems Laboraory Unversy of Kenucky Lengon KY * S. Kan J. Lehman and Burke Hunsaker Teradyne Connecon Sysems
More informationApproximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy
Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae
More informationII. Light is a Ray (Geometrical Optics)
II Lgh s a Ray (Geomercal Opcs) IIB Reflecon and Refracon Hero s Prncple of Leas Dsance Law of Reflecon Hero of Aleandra, who lved n he 2 nd cenury BC, posulaed he followng prncple: Prncple of Leas Dsance:
More informationLearning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015
/4/ Learnng Objecves Self Organzaon Map Learnng whou Exaples. Inroducon. MAXNET 3. Cluserng 4. Feaure Map. Self-organzng Feaure Map 6. Concluson 38 Inroducon. Learnng whou exaples. Daa are npu o he syse
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More informationDynamic Team Decision Theory
Dynamc Team Decson Theory EECS 558 Proec Repor Shruvandana Sharma and Davd Shuman December, 005 I. Inroducon Whle he sochasc conrol problem feaures one decson maker acng over me, many complex conrolled
More informationFirst-order piecewise-linear dynamic circuits
Frs-order pecewse-lnear dynamc crcus. Fndng he soluon We wll sudy rs-order dynamc crcus composed o a nonlnear resse one-por, ermnaed eher by a lnear capacor or a lnear nducor (see Fg.. Nonlnear resse one-por
More informationStructural Optimization Using Metamodels
Srucural Opmzaon Usng Meamodels 30 Mar. 007 Dep. o Mechancal Engneerng Dong-A Unvers Korea Kwon-Hee Lee Conens. Numercal Opmzaon. Opmzaon Usng Meamodels Impac beam desgn WB Door desgn 3. Robus Opmzaon
More informationMANY real-world applications (e.g. production
Barebones Parcle Swarm for Ineger Programmng Problems Mahamed G. H. Omran, Andres Engelbrech and Ayed Salman Absrac The performance of wo recen varans of Parcle Swarm Opmzaon (PSO) when appled o Ineger
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationA NEW METHOD OF FMS SCHEDULING USING OPTIMIZATION AND SIMULATION
A NEW METHD F FMS SCHEDULING USING PTIMIZATIN AND SIMULATIN Ezedeen Kodeekha Deparmen of Producon, Informacs, Managemen and Conrol Faculy of Mechancal Engneerng udapes Unversy of Technology and Econcs
More informationTHE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS
THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationEpistemic Game Theory: Online Appendix
Epsemc Game Theory: Onlne Appendx Edde Dekel Lucano Pomao Marcano Snscalch July 18, 2014 Prelmnares Fx a fne ype srucure T I, S, T, β I and a probably µ S T. Le T µ I, S, T µ, βµ I be a ype srucure ha
More informationAn Optimal Control Approach to the Multi-agent Persistent Monitoring Problem
An Opmal Conrol Approach o he Mul-agen Perssen Monorng Problem Chrsos.G. Cassandras, Xuchao Ln and Xu Chu Dng Dvson of Sysems Engneerng and Cener for Informaon and Sysems Engneerng Boson Unversy, cgc@bu.edu,
More information, t 1. Transitions - this one was easy, but in general the hardest part is choosing the which variables are state and control variables
Opmal Conrol Why Use I - verss calcls of varaons, opmal conrol More generaly More convenen wh consrans (e.g., can p consrans on he dervaves More nsghs no problem (a leas more apparen han hrogh calcls of
More informationThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Journal of Indusral Engneerng 1 (008) 35-39 The preempve resource-consraned projec schedulng problem subjec o due daes and preempon penales An neger programmng approach B. Afshar Nadjaf Deparmen of Indusral
More informationMONTE CARLO ALGORITHM FOR CLASPING SEARCH AND NEUTRON LEAKAGE
Sep. 5. Vol. 7. No. 3 Inernaonal Journal of Engneerng and Appled Scences - 5 EAAS & ARF. All rghs reserved www.eaas-ournal.org MONTE CARLO ALGORITHM FOR CLASPING SEARCH AND NEUTRON LEAKAGE PEYMAN MAJNOUN
More information3. OVERVIEW OF NUMERICAL METHODS
3 OVERVIEW OF NUMERICAL METHODS 3 Inroducory remarks Ths chaper summarzes hose numercal echnques whose knowledge s ndspensable for he undersandng of he dfferen dscree elemen mehods: he Newon-Raphson-mehod,
More informatione-journal Reliability: Theory& Applications No 2 (Vol.2) Vyacheslav Abramov
June 7 e-ournal Relably: Theory& Applcaons No (Vol. CONFIDENCE INTERVALS ASSOCIATED WITH PERFORMANCE ANALYSIS OF SYMMETRIC LARGE CLOSED CLIENT/SERVER COMPUTER NETWORKS Absrac Vyacheslav Abramov School
More informationPhysical Simulation Using FEM, Modal Analysis and the Dynamic Equilibrium Equation
Physcal Smulaon Usng FEM, Modal Analyss and he Dynamc Equlbrum Equaon Paríca C. T. Gonçalves, Raquel R. Pnho, João Manuel R. S. Tavares Opcs and Expermenal Mechancs Laboraory - LOME, Mechancal Engneerng
More information