Collection Center Location Problem with Incentive & Distance Dependent Returns

Size: px
Start display at page:

Download "Collection Center Location Problem with Incentive & Distance Dependent Returns"

Transcription

1 International Workshop on Distribution Logistics IWDL 2006 Brescia, ITALY October 2 nd 5 th, 2006 Collection Center Location Proble with Incentive & Distance Dependent Returns Deniz Aksen College of Adinistrative Sciences and Econoics, Koç University Necati Aras Departent of Industrial Engineering, Boğaziçi University Original slides by Ergül Taslacıoğlu Zenginer

2 Agenda Conclusions 2

3 Introduction Traditional focus of supply chains: fine-tuning the logistics of products fro raw aterial to the end custoer Modern supply chain view: increasing flow of products in the reverse direction 3

4 Definition of Reverse Logistics The process of planning, ipleenting, and controlling backward flows of raw aterial, in-process inventory, packaging, and finished goods fro a anufacturing, distribution or reuse point, to a point of origin for the purpose of recapturing value or proper disposal. (REVLOG, 2002) 4

5 Reverse Logistics Process (Fleischann et al., 2000) Collection: process of rendering used products available and physically oving the to soe point for further treatent. It ay include activities purchasing, transportation, and storage Collection Inspection/separation: costs are 30-50% the of set overall of operations EOL product for deterining anageent costs (Mulder whether et a al.,1999) given product is re-usable and in which way Reprocessing: transforation of a used product into a usable product again Disposal: done for products that cannot be re-used for technical or econoical reasons Redistribution: distributing reusable products to a potential arket 5

6 Types of Collection Strategies Curbside collection: consuers sort recyclable aterial fro other solid wastes and place in bins at curbside convenient, high return rate Drop-off centers: requires ore consuer effort, so lower return rates consuers are not offered reiburseent for aterials delivered Buy-back centers: consuers provide the initial transportation and drop-off recyclables they receive reiburseent 6

7 Coon practices for Collection (Mulder et al., 1999) Netherlands, Belgiu, and Italy unicipalities: ensure separate collection of EOL electronics fro households producers: in charge of recycling Switzerland and Sweden producers are fully responsible for organizing separate collection structures for EOL electronics Denark unicipalities are responsible for separate collection of EOL electronic products and also their proper treatent funded through local waste taxes 7

8 Multi Echelon Reverse Logistics Network (Min et al., 2006) custoers drop products to initial collection points (ICP) products are transferred fro ICPs to Central Return Centers (CRC) cost coponents: renting, inventory carrying, aterial handling, setup, shipping CRCs have a liited capacity service level requireent for ICPs Obective: finding optiu nuber and location of ICP and CRCs, and frequency of shipents fro ICP to CRCs 8

9 Proble is faced by a copany that collects used products fro consuers Sites at which collection centers can be located Consuers who have end-of-life products Drop-off odel Return decision based on the: financial incentive offered by the copany (R) travel distance of the consuers (d i ) Obective: to axiize profit by deterining sites at which collection centers ust be set up financial incentive (unit acquisition price) offered to custoers 9

10 Model-1: UCCLP the nuber and locations of CCs & incentive to be offered are decided tradeoff : high fixed cost and high return rate low fixed cost and less return rate Model-2: p-cclp UCCLP in which the nuber of collection facilities to be opened is predeterined siilar to the faous p-edian proble locations of CCs and incentive to be suggested are decided 10

11 5 9 R kd > R *3 > 20 3 R 0 : Reservation incentive (rv) R: Incentive Offered k: cost per unit distance traveled d :distance between cust. and nearest CC to it 11

12 R kd > R *3 < 20 3 R 0 : Reservation incentive (rv) R: Incentive Offered k: cost per unit distance traveled d :distance between cust. and nearest CC to it 12

