Failure Analysis of a Composite Laminate in HyperWorks through Ply Elimination Procedure

Size: px
Start display at page:

Download "Failure Analysis of a Composite Laminate in HyperWorks through Ply Elimination Procedure"

Transcription

1 Failure Analysis of a Composite Laminate in HyperWorks through ly Elimination rocedure Ing. Daniele Di anzo Engineering - Rotor ystem Design daniele.disanzo@agustawestland.com

2 Failure Analysis of a Composite Laminate in HyperWorks through ly Elimination rocedure UMMARY Introduction ly Elimination rocedure ubroutine HM_E.tcl resentation of the problem Analysis and Results Future developments and Conclusions 2

3 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure Design assessment of a composite laminate Failure Analysis: a negative M (Margin of afety) does not necessarily imply the failure of the composite laminate. In order to assess the final static ultimate strength, further investigation is needed. ly Elimination is a procedure suitable for this purpose. It allows in-depth investigations into the resistance capabilities of composite laminates. bviously, a real test is needed to have the final validation and approval of the solution. 3

4 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure What is ly Elimination? A negative Margin of afety (M) not always means a catastrophic failure of the laminate. The UD strength is much dominated by the fiber strength. When M negative is caused by transverse stress s 2 overcoming the allowable, the corresponding damage in the matrix can be simulated by degrading the material properties in the transverse and shear directions. Degrading the elastic properties of the areas with M<0, the laminate stiffness changes as well and thus stresses are re-distributed. It is an iterative process, which ends with positive M unless fibers break. In case of fibers break, this actually means the final failure of the laminate 4

5 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure ly Elimination Logical Flow The process can be summarized with the scheme below: Iterative Loop M calculation M < 0 elect elements with M<0 Apply fake material (E 2, G 12 small) M > 0 End of analysis Run analysis End of analysis This is a simplified procedure, which does not consider the type of failure (matrix or fibers failure). Further development will be discussed later. 5

6 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure ly Elimination rocess in HyperWorks HyperView HyperMesh 1. Create/update Actual et (M>0) 2. Create/update Fake et (M<0) M contour et A (Fake) et B (Actual) Assign the proper material Re-run analysis FE oftware: Radioss Linear Iterative Loop 6

7 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure, tartup in HM ly Elimination rocess: tartup in HyperMesh (i.e. tep 0 ) Modify the FE model as follows: reliminary operations 1) create fake material fake_mat 2) create element sets {el_actual_ly# - el_fake_ly#} for each ply 3) create ply sets {actual_ly# - fake_ly#} for each ply 4) define stack sequence (TACK) mat el_actual_ly# el_fake_ly# actual_ly# fake_ly# n plies TACK fake_mat n plies 7

8 tep 0 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure, tartup in HM 1) create degraded material fake_mat E1 nu12 Xt Xc Yt Yc degradation of transverse elastic properties: E2=G12=1 tress allowables 2) create element sets for each ply el_actual_ly# identifies the original ply# at step 0 el_fake_ly# empty set at step 0, gathers the degraded elements 8

9 tep 0 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure, tartup in HM 3) create ply sets - attribute properties and the corresponding element set actual_ly# for each ply (actual) t el_actual_ly# ID fake_ly# for each ply (fake) Empty step 0 t el_fake_ly# 9

10 tep 0 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure, tartup in HM 4) define stack sequence (from HM olver Browser Tree) for the subset of plies, introduce the fake plies in couple with the actual ones and redefine the stack sequence properly, as follows: n plies : : LY_301 LY_302. : LY_313. : n + n plies : : actual_ly_ 301 fake_ly_ 301 actual_ly_302 fake_ly_ 302. : actual_ly_313 fake_ly_ 313. : 10

11 tep 0 Composite Laminate Analysis ( ly Elimination ) in HW Introduction ly Elimination rocedure, tartup in HM Then, ptimization anel is used to define the equation for M, as function of ply stresses (s 1, s 2, s 12 ), for both the actual plies and the fake ones. Failure Criterion: TAI-WU F11 F22 F66 F12 F1 F2 F This allows to have M among the outputs of the analysis in ptitruct. Thus, M pattern is available in HyperView for post-processing. The model is now ready for ply elimination iterative loop, performed by subroutine HM_E.tcl. 11

12 Composite Laminate Analysis ( ly Elimination ) in HW The subroutine HM_E.tcl The subroutine HM_E.tcl, programmed in Tcl-Language, has been developed as an accessory tool to be run in HM (from command window) for an automatic application of the ply elimination loop. ####################################################################### # UBRUTINE HM_E.tcl: MAIN INUT DATA # ####################################################################### set MDEL_ref "MyModel.fem" # original fem model (filename) set actual_matid 20 # ID original material (actual) set fake_matid 21 # ID degraded material (fake) set UBCAE_ID 7 # ID load condition set plyid_list " " # List of plies (ID) for E process set stepid k k = 0:1:K # current step of ply elimination ####################################################################### At each step (k), HM_E.tcl retrieves the analysis results from FE output file MyModel_step(k).out and generates the new FE input file MyModel_step(k+1).fem, with the update of actual plies and fake plies. 12

13 tep 1 tep 0 Composite Laminate Analysis ( ly Elimination ) in HW The subroutine HM_E.tcl The working flow proceeds as following: Warning Message in HM Model_step0.fem Run Analysis Model_step0.out HM_E.tcl Iterate until: o element sets have not been updated anymore o the overall laminate fails Model_step1.fem Run Analysis HM_E.tcl Model_step1.out Model_step2.fem and so on 13

