5. Fuzzy Optimization

Size: px
Start display at page:

Download "5. Fuzzy Optimization"

Transcription

1 5. Fuzzy Optimization 1. Fuzzine: An Introduction Fuzzy Memberhip Function Memberhip Function Operation Optimization in Fuzzy Environment Fuzzy Set for Water Allocation Fuzzy Set for Reervoir Storage and Releae Target Fuzzy Set for Water Quality Management Summary Additional Reference (Further Reading) 144

2 135 5 Fuzzy Optimization The precie quantification of many ytem performance criteria and parameter and deciion variable i not alway poible, nor i it alway neceary. When the value of variable cannot be preciely pecified, they are aid to be uncertain or fuzzy. If the value are uncertain, probability ditribution may be ued to quantify them. Alternatively, if they are bet decribed by qualitative adjective, uch a dry or wet, hot or cold, clean or dirty, and high or low, fuzzy memberhip function can be ued to quantify them. Both probability ditribution and fuzzy memberhip function of thee uncertain or qualitative variable can be included in quantitative optimization model. Thi chapter introduce fuzzy optimization modelling, again for the preliminary creening of alternative water reource plan and management policie. 1. Fuzzine: An Introduction Large, mall, pure, polluted, atifactory, unatifactory, ufficient, inufficient, excellent, good, fair, poor and o on are word often ued to decribe variou attribute or performance meaure of water reource ytem. Thee decriptor do not have crip, well-defined boundarie that eparate them from other. A particular mix of economic and environmental impact may be more acceptable to ome and le acceptable to other. Plan A i better than Plan B. The water quality and temperature i good for wimming. Thee qualitative, or fuzzy, tatement convey information depite the impreciion of the italicized adjective. Thi chapter illutrate how fuzzy decriptor can be incorporated into optimization model of water reource ytem. Before thi can be done ome definition are needed Fuzzy Memberhip Function Conider a et A of real or integer number ranging from ay 18 to 25. Thu A [18, 25]. In claical (crip) et theory, any number x i either in or not in the et A. The tatement x belong to A i either true or fale depending on the value of x. The et A i referred to a a crip et.if one i not able to ay for certain whether or not any number x i in the et, then the et A could be referred to a fuzzy. The degree of truth attached to that tatement i defined by a memberhip function. Thi function range from 0 (completely fale) to 1 (completely true). Conider the tatement, The water temperature hould be uitable for wimming. Jut what temperature are uitable will depend on the peron aked. It would be difficult for anyone to define preciely thoe temperature that are uitable if it i undertood that temperature outide that range are abolutely not uitable. A memberhip function defining the interval or range of water temperature uitable for wimming i hown in Figure 5.1. Such function may be defined on the bai of the repone of many potential wimmer. There i a zone of impreciion or diagreement at both end of the range. The form or hape of a memberhip function depend on the individual ubjective feeling of the member or individual who are aked their opinion. To define thi particular memberhip function, each individual i could be aked to define hi or her comfortable water temperature interval (T 1i, T 2i ). The memberhip value aociated with any temperature value T equal the number of

3 136 Water Reource Sytem Planning and Management 1 f 1 m A B (x) E020108d C o E C o Figure 5.1. A fuzzy memberhip function for uitability of water temperature for wimming. Figure 5.3. Memberhip function for water temperature that are conidered too cold or too hot. E020108e 1 et A too cold et B too hot C o Figure 5.2. Two memberhip function relating to wimming water temperature. Set A i the et defining the fraction of all individual who think the water temperature i too cold, and Set B define the fraction of all individual who think the water temperature i too hot. individual who place that T within their range (T 1i, T 2i ), divided by the number of individual opinion obtained. The aignment of memberhip value i baed on ubjective judgement, but uch judgement eem to be ufficient for much of human communication Memberhip Function Operation Denote the memberhip function aociated with a fuzzy et A a m A (x). It define the degree or extent to which any value of x belong to the et A. Now conider two fuzzy et, A and B. Set A could be the range of temperature that are conidered too cold, and et B could be the range of temperature that are conidered too hot. Aume thee two et are a hown in Figure 5.2. The degree or extent that a value of x belong to either of two et A or B i the maximum of the two individual memberhip function value. Thi union memberhip function i defined a: m A B (x) maximum(m A (x), m B (x)) (5.1) Thi union et would repreent the range of temperature that are either too cold or too hot, a illutrated in Figure 5.3. The degree or extent that a value of a variable x i imultaneouly in both et A and B i the minimum of the two individual memberhip function value. Thi interection memberhip function i defined a: m A B (x) minimum (m A (x), m B (x)) (5.2) Thi interection et would define the range of temperature that are conidered both too cold and too hot. Of coure it could be an empty et, a indeed it i in thi cae, baed on the two memberhip function hown in Figure 5.2. The minimum of either function for any value of x i 0. The complement of the memberhip function for fuzzy et A i the memberhip function, m A c (x), of A c. m A c (x) 1 m A (x) (5.3) The complement of et A (defined in Figure 5.2) would repreent the range of temperature conidered not too cold for wimming. The complement of et B (alo defined in Figure 5.2) would repreent the range of temperature conidered not too hot for wimming. The complement of the union et a hown in Figure 5.3 would be the range of temperature conidered jut right. Thi complement et i the ame a hown in Figure Optimization in Fuzzy Environment Conider the problem of finding the maximum value of x given that x cannot exceed 11. Thi i written a: Maximize U x (5.4)

4 Fuzzy Optimization 137 U 20 m C 15 x = < 11 U = x 10 E020108j x E020108g maximum feaible value X of U, and x Figure 5.6. Memberhip function repreenting the vicinity of 11. m G (x) 1/{1 [1/(x 10) 2 ]} if x 10 m G (x) 0 otherwie (5.6) Figure 5.4. A plot of the crip optimization problem defined by Equation 5.4 and 5.5. Thi function i hown in Figure 5.5. The contraint on x i that it hould be in the vicinity of 11. Suppoe the reult of a poll aking individual to tate what they conider to be in the vicinity of 11 reult in the following contraint memberhip function, m C (x): m G m C (x) 1/[1 (x 11) 4 ] (5.7) E020108h x Figure 5.5. Memberhip function defining the fraction of individual who think a particular value of x i ubtantially greater than 10. ubject to: x 11 (5.5) The obviou optimal olution, x 11, i hown in Figure 5.4. Now uppoe the objective i to obtain a value of x ubtantially larger than 10 while making ure that the maximum value of x hould be in the vicinity of 11. Thi i no longer a crip optimization problem; rather, it i a fuzzy one. What i perceived to be ubtantially larger than 10 could be defined by a memberhip function, again repreenting the reult of an opinion poll of what individual think i ubtantially larger than 10. Suppoe the memberhip function for thi goal, m G (x), reflecting the reult of uch a poll, can be defined a: Thi memberhip function i hown in Figure 5.6. Recall the objective i to obtain a value of x ubtantially larger than 10 while making ure that the maximum value of x hould be in the vicinity of 11. In thi fuzzy environment the objective i to maximize the extent to which x exceed 10 while keeping x in the vicinity of 11. The olution can be viewed a finding the value of x that maximize the minimum value of both memberhip function. Thu, we can define the interection of both memberhip function and find the value of x that maximize that interection memberhip function. The interection memberhip function i: m D (x) minimum{m G (x), m C (x)} minimum{1/(1 [1/(x 10) 2 ]), 1/(1 (x 11) 4 )} if x 10 0 otherwie (5.8) Thi interection et, and the value of x that maximize it value, i hown in Figure 5.7. Thi fuzzy deciion i the value of x that maximize the interection memberhip function m D (x), or equivalently: Maximize m D (x) max min{m G (x), m C (x)} (5.9) Uing LINGO, the optimal olution i x and m D (x)

