ON THE WEAK KÄHLER-RICCI FLOW

Size: px
Start display at page:

Download "ON THE WEAK KÄHLER-RICCI FLOW"

Transcription

1 ON THE WEAK KÄHLER-RICCI FLOW XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG Abstract. I this paper, we defie ad study Kähler-Ricci flow with iitial data ot beig smooth with some atural applicatios. 1. Itroductio Let be a -dimesioal compact (without boudary) Kähler maifold. A Kähler metric g ca be represeted by its Kähler form g o. Cosider the Kähler-Ricci flow o [, T ) g(t) (1.1) = Ric( g(t) ), where g(t) is a family of Kähler metrics ad Ric( g ) deotes the Ricci curvature of g. It is kow that for ay smooth Kähler metric g, there is a uique solutio g(t) of (1.1) for some maximal time T > with g() = g. I geeral, T will deped o the iitial metric g. However, i Kähler maifold case, this oly depeds o the Kähler class ad the first Cher class. This observatio plays a importat role i our itroductio of weak Ricci flow over Kähler maifold. The Ricci flow was itroduced by R. Hamilto i [2]. Extesive research has bee doe i the case of the smooth flow (c.f. [22] [6] [14] [21] [25] [12] [13] [3] or [15] for complete updated refereces). I order to prove the uiqueess of extremal Kähler metrics i full geerality, i [9], the first two amed authors were led to the study of Kähler-Ricci flow i the weak sese. ore precisely, we proved i [9] that for ay iitial L -bouded Kähler metric, there is a uiformly L -bouded solutio of (1.1) with the give iitial metric i a suitable sese. oreover, the volume form of the solutio coverges strogly to the volume form of the iitial Kähler metric i L 2 -topology as t. As oe may expect, such a weak solutio of (1.1) should become smooth immediately after t >. Ideed, we cofirm this i this ote i a more geeral settig. Defiitio 1.1. For ay Kähler curret g with C 1,1 bouded potetial o, there is a uique smooth solutio g(t) (t (, T )) of (1.1) such that lim t + g(t) = g i C 1,α ( α (, 1)) orm at the potetial level. A special case of Riema surfaces was also cosidered i [11] with a completely differet proof. Date: October 9, 28 ad, i revised form, February 13, athematics Subject Classificatio. Primary 53C25; Secodary 53C99, 58J99. Key words ad phrases. Differetial geometry, Geometric evolutio equatio. The first author is supported i part by NSF fuds. The secod author is supported i part by NSF fuds. 1

2 2 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG It was kow that ay Kähler metric with costat scalar curvature is the absolute miimizer of the K-eergy o the space of all Kähler metrics with a fixed Kähler class ([8], [18], [24] ad [9]) 1. From aalytic poit of view, it is a extremely difficult problem to prove the existece of Kähler metric with costat scalar curvature i geeral cases. Oe approach is to costruct weak miimizers of the K-eergy by applyig certai variatioal or cotiuous methods. This seems to be a plausible direct approach but very hard. However, eve if we obtaied a C 1,1 miimizer of the K-eergy fuctioal, we would still face the regularity problem. I [8], the first amed author made the followig cojecture: Ay C 1,1 miimizers of the K-eergy i a give Kähler class must be smooth. As a cosequece of the above theorem, we ca solve this cojecture i caoically polarized cases. Example 1.2. I a Kähler class which is proportioal to the first Cher class, ay L Kähler metric which miimizes the K-eergy fuctioal must be smooth. There is aother motivatio for this short paper. O a geeral Kähler maifold, the Kähler-Ricci flow (1.1) may develop sigularity at fiite time (see [31]). I a o-goig project with his collaborators, the secod amed author proposed some problems of studyig how the Kähler-Ricci flow exteds across the fiite time sigularity (see [28] for more discussios). Oe of them ivolves costructig solutios of the Kähler-Ricci flow with much weaker iitial metrics, possibly o spaces with mild sigularity. Our secod result gives a partial solutio to this problem. First we recall some stadard facts: by Hodge Theorem, the space of all Kähler metrics i a fixed Kähler class give by a smooth Kähler metric is P (, ) = {ϕ C () ϕ = + 1 ϕ > o }. We deote by Cl L P (, ) all bouded fuctios plurisubharmoic with respect to. The for ay ϕ Cl L P (, ), there is a well-defied (Borel) measure ( + 1 ϕ) usig the uderstadig from pluripotetial theory about oge-ampère operator itroduced i [2]. Oe ca also thik of this as a volume form i a weak sese. Now we ca state our secod result. Defiitio 1.3. For ay Kähler potetial ϕ Cl L P (, ) whose volume form is L p (, )(p 3), there is a uique smooth solutio g(t) of (1.1) for t (, T ) such that g(t) coverges to ϕ strogly i the L 2 -topology. The orgaizatio of this ote is as follows: i Sectio 2, we show the existece of the weak solutio for the iduced potetial flow which is equivalet to the Kähler- Ricci flow. C -estimates will be derived for the solutio ad its time derivative. We also examie covergece problem for these weak solutios as t teds to. I Sectio 3, we derive the 2d ad 3rd order estimates for the weak solutios. The Theorem 1.1 ad 1.3 follow. I last sectio, we prove the corollary. 2. Weak solutios of Kähler-Ricci flow First we reduce the Kähler-Ricci flow (1.1) to a scalar flow. To start with, we ote that [ g ] tc 1 () represets a Kähler class wheever t T for a sufficietly small T > depedig oly o [ g ] ad c 1 (). Choose a smooth family of Kähler forms t for t [, T ] such that = ad [ t ] = [ g ] tc 1 (). 1 For Kähler-Eistei metrics, cf. [1], [17] ad [29].

3 ON THE WEAK KÄHLER-RICCI FLOW 3 Write g(t) = t + 1 ϕ(t). The, oe ca show by stadard argumet that g(t) solves (1.1) if ad oly if ϕ(t) solves the followig scalar flow: ϕ (2.1) = log ( t + 1 ϕ) h t, t where h t is defied by Ric( t ) + t = 1 h t, ad X (e h t 1)t =. Clearly such a h( t ) does exist ad is uique. As usual, we will regard either (1.1) or (2.1) as the Kähler-Ricci flow o. For simplicity, we deote by ϕ the Kähler form t + 1 ϕ. To costruct a weak solutio to the Kähler-Ricci flow equatio with o-smooth iitial Kähler potetials, as usual, we use smooth approximatios of the iitial data. Let ϕ be a bouded Kähler potetial such that its volume form is i L p for some p > 1. This actually implies Hölder cotiuity of ϕ from the result i [27]. Let ϕ (s)( s 1) be a 1-parameter Kähler potetials such that the followig properties hold: (1) ϕ () = ϕ ad ϕ (s) P (, ) for < s 1. (2) If ϕ has C 1,1 boud, the ϕ (s) has uiform C 1,1 upper boud ad ϕ (s)(s > ) ϕ strogly i W 2,q (, ) for q sufficietly large. (3) ϕ (s) coverges to ϕ uiformly i L -topology ad the volume form ratio coverges to ϕ strogly i L p (p > 1). Later i Sectio 3, less regularity will be assumed, ad so the approximatio would also be less restrictive. It is kow (cf. [31]) that for ay ϕ i P (, ), there is a uique smooth solutio of (2.1) o [,T] with ϕ as the iitial value. Therefore, we have ϕ(s, t) P (, ) ( < s 1, t [, T ]) satisfyig: (2.2) (2.3) ϕ(s, t) = log ( t + 1 ϕ) h t, t ϕ(s, ) = ϕ (s). Clearly, for each s > fixed, there exists a uiform C 2,α boud for ϕ(s, t) ( t T ). However, the upper boud may well deped o s ad so may blow up whe t, s are both small. If there is a limit ϕ(t) = lim s ϕ(s, t), t [, T ], the we ca regard ϕ(t) as a weak solutio of (2.1) with iitial value ϕ. Lemma 2.1. The solutios ϕ(s, t) coverges uiformly to a family of fuctios ϕ(t) (t [, T ]) as s teds to. Proof. For ay positive s ad s, put ψ(t) = ϕ(s, t) ϕ(s, t), the we have ψ = log ( ϕ(s,t) + 1 ψ) ( t + 1 ϕ(s, t)). The the aximum Priciple implies that sup ψ(t) sup ψ(), that is, sup ϕ(s, t) ϕ(s, t) sup ϕ (s ) ϕ (s). The lemma the follows easily from our choice of the iitial data ϕ (s).

