LINES ON BRIESKORN-PHAM SURFACES

Size: px
Start display at page:

Download "LINES ON BRIESKORN-PHAM SURFACES"

Transcription

1 LIN ON BRIKORN-PHAM URFAC GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA Abstact By usng toc modfcatons and a esult of Gonzalez-pnbeg and Lejeune- Jalabet, we answe the followng questons completely On whch Beskon-Pham suface thee exst smooth cuves passng though the sngula pont? If thee exst, how many and what ae the defnng equatons? Intoducton Let (X, 0) be an analytc space gem embedded n (C n, 0), and (L, 0) be a smooth cuve gem n (C n, 0) nce L s locally bholomophc to a lne, we often say that L s a lne If fo a sngula pont O X sng, thee exsts a lne (smooth cuve) L n C n such that O L and L \ {O} X eg, we say that X contans (o has ) a lne passng though O On a sngula suface X n C 3 one can not always fnd a smooth cuve passng though (not contaned n) the sngula locus of X Gonzalez-pnbeg and Lejeune-Jalabet poved a cteon fo the exstence of smooth cuve on any (two dmensonal) suface We quote ths esult hee fo the convenence of the eade Let π : X (X, 0) be the mnmal esoluton of a sngula suface (X, 0) Let L be the set of lnes on (X, 0) Fo an exceptonal dvso, let L denote the set of lnes on (X, 0) wth the stct tansfom ntesectng tansvesally Let m be the maxmal deal of the local ng O X,0 The cycle Z X on X defned by the deal sheaf mo X s called the maxmal cycle of π Gonzalez-pnbeg and Lejeune-Jalabet Theoem ([, 2]) () Thee exsts lnes on (X, 0) f and only f the maxmal cycle Z X has at least one educed component; (2) The set of all the lnes on (X, 0) s a dsjont unon of the L s wth each a educed component n Z X And L s called the famly of lnes coespondng to In [3, 4], lnes on sufaces wth smple sngulates ae classfed by usng the classfcaton machney All the sufaces wth smple o smple ellptc sngulates passng though x-axs ae equvalent to (unde the coodnate tansfomaton pesevng the x-axs) some sufaces defned by explct equatons Remak that by the afoementoned theoem many sngula sufaces have lnes Among the examples ae mnmal sufaces, sandwched sufaces and so on In ths pape we ae nteested n the followng questons on the so-called Beskon-Pham type sufaces, denoted by G(p, q, ), and defned n C 3 by x p + y q + z = 0 99 Mathematcs ubject Classfcaton 4J7, 3225, 3245 Key wods and phases lne, Beskon-Pham suface, toc modfcaton, toson numbe The fst autho was suppoted by JP: P98028

2 2 GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA Fo what knd of (p, q, ), thee ae lnes on G(p, q, )? And fo what knd of (p, q, ), thee ae no lnes on G(p, q, )? Futhemoe, f thee ae lnes, how many? What ae the defnng equatons fo the lnes? We gve complete answes to these questons The method we use hee s the toc modfcatons of suface sngulates We efe the eade to the book [6] fo notons and notatons Thee s an nvaant, called the toson numbe [3], attached to each lne Ths toson numbe s defned as follows Fo a pa of analytc space gems (Σ, 0) (X, 0), embedded n (C n, 0), defned by the deals g h of O := O n,0 espectvely Denote O X := O/h, O Σ := O/g The mage deal of g n O X s denoted by ḡ The O Σ -module M := ḡ/ḡ 2 g/(g 2 + h) s called the conomal module of ḡ If the toson submodule T(M) of M has fnte length, then the length s called the toson numbe of (Σ, X) and s denoted by λ := λ(σ, X) Fo two nteges m > n, let m/n := [m, m 2,, m k ] be the contnued facton epesentaton of m/n Defne Φ(m/n) := max{ m = = m = 2, k} Denote the numbe of famles of lnes on G(p, q, ) by (p, q, ) := {L } By the above mentoned theoem, (p, q, ) = { educed components n Z X } 2 The Newton bounday and the dual Newton dagam Let s := gcd(p, q, ) and p = gcd(q, )/s, q = gcd(, p)/s, = gcd(p, q)/s Let p, q, be the nteges such that p/s =, q/s = p q, /s = p q Then p, q, ae pawsely copme The Newton bounday of G(p, q, ) s a tangle wth vetces A(p, 0, 0), B(0, q, 0), C(0, 0, ) on the plane x/p + y/q + z/ = The dual Newton dagam Γ of G(p, q, ) conssts of = T (, 0, 0), 2 = T (0,, 0), 3 = T (0, 0, ) and P = T (p q,, p q ), whee and n the followng we use T to ndcate that the vecto s a column vecto Accodng to [6, III (63)], n ode to obtan a canoncal toc esoluton of the suface G(p, q, ), we need to make a canoncal egula smplcal subdvson Σ of Γ, whch we descbe oughly as follows (see [6, 7] fo detals) Fo two vectos Q and Q 2 n Z 3, denote by det(q, Q 2 ) the geatest common dvso of the absolute values of the 2 2 mnos of the 3 2 matx (Q, Q 2 ) Obvously, det(, P) = p If p >, P s not egula and we need to subdvde t By [6, II(2)], thee exsts a unque ntege p > p > 0 such that the vecto R := (P + p )/ p s ntegal Then det(r, ) = and det(r, P) = p < p If p >, epeat the pocess fo R P, untl we obtan a egula subdvson of P In ths way, we obtan the canoncal egula smplcal subdvsons of P, 2 P, 3 P Let R = T (,, 2,, 3, ) ( γ) be the ponts beng added to P (see Fgue ) mlaly one adds j = T (s,j, s 2,j, s 3,j ) ( j σ) to 2 P and T k = T (t,k, t 2,k, t 3,k ) ( k τ) to 3 P Then Σ s a egula smplcal subdvson of Γ such that ts estcton to P ( =, 2, 3) s the canoncal egula smplcal subdvson of P descbed above The dual esoluton gaph G of G(p, q, ) s sta-shaped wth the cente P, the exceptonal dvso detemned by P In the followng we use the captal lettes to denote the ponts on Γ as well as the exceptonal dvsos coespondng to them by abusng the symbol The ams n G consst of sp = gcd(q, ) copes of PR, sq = gcd(, p) copes of P and s = gcd(p, q) copes of PT (loc ct)