5 138 Water Reource Sytem Planning and Management E020108k m D contraint x 3. Fuzzy Set for Water Allocation Next conider the application of fuzzy modelling to the water allocation problem illutrated in Figure 5.8. Aume, a in the previou ue of thi example problem, the problem i to find the allocation of water to each firm that maximize the total benefit TB(X): Maximize TB(X) 6x 1 x 2 1 7x 2 1.5x 2 2 8x 3 x 2 3 (5.10) Thee allocation cannot exceed the amount of water available, Q, le any that mut remain in the river, R. Auming the available flow for allocation, Q R, i 6, the crip optimization problem i to maximize Equation 5.10 ubject to the reource contraint: x 1 x 2 x 3 6 (5.11) The optimal olution i x 1 1, x 2 1, and x 3 4 a previouly obtained in Chapter 4 uing everal different objective Figure 5.7. The interection memberhip function and the value of x that repreent a fuzzy optimal deciion optimization method. The maximum total benefit, TB(X), from Equation 5.10, equal To create a fuzzy equivalent of thi crip model, the objective can be expreed a a memberhip function of the et of all poible objective value. The higher the objective value the greater the memberhip function value. Since memberhip function range from 0 to 1, the objective need to be caled o that it alo range from 0 to 1. The highet value of the objective occur when there i ufficient water to maximize each firm benefit. Thi uncontrained olution would reult in a total benefit of and thi happen when x 1 3, x , and x 3 8. Thu, the objective memberhip function can be expreed by: m(x) 6x 1 x 2 1 7x 2 1.5x 2 2 8x 3 x (5.12) It i obviou that the two function (Equation 5.10 and 5.12) are equivalent. However, the goal of maximizing objective function 5.10 i changed to that of maximizing the degree of reaching the objective target. The optimization problem become: maximize m(x) 6x 1 x 2 1 7x 2 1.5x 2 2 8x 3 x ubject to: x 1 x 2 x 3 6 (5.13) The optimal olution of (5.13) i the ame a (5.10 and 5.11). The optimal degree of atifaction i m(x) Figure 5.8. Three waterconuming firm i obtain benefit B i from their allocation x i of water from a river whoe flow i Q. Q firm 1 B 1 = 6x x x1 x2 firm 3 B 3 = 8x 3 x3 2 x3 firm 2 B 2 = 7x 2 1.5x 2 2 E020108m