4 4 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG We shall show that ϕ(t) solves the Kähler-Ricci flow ad cosequetly is a weak solutio i a suitable sese. For this purpose, oe eeds to justify that ϕ(t) is a smooth family for t > which solves (2.1) for t > such that lim t + ϕ(t) = ϕ. Of course, this is the core part of this paper. First we derive a few estimates o ϕ(s, t) uiform for s (, 1] ( Sometimes we abbreviate ϕ(s, t) as ϕ for simplicity). These estimates would evetually be passed o to ϕ(t) by takig limit as s teds to i some proper sese. Lemma 2.2. If ϕ is bouded, the there exists a uiform costat C such that for ay s (, 1] ad t [, T ], ϕ(s, t) C. Proof. Choose c such that h t C c for all t [, T ]. Applyig the aximum Priciple to ϕ(s, t) ± c t, we ca obtai mi ϕ (s) c t ϕ(s, t) max ϕ (s) + c t, s >. The the boud o ϕ follows. The ext lemma gives a estimate o the volume form for the Kähler-Ricci flow whe t >. I this ote, ϕ always stads for Laplacia with respect to the flow metric ϕ = t + 1 ϕ. Traditioally, C might stad for differet positive costats at differet places. Lemma 2.3. For t >, the volume form has uiform upper ad positive lower bouds which may deped o t. Proof. Differetiatig the Kähler-Ricci flow equatio we get Similarly, we have ϕ = log ( t + 1 ϕ) t h t, ϕ = ( ϕ ϕ h t tr t ( t) + trϕ ) t ϕ ϕ + C(1 + tr ϕ ). ϕ ϕ ϕ C(1 + tr ϕ ), which will be used for lower boud later i this proof. For the upper boud, let s cosider The t-derivative gives For t small eough, we have F + = ϕ + tϕ. F + = ϕ + ϕ + tϕ t ϕ ϕ + Ct(1 + tr ϕ ) = ϕ ( ϕ + tϕ ) + ϕ ϕ + Ct(1 + tr ϕ ) = ϕ F + + tr ϕ t + Ct(1 + tr ϕ ) ϕ F + + C (C Ct)(1 + tr ϕ ). F + ϕ F + + C.

5 ON THE WEAK KÄHLER-RICCI FLOW 5 Sice F + () is uiformly bouded from above, it follows from the aximum Priciple that F + has a uiform upper boud. For the lower boud, set F = ϕ + tϕ = ϕ th + t log ϕ t. The, usig the same C to deote differet costats at places, F = ϕ + ϕ + tϕ 2ϕ + t( ϕ ϕ C(1 + tr ϕ )) = ϕ (ϕ + tϕ ) ϕ ϕ + 2ϕ Ct(1 + tr ϕ ) = ϕ F + tr ϕ t + 2 log ϕ t ϕ F C + (C Ct)(1 + tr ϕ ) + 2 log ϕ ϕ F C + (C Ct) ( ϕ t ) 1 2h t Ct(1 + tr ϕ ) t + 2 log ϕ. t It s easy to see for x >, with the uderstadig that these two C s are ot the same, x 1 It follows that for t small, we have + C log x C. F ϕ F C. The the aximum Priciple implies that F > C for some uiform costat C, that is, the volume form ϕ has a uiform positive lower boud whe cosidered t uiformly away from iitial time. Next we exam whether itegral estimates. lim ϕ(t) = ϕ. To make sure of this, we derive some t + Lemma 2.4. If ϕ is bouded ad ϕ is i L p (p 1), the for ay s (, 1], there exists a positive fuctio C(t) of t such that ϕ L p C(t). oreover, C(t) is idepedet of s ad is uiformly bouded for t [, T ] with T <. Proof. For λ >, set the modified volume ratio as f ϕ = ϕ t e λϕ. We are cosiderig classic smooth solutio. Let C be a costat satisfyig: t t + Ric( t ) t + Ric() t + h t t C.

6 6 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG Use to deote the gradiet with respect to ϕ. The for λ sufficietly large, log f ϕ = tr ϕ ( t) + ϕ ϕ tr t ( t) λϕ = ϕ log f ϕ + tr ϕ ( t + λ 1 ϕ 1 h t ) + R t tr t h t λϕ ϕ log f ϕ + λ (λ 2 C) tr ϕ t λ log f ϕ + λh t + 2 C ϕfϕ f ϕ Thus, we have fϕ 2 ϕ f 2 ϕ f ϕ For ay p 1, we have d d t fϕ p e λϕ t = p fϕ p 1 f ϕ eλϕ t + = p fϕ p 1 f ϕ eλϕ t + +λ ( f ϕe p λϕ p + 2 C λ log f ϕ. ϕ f ϕ f ϕ 2 ϕ f ϕ + 2 C f ϕ λf ϕ log f ϕ. f p ϕ log ϕ e λϕ t + λ f p ϕ ( R t + tr t h t ) e λϕ t t h t ) t fϕe p λϕ ϕ t fϕ p 1 ( ϕ f ϕ f ϕ 2 ϕ + f ϕ (2 C λ log f ϕ )) e λϕ t + C f ϕ +λ f p ϕe λϕ ( log ϕ t h t ) t f p ϕ e λϕ t fϕ p 2 (p ( ϕ f ϕ f ϕ 2 ϕ ) + f ϕ (2 p C λ(p 1) log f ϕ )) ϕ + C λ f f ϕe p λϕ t ϕ p(p 1) f ϕ p 2 f ϕ 2 ϕe λϕ t + C λ (f ϕ p + fϕ p 1 )e λϕ t. Here we have used the fact that the fuctio xlogx has a lower boud for x >. Sice ϕ is uiformly bouded, it follows that ϕ is uiformly bouded i L p for all t [, T ]. It follows from this lemma that the L p -orm of ϕ(t) is uiformly bouded. By the work of Kolodziej [27], we kow that ϕ(t) C α is uiformly bouded, where α = α(p) > may deped o p > 1. The for ay sequece t i, there is a subsequece, still deoted by t i for simplicity, such that ϕ(t i ) coverges to a C α - fuctio ϕ i the C β -topology for some β (, α). A priori, this limit potetial might well deped o the sequece we choose. Lemma 2.5. If p 3, we have ϕ = ϕ. oreover, ϕ(t) coverges to ϕ strogly i the L 2 -topology, where a smooth volume form is used to defie the L 2 -topology ad the choice clearly does t matter. Proof. First we assume that ϕ is smooth, i. e., oe of ϕ (s)(s > ). I the proof of the precedig lemma, set p = 3 ad we have d f 3 d t ϕe λϕ t 6 f ϕ f ϕ 2 ϕe λϕ t + C fϕe 3 λϕ t + C, which implies (2.4) t f ϕ f ϕ 2 ϕ t d u C.

7 ON THE WEAK KÄHLER-RICCI FLOW 7 Now set f = ϕ. Claim 1: We have for t i some fiite iterval, t t (2.5) f 2 ϕ ϕ d u = f f 2 ϕ t d u C (2.6) t t f 2 ϕ ϕ 2 ϕ ϕ d u C. Proof of Claim 1: Sice ϕ is uiformly bouded, we ca choose a uiform costat c such that ϕ c. The we have f ϕ 2 ϕ 2 ϕ ϕ = 2 f ϕ ( f ϕ ϕ) ϕ (ϕ c) ϕ f ϕ 2 (ϕ c) ϕ ϕ ϕ 1 2 f ϕ 2 ϕ 2 ϕ ϕ + C f ϕ 2 ϕ ϕ f ϕ 2 (ϕ c) ϕ + f ϕ 2 (ϕ c) tr ϕ t ϕ 1 2 f ϕ 2 ϕ 2 ϕ ϕ + C f ϕ 2 ϕ ϕ + C f ϕ 2 ϕ = 1 2 f ϕ 2 ϕ 2 ϕ ϕ + C f ϕ f ϕ 2 ϕt + C f ϕ 3 e λϕ t. It follows by itegratig over t ad (2.4) that t fϕ 2 ϕ 2 ϕ ϕ d u C. To prove the first iequality, we observe The, f = e λϕ f ϕ. f f 2 ϕ t = (f ϕe λϕ ) 2 ϕ ϕ 2 f ϕ 2 e 2λϕ ϕ + 2λ 2 f 2 ϕ ϕ 2 ϕ e 2λϕ ϕ C ( f ϕ 2 ϕ ϕ + f 2 ϕ ϕ 2 ϕ ϕ). Thus the first iequality follows from the secod oe ad (2.4). Claim 1 is proved. Claim 2: For ay smooth o-egative cut-off fuctio χ (fixed), we have, (2.7) f χ 2 ϕ t = χ 2 ϕ ϕ C( χ,l ). Proof of Claim 2: f χ 2 ϕ t = χ 2 ϕ ϕ χ 2 t tr ϕ t ϕ C tr ϕ ( ϕ 1 ϕ) ϕ = C ( ϕ ϕ) ϕ C, where the first iequality follows from a elemetary iequality ad the secod iequality makes use of the positivity of t. I other words, ay smooth cut-off fuctio automatically has uiform W 1,2 orm with respect to ay Kähler metric i ay give Kähler class.