3 LIN ON BRIKORN-PHAM URFAC 3 3 C T A B R R γ T τ P σ 2 Fgue Newton bounday and dual Newton dagam of Beskon-Pham suface Lemma Wth the notatons as above, we have l, l,+ θ l, s l,j s l,j+ θ l, t l,k t l,k+ θ l, l =, 2, 3, whee θ := p q, θ 2 :=, θ 3 := p q ae the coodnates of P Poof We pove the lemma fo the R s Let π be the toc modfcaton assocated wth the above egula smplcal cone subdvson Σ Let (π x) = +, (R )+p q (P)+D, whee D s the sum of the dvsos whch do not ntesect wth (R ) s Note that the exceptonal dvso (R ) s a dsjont unon of (R (α) ) ( α sp ) ach (R (α) ) possesses the followng popetes: ) (R (α) ) s somophc to P, 2) the self ntesecton numbe of (R (α) ) s not bgge than 2 by [7] and 3) (R (α) ) only ntesects wth (R (α) and (R (α) + ) (hee R(α) 0 := (α), and R (α) γ+ := P), and (R(α) ) (R (β) + ) = δ αβ ([6] P56) Hence fom (π x) (R (α) ) = +,(R (α) )2 +,2 = 0, we have (R (α) )2 = (+,2 )/, 2 whch mples,,2 Fom (π y) (R (α) ) = 0 + 2,(R (α) )2 + 2,2 = 0, we have 2,2 2, mlaly, we can pove the othe nequaltes 3 The exstence of Lnes Theoem 2 Let s = gcd(p, q, ) G(p, q, ) has lnes f and only f G(p/s, q/s, /s) has lnes Poof It follows fom the fact that the two sufaces have the same dual Newton dagam Theoem 3 Assume gcd(p, q, ) = and ( ) : p q G(p, q, ) has lnes f and only f at least one of the followng condtons holds I) Two of the thee nteges p, q, ae copme and the othe one s dvsble by at least one of the copme numbes II) The nequalty > /gcd(p, q) holds )

4 4 GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA Poof We contnue to use the notatons n the begnnng of 2 By the assumpton ( ), we have the nequaltes ( ) : p q p q We fst show the necessty (a) Assume that thee exsts n the coodnates of P Then by ( ) we have p q = whch mples that gcd(p, q) = and Ths coesponds to a specal case of (I) (b) Let det(p, ) = p > The coodnates of R ae, = (p q + p )/ p q + p / p > by ( ), 2, = q q = 3, We assume that 3, = Ths mples that = q = Then we have p =, q = p, = p, fom whch we have gcd(p, q) = and q Ths coesponds to a case of (I) (c) In case det(p, 2 ) = q >, the coodnates of ae s 2, = ( + q )/ q >, s, = p s 3, = p Assume that s 3, = p = Then p and gcd(p, q) = Ths s also a case of (I) (d) If det(p, 3 ) = >, the coodnates of T ae t, = p q t 2, = and t 3, = ( p q + )/ In ths case, we have only two possbltes (d-) Fstly, assume that t 2, = whch s equvalent to p q and gcd(p, ) = Ths s a case of (I) nce gcd(p, q, ) =, ths s also a case of (II) f p > (d-2) econdly, assume that t 3, = Ths mples = p q + fo some > > 0, whch mples that > p q Ths mples that > /gcd(p, q), whch coesponds to (II) Note that all the coodnates of R ( > n case p > ) and that of j (j > n case q > ) ae bgge than one Also the fst two coodnates of T k (k > n case > ) ae bgge than one By lemma, t 3,k = mples that t 3,α = fo all α =,, k Hence > / gcd(p, q) We show the suffcency Assume fst that (II): > /gcd(p, q) Then > p q and = p q and we get t 3, = Next, assume that (I) s satsfed Then by ( ), ethe () gcd(p, q) = and p o q o (2) gcd(p, ) = and p q () coesponds to a case of (a), (b), o (c) and (2) coesponds to a case of (a) o (d) Fo example assume that gcd(p, q) = and p Ths mples that = and p q Thus p = and ths coesponds to (c) (espectvely to (a)) f q > (esp f q = ) The othe cases ae teated smlaly Remak 4 The case that p = s a specal case of (I) and (II) 4 quatons, numbes and toson numbes of the lnes We contnue to use the notatons n the begnnng of 2 and to assume p q Gonzalez- pnbeg and Lejeune-Jalabet theoem also gves a way to fnd the defnng equatons of the lnes (as cuves n C 3 ) on a suface The computaton of the toson numbe can be done as follows Fo a lne L wth paametezaton x = x(t), y = y(t), z = z(t), one may assume that dx dt (0) 0 By the nvese functon theoem, we have t = t(x) Hence the lne L can be defned by y φ(x) = 0 and z ψ(x) = 0 We choose the followng local coodnate tansfomaton of (C 3, 0): x = x, y = y φ(x), z = z ψ(x) The defnng deal of L s thus g = (y, z ) The defnng equaton of the suface contanng L can be wtten as h ax y + bx z mod g 2 Then λ = dm O/(x (a, b) + g) (see [4])