6 Fuzzy Optimization 139 m C variable value T 15.6 remark target torage for each period E020108n Q- R Figure 5.9. Memberhip function for about 6 unit more or le. E020827q S 1 S 2 S 3 R1 R2 R reervoir torage volume at beginning of period 1 reervoir torage volume at beginning of period 2 reervoir torage volume at beginning of period 3 reervoir releae during period 1 reervoir releae during period 2 reervoir releae during period 3 Next, aume the amount of reource available to be allocated i limited to about 6 unit more or le, which i a fuzzy contraint. Aume the memberhip function decribing thi contraint i defined by Equation 5.14 and i hown in Figure 5.9. m c (X) 1 if x 1 x 2 x 3 5 m c (X) [7 (x 1 x 2 x 3 )]/2 if 5 x 1 x 2 x 3 7 m c (X) 0 if x 1 x 2 x 3 7 (5.14) The fuzzy optimization problem become: Maximize minimum (m G (X), m C (X)) ubject to: m G (X) 6x 1 x 2 1 7x 2 1.5x 2 2 8x 3 x m C (X) [7 (x 1 x 2 x 3 )]/2 (5.15) Solving (5.15) uing LINGO to find the maximum of a lower bound on each of the two objective, the optimal fuzzy deciion are x , x , x , m(x) 0.67, and the total net benefit, Equation 5.10, i TB(X) Compare thi with the crip olution of x 1 1, x 2 1, x 3 4, and the total net benefit of Fuzzy Set for Reervoir Storage and Releae Target Conider the problem of trying to identify a reervoir torage volume target, T S, for the planning of recreation facilitie given a known minimum releae target, T R, and reervoir capacity K. Aume, in thi imple example, thee known releae and unknown torage target mut apply in each of the three eaon in a year. The objective will be to find the highet value of the torage target, T S, Table 5.1. The LINGO olution to the reervoir optimization problem. that minimize the um of quared deviation from actual torage volume and releae le than the minimum releae target. Given a equence of inflow, Q t, the optimization model i: 3 Minimize D (T S S t ) 2 DR 2 t 01T S (5.16) t ubject to: S t Q t R t S t 1 t 1, 2, 3; if t 3, t 1 1 (5.17) S t K t 1, 2, 3 (5.18) R t T R DR t t 1, 2, 3 (5.19) Aume K 20, T R 25 and the inflow Q t are 5, 50 and 20 for period t 1, 2 and 3. The optimal olution, yielding an objective value of 184.4, obtained by LINGO i lited in Table 5.1. Now conider changing the objective function into maximizing the weighted degree of atifying the reervoir torage volume and releae target. Maximize (w S m St w R m Rt ) (5.20) t where w S and w R are weight indicating the relative importance of torage volume target and releae target repectively. The variable m St are the degree of atifying torage volume target in the three period t, expreed by Equation The variable m Rt are the degree of atifying releae target in period t, expreed by Equation m S = { S t /T S for S t T S (5.21) (K S t )/(K T S ) for T S S t m R = R t /T R for R t T R (5.22) { 1 for Rt T R

7 140 Water Reource Sytem Planning and Management m S variabl e value degree 2.48 remark total weighted um memberhip function value E T 20 target torage volume E020108o 0 T K torage St S 1 S 2 S torage volume at beginning of period 1 torage volume at beginning of period 2 torage volume at beginning of period 3 Figure Memberhip function for torage volume. R1 R2 R reervoir releae in period 1 reervoir releae in period 2 reervoir releae in period 3 E020108p m R T R Figure Memberhip function for releae releae Rt M1 M2 M3 M1 M 2 M3 R M1 R M 2 R M um weighted memberhip value period 1 um weighted memberhip value period 2 um weighted memberhip value period 3 torage volume memberhip value period 1 torage volume memberhip value period 2 torage volume memberhip value period 3 reervoir releae memberhip value period 1 reervoir releae memberhip value period 2 reervoir releae memberhip value period 3 Box 5.1. Reervoir model written for olution by LINGO SETS: PERIODS /1..3/: I, R, m, m, mr, 1, 2, m1, m2; NUMBERS /1..4/: S; ENDSETS!*** OBJECTIVE ***; max = degree + 01*TS;!Initial condition; (1) = (TN + 1);!Total degree of atifaction; degree m(t));!weighted degree in period (PERIODS(t): m(t) = w*m(t) + wr*mr(t); S(t) = 1(t) + 2(t); 1(t) < TS ; 2(t) < K TS ;!m(t) = (1(t)/TS) (2(t)/(K TS)) = rewritten in cae dividing by 0; m1(t)*ts = 1(t); m2(t)*(k TS) = 2(t); m(t) = m1(t) m2(t); mr(t) < R(t)/TR ; mr(t) < 1; S(t+1) = S(t) + I(t) R(t);); DATA: TN = 3; K = 20; w =?; wr =?; I = 5, 50, 20; TR = 25; ENDDATA Equation 5.21 and 5.22 are hown in Figure 5.10 and 5.11, repectively. Thi optimization problem written for olution uing LINGO i a hown in Box 5.1. Given weight w S 0.4 and w R 0.6, the optimal olution obtained from olving the model hown in Box 5.1 uing LINGO i lited in Table 5.2. E020903d Table 5.2. Solution of fuzzy model for reervoir torage volume and releae baed on objective If the objective Equation 5.20 i changed to one of maximizing the minimum memberhip function value, the objective become: Maximize m min maximize minimum {m St, m Rt } (5.23) A common lower bound i et on each memberhip function, m St and m Rt, and thi variable i maximized. The optimal olution change omewhat and i a hown in Table 5.3. Thi olution differ from that hown in Table 5.2 primarily in the value of the memberhip function. The target torage volume operating variable value, T S, tay the ame in thi example. 5. Fuzzy Set for Water Quality Management Conider the tream pollution problem illutrated in Figure The tream receive wate from ource

8 Fuzzy Optimization 141 located at Site 1 and 2. Without ome wate treatment at thee ite, the pollutant concentration at Site 2 and 3 will exceed the maximum deired concentration. The problem i to find the level, x i, of watewater treatment (fraction of wate removed) at Site i 1 and 2 required to meet the quality tandard at Site 2 and 3 at a variable value remark MMF T S 1 S 2 S 3 R1 R2 R3 M1 M2 M3 R M1 R M2 R M minimum memberhip function value target torage volume torage volume at beginning of period 1 torage volume at beginning of period 2 torage volume at beginning of period 3 reervoir releae in period 1 reervoir releae in period 2 reervoir releae in period 3 torage volume memberhip value period 1 torage volume memberhip value period 2 torage volume memberhip value period 3 reervoir releae memberhip value period 1 reervoir releae memberhip value period 2 reervoir releae memberhip value period 3 Table 5.3. Optimal olution of reervoir operation model baed on objective E020827t minimum total cot. The data ued for the problem hown in Figure 5.12 are lited in Table 5.4. The crip model for thi problem, a dicued in the previou chapter, i: Minimize C 1 (x 1 ) C 2 (x 2 ) (5.24) ubject to: Water quality contraint at ite 2: max [P 1 Q 1 W 1 (1 x 1 )]a 12 /Q 2 P 2 [(32)(10) (1 x 1 )/86.4] 0.25/12 20 which, when implified, i: x Water quality contraint at ite 3: {[P 1 Q 1 W 1 (1 x 1 )]a 13 max [W 2 (1 x 2 )]a 23 }/Q 3 P 3 {[(32)(10) (1 x 1 )/86.4] 0.15 [80000(1 x 2 )/86.4] 0.60}/13 20 which, when implified, i: x x (5.25) (5.26) Retriction on fraction of wate removal: 0 x i for ite i 1 and 2 (5.27) For a wide range of reaonable cot, the optimal olution found uing linear programming wa 0.78 and 0.79, or eentially 80% removal efficiencie at Site 1 and 2. Compare thi olution with that of the following fuzzy model. To develop a fuzzy verion of thi problem, uppoe the maximum allowable pollutant concentration in the tream at Site 2 and 3 were expreed a about 20 mg/l or le. Obtaining opinion of individual of what firm 1 recreation producing W1 park treamflow Q ite 1 W1 ( 1 x1) ite 2 W2 ( 1 x2) ite 3 Figure A tream pollution problem of finding the wate removal efficiencie (x 1, x 2 ) that meet the tream quality tandard at leat cot. firm 2 producing W 2 E020108q

9 142 Water Reource Sytem Planning and Management Table 5.4. Parameter value elected for the water quality management problem illutrated in Figure parameter flow wate Q1 m 3 / 10 flow jut uptream of ite 1 Q 2 Q 3 W1 kg/day 250,000 pollutant ma produced at ite 1 W 2 unit m 3 / m 3 / kg/day value remark 12 flow jut uptream of ite 2 13 flow at park 80,000 pollutant ma produced at ite 2 E020827u pollutant conc. P1 mg/l 32 concentration jut uptream of ite 1 P 2 P 3 mg/l mg/l 20 maximum allowable concentration uptream of 2 20 maximum allowable concentration at ite 3 decay fraction a 12 a 13 a fraction of ite 1 pollutant ma at ite fraction of ite 1 pollutant ma at ite fraction of ite 2 pollutant ma at ite 2 m m τ E020108r concentration E % treatment efficiency x i Figure Memberhip function for about 20 mg/l or le. Figure Memberhip function for bet available treatment technology. they conider to be 20 mg/l or le, a memberhip function can be defined. Aume it i a hown in Figure Next, aume that the government environmental agency expect each polluter to intall bet available technology (BAT) or to carry out bet management practice (BMP) regardle of whether or not thi i required to meet tream-quality tandard. Aking expert jut what BAT or BMP mean with repect to treatment efficiencie could reult in a variety of anwer. Thee repone can be ued to define memberhip function for each of the two firm in thi example. Aume thee memberhip function for both firm are a hown in Figure Finally, aume there i a third concern that ha to do with equity. It i expected that no polluter hould be required to treat at a much higher efficiency than any other polluter. A memberhip function defining jut what difference are acceptable or equitable could quantify thi concern. Aume uch a memberhip function i a hown in Figure Conidering each of thee memberhip function a objective, a number of fuzzy optimization model can be defined. One i to find the treatment efficiencie that maximize the minimum value of each of thee memberhip function. Maximize m max min{m P, m T, m E } (5.28)

10 Fuzzy Optimization 143 m E variable M value 0.93 remark minimum memberhip value E020827v E020108t If we aume that the pollutant concentration at ite j 2 and 3 will not exceed 23 mg/l, the pollutant concentration memberhip function m Pj are: m Pj 1 p 2j /5 (5.29) The pollutant concentration at each ite j i the um of two component: p j p 1j p 2j (5.30) where p 1j 18 (5.31) p 2j (23 18) (5.32) If we aume the treatment plant efficiencie will be between 70 and 90% at both Site i 1 and 2, the treatment technology memberhip function m Ti are: m Ti (x 2i /5) (x 4i /0.10) (5.33) and the treatment efficiencie are: x i 0.70 x 2i x 3i x 4i (5.34) where x 2i 5 (5.35) x 3i 5 (5.36) x 4i 0.10 (5.37) Finally, auming the difference between treatment efficiencie will be no greater than 14, the equity memberhip function, m E, i: m E Z (/5) D 1 (1 Z) (/(0.14 5)) D 2 (5.38) where D 1 5Z (5.39) x 1 - x 2 Figure Equity memberhip function in term of the abolute difference between the two treatment efficiencie. 14 X1 X2 P2 P3 p M 2 p M treatment efficiency at ite 1 treatment efficiency at ite 2 pollutant concentration jut uptream of ite 2 pollutant concentration jut uptream of ite 3 memberhip value for pollutant concentration ite 2 memberhip value for pollutant concentration ite 3 MT memberhip value for treatment level ite 1 MT memberhip value for treatment level ite 2 ME 0 memberhip value for difference in treatment Table 5.5. Solution to fuzzy water quality management model Equation 5.28 to D 2 (0.14 5) (1 Z) (5.40) x 1 x 2 DP DM (5.41) DP DM D 1 5(1 Z) D 2 (5.42) Z i a binary 0, 1 variable. (5.43) The remainder of the water quality model remain the ame: Water quality contraint at ite 2: [P 1 Q 1 W 1 (1 x 1 )] a 12 /Q 2 P 2 (5.44) [(32)(10) (1 x 1 )/86.4] 0.25/12 P 2 Water quality contraint at ite 3: {[P 1 Q 1 W 1 (1 x 1 )] a 13 [W 2 (1 x 2 )] a 23 }/Q 3 P 3 (5.45) {[(32)(10) (1 x 1 )/86.4] 0.15 [80000(1 x 2 )/86.4] 0.60}/13 P 3 Retriction on fraction of wate removal: 0 x i for ite i 1 and 2. (5.46) Solving thi fuzzy model uing LINGO yield the reult hown in Table 5.5. Thi olution confirm the aumption made when contructing the repreentation of the memberhip function in the model. It i alo very imilar to the leat-cot olution found from olving the crip LP model.

11 144 Water Reource Sytem Planning and Management 6. Summary Optimization model incorporating fuzzy memberhip function are ometime appropriate when only qualitative tatement are made when tating objective and/or contraint of a particular water management problem or iue. Thi chapter ha hown how fuzzy optimization can be applied to ome imple example problem aociated with water allocation, reervoir operation, and pollution control. Thi ha been only an introduction. Thoe intereted in more detailed explanation and application may refer to any of the additional reference lited in the next ection. 7. Additional Reference (Further Reading) BARDOSSY, A. and DUCKSTEIN, L Fuzzy rulebaed modeling with application to geophyical, biological, and engineering ytem. Boca Raton, Fla., CRC Pre. CHEN, S.Y Theory and application of fuzzy ytem deciion-making. Dalian, China, Dalian Univerity of Technology Pre. (In Chinee.). KINDLER, J Rationalizing water requirement with aid of fuzzy allocation model. Journal of Water Reource Planning and Management, ASCE, Vol. 118, No. 3, pp KUNDZEWICZ, W. (ed.) New uncertainty concept in hydrology and water reource. Cambridge, UK, Cambridge Univerity Pre. LOOTSMA, F.A Fuzzy logic for planning and deciion-making. Boton, Ma., Kluwer Academic. TERANO, T.; ASAI, K. and SUGENO, M Fuzzy ytem theory and it application. San Diego, Calif., Academic Pre. TILMANT, A.; VANCLOSSTER, M.; DUCKSTEIN, L. and PERSOONNS, E Comparion of fuzzy and nonfuzzy optimal reervoir operating policie, Journal of Water Reource Planning and Management, ASCE, Vol. 128, No. 6, pp ZHOU, H.-C Note on fuzzy optimization and application. Dalian, China, Dalian Univerity of Technology Pre. ZIMMERMANN, H.-J Fuzzy et, deciion-making, and expert ytem. Boton, Ma., Kluwer Academic.

12

VI Fuzzy Optimization

VI Fuzzy Optimization VI Fuzzy Optimization 1. Fuzziness, an introduction 2. Fuzzy membership functions 2.1 Membership function operations 3. Optimization in fuzzy environments 3.1 Water allocation 3.2 Reservoir storage and

More information

Social Studies 201 Notes for November 14, 2003

Social Studies 201 Notes for November 14, 2003 1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the

More information

Social Studies 201 Notes for March 18, 2005

Social Studies 201 Notes for March 18, 2005 1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the

More information

Lecture 4 (Fuzzy Set Operations)

Lecture 4 (Fuzzy Set Operations) http://experty.4t.com Lecture 4 (Fuzzy Set Operation) We need a radically different kind of mathematic, the mathematic of fuzzy or cloudy quantitie which are not decribable in term of probability ditribution

More information

7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281

7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281 72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition

More information

Source slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis

Source slideplayer.com/fundamentals of Analytical Chemistry, F.J. Holler, S.R.Crouch. Chapter 6: Random Errors in Chemical Analysis Source lideplayer.com/fundamental of Analytical Chemitry, F.J. Holler, S.R.Crouch Chapter 6: Random Error in Chemical Analyi Random error are preent in every meaurement no matter how careful the experimenter.

More information

Problem Set 8 Solutions

Problem Set 8 Solutions Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem

More information

Evolutionary Algorithms Based Fixed Order Robust Controller Design and Robustness Performance Analysis

Evolutionary Algorithms Based Fixed Order Robust Controller Design and Robustness Performance Analysis Proceeding of 01 4th International Conference on Machine Learning and Computing IPCSIT vol. 5 (01) (01) IACSIT Pre, Singapore Evolutionary Algorithm Baed Fixed Order Robut Controller Deign and Robutne

More information

Preemptive scheduling on a small number of hierarchical machines

Preemptive scheduling on a small number of hierarchical machines Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,

More information

Lecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004

Lecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004 18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem

More information

Bogoliubov Transformation in Classical Mechanics

Bogoliubov Transformation in Classical Mechanics Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How

More information

Multi-dimensional Fuzzy Euler Approximation

Multi-dimensional Fuzzy Euler Approximation Mathematica Aeterna, Vol 7, 2017, no 2, 163-176 Multi-dimenional Fuzzy Euler Approximation Yangyang Hao College of Mathematic and Information Science Hebei Univerity, Baoding 071002, China hdhyywa@163com

More information

IEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation

IEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation IEOR 316: Fall 213, Profeor Whitt Topic for Dicuion: Tueday, November 19 Alternating Renewal Procee and The Renewal Equation 1 Alternating Renewal Procee An alternating renewal proce alternate between

More information

Multicolor Sunflowers

Multicolor Sunflowers Multicolor Sunflower Dhruv Mubayi Lujia Wang October 19, 2017 Abtract A unflower i a collection of ditinct et uch that the interection of any two of them i the ame a the common interection C of all of

More information

Fermi Distribution Function. n(e) T = 0 T > 0 E F

Fermi Distribution Function. n(e) T = 0 T > 0 E F LECTURE 3 Maxwell{Boltzmann, Fermi, and Boe Statitic Suppoe we have a ga of N identical point particle in a box ofvolume V. When we ay \ga", we mean that the particle are not interacting with one another.

More information

Singular perturbation theory

Singular perturbation theory Singular perturbation theory Marc R. Rouel June 21, 2004 1 Introduction When we apply the teady-tate approximation (SSA) in chemical kinetic, we typically argue that ome of the intermediate are highly

More information

Improving the Efficiency of a Digital Filtering Scheme for Diabatic Initialization

Improving the Efficiency of a Digital Filtering Scheme for Diabatic Initialization 1976 MONTHLY WEATHER REVIEW VOLUME 15 Improving the Efficiency of a Digital Filtering Scheme for Diabatic Initialization PETER LYNCH Met Éireann, Dublin, Ireland DOMINIQUE GIARD CNRM/GMAP, Météo-France,

More information

Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions

Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions Stochatic Optimization with Inequality Contraint Uing Simultaneou Perturbation and Penalty Function I-Jeng Wang* and Jame C. Spall** The John Hopkin Univerity Applied Phyic Laboratory 11100 John Hopkin

More information

Control Systems Analysis and Design by the Root-Locus Method

Control Systems Analysis and Design by the Root-Locus Method 6 Control Sytem Analyi and Deign by the Root-Locu Method 6 1 INTRODUCTION The baic characteritic of the tranient repone of a cloed-loop ytem i cloely related to the location of the cloed-loop pole. If

More information

Lecture 8: Period Finding: Simon s Problem over Z N

Lecture 8: Period Finding: Simon s Problem over Z N Quantum Computation (CMU 8-859BB, Fall 205) Lecture 8: Period Finding: Simon Problem over Z October 5, 205 Lecturer: John Wright Scribe: icola Rech Problem A mentioned previouly, period finding i a rephraing

More information

(b) Is the game below solvable by iterated strict dominance? Does it have a unique Nash equilibrium?

(b) Is the game below solvable by iterated strict dominance? Does it have a unique Nash equilibrium? 14.1 Final Exam Anwer all quetion. You have 3 hour in which to complete the exam. 1. (60 Minute 40 Point) Anwer each of the following ubquetion briefly. Pleae how your calculation and provide rough explanation

More information

μ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =

μ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL = Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient

More information

NCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011

NCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011 NCAAPMT Calculu Challenge 011 01 Challenge #3 Due: October 6, 011 A Model of Traffic Flow Everyone ha at ome time been on a multi-lane highway and encountered road contruction that required the traffic

More information

Convex Hulls of Curves Sam Burton

Convex Hulls of Curves Sam Burton Convex Hull of Curve Sam Burton 1 Introduction Thi paper will primarily be concerned with determining the face of convex hull of curve of the form C = {(t, t a, t b ) t [ 1, 1]}, a < b N in R 3. We hall

More information

List coloring hypergraphs

List coloring hypergraphs Lit coloring hypergraph Penny Haxell Jacque Vertraete Department of Combinatoric and Optimization Univerity of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematic Univerity

More information

Design By Emulation (Indirect Method)

Design By Emulation (Indirect Method) Deign By Emulation (Indirect Method he baic trategy here i, that Given a continuou tranfer function, it i required to find the bet dicrete equivalent uch that the ignal produced by paing an input ignal

More information

Suggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall

Suggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall

More information

UNIT 15 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS

UNIT 15 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS UNIT 1 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS Structure 1.1 Introduction Objective 1.2 Redundancy 1.3 Reliability of k-out-of-n Sytem 1.4 Reliability of Standby Sytem 1. Summary 1.6 Solution/Anwer

More information

Physics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014

Physics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014 Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion

More information

Codes Correcting Two Deletions

Codes Correcting Two Deletions 1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of

More information

ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang

ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang

More information

into a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get

into a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get Lecture 25 Introduction to Some Matlab c2d Code in Relation to Sampled Sytem here are many way to convert a continuou time function, { h( t) ; t [0, )} into a dicrete time function { h ( k) ; k {0,,, }}

More information

Convergence criteria and optimization techniques for beam moments

Convergence criteria and optimization techniques for beam moments Pure Appl. Opt. 7 (1998) 1221 1230. Printed in the UK PII: S0963-9659(98)90684-5 Convergence criteria and optimization technique for beam moment G Gbur and P S Carney Department of Phyic and Atronomy and

More information

In presenting the dissertation as a partial fulfillment of the requirements for an advanced degree from the Georgia Institute of Technology, I agree

In presenting the dissertation as a partial fulfillment of the requirements for an advanced degree from the Georgia Institute of Technology, I agree In preenting the diertation a a partial fulfillment of the requirement for an advanced degree from the Georgia Intitute of Technology, I agree that the Library of the Intitute hall make it available for

More information

CHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS

CHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS Copyright 22 IFAC 5th Triennial World Congre, Barcelona, Spain CHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS Tritan Pérez Graham C. Goodwin Maria M. Serón Department of Electrical

More information

CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS

CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.1 INTRODUCTION 8.2 REDUCED ORDER MODEL DESIGN FOR LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.3

More information

Comparing Means: t-tests for Two Independent Samples

Comparing Means: t-tests for Two Independent Samples Comparing ean: t-tet for Two Independent Sample Independent-eaure Deign t-tet for Two Independent Sample Allow reearcher to evaluate the mean difference between two population uing data from two eparate

More information

The Impact of Imperfect Scheduling on Cross-Layer Rate. Control in Multihop Wireless Networks

The Impact of Imperfect Scheduling on Cross-Layer Rate. Control in Multihop Wireless Networks The mpact of mperfect Scheduling on Cro-Layer Rate Control in Multihop Wirele Network Xiaojun Lin and Ne B. Shroff Center for Wirele Sytem and Application (CWSA) School of Electrical and Computer Engineering,

More information

CDMA Signature Sequences with Low Peak-to-Average-Power Ratio via Alternating Projection

CDMA Signature Sequences with Low Peak-to-Average-Power Ratio via Alternating Projection CDMA Signature Sequence with Low Peak-to-Average-Power Ratio via Alternating Projection Joel A Tropp Int for Comp Engr and Sci (ICES) The Univerity of Texa at Autin 1 Univerity Station C0200 Autin, TX

More information

Lecture 9: Shor s Algorithm

Lecture 9: Shor s Algorithm Quantum Computation (CMU 8-859BB, Fall 05) Lecture 9: Shor Algorithm October 7, 05 Lecturer: Ryan O Donnell Scribe: Sidhanth Mohanty Overview Let u recall the period finding problem that wa et up a a function

More information

Clustering Methods without Given Number of Clusters

Clustering Methods without Given Number of Clusters Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,

More information

Optimal Coordination of Samples in Business Surveys

Optimal Coordination of Samples in Business Surveys Paper preented at the ICES-III, June 8-, 007, Montreal, Quebec, Canada Optimal Coordination of Sample in Buine Survey enka Mach, Ioana Şchiopu-Kratina, Philip T Rei, Jean-Marc Fillion Statitic Canada New

More information

Given the following circuit with unknown initial capacitor voltage v(0): X(s) Immediately, we know that the transfer function H(s) is

Given the following circuit with unknown initial capacitor voltage v(0): X(s) Immediately, we know that the transfer function H(s) is EE 4G Note: Chapter 6 Intructor: Cheung More about ZSR and ZIR. Finding unknown initial condition: Given the following circuit with unknown initial capacitor voltage v0: F v0/ / Input xt 0Ω Output yt -

More information

Automatic Control Systems. Part III: Root Locus Technique

Automatic Control Systems. Part III: Root Locus Technique www.pdhcenter.com PDH Coure E40 www.pdhonline.org Automatic Control Sytem Part III: Root Locu Technique By Shih-Min Hu, Ph.D., P.E. Page of 30 www.pdhcenter.com PDH Coure E40 www.pdhonline.org VI. Root

More information

1. The F-test for Equality of Two Variances

1. The F-test for Equality of Two Variances . The F-tet for Equality of Two Variance Previouly we've learned how to tet whether two population mean are equal, uing data from two independent ample. We can alo tet whether two population variance are

More information

A BATCH-ARRIVAL QUEUE WITH MULTIPLE SERVERS AND FUZZY PARAMETERS: PARAMETRIC PROGRAMMING APPROACH

A BATCH-ARRIVAL QUEUE WITH MULTIPLE SERVERS AND FUZZY PARAMETERS: PARAMETRIC PROGRAMMING APPROACH Mathematical and Computational Application Vol. 11 No. pp. 181-191 006. Aociation for Scientific Reearch A BATCH-ARRIVA QEE WITH MTIPE SERVERS AND FZZY PARAMETERS: PARAMETRIC PROGRAMMING APPROACH Jau-Chuan

More information

Computers and Mathematics with Applications. Sharp algebraic periodicity conditions for linear higher order

Computers and Mathematics with Applications. Sharp algebraic periodicity conditions for linear higher order Computer and Mathematic with Application 64 (2012) 2262 2274 Content lit available at SciVere ScienceDirect Computer and Mathematic with Application journal homepage: wwweleviercom/locate/camwa Sharp algebraic

More information

RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS

RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS www.arpapre.com/volume/vol29iue1/ijrras_29_1_01.pdf RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS Sevcan Demir Atalay 1,* & Özge Elmataş Gültekin

More information

Extending MFM Function Ontology for Representing Separation and Conversion in Process Plant

Extending MFM Function Ontology for Representing Separation and Conversion in Process Plant Downloaded from orbit.dtu.dk on: Oct 05, 2018 Extending MFM Function Ontology for Repreenting Separation and Converion in Proce Plant Zhang, Xinxin; Lind, Morten; Jørgenen, Sten Bay; Wu, Jing; Karnati,

More information

Z a>2 s 1n = X L - m. X L = m + Z a>2 s 1n X L = The decision rule for this one-tail test is

Z a>2 s 1n = X L - m. X L = m + Z a>2 s 1n X L = The decision rule for this one-tail test is M09_BERE8380_12_OM_C09.QD 2/21/11 3:44 PM Page 1 9.6 The Power of a Tet 9.6 The Power of a Tet 1 Section 9.1 defined Type I and Type II error and their aociated rik. Recall that a repreent the probability

More information

Fast Convolutional Sparse Coding (FCSC)

Fast Convolutional Sparse Coding (FCSC) Fat Convolutional Spare Coding (FCSC) Bailey ong Department of Computer Science Univerity of California, Irvine bhkong@ic.uci.edu Charle C. Fowlke Department of Computer Science Univerity of California,

More information

Nonlinear Single-Particle Dynamics in High Energy Accelerators

Nonlinear Single-Particle Dynamics in High Energy Accelerators Nonlinear Single-Particle Dynamic in High Energy Accelerator Part 6: Canonical Perturbation Theory Nonlinear Single-Particle Dynamic in High Energy Accelerator Thi coure conit of eight lecture: 1. Introduction

More information

SERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lectures 41-48)

SERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lectures 41-48) Chapter 5 SERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lecture 41-48) 5.1 Introduction Power ytem hould enure good quality of electric power upply, which mean voltage and current waveform hould