8 8 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG Claim 3: We have (2.8) f ϕ 2 ϕ t = ϕ 2 ϕ ϕ C( ϕ L ). Proof of Claim 3: Let c be the same as i the proof of Claim 1. ϕ 2 ϕ ϕ = (ϕ c) ϕϕ ϕ = (ϕ c)tr ϕ t ϕ (ϕ c) ϕ C. I the last iequality, we have used the fact that ϕ is uiformly bouded. Claim 4: For ay positive χ, the followig iequality holds t (2.9) χ f 2 tr ϕ t t d u C 1 t + C 2 t, where both costats deped oly o χ L ad χ,l. Proof of Claim 4: χ f 2 tr ϕ t t = χ f t ϕ 1 = χ f ϕ χ f 1 ϕ ϕ 1 C + 1χ f ϕ 1 ϕ + ( C C 1 + ( f 2 ϕ ϕ ( 1 + ( f 2 ϕ ϕ ) 1 1f χ ϕ 1 ) 1 ( 2 ϕ 2 ϕ ϕ ) ( f 2 ϕ 2 ϕ ϕ ϕ 2 + ( χ 2 ϕ ϕ ) 1 ) 2. ) 1 2 ( f ) 2 ϕ 2 ϕ ϕ 1 ) 2 We have used Claims 2 ad Claim 3 i derivig the last iequality. The Claim 4 follows from itegratig the above iequality from to t ad usig Claim 1 ad the Schwartz iequality. A straightforward computatio shows log f = tr ϕ ( t) + ϕ ϕ ( tr t t = ϕ log f + tr ϕ ht + t) trt Usig this, we deduce d d t χf 2 t = C Note that ϕf f f 2 ϕ f 2 + Ctr ϕ t + C. ( χ 2f f ) + f 2 tr t t t t χf( ϕ f f 2 ϕ + Cftr ϕ t + Cf) t f ( χ, f) ϕ ϕ + C χf 2 t + C χf 2 tr ϕ t t χ 2 ϕ ϕ f 2 ϕ ϕ + C χf 2 t + C χf 2 tr ϕ t t f 2 ϕ ϕ + C χf 2 t + C χf 2 tr ϕ t t. χ f 2 t C, t [, T ].

9 ON THE WEAK KÄHLER-RICCI FLOW 9 Itegratig the above iequality from t = to t = t i ad usig Claim 4, we have χf 2 t ti χf 2 t + C(t i + t i ). I derivig the above iequality, we used the fact that ϕ is smooth. For geeral ϕ as give, applyig the above to ϕ(s, t i ) for ay s > ad the takig the limit as s teds to, we get for ay ϕ(t i ), ( ) 2 ϕ(ti) χ t i t i χ ( ϕ ) 2 + C(t i + t i ). Here oe ca use Fatou s Lemma ad the strog covergece for the measure at iitial time. O the other had, usig the assumptio that ϕ(t i ) coverges to ϕ, we ca show that ϕ(t i ) coverges weakly to ñ ϕ t i ca justify the covergece of itegratio i a similar way ad have (2.1) χ ( ñ ϕ ) 2 i L 2 (, ). The by takig t i to, we χ ( ϕ ) 2. Sice this holds for ay o-egative smooth cut-off fuctio χ, we have a. e. i. However, It follows ñ ϕ ϕ ϕ ñ = ϕ = vol()! (2.11) ñ ϕ ϕ i L 2 (, ). The uiqueess of oge-ampère equatio for C solutio by Kolodziej as i [26] implies that ϕ = ϕ. Sice {t i } is ay sequece goig to, we have proved that ϕ(t) coverges to ϕ as t teds to. Furthermore, we have χ ( ñ ϕ ) 2 = lim i χ ( ) 2 ϕi. Together with weak covergece, we coclude ϕ i coverges strogly to ñ ϕ L 2 (, ). Hece Lemma 2.5 is proved. i So far, we have show that with assumptio o the volume form, the solutio of the weak Kähler-Ricci flow really goes (back) to the iitial data as t. 3. Higher order estimates I this sectio, we prove the regularity of the weak Ricci flow uder appropriate assumptios o the iitial Kähler potetial ϕ.

10 1 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG 3.1. The C 1,1 case. I this subsectio, we wat to prove the followig Laplacia estimates. Propositio 3.1. [9] If ϕ Cl L P (, ) is C 1,1 -bouded, the t + 1 ϕ(t) C, t [, T ]. I other words, ϕ(t) is uiformly C 1,1 -bouded. oreover, ϕ (t) coverges to ϕ strogly i L 2 space as t. Proof. The C 1,1 assumptio o ϕ gives a L (upper) boud for the volume form. I sight of Lemma 2.5, it suffices to prove the Laplacia estimate. Let ϕ (s) be the smooth approximatios of ϕ ad ϕ(s, t) be the associated solutios as before. Sice ϕ is i C 1,1, we ca arrage ϕ (s) with uiformly bouded C 1,1 -orms. Thus, we oly eed to boud ϕ(s, t) uiformly i C 1,1. For simplicity, ϕ stads for ϕ(s, ) below. By Lemma 2.2, it s uiformly bouded. We first derive a poitwise uiform upper boud o the volume form for t [, T ] as follows. ( ϕ ) ( ϕ ) + C(1 + tr ϕ t ) ( ϕ Cϕ) + C + C(tr ϕ( 1 ϕ) + tr ϕ t ) ( ϕ Cϕ) + C + ( ϕ Cϕ) + C + Cϕ. It ca be reformulated as ( ϕ Cϕ) ( ϕ Cϕ) + C C( ϕ Cϕ). Applyig the aximum Priciple, oe ca easily derive a uiform upper boud for ϕ ϕ Cϕ. Sice ϕ is uiformly bouded, we get a uiform upper boud o, so the volume form is uiformly bouded from above. By stadard computatio as i [32], we have e Cϕ ( ϕ )(e Cϕ tr t ( ϕ )) C+(C ϕ C)tr t ( ϕ )+Ce 1 ϕ 1 trt ( ϕ ) 1. Suppose that the maximum of e Cϕ tr t ( ϕ ) is attaied at some (p, t) i [, T ]. At that poit, assumig t > without loss of geerality, we have C + (C ϕ C)tr t ( ϕ ) + Ce 1 ϕ 1 trt ( ϕ ) 1. Usig the upper boud for ϕ, we have tr t ( ϕ ) 1 ϕ 1 ϕ 1 Ce 1 + Ce 1 trt ( ϕ ) C ϕ C + Ctr t ( ϕ ). e 1 ϕ 1 trt ( ϕ ) This implies a uiform upper boud of tr t ( ϕ ) at (p, t). Sice ϕ is uiformly bouded, it follows that this trace is uiformly bouded. The propositio is thus proved.

11 ON THE WEAK KÄHLER-RICCI FLOW The L case. We are goig to fiish provig Theorems 1.1 ad 1.3 i this subsectio. The estimates will be local for t > uder the weaker assumptio that the iitial Kähler potetial is merely bouded. Let s poit out that i this case, oe ca still defie weak flow usig smooth decreasig approximatio of the iitial bouded Kähler potetial 2. These approximatio flows have potetials decreasig to the weak flow poitwisely. oreover, for two choices of such approximatios, it s ot hard to see the limits would be the same because oe-sided relatio at the iitial time will be preserved alog the flow. All these ca be justified by applyig aximum Priciple as i Lemma 2.1. Thus we have the uiqueess of the weak flow. This also makes sure what we are discussed below is the same weak flow as before whe there is more regularity assumptio. Recall that t is a smooth family of Kähler metrics with [ t ] = [] tc 1 () ad ϕ = t + 1 ϕ. oreover, the Kähler-Ricci flow is reduced to the followig equatio for ϕ: ϕ = log ( t + 1 ϕ) t h t, ϕ(, ) = ϕ. ϕ(t) is obtaied by takig the limit of ϕ(s, t) as s teds to. I order to prove the theorem, we oly eed to get uiform estimates for higher order derivatives of ϕ(s, t) for all s > small. As before, for simplicity, we ca simply assume that ϕ is smooth (as oe of the ϕ(s, )). Choose ay iterval [t 1, t ] with T > t 1 > t >. By Lemmas 2.2 ad 2.3, we have the uiform boud for ϕ ad ϕ for t [t, t 1 ]. Now we derive the Laplacia ad higher order derivative estimates by the stadard methods (see [32], also see [6] or [34]). The estimates may deped o t. As i the last subsectio, we have e Cϕ ( ϕ )(e Cϕ tr t ( ϕ )) C Ctr t ( ϕ ) + Ctr t ( ϕ ) 1, where the boud o ϕ for t [t, t 1 ] has bee used. The boud for e Cϕ tr t ( ϕ ) at t t = is ot available. So we cosider the followig quatity istead Straightforward computatios the gives (t t ) 1 e Cϕ tr t ( ϕ ). e Cϕ ( ϕ )((t t ) 1 e Cϕ tr t ( ϕ )) (t t ) 1 ( C Ctr t ( ϕ ) + Ctr t ( ϕ ) 1 ) ( 1)(t t ) 2 tr t ( ϕ ). At the maximum value poit (p, t) of (t t ) 1 e Cϕ tr t ( ϕ ) i [t, t 1 ], where clearly t > t, ( t t ) 1 ( C Ctr t ( ϕ ) + Ctr t ( ϕ ) 1 ) ( 1)( t t ) 2 tr t ( ϕ ) = C( t t ) 1 (C t + C)( t t ) 2 tr t ( ϕ ) + C( t t ) 1 tr t ( ϕ ) 1. ultiply t t o both sides ad reformulate the above to be C( t t ) (C t + C)( t t ) 1 tr t ( ϕ ) + C(( t t ) 1 tr t ( ϕ )) 1. 2 This is provided by the result i [3] as a simple versio of the more geeral result i [16] for this case.