13 R 0 R 0 ~ U(a,b) : easure of consuer willingness Ray et al., 2005; Woanowski et al., 2003 Probability density function of R 0 f ( R ) = 1 0 b a f(r 0 ) 1 a b R 0 Probability distribution function of R 0 F ( R 0 ) R = 0 a b a F(R 0 ) 1 a b R 0 13

14 Paraeters e i f i h s M Variables Y i δ1 : Euclidean distance between custoer zone and candidate site i : fixed cost of opening and operating a collection center at site i : nuber of product holders located at zone : unit revenue fro a return : a large nuber 1 if a collection center is located at site i = 0 otherwise 1 if product holdersat zone areassignedto thecollectioncenter at sitei X i = 0 otherwise R : aount of incentive offered by the copany P : proportion of product holders at zone who drop off their product 1 if product holders at zone do not drop off their product ( P = 0) δ 1 = 0 otherwise 1 if all product holders at zone drop off their product ( P = 1) δ 2 = 0 otherwise & auxiliary binary variables used for forulating P 14 δ 2

15 R : aount of incentive copany offers k : cost per unit distance traveled d : distance between cust. zone and nearest facility kd : cost of carrying product fro zone to nearest facility P : proportion of consuers at zone who return their product P = Pr( R kd R0 > 0) = ( R kd b a a) + P = 0 R kd a b a 1 R < kd kd + a R kd + a R < + b kd + b 15

16 Return Rate Function R 0 R 0 ~ U(a,b) P = 0 R 1 kd b a a R < kd kd + a R kd + a R < + b kd + b P 1 P 1 0 a kd +a R 1 kd +b s R 16

17 h : nuber of consuers that own the product of the copany h P : total nuber of returns fro zone s : value of a returned product (s R):profit gained fro each return Π =h P (s R): profit fro custoer zone = 0 h b a 0 2 ( R + α R β ) R < kd kd R s + a + a R < s 17

18 Obective Function - UCCLP ax n ( s R) f Y = h P = 1 i 1 i i Total expected profit Total fixed cost of opening CCs 18

19 Constraints (UCCLP) subect to (1) (2) i= 1 X i X i Y = 1 i i = 1,..., n = 1,..., ; = 1,..., n (11) R a (12) (13) (14) R s X Y i i { 0,1 } i = 1,..., ; { 0,1 } i = 1,..., = 1,..., n 19