More information

DYNAMIC MODELS FOR CONTROLLER DESIGN

DYNAMIC MODELS FOR CONTROLLER DESIGN DYNAMIC MODELS FOR CONTROLLER DESIGN M.T. Tham (996,999) Dept. of Chemical and Proce Engineering Newcatle upon Tyne, NE 7RU, UK.. INTRODUCTION The problem of deigning a good control ytem i baically that

More information

An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem

An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem An Inequality for Nonnegative Matrice and the Invere Eigenvalue Problem Robert Ream Program in Mathematical Science The Univerity of Texa at Dalla Box 83688, Richardon, Texa 7583-688 Abtract We preent

More information

DIFFERENTIAL EQUATIONS

DIFFERENTIAL EQUATIONS DIFFERENTIAL EQUATIONS Laplace Tranform Paul Dawkin Table of Content Preface... Laplace Tranform... Introduction... The Definition... 5 Laplace Tranform... 9 Invere Laplace Tranform... Step Function...4

More information

Optimization model in Input output analysis and computable general. equilibrium by using multiple criteria non-linear programming.

Optimization model in Input output analysis and computable general. equilibrium by using multiple criteria non-linear programming. Optimization model in Input output analyi and computable general equilibrium by uing multiple criteria non-linear programming Jing He * Intitute of ytem cience, cademy of Mathematic and ytem cience Chinee