14 Composite Laminate Analysis ( ly Elimination ) in HW roblem Definition roblem: Design optimization of a helicopter MR blade composite tip Composite kin Tip 14

15 Composite Laminate Analysis ( ly Elimination ) in HW roblem Definition Considering a skin tip made up of U/D plies, two different composite materials have been investigated: Glass fibers or Graphite fibers? Which of them is the most reliable solution? The evaluation of M (Tsai-Wu), and the E procedure as well, will help us to find out the best choice. 15

16 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, M Contour The evaluation has been carried out with the most critical load condition. M CNTUR LT Upper skin tip, ly +45 E tep 0 fake_ly306 M < 0 M 0 actual_ly306 Note that, without stress evaluation, you are not able to say if M<0 is due to an overstress in fiber direction or in transverse/shear direction. 16

17 actual_ly303 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, Fiberglass plies LY ELIMINATIN: Upper skin tip, Fiberglass plies (ly 0 ) tep 0 tep 1 tep 2 tep 3 tep 4 tep 5 17

18 actual_ly303 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, Fiberglass plies LY ELIMINATIN: Upper skin tip, Fiberglass plies (ly 0 ) tep 10 tep 15 tep 20 tep 25 tep 30 E convergence has been reached. Updates of the model after step 20 are not significant. 18

19 actual_ly303 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, Graphite plies LY ELIMINATIN: Upper skin tip, Graphite plies (ly 0 ) tep 0 tep 1 tep 2 tep 3 tep 4 tep 5 19

20 actual_ly303 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, Graphite plies LY ELIMINATIN: Upper skin tip, Graphite plies (ly 0 ) tep 8 tep 10 tep 13 E convergence has been reached for both configurations. Faster convergence for Graphite skin tip (reached at step 13) The degraded area is smaller than that for the fiberglass solution. Is graphite really to be preferred to fiberglass? 20

21 Upper kin Tip Graphite Fiberglass Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, results actual_ly303 fake_ly303 M > 0 M < 0 Fiber Failure 21

22 Lower kin Tip Graphite Fiberglass Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, results actual_ly303 fake_ly303 M > 0 M < 0 Fiber Failure 22

23 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, results ly Elimination has shown that graphite skin tip can be subjected to fiber failure. Is it really a local phenomenon or does it propagate? In response to this question, a further degradation of the material can be included in the procedure. A new iterative loop is performed. Actual_mat Actual_LY E2=G12=1 Fake_mat Fake_LY NEW! E1=E2=G12=1 Fail_mat Fail_LY If the new ply set Fail_LY becomes larger and larger as the iteration proceeds, it means that fiber failure propagates: catastrophic failure of the laminate occurs. 23

24 tep 2.2 tep 2.1 tep 2.0 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, results LY ELIMINATIN (extended): Lower skin tip, Graphite plies actual_ly303 fake_ly303 fail_ly303 24

25 tep 2.5 Composite Laminate Analysis ( ly Elimination ) in HW kin Tip ly Elimination, results LY ELIMINATIN (extended): Lower skin tip, Graphite plies actual_ly303 fake_ly303 fail_ly303 The failed area (M<0, due to s 1 overcoming the allowable) is bound to expand. It is confirmed that catastrophic failure occurs. Thus, the graphite skin tip is not acceptable. Note that: actual_ly + fake_ly + fail_ly = LY (the real ply) 25

26 Composite Laminate Analysis ( ly Elimination ) in HW Conclusions: further developments The current procedure, just as discussed, is conservative. The degradation to fail_mat is not direct, but passes through the intermediate fake_mat (i.e. matrix failure), even though s 1 overcoming the allowable has occurred immediately (that is fiber failure). As development, the routine degrades the areas with M<0 depending on the type of failure. Real LY Fake_mat: E2=G12=1 s 1 >X Fiber failure M<0 actual_ly s 2 >Y t 12 > (s 1 <X) Matrix failure Fail_mat: E1=1 + E2=G12=1 s 1 >X Fiber failure M<0 fail_ly fake_ly Iterative loop 26

27 tep k Composite Laminate Analysis ( ly Elimination ) in HW Conclusions: further developments TAI-WU failure criterion is not capable of distinguishing matrix failure from fiber failure. This limitation can be overcome by including the max stress criterion. The procedure shall be modified as follows: evaluation of the stresses (post-processing of file.h3d, in addition to.out) comparison of the stresses with the allowables: s 1 >X: fiber failure s 2 >Y t 12 > (s1<x): matrix failure degradation of the elements with M<0 according to the type of failure. Model_step(k).fem Run Analysis HM_E.tcl Model_step(k+1).fem and so on M s ij Model_step(k).out Model_step(k).h3d 27

28 Composite Laminate Analysis ( ly Elimination ) in HW Conclusions: further developments The subroutine HM_E.tcl has been modified accordingly. The main benefits are: faster convergence/divergence of the loop: fewer steps are needed distinction of fiber failure from matrix failure, from the very beginning of the procedure if fiber failure occurs, it is found out earlier (thanks to the parallel degradation) Remember that: matrix failure is acceptable fiber failure may be catastrophic In conclusion, the implementation of this subroutine has allowed to automatize ly Elimination in HW. Thanks to this tool, a more in-depth investigation of the structure is possible. It is easier to understand where a reinforcement is needed, thus helping to re-design the structure properly. The results with the modified subroutine are not here presented 28

Markov Decision Processes

Markov Decision Processes Markov Decision Processes Robert Platt Northeastern University Some images and slides are used from: 1. CS188 UC Berkeley 2. AIMA 3. Chris Amato Stochastic domains So far, we have studied search Can use