5 LIN ON BRIKORN-PHAM URFAC 5 Lemma 5 (p, p, p) = and the lne can be paametezed by and the toson numbe λ = p x = bt, y = ct, z = t, wth b p + c p + = 0, Poof The poof s tval and s omtted Lemma 6 ) If p >, then (p,, ) = p( ) + Let T 0 := 3, T := P, and T,, T be the ponts on 3 P to make the canoncal egula smplcal subdvson of 3 P Then to each T k coespond p educed components T () k maxmal cycle of G(p,, ) The toson numbes fo the lnes n L () T k the same: λ = k(p )q; ( > k > 0) n the (k fxed) ae 2) If p > and q, then (p,, p) = p( + q ) Let T 0 := 3, and T,, T the q be ponts on 3 P to make the canoncal egula smplcal subdvson of 3 P Then to each T k = T (kq, k, ) coespond p educed components T () k (k > 0) n the maxmal cycle of G(p,, p) The toson numbes of the lnes n L () T fo each fxed k (k =,, q ) k ae the same λ = k(p )q Let be on P 2 (see Fgue ) wth as the last coodnate Thee ae p educed components () ( =,, p) n the maxmal cycle { coespondng to ( The )} toson ae the same: λ = mn (p ), ( ) + q numbes of the lnes n L () Poof We leave the easy poof to the eade In the followng, we assume that gcd(p, q, ) = and < p q The exact numbes of famles of lnes ae gven n Table The poof s n lemma 7 Lemma 7 Let < p < q = and gcd(p, q) = Thee ae q educed components R () n the maxmal cycle coespondng to R (see fgue ) And the q famles of lnes on G(p, q, q) can be paametezed by x = ct + q p, y = t, z = ω β ( + c p t p δ ) /q t, β =,, q, [ whee c 0 s a constant, ω β s a oot of ω q =, and δ = q p q p { ( )} of these lnes ae the same λ = mn q, (p ) + q p Poof We omt the easy poof ] The toson numbes Lemma 8 Let gcd(p, q) = and The maxmal cycle s educed and conssts of T k+ = T ((k +)q, (k +)p, ) (k = 0,, = / ) The lnes n L Tk+ can be paametezed by x = c kq u (+αq+k)/p t (k+)q, y = c kp u α+kp t (k+)p, z = cut, whee 0 α < p such that ( + αq + k)/p s an ntege, c 0 s a constant and u = u(t) s a unt satsfyng + u + u (α+pk)q v (k+) w k = 0 The toson numbe fo the lnes n L Tk+ s λ = (k + )(p )q

6 6 GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA Condtons (p, q, ) = q q gcd(p, q) = > q, = + Φ( ) < p < q > q, p, q + q = + Φ( ) + q > q, p, q [ ] + p = + Φ( ) + p > gcd(p,q) < p q gcd(p, q, ) = gcd(p, q) =, p, q o gcd(p, q) > gcd(p, q) gcd(p,q) { ( = gcd(p, q) + Φ /gcd(p,q) )} Table Numbe of lnes on Beskon-Pham sufaces Poof In ths case P = T ( q, p, ) and det(p, ) = det(p, 2 ) =, det(p, 3 ) = Let 0 α, β < p such that M k = p ( + αt k+ + βt k ) = T( ) + αq + k, α + pk, p s ntegal Fom the chat detemned by M k, T k+, T k, one can do all the computatons Lemma 9 Let gcd(p, q) = and p, q In the maxmal cycle thee ae q educed components R () ( q) coespondng to R = T (( + δ)/p, /q, ), whee 0 < δ < p such that ( + δ)/p s an ntege The lnes n L () R can be paametezed as x = ct (+δ)/p, y = ω ( + c q t δ) /q t /q, z = t, whee c 0 s a constant { and ω([ s] a oot ) of ω q =, } =,, q The toson numbes ae the same: λ = mn (p ) p +, (q )/q Moeove, f >, n the maxmal cycle thee ae also educed components coespondng to T k+ = T ((k + )q, (k + )p, ) (k = 0,, ) The paametezatons and the toson numbes of the lnes n L Tk+ ae the same as n lemma 8 Poof One only needs to pove the statement about L R (), whch can be done fom the chat detemned by, 2, R

7 LIN ON BRIKORN-PHAM URFAC 7 Lemma 0 Let gcd(p, q) = and p, q In the maxmal cycle, thee ae p educed components (j) ( j p) coespondng to = T (/p, ( + δ)/q, ), whee 0 < δ < q such that s ntegal The lnes n L (j) can be paametezed by x = ω j ( + c q t δ ) /p t /p, y = ct (+δ)/q, z = t, whee c 0 s a constant { and ([ ω j ] s a ) oot of ω p =, } j =,, p The toson numbes [ ae the same: λ = mn (q ) q +, (p )/p Moeove, f >, thee ae also ] educed components n the maxmal cycle coespondng to T k+ = T ((k + )q, (k + )p, ) (k = 0,, ) The paametezatons and the toson numbes of the lnes n L Tk+ ae the same as n lemma 8 Poof mla to that of lemma 9 Lemma Let gcd(p, q, ) =, < p q and > / gcd(p, q) Assume that ethe gcd(p, q) =, p, q o gcd(p, q) > Then to each T k+ = T( ) (k + )q (k + )p gcd(p, q), gcd(p, q) gcd(p, q),, (k = 0,, ) coespond gcd(p, q) educed components T (γ) k+ (γ =,, gcd(p, q)) n the maxmal cycle And they ae the only educed components n the maxmal cycle Fo fxed k, the lnes n L T (γ) k+ can be paametezed by x = c k q u (+(k p+α) q)/ p γ t (k+) q, y = c k p u k p+α γ t (k+) p, z = cu γ t, γ =,,, whee u γ s a unt satsfyng + u + c k u (k p+α)q t (k+) = 0, and = gcd(p, q), p = p/, q = q/, 0 α < p such that ( + (k p+α) q)/ p s an ntege And the toson numbes of the lnes n L (γ) T ae: λ = (k + )(p )q/ gcd(p, q) k+ Poof Notce that all the coodnates [ of R and ] j ae geate than and T k+ s as n the statement of the lemma (k = 0,, gcd(p,q) ) Denote T 0 := 3 Let 0 α, β < p be the nteges such that M k := p ( + αt k+ + βt k ) = T( ) + (k p + α) q, k p + α, p s ntegal Then the smplex detemned by M k, T k+, T k s egula Fom ths chat, one can obtan the gven paametezaton of the lnes n L (γ) T by a calculaton k+ Coollay 2 If any two of the p, q, ae copme and q = p+α, = q + β wth 0 < α < p, 0 < β < q, thee do not exst smooth cuves on G(p, q, ) Poof We gve an elementay poof Let C be a smooth cuve n (C 3, 0), paametezed by x = x(t) = a k t k, y = y(t) = b k t k, z = z(t) = c k t k, t < ǫ k= Then C G(p, q, ) f and only f k= k= [x(t)] p + [y(t)] q + [z(t)] = 0 fo all t < ǫ Fom ths and the assumpton on p, q,, one can deduce that a = b = c = 0