More information

CONGESTION control is a key functionality in modern

CONGESTION control is a key functionality in modern IEEE TRANSACTIONS ON INFORMATION TEORY, VOL. X, NO. X, XXXXXXX 2008 On the Connection-Level Stability of Congetion-Controlled Communication Network Xiaojun Lin, Member, IEEE, Ne B. Shroff, Fellow, IEEE,

More information

The Laplace Transform , Haynes Miller and Jeremy Orloff

The Laplace Transform , Haynes Miller and Jeremy Orloff The Laplace Tranform 8.3, Hayne Miller and Jeremy Orloff Laplace tranform baic: introduction An operator take a function a input and output another function. A tranform doe the ame thing with the added

More information

THE STOCHASTIC SCOUTING PROBLEM. Ana Isabel Barros

THE STOCHASTIC SCOUTING PROBLEM. Ana Isabel Barros THE STOCHASTIC SCOUTING PROBLEM Ana Iabel Barro TNO, P.O. Box 96864, 2509 JG The Hague, The Netherland and Faculty of Military Science, Netherland Defence Academy, P.O. Box 10000, 1780 CA Den Helder, The

More information

Unavoidable Cycles in Polynomial-Based Time-Invariant LDPC Convolutional Codes

Unavoidable Cycles in Polynomial-Based Time-Invariant LDPC Convolutional Codes European Wirele, April 7-9,, Vienna, Autria ISBN 978--87-4-9 VE VERLAG GMBH Unavoidable Cycle in Polynomial-Baed Time-Invariant LPC Convolutional Code Hua Zhou and Norbert Goertz Intitute of Telecommunication