12 12 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG So we get Thus at (p, t), usig the boud for ϕ, It follows that for all t [t, t 1 ], ( t t ) 1 tr t ( ϕ ) C. ( t t ) 1 e Cϕ tr t ( ϕ ) C. (t t ) 1 e Cϕ tr t ( ϕ ) C, o which implies C tr t ( ϕ ) (t t ) 1. This together with the volume lower boud gives the uiform metric boud locally away from t =. Next, we ca get the third order estimate i a similar fashio. We have a similar iequality as i [6]. Of course, i order to do this, we still traslate the time to guaratee the uiform metric boud. Let s say the time is traslated so that the origial time t = t > is ow the ew iitial time t =. The iequality is as follows, for S = g i j ϕ gϕ k l gϕ λ η ϕ i lλ ϕ jk η, As i [32], we also have ( ϕ )S C S C. ( ϕ ) t ϕ C S C. From the first oe, as i the Laplacia estimate, we cosider ts istead, ( ϕ )(ts) Ct S Ct S. Choosig A > large eough, oe has, for t [, T ], ( ϕ )(ts + A t ϕ) C S C. The fuctio ts + A t ϕ has uiformly bouded at the (ew) iitial time, t =. By aximum Priciple, if its maximum value is achieved at some poit i ad t >, the S is bouded there. Cosequetly, the whole fuctio ts + A t ϕ is also bouded there. So we fially coclude which implies ts + A t ϕ C, S C t. This provides a local C 2,α boud for ϕ. After this, higher order estimates follow from the stadard argumet. Therefore, by Ascoli-Arzela Theorem, we have proved that the weak flow cosidered so far is actually smooth i (, T ]. Theorem 1.1 follows from this ad the secod order estimate i Subsectio 3.1. Theorem 1.3 follows from this ad Lemma 2.5.

13 ON THE WEAK KÄHLER-RICCI FLOW C 1,1 K-eergy miimizer I a earlier paper [9] where the preset work is iitiated, the first two amed authors proved that Propositio 4.1. I ay Kähler class, the volume form of ay C 1,1 K-eergy miimizer belogs to H 1,2 (, ). By Lemma 2.5 ad Propositio 3.1, we ca prove a stroger result. Defiitio 4.2. The C 1,1 miimizer of the K-eergy fuctioal i ay caoical Kähler class with positive first Cher class is ecessarily smooth. Proof. Let φ be a C 1,1 Kähler potetial which miimizes the K-eergy fuctioal i the caoical Kähler class. Accordig to the results proved i the precedig sectios, there is a uique smooth Kähler-Ricci flow ϕ(t)(t > ) such that ϕ = log ϕ + ϕ h. ϕ oreover, lim t = ϕ strogly i L2 (, g ) ad the Kähler potetial ϕ(t) coverges to ϕ strogly i C 1,α () for ay α (, 1). Sice the K-eergy is decreasig alog the Kähler-Ricci flow, we have lim sup E(ϕ(t)) E(ϕ ) = if E(φ). t + φ H Sice the K-eergy is o-icreasig for ϕ(t)(t > ), the for ay t >, we have if E(φ) E(ϕ(t)) if E(φ). φ H φ H I other words, E(ϕ(t)) = if E(φ), t >. φ H Sice ϕ(t) is a smooth Kähler metric, this meas that the scalar curvature of ϕ(t) (t > ) must be costat. Cosequetly, ϕ(t) is a Kähler-Eistei metric for all t >. This i turs implies that ϕ is a fuctio of t oly. Note that ϕ is the strog C 1,α limit of ϕ(t) as t. Therefore, ϕ ϕ(t) is a costat which depeds oly o t. I other words, ϕ is also a Kähler-Eistei metric ad the theorem is the proved. Refereces 1. S. Bado ad T. abuchi. Uiqueess of Eistei Kähler metrics modulo coected group actios. Algebraic geometry, Sedai, 1985, 11 4, Adv. Stud. Pure ath., 1, North-Hollad, Amsterdam, E. Bedford; B. A. Taylor. A ew capacity for plurisubharmoic fuctios. Acta ath. 149 (1982), o. 1-2, Z. Blocki; S. Kolodziej. O regularizatio of plurisubharmoic fuctios o maifolds. Proc. Amer. ath. Soc. 135 (27), o. 7, (electroic). 4. E. Calabi. Extremal Kähler metrics. I Semiar o Differetial Geometry, volume 16 of 12, pages A. of ath. Studies, Uiversity Press, E. Calabi. Extremal Kähler metrics, II. I Differetial geometry ad Complex aalysis, pages Spriger, H. D. Cao. Deformatio of Kähler metrics to Kähler-Eistei metrics o compact Kähler maifolds. Ivet. ath. 81 (1985), o. 2, X. X. Che. Weak limits of Riemaia metrics i surfaces with itegral curvature boud. Calc. Var. Partial Differetial Equatios 6 (1998), o. 3,

14 14 XIUXIONG CHEN, GANG TIAN, AND ZHOU ZHANG 8. X. X. Che. Space of Kähler metrics. Joural of Differetial Geometry, 56(2): , X. X. Che ad G. Tia. Foliatio by holomorphic discs ad its applicatio i Kähler geometry, math.dg/ Submitted. 1. X. X. Che. Space of Kähler metrics (III) O the greatest lower boud of the Calabi eergy ad the lower boud of geodesic distace. Preprit, X. X. Che ad W. Y. Dig. Ricci flow o surfaces with L iitial metrics. Ricci flow o surfaces with degeerate iitial metrics. J. Partial Differetial Equatios 2 (27), o. 3, X. X. Che ad G. Tia. Ricci flow o Kähler-Eistei surfaces. Ivet. ath. 147 (22), o. 3, X. X. Che ad G. Tia. Ricci flow o Kähler-Eistei maifolds. Duke. ath. J. 131, (26), o. 1, B. Chow. The Ricci flow o the 2-sphere. J. Differetial Geom. 33 (1991), o. 2, B. Chow, P. Lu ad L. Ni. Hamilto s Ricci flow. Graduate Studies i athematics, 77. America athematical Society, Providece, RI; Sciece Press, New York, 26. xxxvi+68 pp. ISBN: ; J. -P. D ly,. Pau. Numerical characterizatio of the Kähler coe of a compact Kähler maifold. A. of ath. 159 (24), W.Y. Dig ad G. Tia. Kähler-Eistei metrics ad the geeralized Futaki ivariat. Ivet. ath. 11 (1992), o. 2, S. K. Doaldso. Scalar curvature ad projective embeddigs, II. Q. J. ath. 56 (25), o. 3, S. K. Doaldso. Lower bouds o the Calabi fuctioal. math.dg/ R. Hamilto. Three-maifolds with positive Ricci curvature. J. Diff. Geom., 17:255 36, R. Hamilto. The formatio of sigularities i the Ricci flow, volume II. Iterat. Press, G. Huiske. Ricci deformatio of the metric o a Riemaia maifold. J. Differetial Geom. 21 (1985), o. 1, T. abuchi. K-eergy maps itegratig Futaki ivariats. Tohoku ath. J., 38 (1986), T. abuchi A eergy-theoretic approach to the Hitchi-Kobayashi correspodece for maifolds. I. Ivet. ath. 159 (25), o. 2, G. Perelma. The etropy formula for the Ricci flow ad its geometric applicatios, S., Kolodziej. The complex oge-ampere equatio ad pluripotetial theory. em.amer. ath. Soc. 178 (25), o. 84, x+64 pp. 27. S., Kolodziej. Hölder cotiuity of solutios to the complex oge-ampère equatio with the right had side i L p. The case of compact Kähler maifolds. ArXiv, math.cv/ J. Sog ad G. Tia. The Kähler-Ricci flow o surfaces of positive Kodaira dimesio. Ivetioes math., 17(27), o. 3, G. Tia. Kähler-Eistei metrics with positive scalar curvature. Ivet. ath. 13 (1997), o. 1, G. Tia ad X. H. Zhu Covergece of Kähler-Ricci flow. J. Amer. ath. Soc. 2 (27), o. 3, G. Tia ad Z. Zhag. O the Kähler-Ricci flow o projective maifolds of geeral type. Chiese Aals of athematics - Series B, Volume 27, Number 2, S. T. Yau. O the Ricci curvature of a compact Kähler maifold ad the complex oge- Ampère equatio, I. Comm. Pure Appl. ath. 31 (1978), o. 3, Z. Zhag. O Degeerate oge-ampère Equatios over Closed Kähler aifolds. It. ath. Res. Not. 26, Art. ID 6364, 18 pp. 34. Z. Zhag. Degeerate oge-ampere Equatios over Projective aifolds. PHD Thesis at IT, 26.