8 8 GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA xample 3 ) On 8 suface G(2, 3, 5) thee do not exst lnes 2) On the sufaces G(2, 3, 7), thee exsts one famly of lnes A egula subdvson of the dual Newton dagam s gven n Fgue 2 Whee P = T (2, 4, 6), Q = T (, 7, 3), P Q R T 2 Fgue 2 R = T (7, 5, 2), = T (3, 2, ), = T (,, ), 2 = T (2, 2, ), 3 = T (2,, 2), 4 = T (2,, ), T = T (4, 3, ) Only the exceptonal dvsos coespondng to P, Q, R, have non-empty ntesectons wth the stct tansfom of the suface G(2, 3, 7) On the chat coespondng to the tangle σ = QP, we have the modfcaton map epesented by x = u v 2 w 3, y = u 7 v 4 w 2, z = u 3 v 6 w, whee (u, v, w) s the coodnates on the chat coespondng to σ The stct tansfom of G(2, 3, 7) s defned by u + w + = 0 The exceptonal dvso coespondng to s defned by u + = 0, w = 0 The blowng down of the lne v = c 0, u + w + = 0 s the smooth cuve n (C 3, 0): x = c 2 ( + t) t 3, y = c 4 ( + t) 7 t 2, z = c 6 ( + t) 3 t, whee t C s the paamete Ths cuve s on G(2, 3, 7) wth toson numbe 3 Remak 4 If one apples the fomula n lemma to ths example, one gets a dffeent paametezaton Ths shows that the paametezatons of the lnes n the same famly mght be dffeent Ths s because the toc modfcatons of the suface and the chat used mght be dffeent Howeve, the toson numbes ae nvaant

9 LIN ON BRIKORN-PHAM URFAC 9 Refeences [] G Gonzalez-pnbeg, M Lejeune-Jalabet, Coubes lsses su les sngulatés de suface, C R Acad c Pas, t éte, I, 38 (994) [2] G Gonzalez-pnbeg, M Lejeune-Jalabet, Famles of smooth cuves on suface sngulates and wedges, Ann Polonc Math, LXVII2 (997) [3] G Jang, Functons wth non-solated sngulates on sngula spaces, Thess, Unvestet Utecht, 998 [4] G Jang, D esma, Local embeddngs of lnes n sngula hypesufaces, Ann Inst Foue (Genoble), 49 (999) no 4, [5] H B Laufe, Nomal two-dmensonal sngulates, Ann Math tudes, 7, Pnceton Unv Pess, Pnceton 97 [6] M Oka, Non-degeneate complete ntesecton sngulaty, Hemann, Édteus des cences et des Ats, 997 [7] M Oka, On the esoluton of the hypesuface sngulates, n: eds T uwa, P, Wagech, Complex analytc sngulates, Advanced tudes n Pue Math 8, Knokunya Company, Tokyo, 987, p Jang (tll Mach 3, 2000), Oka and Pho : Depatment of Mathematcs, Faculty of cence, Tokyo Metopoltan Unvesty, Mnam-Ohsawa -, Hachoj-sh,Tokyo, JAPAN -mal addess: jang@compmeto-uacjp -mal addess: pdta@compmeto-uacjp -mal addess: oka@compmeto-uacjp esma : Depatment of Mathematcs, Utecht Unvesty, Budapestlaan 6, POBox 8000, 3508 TA Utecht, The Nethelands -mal addess: sesma@mathuunl Jang (pemanent): Laonng 2000, People s Republc of Chna -mal addess: jzjgf@maljzpttlncn Depatment of Mathematcs, Jnzhou Nomal Unvesty, Jnzhou h,

An Algorithm For Factoring Integers

An Algorithm For Factoring Integers An Algothm Fo Factong Integes Yngpu Deng and Yanbn Pan Key Laboatoy of Mathematcs Mechanzaton, Academy of Mathematcs and Systems Scence, Chnese Academy of Scences, Bejng 100190, People s Republc of Chna

More information

Orbit dynamics and kinematics with full quaternions

Orbit dynamics and kinematics with full quaternions bt dynamcs and knematcs wth full quatenons Davde Andes and Enco S. Canuto, Membe, IEEE Abstact Full quatenons consttute a compact notaton fo descbng the genec moton of a body n the space. ne of the most

More information

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

On Lockett pairs and Lockett conjecture for π-soluble Fitting classes On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs

More information

(Semi)Parametric Models vs Nonparametric Models

(Semi)Parametric Models vs Nonparametric Models buay, 2003 Pobablty Models (Sem)Paametc Models vs Nonpaametc Models I defne paametc, sempaametc, and nonpaametc models n the two sample settng My defnton of sempaametc models s a lttle stonge than some

More information

PCA vs. Varimax rotation

PCA vs. Varimax rotation PCA vs. Vamax otaton The goal of the otaton/tansfomaton n PCA s to maxmze the vaance of the new SNP (egensnp), whle mnmzng the vaance aound the egensnp. Theefoe the dffeence between the vaances captued

More information

REAL INTERPOLATION OF SOBOLEV SPACES