More information

Electronic Theses and Dissertations

Electronic Theses and Dissertations Eat Tenneee State Univerity Digital Common @ Eat Tenneee State Univerity Electronic Thee and Diertation Student Work 5-208 Vector Partition Jennifer French Eat Tenneee State Univerity Follow thi and additional

More information

Dimensional Analysis A Tool for Guiding Mathematical Calculations

Dimensional Analysis A Tool for Guiding Mathematical Calculations Dimenional Analyi A Tool for Guiding Mathematical Calculation Dougla A. Kerr Iue 1 February 6, 2010 ABSTRACT AND INTRODUCTION In converting quantitie from one unit to another, we may know the applicable

More information

Theoretical Computer Science. Optimal algorithms for online scheduling with bounded rearrangement at the end

Theoretical Computer Science. Optimal algorithms for online scheduling with bounded rearrangement at the end Theoretical Computer Science 4 (0) 669 678 Content lit available at SciVere ScienceDirect Theoretical Computer Science journal homepage: www.elevier.com/locate/tc Optimal algorithm for online cheduling

More information

NONISOTHERMAL OPERATION OF IDEAL REACTORS Plug Flow Reactor

NONISOTHERMAL OPERATION OF IDEAL REACTORS Plug Flow Reactor NONISOTHERMAL OPERATION OF IDEAL REACTORS Plug Flow Reactor T o T T o T F o, Q o F T m,q m T m T m T mo Aumption: 1. Homogeneou Sytem 2. Single Reaction 3. Steady State Two type of problem: 1. Given deired