20 δ1 = 1 and δ2 = 1 (3) (4) (5) (6) (7) (8) (9) (10) Infeasible R R R R P P P P ( ) ke X a M( ) i i i δ = 1 1 ( ) ke X a M i 1 i i + δ = 1 ( ) ke X + b + Mδ ( ) ` ke X + b M( 1 δ ) 2 i= 1 i= 1 1 δ δ 1 R ( R ( i i i= 1 ke b a i= 1 i i ke i i b a X X i i 2 2 ) a + M ) a M ( δ + δ ) 1 = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n ( δ + δ ) = 1,..., n P 1 0 a kd +a kd +b s 20 R

21 δ1 = 0 δ2 = 0 and 1 P (3) (4) (5) (6) (7) (8) (9) (10) R R R R P P P P ( ) ke X a M( ) i i i δ = 1 1 ( ) ke X a M i i i + δ = 1 1 ( ) ke X b M i 1 i i + + δ = 2 ( ) ke X + b M( 1 δ ) 2 i= 1 1 δ δ 1 R ( R ( i i= 1 ke b a i= 1 i ke i i b a X X i i 2 ) a + M ) a M ( δ + δ ) 1 = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n ( δ + δ ) = 1,..., n a kd +a kd +b s 21 R

22 P δ1 = 0 and δ2 =1 1 (3) (4) (5) (6) (7) (8) (9) (10) R R R R P P P P ( ) ke X a M( ) i i i δ = 1 1 ( ) ke X a M i i i + δ = 1 1 ( ) ke X b M i 1 i i + + δ = 2 ( ) ke X + b M( 1 δ ) 2 i= 1 1 δ δ 1 R ( R ( i i= 1 ke b a i= 1 i ke i i b a X X i i 2 ) a + M ) a M ( δ + δ ) 1 = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n ( δ + δ ) = 1,..., n a kd +a kd +b s 22 R

23 P δ1 = 1 and δ 2 = 0 1 (3) (4) (5) (6) (7) (8) (9) (10) R R R R P P P P ( ) ke X a M( ) i i i δ = 1 1 ( ) ke X a M i i i + δ = 1 1 ( ) ke X b M i 1 i i + + δ = 2 ( ) ke X + b M( 1 δ ) 2 i= 1 1 δ δ 1 R ( R ( i i= 1 ke b a i= 1 i ke i i b a X X i i 2 ) a + M ) a M ( δ + δ ) 1 = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n = 1,..., n ( δ + δ ) = 1,..., n a kd +a kd +b s 23 R

24 Extension: p-cclp Obective function ax = n = 1 h P ( s R) Additional constraint =1 Y i i = p 24

25 Begin Phase 1: Tabu Search Select CCs to be opened CCs opened Phase Phase 2: 2: Nelder-Mead Fibonacci Siplex Search Search or Hooke-Jeeves for 1 quality Pattern type Search for ultiple quality types Deterine R or R s (single vs. ultiple quality types) Obective value calculated No Does any stopping condition hold? Yes End 25

26 p-cclp: 1 st phase - Tabu Search Initially p facilities opened with the sallest total distance fro custoer zones SWAP ove operators used (syetrical 1-Swap, 2-Swap, and 3- Swap) to generate a neighborhood of the current solution For each ove operator: nu_neigh = p( p)/3 Tabu status is tracked for every facility: tabu_tenure [1, 2,, Max_Tabu_Tenure = 25] Search terinates IF EITHER ax_iter iterations have been executed, OR IF the best solution found so far does not iprove for ax_nonip_iter consecutive iterations 26

27 p-cclp & UCCLP:2 nd phase Fibonacci Search f(r) f ( λ k ) > f ( µ k ) f f( ( µ k λ + k 1) ) f ( µ k ) f ( λ k+ 1) f ( λk + 1 ) < f ( µ k + 1) a k λ k µ k R k +1 λ k +1 µ k +1 a 1 b k b k + ak +2 λ k +1 µ k + 1 b k +2 27

28 UCCLP: 1 st phase - Tabu Search initially 1 rando facility opened 1-ADD, 1-DROP, 1-SWAP ove operators to generate a neighborhood of the current solution For 1-ADD: nu_neigh = ( ρ) For 1-DROP: nu_neigh = ρ For 1-SWAP: nu_neigh = in{3, ρ ( ρ)} Tabu status is tracked for every facility: tabu_tenure [1, 2,, Max_Tabu_Tenure = 25] Search terinates IF EITHER ax_iter iterations have been executed, OR IF the best solution found so far does not iprove for ax_nonip_iter consecutive iterations 28

29 TS Heuristic vs. Exhaustive Search on p-cclp 29

30 SBB Solver of the GAMS Suite v22.0 SBB calls CPLEX 9.0 for the IP subprobles, and either MINOS or CONOPT as subsolver for NLP OQNLP and DICOPT as MINLP solvers perfor even worse. 30

31 SBB Solver vs. TS Heuristic on UCCLP instances 31

32 Effect of the variability of R 0 Width of [a,b] 32

33 Effect of the variability of R 0 Width of [a,b] 33

34 Effect of the variability of R 0 Width of [a,b] 34

35 Effect of the variability of R 0 Width of [a,b] when a = const. 35

36 p-cclp Results - Suary as p increases profit increases, but the arginal profit decreases with each additional facility return rate increases financial incentive offered decreases when s is higher incentive is higher collection rate is higher 36

37 p-cclp Effect of the Variability of R 0 As ean and standard deviation increases profit decreases return rate decreases incentive increases to soe extend 37

38 p-cclp Effect of the Variability of R 0 As standard deviation increases, ean being constant Profit increases, for s=50 and s=75 first decreases then increases for s=100 Return rate increases for s=50 decreases for s=75 and s=100 Incentive decreases 38

39 UCCLP Results - Suary when fixed cost is higher profit is lower # of opened CCs is lower return rate is lower when s is higher profit & incentive is higher # of CCs lower 39

40 Conclusions a CC location odel is proposed for collection of EOL products fro custoers nuber and locations of CCs that should be opened and financial incentive are deterined custoers are assued to aggregate at soe points a reservation price is assued for each custoer two factors affect custoers decision on returning the product: financial incentive proxiity to the nearest collection center returned product still has a value for the copany which can be extracted by subsequent reprocessing activities 40

41 Conclusions proble is forulated as a Mixed-Integer Nonlinear Facility Location (MINLP) odel to deterine the collection center locations and the financial incentive to be offered a 2-phase solution ethodology is used Tabu search & Fibonacci search 3870 experients are ade in total results are presented for two odels: p-cclp and UCCLP 41

42 Questions & Coents? Coputational Results p-cclp Sensitivity Results with respect to p and s p-cclp Sensitivity with respect to Variance and Mean Effect of the FC value in UCCLP Effect of R 0 variability in p-cclp Milano Istanbul Bergao Brescia 42

43 Effect of p on Profit 1.E+06 Profit (Logarithic Scale) 1.E+05 1.E+04 1.E+03 s=50 s=75 s=100 1.E p 43

44 Effect of p on Collection Rate Collection Rate (%) s=50 s=75 s= p 44

45 Effect of p on Incentive Incentive s=50 s=75 s= p 45

46 Effect of s on Incentive & Collection Rate Incentive Incentive Collection rate Collection Rate (%) s 0 p=1 46

47 Varying µ and σ: Effect on Profit 40,000 35,000 Profit 30,000 25,000 20,000 15,000 p=1 p=2 p=3 p=4 p=5 p=6 10,000 5,000 0 [40,60] [40,70] [40,80] [40,90] [40,100] [a,b] s=75 47

48 Varying µ and σ: Effect on Return Rate Return Rate (%) p=1 p=2 p=3 p=4 p=5 p=6 0 [40,60] [40,70] [40,80] [40,90] [40,100] [a,b] s=75 48

49 Varying µ and σ: Effect on Incentive, s= Incentive p=1 p=2 p=3 p=4 p=5 p= [40,60] [40,70] [40,80] [40,90] [40,100] [a,b] s=75 49

50 Varying µ and σ : Effect on Incentive, s= Incentive p=1 p=2 p=3 p=4 p=5 p= [40,60] [40,70] [40,80] [40,90] [40,100] [a,b] s=100 50

51 Effect of Fixed Cost on Profit Profit s=50 s=75 s= Low Mediu High Fixed Cost 51

52 Effect of Fixed Cost on Incentive and # of CCs s= s=75 s=100 Incentive Nuber of CC's Opened s=50 s=75 s=100 0 Low Mediu High 0 Fixed cost level 52

53 Effect of Fixed Cost on Return Rate Return Rate (%) s=50 s=75 s=100 0 Low Mediu High Fixed Cost 53

OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS

OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS 5 th International Conference Coputational Mechanics and Virtual Engineering COMEC 2013 24-25 October 2013, Braşov, Roania OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS I. Milosan 1 1 Transilvania

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Support Vector Machines MIT Course Notes Cynthia Rudin

Support Vector Machines MIT Course Notes Cynthia Rudin Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem International Journal of Conteporary Matheatical Sciences Vol. 14, 2019, no. 1, 31-42 HIKARI Ltd, www.-hikari.co https://doi.org/10.12988/ijcs.2019.914 Optiu Value of Poverty Measure Using Inverse Optiization

More information

Equilibria on the Day-Ahead Electricity Market

Equilibria on the Day-Ahead Electricity Market Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal argarida.carvalho@dcc.fc.up.pt João Pedro Pedroso INESC Porto,

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

Online Supplement. and. Pradeep K. Chintagunta Graduate School of Business University of Chicago

Online Supplement. and. Pradeep K. Chintagunta Graduate School of Business University of Chicago Online Suppleent easuring Cross-Category Price Effects with Aggregate Store Data Inseong Song ksong@usthk Departent of arketing, HKUST Hong Kong University of Science and Technology and Pradeep K Chintagunta

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel

More information

FUZZY PARAMETRIC GEOMETRIC PROGRAMMING WITH APPLICATION IN FUZZY EPQ MODEL UNDER FLEXIBILITY AND RELIABILITY CONSIDERATION

FUZZY PARAMETRIC GEOMETRIC PROGRAMMING WITH APPLICATION IN FUZZY EPQ MODEL UNDER FLEXIBILITY AND RELIABILITY CONSIDERATION ISSN 1746-7659, England, UK Journal of Inforation and Coputing Science Vol. 7, No. 3, 1, pp. 3-34 FUZZY PARAMERIC GEOMERIC PROGRAMMING WIH APPLICAION IN FUZZY EPQ MODEL UNDER FLEXIBILIY AND RELIABILIY

More information

Optimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks

Optimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks 1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster

More information

Simulation of Discrete Event Systems

Simulation of Discrete Event Systems Siulation of Discrete Event Systes Unit 9 Queueing Models Fall Winter 207/208 Prof. Dr.-Ing. Dipl.-Wirt.-Ing. Sven Tackenberg Benedikt Andrew Latos M.Sc.RWTH Chair and Institute of Industrial Engineering

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

Synchronized Production-Distribution Planning in a Single-Plant Multi- Destination Network

Synchronized Production-Distribution Planning in a Single-Plant Multi- Destination Network Synchronized Production-Distribution Planning in a Single-Plant Multi- Destination Netork Nafee Rizk (nafee.rizk@centor.ulaval.ca), Alain Martel (alain.artel@centor.ulaval.ca) and Sophie D Aours (sophie.daours@forac.ulaval.ca)

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,

More information

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo

More information

Forecasting Financial Indices: The Baltic Dry Indices

Forecasting Financial Indices: The Baltic Dry Indices International Journal of Maritie, Trade & Econoic Issues pp. 109-130 Volue I, Issue (1), 2013 Forecasting Financial Indices: The Baltic Dry Indices Eleftherios I. Thalassinos 1, Mike P. Hanias 2, Panayiotis

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

1 Analysis of heat transfer in a single-phase transformer

1 Analysis of heat transfer in a single-phase transformer Assignent -7 Analysis of heat transr in a single-phase transforer The goal of the first assignent is to study the ipleentation of equivalent circuit ethod (ECM) and finite eleent ethod (FEM) for an electroagnetic

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction TWO-STGE SMPLE DESIGN WITH SMLL CLUSTERS Robert G. Clark and David G. Steel School of Matheatics and pplied Statistics, University of Wollongong, NSW 5 ustralia. (robert.clark@abs.gov.au) Key Words: saple

More information

Combining Classifiers

Combining Classifiers Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007 Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

Homework 3 Solutions CSE 101 Summer 2017

Homework 3 Solutions CSE 101 Summer 2017 Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing

More information

Online Publication Date: 19 April 2012 Publisher: Asian Economic and Social Society

Online Publication Date: 19 April 2012 Publisher: Asian Economic and Social Society Online Publication Date: April Publisher: Asian Econoic and Social Society Using Entropy Working Correlation Matrix in Generalized Estiating Equation for Stock Price Change Model Serpilılıç (Faculty of

More information

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP ISAHP 003, Bali, Indonesia, August 7-9, 003 A OSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP Keun-Tae Cho and Yong-Gon Cho School of Systes Engineering Manageent, Sungkyunkwan University

More information

lecture 36: Linear Multistep Mehods: Zero Stability

lecture 36: Linear Multistep Mehods: Zero Stability 95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Support Vector Machines. Goals for the lecture

Support Vector Machines. Goals for the lecture Support Vector Machines Mark Craven and David Page Coputer Sciences 760 Spring 2018 www.biostat.wisc.edu/~craven/cs760/ Soe of the slides in these lectures have been adapted/borrowed fro aterials developed

More information

Supplier Selection in Closed-loop Supply Chains

Supplier Selection in Closed-loop Supply Chains DECISION SCIENCES INSTITUTE A Multi-Objective Optiization Model for Supplier Selection and Order Allocation in Closed-loop Supply Chains (Full Paper Subission) Karan S., PhD, PE, CQE Assistant Professor

More information

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13 CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence Best Ar Identification: A Unified Approach to Fixed Budget and Fixed Confidence Victor Gabillon Mohaad Ghavazadeh Alessandro Lazaric INRIA Lille - Nord Europe, Tea SequeL {victor.gabillon,ohaad.ghavazadeh,alessandro.lazaric}@inria.fr

More information

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article

More information

Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse

Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse Aerican Journal of Operations Research, 205, 5, 493-502 Published Online Noveber 205 in SciRes. http://www.scirp.org/journal/ajor http://dx.doi.org/0.4236/ajor.205.56038 Matheatical Model and Algorith

More information

Machine Learning Basics: Estimators, Bias and Variance

Machine Learning Basics: Estimators, Bias and Variance Machine Learning Basics: Estiators, Bias and Variance Sargur N. srihari@cedar.buffalo.edu This is part of lecture slides on Deep Learning: http://www.cedar.buffalo.edu/~srihari/cse676 1 Topics in Basics

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

Chapter 6: Economic Inequality

Chapter 6: Economic Inequality Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,

More information

Reduction of Uncertainty in Post-Event Seismic Loss Estimates Using Observation Data and Bayesian Updating

Reduction of Uncertainty in Post-Event Seismic Loss Estimates Using Observation Data and Bayesian Updating Reduction of Uncertainty in Post-Event Seisic Loss Estiates Using Observation Data and Bayesian Updating Maura Torres Subitted in partial fulfillent of the requireents for the degree of Doctor of Philosophy

More information

Stochastic Optimization of Product-Machine Qualification in a Semiconductor Back-end Facility

Stochastic Optimization of Product-Machine Qualification in a Semiconductor Back-end Facility Stochastic Optiization of Product-Machine Qualification in a Seiconductor Back-end Facility Mengying Fu, Ronald Askin, John Fowler, Muhong Zhang School of Coputing, Inforatics, and Systes Engineering,

More information

Construction of an index by maximization of the sum of its absolute correlation coefficients with the constituent variables

Construction of an index by maximization of the sum of its absolute correlation coefficients with the constituent variables Construction of an index by axiization of the su of its absolute correlation coefficients with the constituent variables SK Mishra Departent of Econoics North-Eastern Hill University Shillong (India) I.

More information

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul

More information

Is Walras s Theory So Different From Marshall s?

Is Walras s Theory So Different From Marshall s? Is Walras s Theory So Different Fro Marshall s? Ezra Davar (Independent Researcher) Anon VeTaar 4/1, Netanya 40, Israel E-ail: ezra.davar@gail.co Received: July 17, 014 Accepted: August 5, 014 Published:

More information

MULTIAGENT Resource Allocation (MARA) is the

MULTIAGENT Resource Allocation (MARA) is the EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns

More information

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China 6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith

More information

U V. r In Uniform Field the Potential Difference is V Ed

U V. r In Uniform Field the Potential Difference is V Ed SPHI/W nit 7.8 Electric Potential Page of 5 Notes Physics Tool box Electric Potential Energy the electric potential energy stored in a syste k of two charges and is E r k Coulobs Constant is N C 9 9. E

More information

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT

NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31

More information

A new robust optimization approach for scheduling under uncertainty II. Uncertainty with known probability distribution

A new robust optimization approach for scheduling under uncertainty II. Uncertainty with known probability distribution Coputers and Cheical Engineering 31 (2007) 171 195 A new robust optiization approach for scheduling under uncertainty II. Uncertainty with nown probability distribution Stacy L. Jana, Xiaoxia Lin, Christodoulos

More information

Analysis of Polynomial & Rational Functions ( summary )

Analysis of Polynomial & Rational Functions ( summary ) Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are, Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

On Fuzzy Three Level Large Scale Linear Programming Problem

On Fuzzy Three Level Large Scale Linear Programming Problem J. Stat. Appl. Pro. 3, No. 3, 307-315 (2014) 307 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.12785/jsap/030302 On Fuzzy Three Level Large Scale Linear

More information

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk

More information

Defect-Aware SOC Test Scheduling

Defect-Aware SOC Test Scheduling Defect-Aware SOC Test Scheduling Erik Larsson +, Julien Pouget*, and Zebo Peng + Ebedded Systes Laboratory + LIRMM* Departent of Coputer Science Montpellier 2 University Linköpings universitet CNRS Sweden

More information

Measures of average are called measures of central tendency and include the mean, median, mode, and midrange.

Measures of average are called measures of central tendency and include the mean, median, mode, and midrange. CHAPTER 3 Data Description Objectives Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance,

More information

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost

More information

The S-curve Behaviour of the Trade Balance: A Stepwise Procedure

The S-curve Behaviour of the Trade Balance: A Stepwise Procedure Article The S-curve Behaviour of the Trade Balance: A Stepwise Procedure Foreign Trade Review 52(1) 1 14 2017 Indian Institute of Foreign Trade SAGE Publications sagepub.in/hoe.nav DOI: 10.1177/0015732516650826

More information

The impact of online sales on centralised and decentralised dual-channel supply chains

The impact of online sales on centralised and decentralised dual-channel supply chains European J. Industrial Engineering, Vol. 12, No. 1, 2018 67 The ipact of online sales on centralised and decentralised dual-channel supply chains Ilkyeong Moon Departent of Industrial Engineering, Seoul

More information

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals Estiation of ADC Nonlinearities fro the Measureent in Input Voltage Intervals M. Godla, L. Michaeli, 3 J. Šaliga, 4 R. Palenčár,,3 Deptartent of Electronics and Multiedia Counications, FEI TU of Košice,

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING ASSIGNMENT BOOKLET Bachelor s Degree Prograe (B.Sc./B.A./B.Co.) MTE-14 MATHEMATICAL MODELLING Valid fro 1 st January, 18 to 1 st Deceber, 18 It is copulsory to subit the Assignent before filling in the

More information

Genetic Quantum Algorithm and its Application to Combinatorial Optimization Problem

Genetic Quantum Algorithm and its Application to Combinatorial Optimization Problem Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr

More information

INTEGRATIVE COOPERATIVE APPROACH FOR SOLVING PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES

INTEGRATIVE COOPERATIVE APPROACH FOR SOLVING PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES 8 th International Conference of Modeling and Siulation - MOSIM 10 - May 10-12, 2010 - Haaet - Tunisia Evaluation and optiization of innovative production systes of goods and services INTEGRATIVE COOPERATIVE

More information

On the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual

On the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual 6 IEEE Congress on Evolutionary Coputation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-1, 6 On the Analysis of the Quantu-inspired Evolutionary Algorith with a Single Individual

More information

Hierarchical central place system and agglomeration economies on households

Hierarchical central place system and agglomeration economies on households Hierarchical central place syste and aggloeration econoies on households Daisuke Nakaura, Departent of International Liberal Arts, Fukuoka Woen s University Executive suary Central place theory shows that

More information

OBJECTIVES INTRODUCTION

OBJECTIVES INTRODUCTION M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial

More information

Scheduling Contract Algorithms on Multiple Processors

Scheduling Contract Algorithms on Multiple Processors Fro: AAAI Technical Report FS-0-04. Copilation copyright 200, AAAI (www.aaai.org). All rights reserved. Scheduling Contract Algoriths on Multiple Processors Daniel S. Bernstein, Theodore. Perkins, Shloo

More information

Convexity-Based Optimization for Power-Delay Tradeoff using Transistor Sizing

Convexity-Based Optimization for Power-Delay Tradeoff using Transistor Sizing Convexity-Based Optiization for Power-Delay Tradeoff using Transistor Sizing Mahesh Ketkar, and Sachin S. Sapatnekar Departent of Electrical and Coputer Engineering University of Minnesota, Minneapolis,

More information

Genetic Algorithm Search for Stent Design Improvements

Genetic Algorithm Search for Stent Design Improvements Genetic Algorith Search for Stent Design Iproveents K. Tesch, M.A. Atherton & M.W. Collins, South Bank University, London, UK Abstract This paper presents an optiisation process for finding iproved stent

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3

More information

A multi-model multi-analysis limited area ensemble: calibration issues

A multi-model multi-analysis limited area ensemble: calibration issues - European Centre for Mediu-Range Weather Forecasts - Third International Workshop on Verification Methods Reading 31 Jan 2 Feb. 2007 A ulti-odel ulti-analysis liited area enseble: calibration issues M.

More information

A Finite Element Propagation Model For Extracting Normal Incidence Impedance In Nonprogressive Acoustic Wave Fields

A Finite Element Propagation Model For Extracting Normal Incidence Impedance In Nonprogressive Acoustic Wave Fields NASA Technical Meorandu 110160 A Finite Eleent Propagation Model For Extracting Noral Incidence Ipedance In Nonprogressive Acoustic Wave Fields Willie R. Watson Langley Research Center, Hapton, Virginia

More information

Contingent Stimulus in Crowdfunding

Contingent Stimulus in Crowdfunding Contingent Stiulus in Crowdfunding Longyuan Du, Ming Hu Rotan School of Manageent, University of Toronto, Toronto, Ontario, Canada M5S 3E6 {longyuan.du14@rotan.utoronto.ca, ing.hu@rotan.utoronto.ca} Jiahua

More information

An Introduction to Meta-Analysis

An Introduction to Meta-Analysis An Introduction to Meta-Analysis Douglas G. Bonett University of California, Santa Cruz How to cite this work: Bonett, D.G. (2016) An Introduction to Meta-analysis. Retrieved fro http://people.ucsc.edu/~dgbonett/eta.htl

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

AN IMPROVED FUZZY TIME SERIES THEORY WITH APPLICATIONS IN THE SHANGHAI CONTAINERIZED FREIGHT INDEX

AN IMPROVED FUZZY TIME SERIES THEORY WITH APPLICATIONS IN THE SHANGHAI CONTAINERIZED FREIGHT INDEX Journal of Marine Science and Technology, Vol 5, No, pp 393-398 (01) 393 DOI: 106119/JMST-01-0313-1 AN IMPROVED FUZZY TIME SERIES THEORY WITH APPLICATIONS IN THE SHANGHAI CONTAINERIZED FREIGHT INDEX Ming-Tao

More information

PROXSCAL. Notation. W n n matrix with weights for source k. E n s matrix with raw independent variables F n p matrix with fixed coordinates

PROXSCAL. Notation. W n n matrix with weights for source k. E n s matrix with raw independent variables F n p matrix with fixed coordinates PROXSCAL PROXSCAL perfors ultidiensional scaling of proxiity data to find a leastsquares representation of the obects in a low-diensional space. Individual differences odels can be specified for ultiple

More information

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem J. Stat. Appl. Pro. 6, No. 2, 305-318 2017) 305 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.18576/jsap/060206 On Rough Interval Three evel arge Scale

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version

A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version Made available by Hasselt University Library in Docuent Server@UHasselt Reference (Published version): EGGHE, Leo; Bornann,

More information