Presentation is loading. Please wait.

Presentation is loading. Please wait.

H EURISTIC S OLVER  Builds and tests alternative fuel treatment schedules (solutions) at each iteration  In each iteration:  Evaluates the effects of.

Published byEfren Hoose Modified over 10 years ago

Similar presentations

Presentation on theme: "H EURISTIC S OLVER  Builds and tests alternative fuel treatment schedules (solutions) at each iteration  In each iteration:  Evaluates the effects of."— Presentation transcript:

1 H EURISTIC S OLVER  Builds and tests alternative fuel treatment schedules (solutions) at each iteration  In each iteration:  Evaluates the effects of each alternative schedule on the constraints  Evaluates the expected loss over time  Selects the fuel treatment schedule that provides the minimum overall expected loss over time while satisfying the constraints

2 H EURISTIC S OLVER  Uses Simulated Annealing (SA) Algorithm to select treatments  The SA algorithm is based on simulating cooling of materials in a bath (annealing)  Heuristic optimization technique widely used to solve large combinatorial problems in various fields Assignment/scheduling problems Transportation network problems Manufacturing problems  Monte Carlo approach that uses a local search  A subset of all possible solutions is explored by moving to through neighbor solutions  Some lower quality solutions are accepted to avoid solutions stagnation at local optimum

3 B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT  Assigns fuel treatments to stand polygons (GIS layer)  Treating individual stands is generally not effective at changing fire behavior at the landscape level (Finney 2006)  Solver builds clusters of adjacent polygons to form larger treatment units

4  Clustering adjacent stand polygons No action Select random polygon B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

5  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 5.0 ac Clustered area 5.0 ac No action Selected Adjacent Select random polygon Update cluster area Is current cluster area > minimum cluster area ? Identify adjacent polygons No Select random adjacent polygon B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

6  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 4.5 ac Clustered area 9.5 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

7  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 5.8 ac Clustered area 15.3 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

8  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 6.1 ac Clustered area 21.4 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

9  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 5.2 ac Clustered area 26.6 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

10  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 7.2 ac Clustered area 33.8 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

11  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 8.1 ac Clustered area 41.9 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

12  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 8.8 ac Clustered area 50.7 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

13  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 7.7 ac Clustered area 58.4 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

14  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 7.8 ac Clustered area 74.0 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

15  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 8.9 ac Clustered area 82.9 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

16  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 8.2 ac Clustered area 91.1 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

17  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 7.8 ac Clustered area 98.9 ac No action Selected Adjacent Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

18  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 7.8 ac Clustered area 106.8 ac No action Selected Clustered Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No Stop clustering polygons Yes B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

19  Clustering adjacent stand polygons Minimum cluster 100.0 ac Selected polygon 7.8 ac Clustered area 106.8 ac Select random polygon Identify adjacent polygons Select random adjacent polygon Update cluster area Is current cluster area > minimum cluster area ? No Stop clustering polygons Yes B UILDING C LUSTERS OF P OLYGONS FOR T REATMENT

20 H EURISTIC S OLVER  Objective is to minimize expected loss where : c : Index of grid cells (pixels) t : Index of time period Loss c,t : Expected loss value for grid cell c for period t, based on the flame length predicted by MTT P c,t : Probability of cell c being burned in period t, based on the fire arrival time predicted by MTT

21 S TEPS IN EACH I TERATION Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period

22 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

23 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

24 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

25 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

26 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

27 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

28 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

29 Build or modify a solution (timing and placement of treatments) Is SA stopping criteria met ? No Data passed to Solver: Landscape fuel parameters Fire scenario Objective Function Constraints Adjacent Polygons topography Run MTT for each planning period and retrieve results by pixel ( flame length, arrival time) Calculate objective function value (total expected loss value) Report Best Found Solution Yes Update the landscape fuel parameters for each period S TEPS IN EACH I TERATION

30 T REATMENT S ELECTION  Selection of treatments and location of clusters to develop alternative schedules (solutions) is conducted in two phases  Phase I: Add clusters until the maximum area feasible to treat is reached in each period  Iteration zero – “no action”  Following iterations – randomly locate and add feasible clusters over the landscape  Phase II: Replace clusters with new clusters to find the best allocation and timing of fuel treatments  At each iteration – randomly select a new cluster and remove a previously selected cluster  Continues until stopping rule is reached

31 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

32 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

33 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

34 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

35 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

36 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

37 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

38 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

39 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

40 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

41 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

42 Lower bound Upper bound 400 650 P1 P2  Phase I – add a cluster  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres Numerous tries found no addition clusters could be added without exceeding the 650–ac Upper Bound ===> Go to Phase II T REATMENT S ELECTION

43 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

44 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

45 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

46 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

47 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

48 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

49 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

50 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

51 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

52 Lower bound Upper bound 400 650 P1 P2  Phase II – change cluster locations and timing  Evaluate feasibility  Run MTT algorithm arrival time flame length  Calculate expected loss Period 1 Period 2 Area constraints Period 1  400 – 650 acres Period 2  400 – 650 acres T REATMENT S ELECTION

53 S OLVER P ERFORMANCE  Algorithm performance Phase I Phase II “no action” Expected Loss Iteration Number