More information

Suggestions - Problem Set (a) Show the discriminant condition (1) takes the form. ln ln, # # R R

Suggestions - Problem Set (a) Show the discriminant condition (1) takes the form. ln ln, # # R R Suggetion - Problem Set 3 4.2 (a) Show the dicriminant condition (1) take the form x D Ð.. Ñ. D.. D. ln ln, a deired. We then replace the quantitie. 3ß D3 by their etimate to get the proper form for thi

More information

online learning Unit Workbook 4 RLC Transients

online learning Unit Workbook 4 RLC Transients online learning Pearon BTC Higher National in lectrical and lectronic ngineering (QCF) Unit 5: lectrical & lectronic Principle Unit Workbook 4 in a erie of 4 for thi unit Learning Outcome: RLC Tranient

More information

Solving Differential Equations by the Laplace Transform and by Numerical Methods

Solving Differential Equations by the Laplace Transform and by Numerical Methods 36CH_PHCalter_TechMath_95099 3//007 :8 PM Page Solving Differential Equation by the Laplace Tranform and by Numerical Method OBJECTIVES When you have completed thi chapter, you hould be able to: Find the

More information

CS 170: Midterm Exam II University of California at Berkeley Department of Electrical Engineering and Computer Sciences Computer Science Division

CS 170: Midterm Exam II University of California at Berkeley Department of Electrical Engineering and Computer Sciences Computer Science Division 1 1 April 000 Demmel / Shewchuk CS 170: Midterm Exam II Univerity of California at Berkeley Department of Electrical Engineering and Computer Science Computer Science Diviion hi i a cloed book, cloed calculator,

More information

Lecture 17: Analytic Functions and Integrals (See Chapter 14 in Boas)

Lecture 17: Analytic Functions and Integrals (See Chapter 14 in Boas) Lecture 7: Analytic Function and Integral (See Chapter 4 in Boa) Thi i a good point to take a brief detour and expand on our previou dicuion of complex variable and complex function of complex variable.

More information

The Secret Life of the ax + b Group

The Secret Life of the ax + b Group The Secret Life of the ax + b Group Linear function x ax + b are prominent if not ubiquitou in high chool mathematic, beginning in, or now before, Algebra I. In particular, they are prime exhibit in any

More information

HELICAL TUBES TOUCHING ONE ANOTHER OR THEMSELVES

HELICAL TUBES TOUCHING ONE ANOTHER OR THEMSELVES 15 TH INTERNATIONAL CONFERENCE ON GEOMETRY AND GRAPHICS 0 ISGG 1-5 AUGUST, 0, MONTREAL, CANADA HELICAL TUBES TOUCHING ONE ANOTHER OR THEMSELVES Peter MAYRHOFER and Dominic WALTER The Univerity of Innbruck,

More information

Green-Kubo formulas with symmetrized correlation functions for quantum systems in steady states: the shear viscosity of a fluid in a steady shear flow

Green-Kubo formulas with symmetrized correlation functions for quantum systems in steady states: the shear viscosity of a fluid in a steady shear flow Green-Kubo formula with ymmetrized correlation function for quantum ytem in teady tate: the hear vicoity of a fluid in a teady hear flow Hirohi Matuoa Department of Phyic, Illinoi State Univerity, Normal,

More information

USPAS Course on Recirculated and Energy Recovered Linear Accelerators

USPAS Course on Recirculated and Energy Recovered Linear Accelerators USPAS Coure on Recirculated and Energy Recovered Linear Accelerator G. A. Krafft and L. Merminga Jefferon Lab I. Bazarov Cornell Lecture 6 7 March 005 Lecture Outline. Invariant Ellipe Generated by a Unimodular

More information

Lecture 4 Topic 3: General linear models (GLMs), the fundamentals of the analysis of variance (ANOVA), and completely randomized designs (CRDs)

Lecture 4 Topic 3: General linear models (GLMs), the fundamentals of the analysis of variance (ANOVA), and completely randomized designs (CRDs) Lecture 4 Topic 3: General linear model (GLM), the fundamental of the analyi of variance (ANOVA), and completely randomized deign (CRD) The general linear model One population: An obervation i explained

More information

Standard Guide for Conducting Ruggedness Tests 1

Standard Guide for Conducting Ruggedness Tests 1 Deignation: E 69 89 (Reapproved 996) Standard Guide for Conducting Ruggedne Tet AMERICA SOCIETY FOR TESTIG AD MATERIALS 00 Barr Harbor Dr., Wet Conhohocken, PA 948 Reprinted from the Annual Book of ASTM

More information

COHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE

COHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE COHOMOLOGY AS A LOCAL-TO-GLOBAL BRIDGE LIVIU I. NICOLAESCU ABSTRACT. I dicu low dimenional incarnation of cohomology and illutrate how baic cohomological principle lead to a proof of Sperner lemma. CONTENTS.

More information

STOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND

STOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND OPERATIONS RESEARCH AND DECISIONS No. 4 203 DOI: 0.5277/ord30402 Marcin ANHOLCER STOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND The generalized tranportation problem

More information

p. (The electron is a point particle with radius r = 0.)

p. (The electron is a point particle with radius r = 0.) - pin ½ Recall that in the H-atom olution, we howed that the fact that the wavefunction Ψ(r) i ingle-valued require that the angular momentum quantum nbr be integer: l = 0,,.. However, operator algebra

More information

Linear System Fundamentals

Linear System Fundamentals Linear Sytem Fundamental MEM 355 Performance Enhancement of Dynamical Sytem Harry G. Kwatny Department of Mechanical Engineering & Mechanic Drexel Univerity Content Sytem Repreentation Stability Concept

More information

1 Bertrand duopoly with incomplete information

1 Bertrand duopoly with incomplete information Game Theory Solution to Problem Set 5 1 Bertrand duopoly ith incomplete information The game i de ned by I = f1; g ; et of player A i = [0; 1) T i = fb L ; b H g, ith p(b L ) = u i (b i ; p i ; p j ) =

More information

(b) 99%; n = 15; σ is unknown; population appears to be normally distributed.