More information

Composites Materials Data, Plies and Laminates for Design and FEA

Composites Materials Data, Plies and Laminates for Design and FEA C o m p o S I D E p re s e n t s Composites Materials Data, Plies and Laminates for Design and FEA Lorenzo Bossi (Sales & Marketing Manager) & Jon Evans (Application Engineer) A g e n d a Introduction

More information

Pertmaster - Risk Register Module

Pertmaster - Risk Register Module Pertmaster - Risk Register Module 1 Pertmaster - Risk Register Module Pertmaster Risk Register Module This document is an extract from the Pertmaster help file version h2.62. Pertmaster - Risk Register

More information

Using Fiber Reinforced Polymer to Restore Deteriorated Structural Members

Using Fiber Reinforced Polymer to Restore Deteriorated Structural Members International Journal of Material and Mechanical Engineering, 01, 1: 1-7 - 1 - Published Online April 01 http://www.ijm-me.org Using Fiber Reinforced Polymer to Restore Deteriorated Structural Members

More information

On the use of time step prediction

On the use of time step prediction On the use of time step prediction CODE_BRIGHT TEAM Sebastià Olivella Contents 1 Introduction... 3 Convergence failure or large variations of unknowns... 3 Other aspects... 3 Model to use as test case...

More information

Sample Size Calculations for Odds Ratio in presence of misclassification (SSCOR Version 1.8, September 2017)

Sample Size Calculations for Odds Ratio in presence of misclassification (SSCOR Version 1.8, September 2017) Sample Size Calculations for Odds Ratio in presence of misclassification (SSCOR Version 1.8, September 2017) 1. Introduction The program SSCOR available for Windows only calculates sample size requirements

More information

Optimal Dam Management

Optimal Dam Management Optimal Dam Management Michel De Lara et Vincent Leclère July 3, 2012 Contents 1 Problem statement 1 1.1 Dam dynamics.................................. 2 1.2 Intertemporal payoff criterion..........................

More information

CS 188: Artificial Intelligence Fall 2011

CS 188: Artificial Intelligence Fall 2011 CS 188: Artificial Intelligence Fall 2011 Lecture 9: MDPs 9/22/2011 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 2 Grid World The agent lives in

More information

91.420/543: Artificial Intelligence UMass Lowell CS Fall 2010

91.420/543: Artificial Intelligence UMass Lowell CS Fall 2010 91.420/543: Artificial Intelligence UMass Lowell CS Fall 2010 Lecture 17 & 18: Markov Decision Processes Oct 12 13, 2010 A subset of Lecture 9 slides from Dan Klein UC Berkeley Many slides over the course

More information

How to prepare an order in Worksheet

How to prepare an order in Worksheet The following pages are a walk through of a basic way to get an order prepared with worksheet for AIS. This is only a guide to help you learn the best way to get an order together, and how to create an

More information

Making Complex Decisions

Making Complex Decisions Ch. 17 p.1/29 Making Complex Decisions Chapter 17 Ch. 17 p.2/29 Outline Sequential decision problems Value iteration algorithm Policy iteration algorithm Ch. 17 p.3/29 A simple environment 3 +1 p=0.8 2

More information

Markov Decision Processes: Making Decision in the Presence of Uncertainty. (some of) R&N R&N

Markov Decision Processes: Making Decision in the Presence of Uncertainty. (some of) R&N R&N Markov Decision Processes: Making Decision in the Presence of Uncertainty (some of) R&N 16.1-16.6 R&N 17.1-17.4 Different Aspects of Machine Learning Supervised learning Classification - concept learning

More information

Recall: Data Flow Analysis. Data Flow Analysis Recall: Data Flow Equations. Forward Data Flow, Again

Recall: Data Flow Analysis. Data Flow Analysis Recall: Data Flow Equations. Forward Data Flow, Again Data Flow Analysis 15-745 3/24/09 Recall: Data Flow Analysis A framework for proving facts about program Reasons about lots of little facts Little or no interaction between facts Works best on properties

More information

Chapter 11: Artificial Intelligence

Chapter 11: Artificial Intelligence Chapter 11: Artificial Intelligence Computer Science: An Overview Tenth Edition by J. Glenn Brookshear Presentation files modified by Farn Wang Copyright 2008 Pearson Education, Inc. Publishing as Pearson

More information

Lecture 9, Part 2. Graphical Patterns Analysis. Continuation Patterns

Lecture 9, Part 2. Graphical Patterns Analysis. Continuation Patterns Lecture 9, Part 2 Graphical Patterns Analysis Continuation Patterns The graphical configurations we would look into are called continuation patterns. Such models usually mean that the period of price stagnation

More information

MDPs: Bellman Equations, Value Iteration

MDPs: Bellman Equations, Value Iteration MDPs: Bellman Equations, Value Iteration Sutton & Barto Ch 4 (Cf. AIMA Ch 17, Section 2-3) Adapted from slides kindly shared by Stuart Russell Sutton & Barto Ch 4 (Cf. AIMA Ch 17, Section 2-3) 1 Appreciations

More information

Non-Deterministic Search

Non-Deterministic Search Non-Deterministic Search MDP s 1 Non-Deterministic Search How do you plan (search) when your actions might fail? In general case, how do you plan, when the actions have multiple possible outcomes? 2 Example:

More information

INDICATORS. The Insync Index

INDICATORS. The Insync Index INDICATORS The Insync Index Here's a method to graphically display the signal status for a group of indicators as well as an algorithm for generating a consensus indicator that shows when these indicators

More information

Formulating Models of Simple Systems using VENSIM PLE