54 H ARDWARE R EQUIREMENTS AND S OLUTION T IMES  OptFuels has parallel computing capabilities that use all available processors in a machine  For an area of 34,600 acres with 2 treatment period the solver takes: Computer Type (Processor ) Number of processor/Th reads Processor Speed Iterations per minute Solution times Risk Assessment Run Low Intensity Run (~400 iterations) Regular desktop (Intel Core 2 4300) 21.8 GHz0.4Several minutes 18 hrs Multi-processor Laptop (Intel i7-2720QM) 82.33 GHz2.5Seconds2.5 hrs Multi-processor workstation (Intel Xeon X5570) 82.93 GHz3.5Seconds2 hrs

55 H EURISTIC S OLVER E NHANCEMENTS  Adding selection of individual stands for treatments in the latter stages of Phase II.  This selects individual stands for treatment that lie between treatment clusters where the area is too small to generate another cluster  Adding the ability to schedule treatments to minimize expected loss from two or more fire scenarios.  Different ignition points  Different wind direction and speed  Integrating OptFuels into IFT-DSS

56 R ESULTS A VAILABLE FROM O PT F UELS  Spatial and temporal treatment schedule that can be mapped in GIS  Expected loss  Effects functions evaluated for the treatment schedule could include:  Treatment costs, treatment acres, volumes of treatment products (if any), treatment revenues (if any), sediment yields, resource effects (eg. acres of aspen)  Outputs produced by FlamMap MTT for both the treated and untreated landscapes:  GIS display of flame length and arrival time.  LCP files that could be used for additional FlamMap analyses.  FVS stand parameters for the projected stands for both the treated and untreated landscapes:  Tree species, stand size, stand volume, etc.

57 T HANK Y OU ! Questions?

Download ppt "H EURISTIC S OLVER  Builds and tests alternative fuel treatment schedules (solutions) at each iteration  In each iteration:  Evaluates the effects of."

Similar presentations

Local optimization technique G.Anuradha. Introduction The evaluation function defines a quality measure score landscape/response surface/fitness landscape.

Local optimization technique G.Anuradha. Introduction The evaluation function defines a quality measure score landscape/response surface/fitness landscape.
Decision Support 2010-2011 Andry Pinto Hugo Alves Inês Domingues Luís Rocha Susana Cruz.

Decision Support Andry Pinto Hugo Alves Inês Domingues Luís Rocha Susana Cruz.
ECE 667 Synthesis and Verification of Digital Circuits

ECE 667 Synthesis and Verification of Digital Circuits
Hadi Goudarzi and Massoud Pedram

Hadi Goudarzi and Massoud Pedram
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.

Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Acoustic design by simulated annealing algorithm

Acoustic design by simulated annealing algorithm
Progress in Linear Programming Based Branch-and-Bound Algorithms

Progress in Linear Programming Based Branch-and-Bound Algorithms
Western Wildlands Environmental Threat Assessment Center Wildfire Risk Analysis and Fuel Treatment Planning Alan Ager, Western Wildlands Environmental.

Western Wildlands Environmental Threat Assessment Center Wildfire Risk Analysis and Fuel Treatment Planning Alan Ager, Western Wildlands Environmental.
Landscape Hazard Assessment Past Approaches and Current Modeling Tools.

Landscape Hazard Assessment Past Approaches and Current Modeling Tools.
FORS 8450 Advanced Forest Planning Lecture 12 Tabu Search Change in the Value of a Medium-Sized Forest when Considering Spatial Harvest Scheduling Constraints.

FORS 8450 Advanced Forest Planning Lecture 12 Tabu Search Change in the Value of a Medium-Sized Forest when Considering Spatial Harvest Scheduling Constraints.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.

Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
Markov Decision Models for Order Acceptance/Rejection Problems Florian Defregger and Heinrich Kuhn Florian Defregger and Heinrich Kuhn Catholic University.

Markov Decision Models for Order Acceptance/Rejection Problems Florian Defregger and Heinrich Kuhn Florian Defregger and Heinrich Kuhn Catholic University.
CS244-Introduction to Embedded Systems and Ubiquitous Computing Instructor: Eli Bozorgzadeh Computer Science Department UC Irvine Winter 2010.

CS244-Introduction to Embedded Systems and Ubiquitous Computing Instructor: Eli Bozorgzadeh Computer Science Department UC Irvine Winter 2010.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.

MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering Karen Daniels, Arti Mathur, Roger Grinde University of Massachusetts Lowell.

A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering Karen Daniels, Arti Mathur, Roger Grinde University of Massachusetts Lowell.
1 A Shifting Strategy for Dynamic Channel Assignment under Spatially Varying Demand Harish Rathi Advisors: Prof. Karen Daniels, Prof. Kavitha Chandra Center.

1 A Shifting Strategy for Dynamic Channel Assignment under Spatially Varying Demand Harish Rathi Advisors: Prof. Karen Daniels, Prof. Kavitha Chandra Center.
Reporter : Mac Date : 2012.01.03 Multi-Start Method Rafael Marti.

Reporter : Mac Date : Multi-Start Method Rafael Marti.
Ant Colony Optimization Optimisation Methods. Overview.

Ant Colony Optimization Optimisation Methods. Overview.
Simulated Annealing Van Laarhoven, Aarts Version 1, October 2000.

Simulated Annealing Van Laarhoven, Aarts Version 1, October 2000.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.

1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.

Similar presentations

Ads by Google