(b) 99%; n = 15; σ is unknown; population appears to be normally distributed. MTH 345 Exam 3 Fall 2013 Jutify all anwer with neat and organized work. Clearly indicate your anwer. 100 point poible. 1. (12 pt.) Women height are normally ditributed with mean 63.6 in. and tandard deviation

More information

ALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS

ALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS SIAM J. COMPUT. Vol. 30, No. 1, pp. 191 217 c 2000 Society for Indutrial and Applied Mathematic ALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS JON KLEINBERG, YUVAL RABANI, AND ÉVA TARDOS Abtract. In thi paper,

More information

Pythagorean Triple Updated 08--5 Drlnoordzij@leennoordzijnl wwwleennoordzijme Content A Roadmap for generating Pythagorean Triple Pythagorean Triple 3 Dicuion Concluion 5 A Roadmap for generating Pythagorean

More information

Interaction Diagram - Tied Reinforced Concrete Column (Using CSA A )

Interaction Diagram - Tied Reinforced Concrete Column (Using CSA A ) Interaction Diagram - Tied Reinforced Concrete Column (Uing CSA A23.3-14) Interaction Diagram - Tied Reinforced Concrete Column Develop an interaction diagram for the quare tied concrete column hown in

More information

Jump condition at the boundary between a porous catalyst and a homogeneous fluid

Jump condition at the boundary between a porous catalyst and a homogeneous fluid From the SelectedWork of Francico J. Valde-Parada 2005 Jump condition at the boundary between a porou catalyt and a homogeneou fluid Francico J. Valde-Parada J. Alberto Ochoa-Tapia Available at: http://work.bepre.com/francico_j_valde_parada/12/

More information

Acceptance sampling uses sampling procedure to determine whether to

Acceptance sampling uses sampling procedure to determine whether to DOI: 0.545/mji.203.20 Bayeian Repetitive Deferred Sampling Plan Indexed Through Relative Slope K.K. Sureh, S. Umamahewari and K. Pradeepa Veerakumari Department of Statitic, Bharathiar Univerity, Coimbatore,

More information

The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks

The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks EEE/ACM TRANSACTONS ON NETWORKNG, VOL. X, NO. XX, XXXXXXX 200X 1 The mpact of mperfect Scheduling on Cro-Layer Congetion Control in Wirele Network Xiaojun Lin, Member, EEE and Ne B. Shroff Senior Member,

More information

SOME RESULTS ON INFINITE POWER TOWERS

SOME RESULTS ON INFINITE POWER TOWERS NNTDM 16 2010) 3, 18-24 SOME RESULTS ON INFINITE POWER TOWERS Mladen Vailev - Miana 5, V. Hugo Str., Sofia 1124, Bulgaria E-mail:miana@abv.bg Abtract To my friend Kratyu Gumnerov In the paper the infinite

More information

EE Control Systems LECTURE 14

EE Control Systems LECTURE 14 Updated: Tueday, March 3, 999 EE 434 - Control Sytem LECTURE 4 Copyright FL Lewi 999 All right reerved ROOT LOCUS DESIGN TECHNIQUE Suppoe the cloed-loop tranfer function depend on a deign parameter k We

More information

A Simplified Methodology for the Synthesis of Adaptive Flight Control Systems

A Simplified Methodology for the Synthesis of Adaptive Flight Control Systems A Simplified Methodology for the Synthei of Adaptive Flight Control Sytem J.ROUSHANIAN, F.NADJAFI Department of Mechanical Engineering KNT Univerity of Technology 3Mirdamad St. Tehran IRAN Abtract- A implified

More information

Inference for Two Stage Cluster Sampling: Equal SSU per PSU. Projections of SSU Random Variables on Each SSU selection.

Inference for Two Stage Cluster Sampling: Equal SSU per PSU. Projections of SSU Random Variables on Each SSU selection. Inference for Two Stage Cluter Sampling: Equal SSU per PSU Projection of SSU andom Variable on Eac SSU election By Ed Stanek Introduction We review etimating equation for PSU mean in a two tage cluter

More information

time? How will changes in vertical drop of the course affect race time? How will changes in the distance between turns affect race time?

time? How will changes in vertical drop of the course affect race time? How will changes in the distance between turns affect race time? Unit 1 Leon 1 Invetigation 1 Think About Thi Situation Name: Conider variou port that involve downhill racing. Think about the factor that decreae or increae the time it take to travel from top to bottom.

More information

Extension of Inagaki General Weighted Operators. and. A New Fusion Rule Class of Proportional Redistribution of Intersection Masses

Extension of Inagaki General Weighted Operators. and. A New Fusion Rule Class of Proportional Redistribution of Intersection Masses Extenion of nagaki General Weighted Operator and A New Fuion Rule Cla of Proportional Reditribution of nterection Mae Florentin Smarandache Chair of Math & Science Depart. Univerity of New Mexico, Gallup,

More information

A Constraint Propagation Algorithm for Determining the Stability Margin. The paper addresses the stability margin assessment for linear systems

A Constraint Propagation Algorithm for Determining the Stability Margin. The paper addresses the stability margin assessment for linear systems A Contraint Propagation Algorithm for Determining the Stability Margin of Linear Parameter Circuit and Sytem Lubomir Kolev and Simona Filipova-Petrakieva Abtract The paper addree the tability margin aement

More information

Predicting the Performance of Teams of Bounded Rational Decision-makers Using a Markov Chain Model

Predicting the Performance of Teams of Bounded Rational Decision-makers Using a Markov Chain Model The InTITuTe for ytem reearch Ir TechnIcal report 2013-14 Predicting the Performance of Team of Bounded Rational Deciion-maer Uing a Marov Chain Model Jeffrey Herrmann Ir develop, applie and teache advanced

More information

Performance Bounds for Constrained Linear Min-Max Control

Performance Bounds for Constrained Linear Min-Max Control 01 European Control Conference (ECC) July 1-19, 01, Zürich, Switzerland. Performance Bound for Contrained Linear Min-Max Control Tyler H. Summer and Paul J. Goulart Abtract Thi paper propoe a method to

More information

Annex-A: RTTOV9 Cloud validation

Annex-A: RTTOV9 Cloud validation RTTOV-91 Science and Validation Plan Annex-A: RTTOV9 Cloud validation Author O Embury C J Merchant The Univerity of Edinburgh Intitute for Atmo. & Environ. Science Crew Building King Building Edinburgh

More information

Correction for Simple System Example and Notes on Laplace Transforms / Deviation Variables ECHE 550 Fall 2002

Correction for Simple System Example and Notes on Laplace Transforms / Deviation Variables ECHE 550 Fall 2002 Correction for Simple Sytem Example and Note on Laplace Tranform / Deviation Variable ECHE 55 Fall 22 Conider a tank draining from an initial height of h o at time t =. With no flow into the tank (F in

More information

Math Skills. Scientific Notation. Uncertainty in Measurements. Appendix A5 SKILLS HANDBOOK

Math Skills. Scientific Notation. Uncertainty in Measurements. Appendix A5 SKILLS HANDBOOK ppendix 5 Scientific Notation It i difficult to work with very large or very mall number when they are written in common decimal notation. Uually it i poible to accommodate uch number by changing the SI

More information