Formulating Models of Simple Systems using VENSIM PLE Formulating Models of Simple Systems using VENSIM PLE Professor Nelson Repenning System Dynamics Group MIT Sloan School of Management Cambridge, MA O2142 Edited by Laura Black, Lucia Breierova, and Leslie

More information

ONERA Fatigue Model. Z-set group. March 14, Mines ParisTech, CNRS UMR 7633 Centre des Matériaux BP 87, Evry cedex, France

ONERA Fatigue Model. Z-set group. March 14, Mines ParisTech, CNRS UMR 7633 Centre des Matériaux BP 87, Evry cedex, France ONERA Fatigue Model Z-set group Mines ParisTech, CNRS UMR 7633 Centre des Matériaux BP 87, 91003 Evry cedex, France March 14, 2013 Plan 1 ONERA Fatigue Model 2 Basic Tools Multiaxial stress amplitude (SEH)

More information

Homework solutions, Chapter 8

Homework solutions, Chapter 8 Homework solutions, Chapter 8 NOTE: We might think of 8.1 as being a section devoted to setting up the networks and 8.2 as solving them, but only 8.2 has a homework section. Section 8.2 2. Use Dijkstra

More information

EE266 Homework 5 Solutions

EE266 Homework 5 Solutions EE, Spring 15-1 Professor S. Lall EE Homework 5 Solutions 1. A refined inventory model. In this problem we consider an inventory model that is more refined than the one you ve seen in the lectures. The

More information

Mutual Fund & Stock Basis Keeper

Mutual Fund & Stock Basis Keeper A Guide To Mutual Fund & Stock Basis Keeper By Denver Tax Software, Inc. Copyright 1995-2006 Denver Tax Software, Inc. Denver Tax Software, Inc. P.O. Box 5308 Denver, CO 80217-5308 Telephone (voice): Toll-Free:

More information

Chapter 15: Dynamic Programming

Chapter 15: Dynamic Programming Chapter 15: Dynamic Programming Dynamic programming is a general approach to making a sequence of interrelated decisions in an optimum way. While we can describe the general characteristics, the details

More information

UEP USER GUIDE. Preface. Contents

UEP USER GUIDE. Preface. Contents UEP_User_Guide_20171203.docx UEP USER GUIDE Preface For questions, problem reporting, and suggestions, please contact: John Schuyler, Decision Precision john@maxvalue.com 001-303-693-0067 www.maxvalue.com

More information

TDT4171 Artificial Intelligence Methods

TDT4171 Artificial Intelligence Methods TDT47 Artificial Intelligence Methods Lecture 7 Making Complex Decisions Norwegian University of Science and Technology Helge Langseth IT-VEST 0 helgel@idi.ntnu.no TDT47 Artificial Intelligence Methods

More information

CSE 473: Artificial Intelligence

CSE 473: Artificial Intelligence CSE 473: Artificial Intelligence Markov Decision Processes (MDPs) Luke Zettlemoyer Many slides over the course adapted from Dan Klein, Stuart Russell or Andrew Moore 1 Announcements PS2 online now Due

More information

ECON 6022B Problem Set 1 Suggested Solutions Fall 2011

ECON 6022B Problem Set 1 Suggested Solutions Fall 2011 ECON 6022B Problem Set Suggested Solutions Fall 20 September 5, 20 Shocking the Solow Model Consider the basic Solow model in Lecture 2. Suppose the economy stays at its steady state in Period 0 and there

More information

Review of whole course

Review of whole course Page 1 Review of whole course A thumbnail outline of major elements Intended as a study guide Emphasis on key points to be mastered Massachusetts Institute of Technology Review for Final Slide 1 of 24

More information

Global Financial Management

Global Financial Management Global Financial Management Valuation of Cash Flows Investment Decisions and Capital Budgeting Copyright 2004. All Worldwide Rights Reserved. See Credits for permissions. Latest Revision: August 23, 2004

More information

Optimization of Base Station Location in 3G Networks using Mads and Fuzzy C-means

Optimization of Base Station Location in 3G Networks using Mads and Fuzzy C-means Optimization of Base Station Location in 3G Networks using Mads and Fuzzy C-means A. O. Onim 1* P. K. Kihato 2 S. Musyoki 3 1. Jomo Kenyatta University of Agriculture and Technology, Department of Telecommunication

More information

The method of Maximum Likelihood.

The method of Maximum Likelihood. Maximum Likelihood The method of Maximum Likelihood. In developing the least squares estimator - no mention of probabilities. Minimize the distance between the predicted linear regression and the observed

More information

CS227-Scientific Computing. Lecture 6: Nonlinear Equations