REAL INTERPOLATION OF SOBOLEV SPACES REAL INTERPOLATION OF SOBOLEV SPACES NADINE BADR Abstact We pove that W p s a eal ntepolaton space between W p and W p 2 fo p > and p < p < p 2 on some classes of manfolds and geneal metc spaces, whee

More information

Order-Degree Curves for Hypergeometric Creative Telescoping

Order-Degree Curves for Hypergeometric Creative Telescoping Ode-Degee Cuves fo Hyegeometc Ceatve Telescong ABSTRACT Shaosh Chen Deatment of Mathematcs NCSU Ralegh, NC 7695, USA schen@ncsuedu Ceatve telescong aled to a bvaate oe hyegeometc tem oduces lnea ecuence

More information

Gravitation. Definition of Weight Revisited. Newton s Law of Universal Gravitation. Newton s Law of Universal Gravitation. Gravitational Field

Gravitation. Definition of Weight Revisited. Newton s Law of Universal Gravitation. Newton s Law of Universal Gravitation. Gravitational Field Defnton of Weght evsted Gavtaton The weght of an object on o above the eath s the gavtatonal foce that the eath exets on the object. The weght always ponts towad the cente of mass of the eath. On o above

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

We are now ready to answer the question: What are the possible cardinalities for finite fields?

We are now ready to answer the question: What are the possible cardinalities for finite fields? Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

More information

A New replenishment Policy in a Two-echelon Inventory System with Stochastic Demand

A New replenishment Policy in a Two-echelon Inventory System with Stochastic Demand A ew eplenshment Polcy n a wo-echelon Inventoy System wth Stochastc Demand Rasoul Haj, Mohammadal Payesh eghab 2, Amand Babol 3,2 Industal Engneeng Dept, Shaf Unvesty of echnology, ehan, Ian (haj@shaf.edu,

More information

Drag force acting on a bubble in a cloud of compressible spherical bubbles at large Reynolds numbers

Drag force acting on a bubble in a cloud of compressible spherical bubbles at large Reynolds numbers Euopean Jounal of Mechancs B/Fluds 24 2005 468 477 Dag foce actng on a bubble n a cloud of compessble sphecal bubbles at lage Reynolds numbes S.L. Gavlyuk a,b,,v.m.teshukov c a Laboatoe de Modélsaton en

More information

AREA COVERAGE SIMULATIONS FOR MILLIMETER POINT-TO-MULTIPOINT SYSTEMS USING STATISTICAL MODEL OF BUILDING BLOCKAGE

AREA COVERAGE SIMULATIONS FOR MILLIMETER POINT-TO-MULTIPOINT SYSTEMS USING STATISTICAL MODEL OF BUILDING BLOCKAGE Radoengneeng Aea Coveage Smulatons fo Mllmete Pont-to-Multpont Systems Usng Buldng Blockage 43 Vol. 11, No. 4, Decembe AREA COVERAGE SIMULATIONS FOR MILLIMETER POINT-TO-MULTIPOINT SYSTEMS USING STATISTICAL

More information

On the Efficiency of Equilibria in Generalized Second Price Auctions

On the Efficiency of Equilibria in Generalized Second Price Auctions On the Effcency of Equlba n Genealzed Second Pce Auctons Ioanns Caaganns Panagots Kanellopoulos Chstos Kaklamans Maa Kyopoulou Depatment of Compute Engneeng and Infomatcs Unvesty of Patas and RACTI, Geece

More information

Institut für Halle Institute for Economic Research Wirtschaftsforschung Halle

Institut für Halle Institute for Economic Research Wirtschaftsforschung Halle Insttut fü Halle Insttute fo Economc Reseach Wtschaftsfoschung Halle A Smple Repesentaton of the Bea-Jaque-Lee Test fo Pobt Models Joachm Wlde Dezembe 2007 No. 13 IWH-Dskussonspapee IWH-Dscusson Papes

More information

Seshadri constants and surfaces of minimal degree

Seshadri constants and surfaces of minimal degree Seshadi constants and sufaces of minimal degee Wioletta Syzdek and Tomasz Szembeg Septembe 29, 2007 Abstact In [] we showed that if the multiple point Seshadi constants of an ample line bundle on a smooth

More information

Additional File 1 - A model-based circular binary segmentation algorithm for the analysis of array CGH data

Additional File 1 - A model-based circular binary segmentation algorithm for the analysis of array CGH data 1 Addtonal Fle 1 - A model-based ccula bnay segmentaton algothm fo the analyss of aay CGH data Fang-Han Hsu 1, Hung-I H Chen, Mong-Hsun Tsa, Lang-Chuan La 5, Ch-Cheng Huang 1,6, Shh-Hsn Tu 6, Ec Y Chuang*

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of

More information

Electric Potential. otherwise to move the object from initial point i to final point f

Electric Potential. otherwise to move the object from initial point i to final point f PHY2061 Enched Physcs 2 Lectue Notes Electc Potental Electc Potental Dsclame: These lectue notes ae not meant to eplace the couse textbook. The content may be ncomplete. Some topcs may be unclea. These

More information

A Novel Lightweight Algorithm for Secure Network Coding

A Novel Lightweight Algorithm for Secure Network Coding A Novel Lghtweght Algothm fo Secue Netwok Codng A Novel Lghtweght Algothm fo Secue Netwok Codng State Key Laboatoy of Integated Sevce Netwoks, Xdan Unvesty, X an, Chna, E-mal: {wangxaoxao,wangmeguo}@mal.xdan.edu.cn

More information

TRUCK ROUTE PLANNING IN NON- STATIONARY STOCHASTIC NETWORKS WITH TIME-WINDOWS AT CUSTOMER LOCATIONS

TRUCK ROUTE PLANNING IN NON- STATIONARY STOCHASTIC NETWORKS WITH TIME-WINDOWS AT CUSTOMER LOCATIONS TRUCK ROUTE PLANNING IN NON- STATIONARY STOCHASTIC NETWORKS WITH TIME-WINDOWS AT CUSTOMER LOCATIONS Hossen Jula α, Maged Dessouky β, and Petos Ioannou γ α School of Scence, Engneeng and Technology, Pennsylvana

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

Keywords: Transportation network, Hazardous materials, Risk index, Routing, Network optimization.

Keywords: Transportation network, Hazardous materials, Risk index, Routing, Network optimization. IUST Intenatonal Jounal of Engneeng Scence, Vol. 19, No.3, 2008, Page 57-65 Chemcal & Cvl Engneeng, Specal Issue A ROUTING METHODOLOGY FOR HAARDOUS MATIALS TRANSPORTATION TO REDUCE THE RISK OF ROAD NETWORK

More information

Embedding lattices in the Kleene degrees

Embedding lattices in the Kleene degrees F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded

More information

Generalizing the degree sequence problem

Generalizing the degree sequence problem Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

More information

The descriptive complexity of the family of Banach spaces with the π-property

The descriptive complexity of the family of Banach spaces with the π-property Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014

More information

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2) MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