15 ON THE WEAK KÄHLER-RICCI FLOW 15 Departmet of athematics, Uiversity of Wiscosi, adiso, WI address: Departmet of athematics, Priceto Uiversity, Priceto, NJ address: Departmet of athematics, Uiversity of ichiga, at A Arbor, I address: zhagou@umich.edu

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series Roberto s Notes o Ifiite Series Chapter : Series Sectio Ifiite series What you eed to ow already: What sequeces are. Basic termiology ad otatio for sequeces. What you ca lear here: What a ifiite series

More information

On Parity based Divide and Conquer Recursive Functions

On Parity based Divide and Conquer Recursive Functions O Parity based Divide ad Coquer Recursive Fuctios Sug-Hyu Cha Abstract The parity based divide ad coquer recursio trees are itroduced where the sizes of the tree do ot grow mootoically as grows. These

More information

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM AC 007-7: USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM Josue Njock-Libii, Idiaa Uiversity-Purdue Uiversity-Fort Waye Josué Njock Libii is Associate Professor

More information

lecture notes September 2, Sequential Choice

lecture notes September 2, Sequential Choice 18.310 lecture otes September 2, 2013 Sequetial Choice Lecturer: Michel Goemas 1 A game Cosider the followig game. I have 100 blak cards. I write dow 100 differet umbers o the cards; I ca choose ay umbers

More information

Logarithms APPENDIX IV. 265 Appendix

Logarithms APPENDIX IV. 265 Appendix APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult

More information

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS A SELETIVE POINTE FOWADING STATEGY FO LOATION TAKING IN PESONAL OUNIATION SYSTES Seo G. hag ad hae Y. Lee Departmet of Idustrial Egieerig, KAIST 373-, Kusug-Dog, Taejo, Korea, 305-70 cylee@heuristic.kaist.ac.kr

More information

x y z HD(x, y) + HD(y, z) HD(x, z)

x y z HD(x, y) + HD(y, z) HD(x, z) Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece 6.02 Solutios to Chapter 5 Updated: February 16, 2012 Please sed iformatio about errors or omissios to hari; questios

More information

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 2303-4874 (p), ISSN (o) 2303-4955 www.imvibl.org/bulletin Vol. 3(2013), 149-154 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

More information

arxiv: v2 [math.co] 15 Oct 2018

arxiv: v2 [math.co] 15 Oct 2018 THE 21 CARD TRICK AND IT GENERALIZATION DIBYAJYOTI DEB arxiv:1809.04072v2 [math.co] 15 Oct 2018 Abstract. The 21 card trick is well kow. It was recetly show i a episode of the popular YouTube chael Numberphile.

More information

Unit 5: Estimating with Confidence

Unit 5: Estimating with Confidence Uit 5: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Uit 5 Estimatig with Cofidece 8.1 8.2 8.3 Cofidece Itervals: The Basics Estimatig a Populatio

More information

POWERS OF 3RD ORDER MAGIC SQUARES

POWERS OF 3RD ORDER MAGIC SQUARES Fuzzy Sets, Rough Sets ad Multivalued Operatios ad Applicatios, Vol. 4, No. 1, (Jauary-Jue 01): 37 43 Iteratioal Sciece Press POWERS OF 3RD ORDER MAGIC SQUARES Sreerajii K.S. 1 ad V. Madhukar Mallayya

More information

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress. H2 Mathematics Pure Mathematics Sectio A Comprehesive Checklist of Cocepts ad Skills by Mr Wee We Shih Visit: weshih.wordpress.com Updated: Ja 2010 Syllabus topic 1: Fuctios ad graphs 1.1 Checklist o Fuctios

More information

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani Shufflig Cards Utrecht Uiversity Mathematics Bachelor s Thesis D.J.W. Telkamp Supervised by Dr. K. Dajai Jue 3, 207 Cotets Itroductio 2 2 Prerequisites 2 2. Problems with the variatio distace................

More information

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains 7 Figerprit Classificatio Based o Directioal Image Costructed Usig Wavelet Trasform Domais Musa Mohd Mokji, Syed Abd. Rahma Syed Abu Bakar, Zuwairie Ibrahim 3 Departmet of Microelectroic ad Computer Egieerig

More information

Permutation Enumeration

Permutation Enumeration RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for

More information

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013 Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scieces 18 ( 014 ) 399 405 EPC-TKS 013 Iductive derivatio of formulae by a computer Sava Grozdev a *, Veseli Nekov b

More information

Counting on r-fibonacci Numbers

Counting on r-fibonacci Numbers Claremot Colleges Scholarship @ Claremot All HMC Faculty Publicatios ad Research HMC Faculty Scholarship 5-1-2015 Coutig o r-fiboacci Numbers Arthur Bejami Harvey Mudd College Curtis Heberle Harvey Mudd

More information

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule Chapter 3 Combiatorics 3.1 Permutatios Readig questios 1. Defie what a permutatio is i your ow words. 2. What is a fixed poit i a permutatio? 3. What do we assume about mutual disjoitedess whe creatig

More information

7. Counting Measure. Definitions and Basic Properties

7. Counting Measure. Definitions and Basic Properties Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 7. Coutig Measure Defiitios ad Basic Properties Suppose that S is a fiite set. If A S the the cardiality of A is the umber of elemets i A, ad is

More information

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code Proceedigs of the 4th WSEAS It. Coferece o Electromagetics, Wireless ad Optical Commuicatios, Veice, Italy, November 0-, 006 107 A New Space-Repetitio Code Based o Oe Bit Feedback Compared to Alamouti

More information

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im sible umber of wavelegths. The wave~~gt~ ~ ~ ~ c ~ b~dwidth is set low eo~gh to iterfax vices. Oe of the most im ed trasmitters ad ysis much more CO "The author is also f Cumputer sciece Departmet, Uiversity

More information

Sapana P. Dubey. (Department of applied mathematics,piet, Nagpur,India) I. INTRODUCTION

Sapana P. Dubey. (Department of applied mathematics,piet, Nagpur,India) I. INTRODUCTION IOSR Joural of Mathematics (IOSR-JM) www.iosrjourals.org COMPETITION IN COMMUNICATION NETWORK: A GAME WITH PENALTY Sapaa P. Dubey (Departmet of applied mathematics,piet, Nagpur,Idia) ABSTRACT : We are

More information

Summary of Random Variable Concepts April 19, 2000

Summary of Random Variable Concepts April 19, 2000 Summary of Radom Variable Cocepts April 9, 2000 his is a list of importat cocepts we have covered, rather tha a review that derives or explais them. he first ad primary viewpoit: A radom process is a idexed

More information

Compound Controller for DC Motor Servo System Based on Inner-Loop Extended State Observer

Compound Controller for DC Motor Servo System Based on Inner-Loop Extended State Observer BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 6, No 5 Special Issue o Applicatio of Advaced Computig ad Simulatio i Iformatio Systems Sofia 06 Prit ISSN: 3-970; Olie ISSN:

More information

13 Legislative Bargaining

13 Legislative Bargaining 1 Legislative Bargaiig Oe of the most popular legislative models is a model due to Baro & Ferejoh (1989). The model has bee used i applicatios where the role of committees have bee studies, how the legislative

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12 EECS 70 Discrete Mathematics ad Probability Theory Sprig 204 Aat Sahai Note 2 Probability Examples Based o Coutig We will ow look at examples of radom experimets ad their correspodig sample spaces, alog

More information

Computational Algorithm for Higher Order Legendre Polynomial and Gaussian Quadrature Method

Computational Algorithm for Higher Order Legendre Polynomial and Gaussian Quadrature Method Computatioal Algorithm for Higher Order Legre olyomial ad Gaussia Quadrature Method Asif M. Mughal, Xiu Ye ad Kamra Iqbal Dept. of Applied Sciece, Dept. of Mathematics ad Statistics, Dept. of Systems Egieerig

More information

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs Cross-Layer Performace of a Distributed Real-Time MAC Protocol Supportig Variable Bit Rate Multiclass Services i WPANs David Tug Chog Wog, Jo W. Ma, ad ee Chaig Chua 3 Istitute for Ifocomm Research, Heg