CS227-Scientific Computing. Lecture 6: Nonlinear Equations CS227-Scientific Computing Lecture 6: Nonlinear Equations A Financial Problem You invest $100 a month in an interest-bearing account. You make 60 deposits, and one month after the last deposit (5 years

More information

R & R Study. Chapter 254. Introduction. Data Structure

R & R Study. Chapter 254. Introduction. Data Structure Chapter 54 Introduction A repeatability and reproducibility (R & R) study (sometimes called a gauge study) is conducted to determine if a particular measurement procedure is adequate. If the measurement

More information

Accelerated Option Pricing Multiple Scenarios

Accelerated Option Pricing Multiple Scenarios Accelerated Option Pricing in Multiple Scenarios 04.07.2008 Stefan Dirnstorfer (stefan@thetaris.com) Andreas J. Grau (grau@thetaris.com) 1 Abstract This paper covers a massive acceleration of Monte-Carlo

More information

Lecture 12. Stock Option boundary conditions. Agenda:

Lecture 12. Stock Option boundary conditions. Agenda: Lecture 12 Stock Option boundary conditions Agenda: I. Option boundary conditions: ~ Option boundary conditions based on arbitrage force ~ American call options without dividend ~ American put options

More information

Learning TradeStation. News, Time & Sales, Research, Browser, and Ticker Bar

Learning TradeStation. News, Time & Sales, Research, Browser, and Ticker Bar Learning TradeStation News, Time & Sales, Research, Browser, and Ticker Bar Important Information No offer or solicitation to buy or sell securities, securities derivative or futures products of any kind,

More information

University of Illinois at Urbana-Champaign College of Engineering

University of Illinois at Urbana-Champaign College of Engineering University of Illinois at Urbana-Champaign College of Engineering CEE 570 Finite Element Methods (in Solid and Structural Mechanics) Spring Semester 2014 Quiz #1 March 3, 2014 Name: SOLUTION ID#: PS.:

More information

PROBABILISTIC MICROMECHANICAL MODEL OF ENGINEERED CEMENTITIOUS COMPOSITES (ECC)

PROBABILISTIC MICROMECHANICAL MODEL OF ENGINEERED CEMENTITIOUS COMPOSITES (ECC) PROBABILISTIC MICROMECHANICAL MODEL OF ENGINEERED CEMENTITIOUS COMPOSITES (ECC) J. Li (1) and E.-H. Yang (2) (1) Interdisciplinary Graduate School, Nanyang Technological University, Singapore (2) School

More information

Stepping Through Co-Optimisation

Stepping Through Co-Optimisation Stepping Through Co-Optimisation By Lu Feiyu Senior Market Analyst Original Publication Date: May 2004 About the Author Lu Feiyu, Senior Market Analyst Lu Feiyu joined Market Company, the market operator

More information

Robust Dual Dynamic Programming

Robust Dual Dynamic Programming 1 / 18 Robust Dual Dynamic Programming Angelos Georghiou, Angelos Tsoukalas, Wolfram Wiesemann American University of Beirut Olayan School of Business 31 May 217 2 / 18 Inspired by SDDP Stochastic optimization

More information

Stochastic SIL Verification for Complex Safety Instrumented Systems

Stochastic SIL Verification for Complex Safety Instrumented Systems Stochastic SIL Verification for Complex Safety Instrumented Systems Sara Shahidi and Dr. Mehran Pourzand, Monaco Engineering Solutions Limited To ensure a Safety Instrumented System (SIS) is capable of

More information

Markov Decision Process

Markov Decision Process Markov Decision Process Human-aware Robotics 2018/02/13 Chapter 17.3 in R&N 3rd Ø Announcement: q Slides for this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse471/lectures/mdp-ii.pdf

More information

Numerical Methods in Option Pricing (Part III)

Numerical Methods in Option Pricing (Part III) Numerical Methods in Option Pricing (Part III) E. Explicit Finite Differences. Use of the Forward, Central, and Symmetric Central a. In order to obtain an explicit solution for the price of the derivative,

More information

Reinforcement Learning. Slides based on those used in Berkeley's AI class taught by Dan Klein

Reinforcement Learning. Slides based on those used in Berkeley's AI class taught by Dan Klein Reinforcement Learning Slides based on those used in Berkeley's AI class taught by Dan Klein Reinforcement Learning Basic idea: Receive feedback in the form of rewards Agent s utility is defined by the

More information

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring Announcements CS 188: Artificial Intelligence Spring 2011 Lecture 9: MDPs 2/16/2011 Pieter Abbeel UC Berkeley Many slides over the course adapted from either Dan Klein, Stuart Russell or Andrew Moore 1 Announcements

More information

Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration

Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration Piyush Rai CS5350/6350: Machine Learning November 29, 2011 Reinforcement Learning Supervised Learning: Uses explicit supervision

More information

16 MAKING SIMPLE DECISIONS

16 MAKING SIMPLE DECISIONS 247 16 MAKING SIMPLE DECISIONS Let us associate each state S with a numeric utility U(S), which expresses the desirability of the state A nondeterministic action A will have possible outcome states Result

More information

MOLONEY A.M. SYSTEMS THE FINANCIAL MODELLING MODULE A BRIEF DESCRIPTION

MOLONEY A.M. SYSTEMS THE FINANCIAL MODELLING MODULE A BRIEF DESCRIPTION MOLONEY A.M. SYSTEMS THE FINANCIAL MODELLING MODULE A BRIEF DESCRIPTION Dec 2005 1.0 Summary of Financial Modelling Process: The Moloney Financial Modelling software contained within the excel file Model

More information

Semantics with Applications 2b. Structural Operational Semantics

Semantics with Applications 2b. Structural Operational Semantics Semantics with Applications 2b. Structural Operational Semantics Hanne Riis Nielson, Flemming Nielson (thanks to Henrik Pilegaard) [SwA] Hanne Riis Nielson, Flemming Nielson Semantics with Applications:

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Learning Basic idea: Receive feedback in the form of rewards Agent s utility is defined by the reward function Must (learn to) act so as to maximize expected rewards Grid World The agent

More information

LESSON 7-1. Preparing an Income Statement. CENTURY 21 ACCOUNTING Thomson/South-Western

LESSON 7-1. Preparing an Income Statement. CENTURY 21 ACCOUNTING Thomson/South-Western LESSON 7-1 Preparing an Income Statement 2 TERMS REVIEW page 186 Component Percentage the percentage relationship between one financial statement item and the total that includes that item Adequate Disclosure

More information

Linear Modeling Business 5 Supply and Demand

Linear Modeling Business 5 Supply and Demand Linear Modeling Business 5 Supply and Demand Supply and demand is a fundamental concept in business. Demand looks at the Quantity (Q) of a product that will be sold with respect to the Price (P) the product

More information

A Branch-and-Price method for the Multiple-depot Vehicle and Crew Scheduling Problem

A Branch-and-Price method for the Multiple-depot Vehicle and Crew Scheduling Problem A Branch-and-Price method for the Multiple-depot Vehicle and Crew Scheduling Problem SCIP Workshop 2018, Aachen Markó Horváth Tamás Kis Institute for Computer Science and Control Hungarian Academy of Sciences

More information

Reinforcement Learning and Simulation-Based Search

Reinforcement Learning and Simulation-Based Search Reinforcement Learning and Simulation-Based Search David Silver Outline 1 Reinforcement Learning 2 3 Planning Under Uncertainty Reinforcement Learning Markov Decision Process Definition A Markov Decision

More information

Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks

Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks Hussein Abouzeid Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute abouzeid@ecse.rpi.edu

More information

Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration

Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration Piyush Rai CS5350/6350: Machine Learning November 29, 2011 Reinforcement Learning Supervised Learning: Uses explicit supervision

More information

source experience distilled PUBLISHING BIRMINGHAM - MUMBAI

source experience distilled PUBLISHING BIRMINGHAM - MUMBAI Python for Finance Build real-life Python applications for quantitative finance and financial engineering Yuxing Yan source experience distilled PUBLISHING BIRMINGHAM - MUMBAI Table of Contents Preface

More information

Hertha Longo, CSA Matt Wade

Hertha Longo, CSA Matt Wade Hertha Longo, CSA Matt Wade Census and financial forecasting tool to assist religious institutes in decision-making and planning for the future Available on CD for purchase by religious institutes only

More information

Economic Simulations for Risk Analysis

Economic Simulations for Risk Analysis Session 1339 Economic Simulations for Risk Analysis John H. Ristroph University of Louisiana at Lafayette Introduction and Overview Errors in estimates of cash flows are the rule rather than the exception,

More information

Notes II: Consumption-Saving Decisions, Ricardian Equivalence, and Fiscal Policy. Julio Garín Intermediate Macroeconomics Fall 2018

Notes II: Consumption-Saving Decisions, Ricardian Equivalence, and Fiscal Policy. Julio Garín Intermediate Macroeconomics Fall 2018 Notes II: Consumption-Saving Decisions, Ricardian Equivalence, and Fiscal Policy Julio Garín Intermediate Macroeconomics Fall 2018 Introduction Intermediate Macroeconomics Consumption/Saving, Ricardian

More information

Financial Budgeting. User Guide

Financial Budgeting. User Guide Financial Budgeting User Guide Copyright (c) 2002 Jenzabar, Inc. All rights reserved. You may print any part or the whole of this documentation to support installations of Jenzabar software. Where the

More information

Sizing Strategies in Scarce Environments

Sizing Strategies in Scarce Environments 2011-8675 C Sizing Strategies in Scarce Environments Michael D. Mitchell 1, Walter E. Beyeler 1, Robert E. Glass 1, Matthew Antognoli 2, Thomas Moore 1 1 Complex Adaptive System of Systems (CASoS) Engineering

More information

Solutions to questions in Chapter 8 except those in PS4. The minimum-variance portfolio is found by applying the formula:

Solutions to questions in Chapter 8 except those in PS4. The minimum-variance portfolio is found by applying the formula: Solutions to questions in Chapter 8 except those in PS4 1. The parameters of the opportunity set are: E(r S ) = 20%, E(r B ) = 12%, σ S = 30%, σ B = 15%, ρ =.10 From the standard deviations and the correlation

More information

CSE 417 Dynamic Programming (pt 2) Look at the Last Element

CSE 417 Dynamic Programming (pt 2) Look at the Last Element CSE 417 Dynamic Programming (pt 2) Look at the Last Element Reminders > HW4 is due on Friday start early! if you run into problems loading data (date parsing), try running java with Duser.country=US Duser.language=en

More information

Illustration Software Quick Start Guide

Illustration Software Quick Start Guide Illustration Software Quick Start Guide The illustration software is primarily designed to create an illustration that highlights the benefits of downside risk management and illustrates the effects of

More information

Technology, Employment, and the Business Cycle: Do Technology Shocks Explain Aggregate Fluctuations? Comment

Technology, Employment, and the Business Cycle: Do Technology Shocks Explain Aggregate Fluctuations? Comment Technology, Employment, and the Business Cycle: Do Technology Shocks Explain Aggregate Fluctuations? Comment Yi Wen Department of Economics Cornell University Ithaca, NY 14853 yw57@cornell.edu Abstract

More information

Advanced Microeconomics

Advanced Microeconomics Advanced Microeconomics ECON5200 - Fall 2014 Introduction What you have done: - consumers maximize their utility subject to budget constraints and firms maximize their profits given technology and market

More information

4: Single Cash Flows and Equivalence

4: Single Cash Flows and Equivalence 4.1 Single Cash Flows and Equivalence Basic Concepts 28 4: Single Cash Flows and Equivalence This chapter explains basic concepts of project economics by examining single cash flows. This means that each

More information

Financial Reporting Consolidation PEMPAL Treasury Community of Practice thematic group on Public Sector Accounting and Reporting

Financial Reporting Consolidation PEMPAL Treasury Community of Practice thematic group on Public Sector Accounting and Reporting DRAFT 2016 Financial Reporting Consolidation PEMPAL Treasury Community of Practice thematic group on Public Sector Accounting and Reporting Table of Contents 1 Goals and target audience for the Guidance

More information

High Load Diaphragm Design for Panelized Roofs. Copyright Materials. A Cost Effective Solution for Large Low Slope Roofs. Learning Objectives

High Load Diaphragm Design for Panelized Roofs. Copyright Materials. A Cost Effective Solution for Large Low Slope Roofs. Learning Objectives The Wood Products Council is a Registered Provider with The American Institute of Architects Continuing Education Systems (AIA/CES). Credit(s) earned on completion of this program will be reported to AIA/CES

More information

WSIPC Guide to Budgetary Data Mining

WSIPC Guide to Budgetary Data Mining WSIPC Guide to Budgetary Data Mining TERMS OF USE The information contained herein is licensed, trade-secret and proprietary and may not be used, disclosed or reproduced without permission of the licensing

More information

Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA

Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA Rajesh Bordawekar and Daniel Beece IBM T. J. Watson Research Center 3/17/2015 2014 IBM Corporation

More information

Fast Convergence of Regress-later Series Estimators

Fast Convergence of Regress-later Series Estimators Fast Convergence of Regress-later Series Estimators New Thinking in Finance, London Eric Beutner, Antoon Pelsser, Janina Schweizer Maastricht University & Kleynen Consultants 12 February 2014 Beutner Pelsser

More information

Intertemporal choice: Consumption and Savings

Intertemporal choice: Consumption and Savings Econ 20200 - Elements of Economics Analysis 3 (Honors Macroeconomics) Lecturer: Chanont (Big) Banternghansa TA: Jonathan J. Adams Spring 2013 Introduction Intertemporal choice: Consumption and Savings

More information

Parallel Accommodating Conduct: Evaluating the Performance of the CPPI Index

Parallel Accommodating Conduct: Evaluating the Performance of the CPPI Index Parallel Accommodating Conduct: Evaluating the Performance of the CPPI Index Marc Ivaldi Vicente Lagos Preliminary version, please do not quote without permission Abstract The Coordinate Price Pressure

More information

REGIONAL WORKSHOP ON TRAFFIC FORECASTING AND ECONOMIC PLANNING

REGIONAL WORKSHOP ON TRAFFIC FORECASTING AND ECONOMIC PLANNING International Civil Aviation Organization 27/8/10 WORKING PAPER REGIONAL WORKSHOP ON TRAFFIC FORECASTING AND ECONOMIC PLANNING Cairo 2 to 4 November 2010 Agenda Item 3 a): Forecasting Methodology (Presented

More information

AGRICULTURAL BANK MANAGEMENT SIMULATION GAME INSTRUCTIONS * Introduction to the Bank Management Simulation Game

AGRICULTURAL BANK MANAGEMENT SIMULATION GAME INSTRUCTIONS * Introduction to the Bank Management Simulation Game AGRICULTURAL BANK MANAGEMENT SIMULATION GAME INSTRUCTIONS * Introduction to the Bank Management Simulation Game The non-internet version of the agricultural bank management simulation game (Ag Bank Sim)

More information

Topics in Computational Sustainability CS 325 Spring 2016

Topics in Computational Sustainability CS 325 Spring 2016 Topics in Computational Sustainability CS 325 Spring 2016 Note to other teachers and users of these slides. Andrew would be delighted if you found this source material useful in giving your own lectures.

More information

Web Incentive Processing System User Guide. For Participating Independent Contractors (PICs)

Web Incentive Processing System User Guide. For Participating Independent Contractors (PICs) Web Incentive Processing System User Guide For Participating Independent Contractors (PICs) Revised: January 2017 2 W e b I n c e n t i v e P r o c e s s i n g S y s t e m U s e r G u i d e P a r t i c

More information

Likelihood-based Optimization of Threat Operation Timeline Estimation

Likelihood-based Optimization of Threat Operation Timeline Estimation 12th International Conference on Information Fusion Seattle, WA, USA, July 6-9, 2009 Likelihood-based Optimization of Threat Operation Timeline Estimation Gregory A. Godfrey Advanced Mathematics Applications

More information

SOLVING ROBUST SUPPLY CHAIN PROBLEMS

SOLVING ROBUST SUPPLY CHAIN PROBLEMS SOLVING ROBUST SUPPLY CHAIN PROBLEMS Daniel Bienstock Nuri Sercan Özbay Columbia University, New York November 13, 2005 Project with Lucent Technologies Optimize the inventory buffer levels in a complicated

More information

THE PROXIMITY OF MICROVIAS TO PTHs AND ITS IMPACT ON THE RELIABILITY

THE PROXIMITY OF MICROVIAS TO PTHs AND ITS IMPACT ON THE RELIABILITY THE PROXIMITY OF MICROVIAS TO s AND ITS IMPACT ON THE RELIABILITY Anthony Primavera Manager - CSP Consortium Universal Instruments Corporation Binghamton, New York 13902-0825. Jaydutt Joshi Package Development

More information

Inference in Bayesian Networks

Inference in Bayesian Networks Andrea Passerini passerini@disi.unitn.it Machine Learning Inference in graphical models Description Assume we have evidence e on the state of a subset of variables E in the model (i.e. Bayesian Network)

More information

Max Registers, Counters and Monotone Circuits

Max Registers, Counters and Monotone Circuits James Aspnes 1 Hagit Attiya 2 Keren Censor 2 1 Yale 2 Technion Counters Model Collects Our goal: build a cheap counter for an asynchronous shared-memory system. Two operations: increment and read. Read

More information

ECON 200 EXERCISES. (b) Appeal to any propositions you wish to confirm that the production set is convex.

ECON 200 EXERCISES. (b) Appeal to any propositions you wish to confirm that the production set is convex. ECON 00 EXERCISES 3. ROBINSON CRUSOE ECONOMY 3.1 Production set and profit maximization. A firm has a production set Y { y 18 y y 0, y 0, y 0}. 1 1 (a) What is the production function of the firm? HINT:

More information

Lecture Quantitative Finance Spring Term 2015

Lecture Quantitative Finance Spring Term 2015 implied Lecture Quantitative Finance Spring Term 2015 : May 7, 2015 1 / 28 implied 1 implied 2 / 28 Motivation and setup implied the goal of this chapter is to treat the implied which requires an algorithm

More information

ESD 71 / / etc 2004 Final Exam de Neufville ENGINEERING SYSTEMS ANALYSIS FOR DESIGN. Final Examination, 2004

ESD 71 / / etc 2004 Final Exam de Neufville ENGINEERING SYSTEMS ANALYSIS FOR DESIGN. Final Examination, 2004 ENGINEERING SYSTEMS ANALYSIS FOR DESIGN Final Examination, 2004 Item Points Possible Achieved Your Name 2 1 Cost Function 18 2 Engrg Economy Valuation 26 3 Decision Analysis 18 4 Value of Information 15

More information

Resource Planning with Uncertainty for NorthWestern Energy

Resource Planning with Uncertainty for NorthWestern Energy Resource Planning with Uncertainty for NorthWestern Energy Selection of Optimal Resource Plan for 213 Resource Procurement Plan August 28, 213 Gary Dorris, Ph.D. Ascend Analytics, LLC gdorris@ascendanalytics.com

More information

Richardson Extrapolation Techniques for the Pricing of American-style Options

Richardson Extrapolation Techniques for the Pricing of American-style Options Richardson Extrapolation Techniques for the Pricing of American-style Options June 1, 2005 Abstract Richardson Extrapolation Techniques for the Pricing of American-style Options In this paper we re-examine

More information

Intermediate Macroeconomics: Economic Growth and the Solow Model

Intermediate Macroeconomics: Economic Growth and the Solow Model Intermediate Macroeconomics: Economic Growth and the Solow Model Eric Sims University of Notre Dame Fall 2014 1 Introduction We begin the core of the course with a discussion of economic growth. Technically

More information

Model Estimation. Liuren Wu. Fall, Zicklin School of Business, Baruch College. Liuren Wu Model Estimation Option Pricing, Fall, / 16

Model Estimation. Liuren Wu. Fall, Zicklin School of Business, Baruch College. Liuren Wu Model Estimation Option Pricing, Fall, / 16 Model Estimation Liuren Wu Zicklin School of Business, Baruch College Fall, 2007 Liuren Wu Model Estimation Option Pricing, Fall, 2007 1 / 16 Outline 1 Statistical dynamics 2 Risk-neutral dynamics 3 Joint

More information

Predictive Model Learning of Stochastic Simulations. John Hegstrom, FSA, MAAA

Predictive Model Learning of Stochastic Simulations. John Hegstrom, FSA, MAAA Predictive Model Learning of Stochastic Simulations John Hegstrom, FSA, MAAA Table of Contents Executive Summary... 3 Choice of Predictive Modeling Techniques... 4 Neural Network Basics... 4 Financial

More information

IRA FMV and Contribution Report Wizard Instructions for Tax Reporting Service Clients

IRA FMV and Contribution Report Wizard Instructions for Tax Reporting Service Clients IRA FMV and Contribution Report Wizard Instructions for Tax Reporting Service Clients Wizard Purpose The IRA FMV and Contribution Report Wizard must be completed by financial organizations with a 5498

More information

starting on 5/1/1953 up until 2/1/2017.

starting on 5/1/1953 up until 2/1/2017. An Actuary s Guide to Financial Applications: Examples with EViews By William Bourgeois An actuary is a business professional who uses statistics to determine and analyze risks for companies. In this guide,

More information

Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems

Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems NLA p.1/13 Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems... 0 0 0 etc. a n 1,n 1 x n 1 = b n 1 a n 1,n x n solve a n,n x n = b n then back substitution: takes n

More information

Investor Presentation. May 9, 2018

Investor Presentation. May 9, 2018 Investor Presentation May 9, 2018 Non-GAAP Items and Forward-Looking Statements This presentation contains the following non-gaap measures: Adjusted EBITDA (in absolute dollars and as a percentage of sales;

More information

Stochastic Dual Dynamic Programming

Stochastic Dual Dynamic Programming 1 / 43 Stochastic Dual Dynamic Programming Operations Research Anthony Papavasiliou 2 / 43 Contents [ 10.4 of BL], [Pereira, 1991] 1 Recalling the Nested L-Shaped Decomposition 2 Drawbacks of Nested Decomposition

More information

Response of LTI Systems (Transfer Functions, Partial Fraction Expansion, and Convolution), LTI System Characteristics (Stability and Invertibility)

Response of LTI Systems (Transfer Functions, Partial Fraction Expansion, and Convolution), LTI System Characteristics (Stability and Invertibility) Response of LTI Systems (Transfer Functions, Partial Fraction Expansion, and Convolution), LTI System Characteristics (Stability and Invertibility) where h(t) is an impulse response, is called the system

More information

Data and Process Modelling

Data and Process Modelling Data and Process Modelling Lab10. Quantitative Process Analysis Marco Montali KRDB Research Centre for Knowledge and Data Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2015/2016 Marco

More information