Mixed Task Scheduling and Resource Allocation Problems

Mixed Task Scheduling and Resource Allocation Problems Task schedulng and esouce allocaton 1 Mxed Task Schedulng and Resouce Allocaton Poblems Mae-José Huguet 1,2 and Pee Lopez 1 1 LAAS-CNRS, 7 av. du Colonel Roche F-31077 Toulouse cedex 4, Fance {huguet,lopez}@laas.f

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Finite Math Chapter 10: Study Guide and Solution to Problems

Finite Math Chapter 10: Study Guide and Solution to Problems Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount

More information

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

MULTIPLE SOLUTIONS OF THE PRESCRIBED MEAN CURVATURE EQUATION

MULTIPLE SOLUTIONS OF THE PRESCRIBED MEAN CURVATURE EQUATION MULTIPLE SOLUTIONS OF THE PRESCRIBED MEAN CURVATURE EQUATION K.C. CHANG AND TAN ZHANG In memoy of Pofesso S.S. Chen Abstact. We combine heat flow method with Mose theoy, supe- and subsolution method with

More information

Perturbation Theory and Celestial Mechanics

Perturbation Theory and Celestial Mechanics Copyght 004 9 Petubaton Theoy and Celestal Mechancs In ths last chapte we shall sketch some aspects of petubaton theoy and descbe a few of ts applcatons to celestal mechancs. Petubaton theoy s a vey boad

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction

Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction Intenatonal Jounal of Machne Leanng and Computng, Vol. 2, No. 3, June 202 Effcent Evolutonay Data Mnng Algothms Appled to the Insuance Faud Pedcton Jenn-Long Lu, Chen-Lang Chen, and Hsng-Hu Yang Abstact

More information

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Symmetric polynomials and partitions Eugene Mukhin

Symmetric polynomials and partitions Eugene Mukhin Symmetic polynomials and patitions Eugene Mukhin. Symmetic polynomials.. Definition. We will conside polynomials in n vaiables x,..., x n and use the shotcut p(x) instead of p(x,..., x n ). A pemutation

More information

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem. Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set

More information

Explicit, analytical solution of scaling quantum graphs. Abstract

Explicit, analytical solution of scaling quantum graphs. Abstract Explicit, analytical solution of scaling quantum gaphs Yu. Dabaghian and R. Blümel Depatment of Physics, Wesleyan Univesity, Middletown, CT 06459-0155, USA E-mail: ydabaghian@wesleyan.edu (Januay 6, 2003)

More information

Ring structure of splines on triangulations

Ring structure of splines on triangulations www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

More information

Statistical modelling of gambling probabilities

Statistical modelling of gambling probabilities Ttle Statstcal modellng of gamblng pobabltes Autho(s) Lo, Su-yan, Vcto.; 老 瑞 欣 Ctaton Issued Date 992 URL http://hdl.handle.net/0722/3525 Rghts The autho etans all popetay ghts, (such as patent ghts) and

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES

FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES FINITE HILBERT STABILITY OF (BICANONICAL CURVES JAROD ALPER, MAKSYM FEDORCHUK, AND DAVID ISHII SMYTH* To Joe Harrs on hs sxteth brthday Abstract. We prove that a generc canoncally or bcanoncally embedded

More information

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

Nontrivial lower bounds for the least common multiple of some finite sequences of integers J. Numbe Theoy, 15 (007), p. 393-411. Nontivial lowe bounds fo the least common multiple of some finite sequences of integes Bai FARHI bai.fahi@gmail.com Abstact We pesent hee a method which allows to

More information

I = Prt. = P(1+i) n. A = Pe rt

I = Prt. = P(1+i) n. A = Pe rt 11 Chapte 6 Matheatcs of Fnance We wll look at the atheatcs of fnance. 6.1 Sple and Copound Inteest We wll look at two ways nteest calculated on oney. If pncpal pesent value) aount P nvested at nteest

More information

COLLOQUIUM MATHEMATICUM

COLLOQUIUM MATHEMATICUM COLLOQUIUM MATHEMATICUM VOL. 74 997 NO. TRANSFERENCE THEORY ON HARDY AND SOBOLEV SPACES BY MARIA J. CARRO AND JAVIER SORIA (BARCELONA) We show that the transference method of Cofman and Wess can be extended

More information

16. Mean Square Estimation

16. Mean Square Estimation 6 Me Sque stmto Gve some fomto tht s elted to uow qutty of teest the poblem s to obt good estmte fo the uow tems of the obseved dt Suppose epeset sequece of dom vbles bout whom oe set of obsevtos e vlble

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Green's function integral equation methods for plasmonic nanostructures

Green's function integral equation methods for plasmonic nanostructures Geens functon ntegal equaton methods fo plasmonc nanostuctues (Ph Couse: Optcal at the Nanoscale) Thomas Søndegaad epatment of Phscs and Nanotechnolog, Aalbog Unvest, Senve 4A, K-9 Aalbog Øst, enma. Intoducton

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