More information

Symmetric implicit multiderivative numerical integrators for direct solution of fifth-order differential equations

Symmetric implicit multiderivative numerical integrators for direct solution of fifth-order differential equations Tammasat Iteratioal Joural of Sciece ad Tecology Vol.9, No., April-Jue 04 Symmetric implicit multiderivative umerical itegrators for direct solutio of fift-order differetial equatios S. J. Kayode* Departmet

More information

The Institute of Chartered Accountants of Sri Lanka

The Institute of Chartered Accountants of Sri Lanka The Istitute of Chartered Accoutats of Sri Laka Postgraduate Diploma i Busiess ad Fiace Quatitative Techiques for Busiess Hadout 02:Presetatio ad Aalysis of data Presetatio of Data The Stem ad Leaf Display

More information

History and Advancement of the Family of Log Periodic Toothed Planer Microstrip Antenna

History and Advancement of the Family of Log Periodic Toothed Planer Microstrip Antenna Joural of Electromagetic Aalysis ad Applicatios, 2011, 3, 242-247 doi:10.4236/jemaa.2011.36039 Published Olie Jue 2011 (http://www.scirp.org/joural/jemaa) History ad Advacemet of the Family of Log Periodic

More information

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 95 CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 5.1 GENERAL Ru-legth codig is a lossless image compressio techique, which produces modest compressio ratios. Oe way of icreasig the compressio ratio of a ru-legth

More information

Ch 9 Sequences, Series, and Probability

Ch 9 Sequences, Series, and Probability Ch 9 Sequeces, Series, ad Probability Have you ever bee to a casio ad played blackjack? It is the oly game i the casio that you ca wi based o the Law of large umbers. I the early 1990s a group of math

More information

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing 206 3 rd Iteratioal Coferece o Mechaical, Idustrial, ad Maufacturig Egieerig (MIME 206) ISBN: 978--60595-33-7 Applicatio of Improved Geetic Algorithm to Two-side Assembly Lie Balacig Ximi Zhag, Qia Wag,

More information

WAVE-BASED TRANSIENT ANALYSIS USING BLOCK NEWTON-JACOBI

WAVE-BASED TRANSIENT ANALYSIS USING BLOCK NEWTON-JACOBI WAVE-BASED TRANSIENT ANALYSIS USING BLOCK NEWTON-JACOBI Muhammad Kabir McGill Uiversity Departmet of Electrical ad Computer Egieerig Motreal, QC H3A 2A7 Email: muhammad.kabir@mail.mcgill.ca Carlos Christofferse

More information

Single Bit DACs in a Nutshell. Part I DAC Basics

Single Bit DACs in a Nutshell. Part I DAC Basics Sigle Bit DACs i a Nutshell Part I DAC Basics By Dave Va Ess, Pricipal Applicatio Egieer, Cypress Semicoductor May embedded applicatios require geeratig aalog outputs uder digital cotrol. It may be a DC

More information

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1 1. [5] Give sets A ad B, each of cardiality 1, how may fuctios map A i a oe-tooe fashio oto B? 2. [5] a. Give the set of r symbols { a 1, a 2,..., a r }, how may differet strigs of legth 1 exist? [5]b.

More information

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Chapter ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West

More information

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence 8 Chapter 9 Ifiite Series Test Form A Chapter 9 Name Class Date Sectio. Fid the fourth term of the sequece,,,,.... 6 (a) (b) 6 (c) 8 6. Determie if the followig sequece coverges or diverges: If the sequece

More information

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks Eergy-Optimal Olie Algorithms for Broadcastig i Wireless Networks Shay Kutte, Hirotaka Oo, David Peleg, Kuihiko Sadakae, ad Masafumi Yamashita Abstract The paper cosiders the desig of eergy-efficiet olie

More information

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction THE LUCAS TRIANLE RECOUNTED Arthur T Bejami Dept of Mathematics, Harvey Mudd College, Claremot, CA 91711 bejami@hmcedu 1 Itroductio I 2], Neville Robbis explores may properties of the Lucas triagle, a

More information

Shuffling. Shahrzad Haddadan. March 7, 2013

Shuffling. Shahrzad Haddadan. March 7, 2013 Shufflig Shahrzad Haddada March 7, 2013 Abstract I this paper we will talk about two well-kow shufflig methods, the Top to Radom ad the Riffle Shuffle. We are iterested i the umber of shuffles that will

More information

Using Color Histograms to Recognize People in Real Time Visual Surveillance

Using Color Histograms to Recognize People in Real Time Visual Surveillance Usig Color Histograms to Recogize People i Real Time Visual Surveillace DANIEL WOJTASZEK, ROBERT LAGANIERE S.I.T.E. Uiversity of Ottawa, Ottawa, Otario CANADA daielw@site.uottawa.ca, lagaier@site.uottawa.ca

More information

RMS WIDTH OF PULSES PROPAGATING IN AN ARBITRARY DISPERSIVE MEDIUM

RMS WIDTH OF PULSES PROPAGATING IN AN ARBITRARY DISPERSIVE MEDIUM RMS WIDTH OF PULSES PROPAGATING IN AN ARBITRARY DISPERSIVE MEDIUM P.- A. Bélaer, A. Gajadharsih COPL, Départemet de Physique, Uiversité Laval. ad C. Paré Istitut Natioal d Optique INO, Québec. Abstract

More information

Propositional Proofs in Frege and Extended Frege Systems (Abstract)

Propositional Proofs in Frege and Extended Frege Systems (Abstract) Propositioal Proofs i Frege ad Exteded Frege Systems (Abstract) Sam Buss Departmet of Mathematics Uiversity of Califoria, Sa Diego La Jolla, Califoria 92130-0112, USA sbuss@math.ucsd.edu http://math.ucsd.edu/~sbuss

More information

X-Bar and S-Squared Charts

X-Bar and S-Squared Charts STATGRAPHICS Rev. 7/4/009 X-Bar ad S-Squared Charts Summary The X-Bar ad S-Squared Charts procedure creates cotrol charts for a sigle umeric variable where the data have bee collected i subgroups. It creates

More information

Enhancement of the IEEE MAC Protocol for Scalable Data Collection in Dense Sensor Networks

Enhancement of the IEEE MAC Protocol for Scalable Data Collection in Dense Sensor Networks Ehacemet of the IEEE 8.5. MAC Protocol for Scalable Data Collectio i Dese Sesor Networks Kira Yedavalli Departmet of Electrical Egieerig - Systems Uiversity of Souther Califoria Los Ageles, Califoria,

More information

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering ADSP ADSP ADSP ADSP Advaced Digital Sigal Processig (8-79) Sprig Fall Semester, 7 Departmet of Electrical ad Computer Egieerig OTES O RADOM PROCESSES I. Itroductio Radom processes are at the heart of most

More information

An Adaptive Image Denoising Method based on Thresholding

An Adaptive Image Denoising Method based on Thresholding A Adaptive Image Deoisig Method based o Thresholdig HARI OM AND MANTOSH BISWAS Departmet of Computer Sciece & Egieerig Idia School of Mies, Dhabad Jharkad-86004 INDIA {hariom4idia, matoshb}@gmail.com Abstract

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Sprig 24 信號與系統 Sigals ad Systems Chapter SS- Sigals ad Systems Feg-Li Lia NTU-EE Feb4 Ju4 Figures ad images used i these lecture otes are adopted from Sigals & Systems by Ala V. Oppeheim ad Ala S. Willsky,

More information

COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS

COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS Mariusz Ziółko, Przemysław Sypka ad Bartosz Ziółko Departmet of Electroics, AGH Uiversity of Sciece ad Techology, al. Mickiewicza 3, 3-59 Kraków, Polad,

More information

8. Combinatorial Structures

8. Combinatorial Structures Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 8. Combiatorial Structures The purpose of this sectio is to study several combiatorial structures that are of basic importace i probability. Permutatios

More information

Importance Analysis of Urban Rail Transit Network Station Based on Passenger