Lecture 16: Color and Intensity. and he made him a coat of many colours. Genesis 37:3

Lecture 16: Color and Intensity. and he made him a coat of many colours. Genesis 37:3 Lectue 16: Colo and Intensity and he made him a coat of many colous. Genesis 37:3 1. Intoduction To display a pictue using Compute Gaphics, we need to compute the colo and intensity of the light at each

More information

Degrees of freedom in HLM models

Degrees of freedom in HLM models Degees o eedom n HLM models The vaous degees o eedom n a HLM2/HLM3 model can be calculated accodng to Table 1 and Table 2. Table 1: Degees o Feedom o HLM2 Models Paamete/Test Statstc Degees o Feedom Gammas

More information

On Some Functions Involving the lcm and gcd of Integer Tuples

On Some Functions Involving the lcm and gcd of Integer Tuples SCIENTIFIC PUBLICATIONS OF THE STATE UNIVERSITY OF NOVI PAZAR SER. A: APPL. MATH. INFORM. AND MECH. vol. 6, 2 (2014), 91-100. On Some Functions Involving the lcm and gcd of Intege Tuples O. Bagdasa Abstact:

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

UNIT CIRCLE TRIGONOMETRY

UNIT CIRCLE TRIGONOMETRY UNIT CIRCLE TRIGONOMETRY The Unit Cicle is the cicle centeed at the oigin with adius unit (hence, the unit cicle. The equation of this cicle is + =. A diagam of the unit cicle is shown below: + = - - -

More information

Level Annuities with Payments Less Frequent than Each Interest Period

Level Annuities with Payments Less Frequent than Each Interest Period Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach

More information

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant

More information

Bending Stresses for Simple Shapes

Bending Stresses for Simple Shapes -6 Bendng Stesses fo Smple Sapes In bendng, te maxmum stess and amount of deflecton can be calculated n eac of te followng stuatons. Addtonal examples ae avalable n an engneeng andbook. Secton Modulus

More information

Risk Sensitive Portfolio Management With Cox-Ingersoll-Ross Interest Rates: the HJB Equation

Risk Sensitive Portfolio Management With Cox-Ingersoll-Ross Interest Rates: the HJB Equation Risk Sensitive Potfolio Management With Cox-Ingesoll-Ross Inteest Rates: the HJB Equation Tomasz R. Bielecki Depatment of Mathematics, The Notheasten Illinois Univesity 55 Noth St. Louis Avenue, Chicago,

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

A New Estimation Model for Small Organic Software Project

A New Estimation Model for Small Organic Software Project 8 03 ACADEMY PUBLISHER A New Estmaton Model o Small Oganc Sotwae Poject Wan-Jang Han, Tan-Bo Lu, and Xao-Yan Zhang School O Sotwae Engneeng, Bejng Unvesty o Posts and Telecommuncaton, Bejng, Chna Emal:

More information

Chapter 7: Answers to Questions and Problems

Chapter 7: Answers to Questions and Problems 19. Based on the nformaton contaned n Table 7-3 of the text, the food and apparel ndustres are most compettve and therefore probably represent the best match for the expertse of these managers. Chapter

More information

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption Secuty of Full-State Keyed Sponge and uplex: Applcatons to Authentcated Encypton Bat Mennnk 1 Reza Reyhantaba 2 aman Vzá 2 1 ept. Electcal Engneeng, ESAT/COSIC, KU Leuven, and Mnds, Belgum bat.mennnk@esat.kuleuven.be

More information

A Lyapunov Optimization Approach to Repeated Stochastic Games

A Lyapunov Optimization Approach to Repeated Stochastic Games PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/

More information

A PARTICLE-BASED LAGRANGIAN CFD TOOL FOR FREE-SURFACE SIMULATION

A PARTICLE-BASED LAGRANGIAN CFD TOOL FOR FREE-SURFACE SIMULATION C A N A L D E E X P E R I E N C I A S H I D R O D I N Á M I C A S, E L P A R D O Publcacón núm. 194 A PARTICLE-BASED LAGRANGIAN CFD TOOL FOR FREE-SURFACE SIMULATION POR D. MUÑOZ V. GONZÁLEZ M. BLAIN J.

More information

Joint Virtual Machine and Bandwidth Allocation in Software Defined Network (SDN) and Cloud Computing Environments

Joint Virtual Machine and Bandwidth Allocation in Software Defined Network (SDN) and Cloud Computing Environments IEEE ICC 2014 - Next-Geneaton Netwokng Symposum 1 Jont Vtual Machne and Bandwdth Allocaton n Softwae Defned Netwok (SDN) and Cloud Computng Envonments Jonathan Chase, Rakpong Kaewpuang, Wen Yonggang, and

More information

Figure 2. So it is very likely that the Babylonians attributed 60 units to each side of the hexagon. Its resulting perimeter would then be 360!

Figure 2. So it is very likely that the Babylonians attributed 60 units to each side of the hexagon. Its resulting perimeter would then be 360! 1. What ae angles? Last time, we looked at how the Geeks intepeted measument of lengths. Howeve, as fascinated as they wee with geomety, thee was a shape that was much moe enticing than any othe : the

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Mechanics 1: Work, Power and Kinetic Energy

Mechanics 1: Work, Power and Kinetic Energy Mechanics 1: Wok, Powe and Kinetic Eneg We fist intoduce the ideas of wok and powe. The notion of wok can be viewed as the bidge between Newton s second law, and eneg (which we have et to define and discuss).

More information

AMB111F Financial Maths Notes

AMB111F Financial Maths Notes AMB111F Financial Maths Notes Compound Inteest and Depeciation Compound Inteest: Inteest computed on the cuent amount that inceases at egula intevals. Simple inteest: Inteest computed on the oiginal fixed

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Skills Needed for Success in Calculus 1

Skills Needed for Success in Calculus 1 Skills Needed fo Success in Calculus Thee is much appehension fom students taking Calculus. It seems that fo man people, "Calculus" is snonmous with "difficult." Howeve, an teache of Calculus will tell

More information

PREVENTIVE AND CORRECTIVE SECURITY MARKET MODEL

PREVENTIVE AND CORRECTIVE SECURITY MARKET MODEL REVENTIVE AND CORRECTIVE SECURITY MARKET MODEL Al Ahmad-hat Rachd Cheaou and Omd Alzadeh Mousav Ecole olytechnque Fédéale de Lausanne Lausanne Swzeland al.hat@epfl.ch achd.cheaou@epfl.ch omd.alzadeh@epfl.ch

More information

Spirotechnics! September 7, 2011. Amanda Zeringue, Michael Spannuth and Amanda Zeringue Dierential Geometry Project

Spirotechnics! September 7, 2011. Amanda Zeringue, Michael Spannuth and Amanda Zeringue Dierential Geometry Project Spiotechnics! Septembe 7, 2011 Amanda Zeingue, Michael Spannuth and Amanda Zeingue Dieential Geomety Poject 1 The Beginning The geneal consensus of ou goup began with one thought: Spiogaphs ae awesome.

More information

Modeling and computing constrained

Modeling and computing constrained F EAURE A RICLE HE COMPUAION OF CONSRAINED DYNAMICAL SYSEMS: MACHING PHYSICAL MODELING WIH NUMERICAL MEHODS Reseaches have nvestgated modelng and computaton of constaned dynamcal systems, but scentsts

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Graphs of Equations. A coordinate system is a way to graphically show the relationship between 2 quantities.

Graphs of Equations. A coordinate system is a way to graphically show the relationship between 2 quantities. Gaphs of Equations CHAT Pe-Calculus A coodinate sstem is a wa to gaphicall show the elationship between quantities. Definition: A solution of an equation in two vaiables and is an odeed pai (a, b) such

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression. Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook

More information

Determinants of Borrowing Limits on Credit Cards Shubhasis Dey and Gene Mumy

Determinants of Borrowing Limits on Credit Cards Shubhasis Dey and Gene Mumy Bank of Canada Banque du Canada Wokng Pape 2005-7 / Document de taval 2005-7 Detemnants of Boowng mts on Cedt Cads by Shubhass Dey and Gene Mumy ISSN 1192-5434 Pnted n Canada on ecycled pape Bank of Canada

More information

A Markov Chain Grey Forecasting Model: A Case Study of Energy Demand of Industry Sector in Iran

A Markov Chain Grey Forecasting Model: A Case Study of Energy Demand of Industry Sector in Iran 0 3d Iteatoal Cofeece o Ifomato ad Facal Egeeg IED vol. (0) (0) IACSIT ess, Sgapoe A Makov Cha Gey Foecastg Model: A Case Study of Eegy Demad of Idusty Secto Ia A. Kazem +, M. Modaes, M.. Mehega, N. Neshat

More information

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004 OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL Thomas S. Ferguson and C. Zachary Glsten UCLA and Bell Communcatons May 985, revsed 2004 Abstract. Optmal nvestment polces for maxmzng the expected

More information

Week 3-4: Permutations and Combinations

Week 3-4: Permutations and Combinations Week 3-4: Pemutations and Combinations Febuay 24, 2016 1 Two Counting Pinciples Addition Pinciple Let S 1, S 2,, S m be disjoint subsets of a finite set S If S S 1 S 2 S m, then S S 1 + S 2 + + S m Multiplication

More information

On some special nonlevel annuities and yield rates for annuities

On some special nonlevel annuities and yield rates for annuities On some specal nonlevel annutes and yeld rates for annutes 1 Annutes wth payments n geometrc progresson 2 Annutes wth payments n Arthmetc Progresson 1 Annutes wth payments n geometrc progresson 2 Annutes

More information

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves

Nonbinary Quantum Error-Correcting Codes from Algebraic Curves Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu

More information

AN EQUILIBRIUM ANALYSIS OF THE INSURANCE MARKET WITH VERTICAL DIFFERENTIATION

AN EQUILIBRIUM ANALYSIS OF THE INSURANCE MARKET WITH VERTICAL DIFFERENTIATION QUIIRIUM YI OF T IUR MRKT WIT VRTI IFFRTITIO Mahto Okua Faculty of conomcs, agasak Unvesty, 4-- Katafuch, agasak, 8508506, Japan okua@net.nagasak-u.ac.p TRT ach nsuance poduct pe se s dentcal but the nsuance

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

Area distortion of quasiconformal mappings

Area distortion of quasiconformal mappings Area dstorton of quasconformal mappngs K. Astala 1 Introducton A homeomorphsm f : Ω Ω between planar domans Ω and Ω s called K-quasconformal f t s contaned n the Sobolev class W2,loc 1 (Ω) and ts drectonal

More information

Randomized Load Balancing by Joining and Splitting Bins

Randomized Load Balancing by Joining and Splitting Bins Radomzed Load Baacg by Jog ad Spttg Bs James Aspes Ytog Y 1 Itoducto Cosde the foowg oad baacg sceao: a ceta amout of wo oad s dstbuted amog a set of maches that may chage ove tme as maches o ad eave the

More information

Voltage ( = Electric Potential )

Voltage ( = Electric Potential ) V-1 of 9 Voltage ( = lectic Potential ) An electic chage altes the space aound it. Thoughout the space aound evey chage is a vecto thing called the electic field. Also filling the space aound evey chage

More information

Natural hp-bem for the electric field integral equation with singular solutions

Natural hp-bem for the electric field integral equation with singular solutions Natural hp-bem for the electrc feld ntegral equaton wth sngular solutons Alexe Bespalov Norbert Heuer Abstract We apply the hp-verson of the boundary element method (BEM) for the numercal soluton of the

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

Fisher Markets and Convex Programs

Fisher Markets and Convex Programs Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and

More information