Importance Analysis of Urban Rail Transit Network Station Based on Passenger Joural of Itelliget Learig Systems ad Applicatios, 201, 5, 22-26 Published Olie November 201 (http://www.scirp.org/joural/jilsa) http://dx.doi.org/10.426/jilsa.201.54027 Importace Aalysis of Urba Rail

More information

Selection of the basic parameters of the lens for the optic-electronic target recognition system

Selection of the basic parameters of the lens for the optic-electronic target recognition system Proceedigs of the 5th WSEAS It. Cof. o COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS AND CYBERNETICS, Veice, Italy, November 0-, 006 317 Selectio of the basic parameters of the les for the optic-electroic

More information

DIGITALLY TUNED SINUSOIDAL OSCILLATOR USING MULTIPLE- OUTPUT CURRENT OPERATIONAL AMPLIFIER FOR APPLICATIONS IN HIGH STABLE ACOUSTICAL GENERATORS

DIGITALLY TUNED SINUSOIDAL OSCILLATOR USING MULTIPLE- OUTPUT CURRENT OPERATIONAL AMPLIFIER FOR APPLICATIONS IN HIGH STABLE ACOUSTICAL GENERATORS Molecular ad Quatum Acoustics vol. 7, (6) 95 DGTALL TUNED SNUSODAL OSCLLATOR USNG MULTPLE- OUTPUT CURRENT OPERATONAL AMPLFER FOR APPLCATONS N HGH STABLE ACOUSTCAL GENERATORS Lesław TOPÓR-KAMŃSK Faculty

More information

Lecture 29: MOSFET Small-Signal Amplifier Examples.

Lecture 29: MOSFET Small-Signal Amplifier Examples. Whites, EE 30 Lecture 9 Page 1 of 8 Lecture 9: MOSFET Small-Sigal Amplifier Examples. We will illustrate the aalysis of small-sigal MOSFET amplifiers through two examples i this lecture. Example N9.1 (text

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Sprig 2 信號與系統 Sigals ad Systems Chapter SS- Sigals ad Systems Feg-Li Lia NTU-EE Feb Ju Figures ad images used i these lecture otes are adopted from Sigals & Systems by Ala V. Oppeheim ad Ala S. Willsky,

More information

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay Efficiet Feedback-Based Schedulig Policies for Chuked Network Codes over Networks with Loss ad Delay Aoosheh Heidarzadeh ad Amir H. Baihashemi Departmet of Systems ad Computer Egieerig, Carleto Uiversity,

More information

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks The Fudametal Capacity-Delay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu

More information

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73, CS 01 Schlag Jauary 6, 1999 Witer `99 CS 01: Adversary argumets This hadout presets two lower bouds for selectio problems usig adversary argumets ëku73, HS78, FG76ë. I these proofs a imagiary adversary

More information

Optimal Arrangement of Buoys Observable by Means of Radar

Optimal Arrangement of Buoys Observable by Means of Radar Optimal Arragemet of Buoys Observable by Meas of Radar TOMASZ PRACZYK Istitute of Naval Weapo ad Computer Sciece Polish Naval Academy Śmidowicza 69, 8-03 Gdyia POLAND t.praczy@amw.gdyia.pl Abstract: -

More information

arxiv:math/ v2 [math.pr] 14 Mar 2006

arxiv:math/ v2 [math.pr] 14 Mar 2006 The Aals of Applied Probability 2006, Vol. 16, No. 1, 231 243 DOI: 10.1214/105051605000000692 c Istitute of Mathematical Statistics, 2006 arxiv:math/0501401v2 [math.pr] 14 Mar 2006 THE OVERHAND SHUFFLE

More information

On the Number of Permutations on n Objects with. greatest cycle length

On the Number of Permutations on n Objects with. greatest cycle length Ž. ADVANCES IN APPLIED MATHEMATICS 0, 9807 998 ARTICLE NO. AM970567 O the Number of Permutatios o Obects with Greatest Cycle Legth k Solomo W. Golomb ad Peter Gaal Commuicatio Scieces Istitute, Uiersity

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 3 Sigals & Systems Prof. Mark Fowler Note Set #6 D-T Systems: DTFT Aalysis of DT Systems Readig Assigmet: Sectios 5.5 & 5.6 of Kame ad Heck / Course Flow Diagram The arrows here show coceptual flow

More information

Keywords and Phrases: Price wars, repeated games, private information.

Keywords and Phrases: Price wars, repeated games, private information. Itetioal Price Wars o the Equilibrium Path Erik Pot 1, Roald Peeters 2, Has Peters 3 ad Dries Vermeule 4 Abstract I this paper we study the effect of iformatio o the occurrece of itetioal price wars o

More information

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS APPLICATION NOTE AN95091 INTRODUCTION UNDERSTANDING EFFECTIVE BITS Toy Girard, Sigatec, Desig ad Applicatios Egieer Oe criteria ofte used to evaluate a Aalog to Digital Coverter (ADC) or data acquisitio

More information

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION IN MULTICAST NETWORKS Jordi Ros, Wei K. Tsai ad Mahadeve Iyer Departmet of Electrical ad Computer Egieerig Uiversity of Califoria, Irvie, CA 92697 {jros,

More information

Decode-forward and Compute-forward Coding Schemes for the Two-Way Relay Channel

Decode-forward and Compute-forward Coding Schemes for the Two-Way Relay Channel Decode-forward ad Compute-forward Codig Schemes for the Two-Way Relay Chael Peg Zhog ad Mai Vu Departmet of Electrical ad Computer Egieerig McGill Uiversity Motreal, QC, Caada H3A A7 Emails: peg.zhog@mail.mcgill.ca,

More information

Ordering Constraints over Feature Trees

Ordering Constraints over Feature Trees Orderig Costraits over Feature Trees Marti Müller 1, Joachim Niehre 1 ad Adreas Podelski 2 1 Uiversität des Saarlades, mmueller,iehre @ps.ui-sb.de 2 Max-Plack-Istitut für Iformatik, podelski@mpi-sb.mpg.de

More information

Capacity of Large-scale CSMA Wireless Networks

Capacity of Large-scale CSMA Wireless Networks Capacity of Large-scale CSMA Wireless Networks Chi-Ki Chau, Member, IEEE, Mighua Che, Member, IEEE, ad Soug Ch Liew, Seior Member, IEEE Abstract I the literature, asymptotic studies of multi-hop wireless

More information

(2) The MOSFET. Review of. Learning Outcome. (Metal-Oxide-Semiconductor Field Effect Transistor) 2.0) Field Effect Transistor (FET)

(2) The MOSFET. Review of. Learning Outcome. (Metal-Oxide-Semiconductor Field Effect Transistor) 2.0) Field Effect Transistor (FET) EEEB73 Electroics Aalysis & esig II () Review of The MOSFET (Metal-Oxide-Semicoductor Field Effect Trasistor) Referece: Neame, Chapter 3 ad Chapter 4 Learig Outcome Able to describe ad use the followig:

More information

High-Order CCII-Based Mixed-Mode Universal Filter

High-Order CCII-Based Mixed-Mode Universal Filter High-Order CCII-Based Mixed-Mode Uiversal Filter Che-Nog Lee Departmet of Computer ad Commuicatio Egieerig, Taipei Chegshih Uiversity of Sciece ad Techology, Taipei, Taiwa, R. O. C. Abstract This paper

More information

Zonerich AB-T88. MINI Thermal Printer COMMAND SPECIFICATION. Zonerich Computer Equipments Co.,Ltd MANUAL REVISION EN 1.

Zonerich AB-T88. MINI Thermal Printer COMMAND SPECIFICATION. Zonerich Computer Equipments Co.,Ltd  MANUAL REVISION EN 1. Zoerich AB-T88 MINI Thermal Priter COMMAND SPECIFICATION MANUAL REVISION EN. Zoerich Computer Equipmets Co.,Ltd http://www.zoerich.com Commad List Prit ad lie feed Prit ad carriage retur Trasmissio real-time

More information

CONTROLLING FREQUENCY INFLUENCE ON THE OPERATION OF SERIAL THYRISTOR RLC INVERTERS

CONTROLLING FREQUENCY INFLUENCE ON THE OPERATION OF SERIAL THYRISTOR RLC INVERTERS EETRONIS - September, Sozopol, BUGARIA ONTROING FREQUENY INFUENE ON THE OPERATION OF SERIA THYRISTOR R INVERTERS Evgeiy Ivaov Popov, iliya Ivaova Pideva, Borislav Nikolaev Tsakovski Departmet of Power

More information

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions 0 TH EDITION COLLEGE ALGEBRA 4. Logarithic Fuctios Logarithic Equatios Logarithic Fuctios Properties of LIAL HORNSBY SCHNEIDER 4. - 4. - The previous sectio dealt with epoetial fuctios of the for y = a

More information

A Novel Three Value Logic for Computing Purposes

A Novel Three Value Logic for Computing Purposes Iteratioal Joural o Iormatio ad Electroics Egieerig, Vol. 3, No. 4, July 23 A Novel Three Value Logic or Computig Purposes Ali Soltai ad Saeed Mohammadi Abstract The aim o this article is to suggest a

More information

Measurement of Equivalent Input Distortion AN 20

Measurement of Equivalent Input Distortion AN 20 Measuremet of Equivalet Iput Distortio AN 2 Applicatio Note to the R&D SYSTEM Traditioal measuremets of harmoic distortio performed o loudspeakers reveal ot oly the symptoms of the oliearities but also

More information

Intermediate Information Structures

Intermediate Information Structures Modified from Maria s lectures CPSC 335 Itermediate Iformatio Structures LECTURE 11 Compressio ad Huffma Codig Jo Roke Computer Sciece Uiversity of Calgary Caada Lecture Overview Codes ad Optimal Codes

More information

International Power, Electronics and Materials Engineering Conference (IPEMEC 2015)

International Power, Electronics and Materials Engineering Conference (IPEMEC 2015) Iteratioal Power, Electroics ad Materials Egieerig Coferece (IPEMEC 205) etwork Mode based o Multi-commuicatio Mechaism Fa Yibi, Liu Zhifeg, Zhag Sheg, Li Yig Departmet of Military Fiace, Military Ecoomy

More information

A generalization of Eulerian numbers via rook placements

A generalization of Eulerian numbers via rook placements A geeralizatio of Euleria umbers via rook placemets Esther Baaia Steve Butler Christopher Cox Jeffrey Davis Jacob Ladgraf Scarlitte Poce Abstract We cosider a geeralizatio of Euleria umbers which cout

More information

Nonlinear System Identification Based on Reduced Complexity Volterra Models Guodong Jin1,a* and Libin Lu1,b

Nonlinear System Identification Based on Reduced Complexity Volterra Models Guodong Jin1,a* and Libin Lu1,b 6th Iteratioal Coferece o Electroics, Mechaics, Culture ad Medicie (EMCM 205) Noliear System Idetificatio Based o Reduced Complexity Volterra Models Guodog Ji,a* ad Libi Lu,b Xi a research istitute of

More information

RECOMMENDATION ITU-R P Propagation by diffraction

RECOMMENDATION ITU-R P Propagation by diffraction Rec. ITU-R P.- 1 RECOMMENDATION ITU-R P.- Propagatio by diffractio (Questio ITU-R / The ITU Radiocommuicatio Assembly, (1-1-1-1-1-1-1-1- cosiderig a that there is a eed to provide egieerig iformatio for

More information

Dividing Connected Chores Fairly

Dividing Connected Chores Fairly Dividig Coected Chores Fairly Sady Heydrich a,b, Rob va Stee c, a Max Plack Istitute for Iformatics, Saarbrücke, Germay b Saarbrücke Graduate School of Computer Sciece, Germay c Uiversity of Leicester,

More information

CS3203 #5. 6/9/04 Janak J Parekh

CS3203 #5. 6/9/04 Janak J Parekh CS3203 #5 6/9/04 Jaak J Parekh Admiistrivia Exam o Moday All slides should be up We ll try ad have solutios for HWs #1 ad #2 out by Friday I kow the HW is due o the same day; ot much I ca do, uless you

More information

MEI Core 2. Logarithms and exponentials. Section 2: Modelling curves using logarithms. Modelling curves of the form y kx

MEI Core 2. Logarithms and exponentials. Section 2: Modelling curves using logarithms. Modelling curves of the form y kx MEI Core 2 Logarithms ad eoetials Sectio 2: Modellig curves usig logarithms Notes ad Eamles These otes cotai subsectios o: Modellig curves of the form y = k Modellig curves of the form y = ka Modellig

More information

NOISE IN A SPECTRUM ANALYZER. Carlo F.M. Carobbi and Fabio Ferrini Department of Information Engineering University of Florence, Italy

NOISE IN A SPECTRUM ANALYZER. Carlo F.M. Carobbi and Fabio Ferrini Department of Information Engineering University of Florence, Italy NOISE IN A SPECTRUM ANALYZER by Carlo.M. Carobbi ad abio errii Departet of Iforatio Egieerig Uiversity of lorece, Italy 1. OBJECTIVE The objective is to easure the oise figure of a spectru aalyzer with

More information

HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING

HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING H. Chadsey U.S. Naval Observatory Washigto, D.C. 2392 Abstract May sources of error are possible whe GPS is used for time comparisos. Some of these mo

More information

Combined Scheme for Fast PN Code Acquisition

Combined Scheme for Fast PN Code Acquisition 13 th Iteratioal Coferece o AEROSPACE SCIENCES & AVIATION TECHNOLOGY, ASAT- 13, May 6 8, 009, E-Mail: asat@mtc.edu.eg Military Techical College, Kobry Elkobbah, Cairo, Egypt Tel : +(0) 4059 4036138, Fax:

More information

Lecture 4: Frequency Reuse Concepts

Lecture 4: Frequency Reuse Concepts EE 499: Wireless & Mobile Commuicatios (8) Lecture 4: Frequecy euse Cocepts Distace betwee Co-Chael Cell Ceters Kowig the relatio betwee,, ad, we ca easily fid distace betwee the ceter poits of two co

More information

Wi-Fi or Femtocell: User Choice and Pricing Strategy of Wireless Service Provider

Wi-Fi or Femtocell: User Choice and Pricing Strategy of Wireless Service Provider Wi-Fi or Femtocell: User Choice ad Pricig Strategy of Wireless Service Provider Yajiao Che, Qia Zhag Departmet of Computer Sciece ad Egieerig Hog Kog Uiversity of Sciece ad Techology Email: {cheyajiao,

More information

On the Binomial Coefficients and their Interpolation *

On the Binomial Coefficients and their Interpolation * O the Bioial Coefficiets ad their Iterolatio * Leohard Euler Let us rereset the exasio of the ower + x i the followig aer by eas of aroriate characters: + x + x + x + x 3 + etc 3 such that the characters

More information

Jamming-resistant Multi-radio Multi-channel Opportunistic Spectrum Access in Cognitive Radio Networks

Jamming-resistant Multi-radio Multi-channel Opportunistic Spectrum Access in Cognitive Radio Networks JOURNAL OF L A T E X CLASS FILES, VOL. 6, NO., JANUARY 27 Jammig-resistat Multi-radio Multi-chael Opportuistic Spectrum Access i Cogitive Radio Networks Qia Wag, Member, IEEE, Kui Re, Seior Member, IEEE,

More information

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home COMBINATORICS BEGINNER CIRCLE 1/0/013 1. ADVANCE TAXICABS Recall, i the previous lesso, we looked at Taxicabs machies, which always took the shortest path home taxipath We couted the umber of ways that

More information

The Detection of Abrupt Changes in Fatigue Data by Using Cumulative Sum (CUSUM) Method

The Detection of Abrupt Changes in Fatigue Data by Using Cumulative Sum (CUSUM) Method Proceedigs of the th WSEAS Iteratioal Coferece o APPLIED ad THEORETICAL MECHANICS (MECHANICS '8) The Detectio of Abrupt Chages i Fatigue Data by Usig Cumulative Sum (CUSUM) Method Z. M. NOPIAH, M.N.BAHARIN,

More information

The Silicon Controlled Rectifier (SCR)

The Silicon Controlled Rectifier (SCR) The Silico Cotrolled Rectifier (SCR The Silico Cotrolled Rectifier, also called Thyristor, is oe of the oldest power devices, ad it is actually employed as power switch for the largest currets (several

More information

TEN GOOD REASONS FOR USING SPLINE WAVELETS

TEN GOOD REASONS FOR USING SPLINE WAVELETS Proc. SPIE Vol. 369, Wavelets Applicatios i Sigal ad Image Processig V, 997, pp. 4-43. TEN GOOD REASONS FOR USING SPLINE WAVELETS Michael User Swiss Federal Istitute of Techology (EPFL) CH-05 Lausae, Switzerlad.

More information

WSN Node Localization Regularization Algorithm Based on Quasi Optimal Criterion Parameter Selection

WSN Node Localization Regularization Algorithm Based on Quasi Optimal Criterion Parameter Selection Sesors & rasducers Vol. 23 Special Issue July 203 pp. 94-98 Sesors & rasducers 203 by IFSA http://www.sesorsportal.com WSN Node Localizatio Regularizatio Algorithm Based o Quasi Optimal Criterio Parameter

More information

General Model :Algorithms in the Real World. Applications. Block Codes

General Model :Algorithms in the Real World. Applications. Block Codes Geeral Model 5-853:Algorithms i the Real World Error Correctig Codes I Overview Hammig Codes Liear Codes 5-853 Page message (m) coder codeword (c) oisy chael decoder codeword (c ) message or error Errors

More information

Tier-Aware Resource Allocation in OFDMA Macrocell-Small Cell Networks

Tier-Aware Resource Allocation in OFDMA Macrocell-Small Cell Networks 1 Tier-Aware Resource Allocatio i OFDMA Macrocell-Small Cell Networks Amr Abdelasser, Ekram Hossai, ad Dog I Kim arxiv:145.2v1 [cs.ni] 8 May 214 Abstract We preset a joit sub-chael ad power allocatio framework

More information

ELEC 350 Electronics I Fall 2014

ELEC 350 Electronics I Fall 2014 ELEC 350 Electroics I Fall 04 Fial Exam Geeral Iformatio Rough breakdow of topic coverage: 0-5% JT fudametals ad regios of operatio 0-40% MOSFET fudametals biasig ad small-sigal modelig 0-5% iodes (p-juctio

More information