On the evaluation of saving-consumption plans
|
|
- Andrea Wells
- 5 years ago
- Views:
Transcription
1 On the evauation of saving-consumption pans Steven Vanduffe Jan Dhaene Marc Goovaerts Juy 13, 2004 Abstract Knowedge of the distribution function of the stochasticay compounded vaue of a series of future (positive and/or negative) payments is needed for soving severa probems in an insurance or finance environment, see e.g. Dhaene et a. (2002 a,b). In Kaas et a. (2000), convex ower bound approximations for such a sum have been proposed. In case of changing signs of the payments however, the distribution function or the quanties of the ower bound are not easy to determine, as the approximation for the random compounded vaue of the payments wi in genera not be a comonotonic sum. In this paper, we present a method for determining accurate and easy computabe approximations for risk measures of such a sum, in case one first has positive payments (savings), foowed by negative ones (consumptions). This particuar cashfow pattern is observed in saving - consumption pans. In such a pan, a person saves money on a reguar basis for a certain number of years. The amount avaiabe at the end of this period is then used to generate a yeary pension for a fixed number of years. Using the resuts of this paper one can find accurate and easy to compute answers to questions such as: "What is the minima required yeary savings effort α during a fixed number of years, such that one wi be abe to meet, with a probabiity of at east (1 ε), a given consumption pattern during the withdrawa period?" 1
2 1 Introduction In a finance or insurance context, one is often interested in the distribution function (d.f.) of a random variabe (r.v.) S given by S = n α i e Z i. (1) Here the α i are rea numbers and (Z 0,Z 1,..., Z n ) is a mutivariate norma random vector. Theaccumuatedvaueattimen of a series of future deterministic saving amounts α i at times i, i =0,...,n 1, can be written in the form (1), where Z i denotes the random accumuation factor over the period [i, n]. The present vaue of a series of future deterministic payments α i at times i, i =1,...,n, can be written in the form (1), where now Z i denotes the random discount factor over the period [0,i]. Determining the price of Asian or basket options in a Back & Schoes setting bois down to computing stop-oss premiums of a r.v. of the type described in (1), see for instance Abrecher, Dhaene, Goovaerts & Schoutens (2003) or Vanmaee, Dhaene, Deestra, Liinev & Goovaerts (2004). As mentioned in Dhaene, Vanduffe, Goovaerts, Kaas & Vyncke (2004) or Vanduffe, Dhaene, Goovaerts & Kaas (2003), setting provisions and capita requirements in an insurance context comes down to determining risk measures reated to a r.v. of the type (1). As the r.v. S defined in (1) is a sum of non-independent ognorma r.v. s, its d.f. cannot be determined anayticay. Therefore a variety of approximation techniques for determining d.f. s of this type have been proposed in the iterature. Practitioners often use a (first two moments) matching ognorma approximation for the d.f. of S. Mievsky & Posner (1998) and Mievsky & Robinson (2000) propose a moment matching reciproca Gamma approximation for the d.f. of S. Kaas, Dhaene and Goovaerts (2000) and Dhaene, Denuit, Goovaerts, Kaas & Vyncke (2002a,b) derive a ower bound approximation for the d.f. of S. The ower bound is defined by E[S Λ] for an appropriate choice of the conditioning r.v. Λ. It is caed a ower bound approximation since (the d.f.) of E[S Λ] is smaer in the convex order sense than (the d.f. of) S. This means that the expectations of both r.v. s are equa, whereas the stop-oss premiums of the ower bound are smaer than the corresponding stop-oss 2
3 premiums of S. The ower bound approximation performs very accurate when an optima choice is made for the conditioning r.v. Λ, see for instance Vanduffe, Hoedemakers & Dhaene (2004). We point out that the ognorma and the reciproca Gamma approximation have been proposed in the context of series of positive cash fows, whereas the ower bound approximation can aso be appied in case of changing signs of the α i. In this case however, and this in contrast to the situation that a α i have equa signs, it is not possibe to find a conditioning r.v. Λ that eads to an accurate approximation for the d.f. of S such that E[S Λ] = P n α i E e Z i Λ is a sum of non-decreasing functions of Λ. This impies that distortion risk measures reated to E[S Λ] cannot be obtained by simpy summing the corresponding risk measures of the individua terms in the sum, as is the case when a α i are positive, see Dhaene, Vanduffe, Tang, Goovaerts, Kaas & Vyncke (2004). Goovaerts, De Schepper, Hua, Darkiewicz & Vyncke (2003) propose an approach that uses convex bounds for the positive and negative sum separatey. They connect the two r.v. s invoved by a copua of a particuar famiy. In this paper, we foow another path to determine accurate and easy computabe approximations for a sum S as defined in (1), in the specia case that one first has positive payments α i (savings) foowed by negative ones (withdrawas). An important situation where one encounters this particuar cash fow pattern, and hence where our resuts can be appied, is the saving - consumption probem. Take as an exampe a 20/65/95 pension pan in a defined contribution pension scheme. A person of age 20 intends to save money for 45 consecutive years (unti retirement). After his retirement, he wants to withdraw money from his pension account on a reguar basis and this for a period of 30 years. Assume that his yeary savings are constant and equa to α, whie his yeary consumption(pension) is constant and equa to 1. A reevant question to answer is: "What is the minima required yeary savings effort α such that this person wi be abe to meet his consumption pattern during the 30 year withdrawa period, with a probabiity of at east (1 ε)? In this paper, we wi present a methodoogy for answering these types of questions. The paper is organized as foows. In Section 2, we describe the savingconsumptionprobem. InSections3and4,wepresentaccurateandeasy computabe approximations for the quanties of fina weath random variabes in the saving-consumption probem. The specia case of constant savings and 3
4 constant withdrawas is considered in Section 5. Finay, in Section 6 the theoretica resuts presented in this paper are iustrated by some numerica exampes. 2 Probem description Consider a set of deterministic amounts α 0,α 1,,α with n 1,m 0. Thefirst n amounts α 0,α 2,,α n 1 are nonnegative and correspond to saving amounts that are put on an investment account at respective times 0, 1,,n 1. Theastm +1amounts α n,α n+1,,α are nonpositive and correspond to withdrawas from the account at times n, n+1,,, respectivey. We wi assume that α 0 > 0 and α n < 0. We wi ca a pan as described above a saving - consumption pan. We assume that the return on the account is generated by a geometric Brownian motion process. An amount of 1 avaiabe on the account at time i 1, is assumed to grow to the random amount e Y i at time i. Hence,the r.v. Y i is the random return over the year [i 1,i]. The r.v. s Y i are i.i.d. and norma distributed, with parameters µ σ2 and 2 σ2. Let V j denote the surpus at time j. By convention, the surpus at time j has to be understood as the surpus just after saving or withdrawa. Starting from the initia vaue V 0 = α 0,thesurpusV j avaiabe at time j is given by the foowing recursive reation: V j = V j 1 e Y j + α j, j =1,,n+ m. (2) For the moment, we aow the surpus to become negative, which means that shortseing of units of the investment account is aowed. Note that for the first saving - ater consuming cash fow pattern as described in (2), we have that once the surpus becomes negative, it wi stay negative over the whoe remaining time period and no recovery is possibe anymore. This ruin scenario can ony occur from time n (retirement) on. Soving the recursion (2), we find that the fina surpus V can be written as V = α i e Z i, (3) 4
5 where the r.v. s Z i are given by Z i = j=i+1 Y j, i =0,,n+ m, (4) and where, by convention, P s j=r a j =0if r>s.ther.v. Z i is the accumuation factor over the period [i, n]. Its mean and variance are given by E [Z i ]=(n + m i) µµ σ2 (5) 2 and σ 2 Z i =(n + m i)σ 2. (6) As it is impossibe to determine the d.f. of V anayticay, we propose to approximate it by the d.f. of V = E [V Λ] (7) for some convenient choice of the conditioning r.v. Λ. Wehavethat(the d.f. of) V is a ower bound in the sense of convex order for (the d.f. of) V, see for instance Kaas, Dhaene & Goovaerts (2000). In particuar, we have that E [V ]=E V = α i e ( i)µ. (8) In the seque, we wi consider a conditioning r.v. Λ which is a inear combination of the compounded returns Z i : Λ = j=0 γ j Z j, (9) for suitabe choices of the parameters γ j. This r.v. can aso be written in terms of the yeary returns: Λ = j=1 where the reation between the β j and the γ j is given by β j Y j, (10) j 1 β j = γ k. (11) k=0 5
6 For more detais about these kind of approximations, its reation with the concept of comonotonicity and its appications in insurance and finance, see Dhaene, Denuit, Goovaerts, Kaas & Vyncke (2002 a,b). Let U be a uniform(0,1) r.v. and et Φ denote the standard norma d.f. After some straightforward derivations we find that the r.v. V defined in (7) with Λ given by (9) is distributed as V α i e E[Z i]+ 1 2 (1 r2 i )σ2 Z +r i σ Zi Φ 1 (U) i, (12) d = where = d stands for equaity in distribution and where the coefficients r i are given by r i = cov (Z P i, Λ) j=i+1 = β j σ Zi σ q P, i =0,,n+ m 1 (13) Λ n + m i j=1 β2 j and r =0. (14) Notice that the ast term in (12), and aso in (3), reduces to the constant number α. For any rea-vaued r.v., we wi denote its distribution function Pr [ x] by F (x). The ower quanties Q[] and the upper quanties Q + p [] of are defined by Q p [] = inf{x R F (x) p}, (15) Q + p [] = sup{x R F (x) p}, p (0, 1), where by convention, inf φ =+ and sup φ =. When F is stricty increasing, we have that Q p [] =Q + p []. Let and g() be rea-vaued r.v. s. If g is non-decreasing and continuous, then Q p [g()] = g (Q p []), (16) Q + p [g()] = g Q + p [], p (0, 1). Furthermore, for any rea number x number, we have p F (x) Q p [] x, (17) Pr [ <x] p x Q + p [], p (0, 1). 6
7 If a the terms α i e E[Z i]+ 1 2 (1 r2 i )σ2 Z +r i σ Zi Φ 1 (U) i in (12) are non-decreasing functions of U (or a are non-increasing functions of U), then we say that V is a comonotonic sum. In case a terms are non-decreasing, then aso the continuous function f defined by f(p) = a i e E[Z i]+ 1 2 (1 r2 i )σ2 Z i +r i σ Zi Φ 1 (p), p (0, 1), (18) is non-decreasing. From (16) we find that in this case, the p-quantie of V is given by Q + p [V] =f(p), p (0, 1). (19) Moreover, in case V is a comonotonic sum, any distortion risk measure (such as VaR p and TVaR p ) reated to V equas the sum of the risk measures reated to the margina terms in (12), see for instance Dhaene, Vanduffe,Tang,Goovaerts,Kaas&Vyncke(2004). Aconditioning r.v. Λ that makes f non-decreasing (and continuous) can aways be found. Indeed, if we take a β j 0 for j =1, 2,...n, whereas β j =0for j = n +1,n+2,..., n + m, then one has that f is non-decreasing, so that (19) hods in this case. Of course, we cannot expect that such a choice of the parameters β j wi in genera ead to an accurate approximation for the d.f. of V. It is cear that for appropriate choices of Λ, ther.v. V wi not necessariy be a comonotonic sum of ognorma r.v. s. Hence, the function f(p) wi not be non-decreasing on the whoe interva (0, 1). This impies that the quanties of V cannot be determined easiy in this case because (16) can not be appied. As noticed above, the cashfow pattern that we consider (first saving - ater consuming) impies that once the vaue V j become negative, no recovery is possibe in the sense that a future vaues V k,k j, wi be negative too. From now on, we wi assume that shortseing is not aowed. Hence, once the surpus reaches eve 0, no further withdrawas from the pension account are aowed. One can easiy verify that under this assumption, the weath W k avaiabe on the account at time k can be expressed as foows in terms of the surpus V k,defined in (2): W k =max[v k, 0], k =0,,n+ m. (20) Quantities heping to decide whether or not to underwrite the saving - consumption pan are the quanties and the distribution function of fina weath 7
8 W.Aswehavethat Q + p [W ]=sup{x Pr [W >x] 1 p}, (21) the quantie Q + p [W ] can be interpreted as the argest amount of money that wi be eft at time n + m, with a probabiity of at east (1 p). A possibe requirement for a saving - consumption pan to be considered as feasibe coud be Q [W ] > 0. Forapanfufiing this condition, there is a probabiity of (at east) 95% that one wi be abe to meet the desired consumption pattern, hence that there wi be no consumption shortfa. For a given pan, one coud be interested in the probabiity that no consumption shortfa wi occur. This probabiity is given by Pr [W > 0]. In genera, the probabiities Pr [W >x] and the quanties Q + p [W ] cannot be determined anayticay. Therefore, we propose to approximate (the d.f. of ) W by (the d.f. of) W =max[v, 0]. From (12), we find that d =max[f(u), 0], (22) W where the function f is defined by (18). We propose to approximate the tai probabiities Pr [W >x] and the quanties Q + p [W ] by Pr W >x and Q + p [W ], respectivey. In the next section we wi prove that under rather weak conditions the function max[f(p), 0] is non-decreasing and continuous. From (16) we find a straightforward way to compute the quanties of W in this case. 3 Approximations for the quanties of W The foowing emma gives sufficient conditions for the function max[f(p), 0] to be non-decreasing. Lemma 1 If a β j > 0, for j =1, 2,...n+ m, then for a p in the unit interva (0, 1), one has that f(p) 0 impies f 0 (p) > 0. Proof. From (13), we find that r i σ Zi = σ P j=i+1 β j q P j=1 β2 j, i =0,,n+ m 1. 8
9 Hence, a correations r i > 0 for i =0, 1,...n + m 1 and the sequence {r i σ Zi } 0 r is stricty decreasing and stricty positive. By appication of the chain rue, we find for p (0, 1) that f 0 (p) = 1 1 a Φ 0 [Φ 1 i e E[Z i]+ 1 2 (1 r2 i )σ2 Z +r i σ Zi Φ 1 (p) i r i σ Zi. (p)] Now assume that f(p) 0 for some vaue of p in the unit interva (0, 1). When n + m =1, it is straightforward to prove that f 0 (p) > 0. 1 Let us now assume that n + m>1. Since > 0 and α Φ 0 [Φ 1 (p)] 0, we find that f 0 (p) > r 1 n 1σ Zn 1 a Φ 0 [Φ 1 i e E[Z i]+ 1 2 (1 r2 i )σ2 Z +r i σ Zi Φ 1 (p) i (p)] which ends the proof. Notice that = r n 1σ Zn 1 Φ 0 [Φ 1 (p)] (f(p) α ) 0, σ 2 β j = Cov (Y j, Λ), j =1,,n+ m. (23) Hence, the condition that a β j > 0 in Lemma 1 means that any yeary return Y j is stricty positive correated with the conditioning random variabe Λ. One can easiy prove that when a β j > 0, one has that im f(p) =a 0 (24) p 0 and im f(p) =+. (25) p 1 When a β j are assumed to be stricty positive, we find from Lemma 1 that the function max [f(p), 0] is non-decreasing (and continuous) on the interva (0, 1). From (22) and (16) we see that the quanties of W can easiy be determined anayticay in this case: Q p [W ] =Q + p [W ] =max[f(p), 0], p (0, 1). (26) 9
10 Under the conditions of Lemma 1, we find that the d.f. of W can be determined from f(f W (x)) = x, x 0, (27) Indeed, we have that for any x 0, n o F W (x) = sup p (0, 1) p F W (x) = sup p (0, 1) Q p [W] x ª = sup{p (0, 1) max[f(p), 0] x} = sup{p (0, 1) f(p) x}, (28) so that the reation (27) foows from (24), (25), Lemma 1 and the fact that f is continuous on (0, 1). 4 On the choice of the conditioning r.v. Λ In order to determine the optima vaues for the coefficients β j, we foow the procedure as expained in Vanduffe, Hoedemakers & Dhaene (2004). They consider the case were a cash fow payments α i are positive. But the procedure can easiy be extended to the case of genera α i. We have that Var[V ] and Var V are given by and Var [V ]= Var V = j=0 j=0 α i α j e E[Z i]+e[z j ]+ 1 2 (σ2 Z i +σ 2 Zj ) (e Cov(Z i,z j ) 1) (29) α i α j e E[Z i]+e[z j ]+ 1 2 (σ2 Z i +σ 2 Zj ) (e r ir j σ Zi σ Zj 1), (30) 10
11 respectivey. Consider the foowing first order approximation for Var V : Var V = j=0 j=0 α i α j e E[Z i]+e[z j ]+ 1 2 (σ2 Z i +σ 2 Zj ) (r i r j σ Zi σ Zj ) (31) µ α i α j e E[Z i]+e[z j ]+ 1 2 (σ2 Z +σ 2 i Zj ) Cov[Zi, Λ] Cov[Z j, Λ] Var(Λ) = (Cov(P α i e E[Z i]+ 1 2 σ2 Z i Z i, Λ)) 2 Var(Λ) =(Corr( α j e E[Z j]+ 1 2 σ2 Z j Zj, Λ)) 2 Var( α j e E[Z j]+ 1 2 σ2 Z j Zj ). j=0 In genera, we have that Var V < Var[V ] hods, uness V = V. Intuitivey, it seems reasonabe to choose Λ such that Var V is maximized and hence as cose as possibe to Var[V ]. In order to find an easy computabe approximation, we propose to choose Λ such that the first order approximation (31) for Var V is maximized: Λ = j=0 j=0 α j e E[Z j]+ 1 2 σ2 Z j Zj. (32) This means that the coefficients β j,j=1,,n+ m, in (10) are given by j 1 j 1 j 1 β j = γ i = α i e E[Z i]+ 1 2 σ2 Z i = α i e ( i)µ. (33) Our main resut is stated in the foowing Theorem. Theorem 2 If the β j,j=1, 2,..., n + m, are defined by (33), and if then the quanties of W are given by E [V ] > 0, (34) Q + p [W ] =max[f(p), 0], 0 <p<1, (35) d 11
12 whereas the d.f. of W foows from with f(p) defined by (18). f(f W (x)) = x, x 0, (36) Proof. It is straightforward to verify that the condition (34) impies that a β j > 0, for j =1, 2,...n + m. The stated resut then foows from (26) and (27). It is cear that any reasonabe first saving- ater consuming pan shoud fufi the condition (34), which states that the average fina surpus E[V ] shoud be non-negative. 5 The case of constant savings and consumptions In the remainder of this paper, we wi consider the specia case that a saving amounts are equa: α 0 = α 1 = = α n 1 = α, and aso that a withdrawas are equa: α n = α n+1 = = α = 1. In the seque, we wi aways assume that the β j coefficients, j=1,,n+ m, needed to define Λ, are given by (33). The condition (34) can be rewritten as α>α = 1 e (m+1)µ. (37) e nµ 1 When the condition (37) is fufied, we find from Theorem 3 and (18) that the approximated quanties Q + p [W ] and the approximated probabiities F W (x) foow from (35) and (36) with f(p) f α (p) given by n 1 f α (p) =α e ( i)µ e 1 2 r2 i σ2 Z +r i σ Zi Φ 1 (p) i e ( i)µ e 1 2 r2 i σ2 Z +r i σ Zi Φ 1 (p)) i. (38) Let W (α) and W (α) denote the (approximated) fina weath for a given saving-consumption pan with a saving α and consumption eve of 1. Simiary, V (α) is the surpus of the α -pan. i=n 12
13 For α as defined in (37), one has that F W (α )(0) > 0.5. (39) Indeed, α corresponds to the saving-consumption pan with expected surpus E[V (α )] equa to zero. From (8), we find n 1 E [V (α )] = a e ( i)µ i=n e ( i)µ =0. (40) From this expression we see that a β j,j=1,,n + m, asdefined in (33) are stricty positive. Hence, from (27) we find that the probabiity of consumption shortfa foows from f α (F W (α )(0)) = 0 From (18) and the fact that the sequence {r i σ Zi } 0 r is non-increasing and positive, one finds that n 1 f α (0.5) = a e ( i)µ e 1 2 r2 i σ2 Z i 1 i=n e ( i)µ e 1 2 r2 i σ2 Z i < 0. so that F W (α )(0) > 0.5, as stated in (39). In practica situations, one wi often be interested in the minima savings amount α that is required such that the probabiity of a consumption shortfa F W (α)(0) is at most equa to ε. Hence, et us consider the case that one wants to determine α(ε) whichisdeterminedby α(ε) =inf α F W (α)(0) ε ª, 0 <ε<1. (41) The probabiity ε is typicay smaer than 10%, et s say. In genera, F W (α)(0) is stricty decreasing and continuous in α. Thisimpies that α(ε) foows from F W (α(ε))(0) = ε. (42) We propose to approximate α(ε) by α (ε) which is defined by F W (α (ε))(0) = ε. (43) 13
14 Now, in case ε is such that α (ε) >α we have that E V (α (ε)) > 0. Hence,from(36),wehavethattheapproximatedsavingseffort α (ε) can be found from f α (ε)(ε) =0 if α (ε) >α. (44) Notice that we can expect that for any reasonabe ε<0.5, the approximated savings effort α (ε) can be found from (44). To see this, notice that from (39) we have that F W (α )(0) > 0.5. Furthermore, we have that F W (α)(0) is in genera stricty decreasing and continuous in α. From these two observations we find that it is very ikey that for a typica ε<0.5 we wi have that the condition α (ε) >α in (44) is fufied. 6 Numerica iustration In this section we wi numericay iustrate the resuts of this paper, appied to the specia case of α-pans as considered in the previous section. We wi assume that the yeary returns Y i have expectation and variance given by µ σ2 and 2 σ2,whereµ =0.075 and σ =0.15. First, we consider a saving-consumption pan that consists of 10 constant savings α 0 = α 2 = = α 9 =1, foowed by 10 constant withdrawas α 10 = α 11 = = α 19 = 1. Inthiscasewefind that E[V 19 ]=16.02 > 0, so that Theorem 3 can be used for determining the quanties of W19. In Tabe 1 we compare the approximated quanties Q + p [W19] with the simuated quanties Q + p [W 19 ] This tabe iustrates the accuracy of the ower bound based approximation W19. From this tabe we find for instance that there is a 90% probabiity that the fina weath at time 19 wi exceed 1.75 (simuated vaue). The approximated vaue for this fina weath is From (27) it foows that the (approximated) probabiity of consumption shortfa Pr W19 =0 equas 4.83%. In case the investor finds this probabiitytoohigh,hewihavetoincreasehissavingsefforts of 1 per year during the first ten years. As a second appication, we consider the 20/65/95 saving-consumption pan as mentioned in the introduction. This pan consists of 45 constant savings α 0 = α 2 = = α 44 = α>0, thefirst one at the age of 20 and the ast one at the age of 64. After retirement, yeary withdrawas equa to -1 wi be made unti the age of 95 has been reached, hence α 45 = α 46 = = α 75 = 1. The condition (34), or equivaenty (37) can be expressed as: α>
15 p Q + p [W19] Q + p [W 19 ] s.e Tabe 1: Approximate and simuated vaues for the quanties of W 19. α Pr W75 = % % % % % % Tabe 2: The approximated probabiity of consumption shortfa for different vaues of the savings effort. Tabe 2 contains the approximated probabiities of consumption shortfa Pr W 75 =0,fordifferent saving amounts α. These probabiities foow from (27). From (44) we find that the approximated minima savings amount α (0.05) that guarantees that the probabiity of consumption shortfa is ess than or equa to 5% is given by Acknowedgement 3 The authors acknowedge the financia support by the Onderzoeksfonds K.U.Leuven (GOA/02: Actuariëe, financiëe en statistische aspecten van afhankeijkheden in verzekerings- en financiëe portefeuies). 15
16 References [1] Abrecher, H., Dhaene, J., Goovaerts, M.J. & Schoutens, W. (2003). Static hedging of Asian options under Lévy modes: the comonotonic approach, Research Report OR 0365, Department of Appied Economics, K.U.Leuven. [2] Dhaene, J., Denuit, M., Goovaerts, M.J., Kaas, R. & Vyncke, D., 2002(a). The concept of comonotonicity in actuaria science and finance: Theory, Insurance: Mathematics & Economics, 31(1), [3] Dhaene, J., Denuit, M., Goovaerts, M.J., Kaas, R. & Vyncke, D., 2002(b). The concept of comonotonicity in actuaria science and finance: Appications, Insurance: Mathematics & Economics, 31(2), [4] Dhaene, J., Vanduffe, S., Goovaerts, M.J., Kaas, R. & Vyncke, D. (2004). Comonotonic approximations for optima portfoio seection probems, Journa of Risk and Insurance, toappear [5] Dhaene, J., Vanduffe, S., Tang, Q., Goovaerts, M.J., Kaas, R. & Vyncke, D. (2004). Sovency capita, risk measures and comonotonicity: a review, Research Report OR 0416, Department of Appied Economics, K.U.Leuven. [6] Goovaerts, M.J., De Schepper, A., Hua, Y., Darkiewicz, G. & Vyncke, D. (2003). An investigation on the use of copuas when cacuation genera cash fow distributions, Proceedings of the 8th Internationa Congress on Insurance: Mathematics and Economics, Rome, June, [7] Kaas, R., Dhaene, J. & Goovaerts, M. (2000). Upper and ower bounds for sums of random variabes, Insurance: Mathematics and Economics, 27, [8] Mievsky, M.A. & Posner, S.E. (1998). Asian Options, the Sum of Lognormas, and the Reciproca Gamma Distribution, Journa of financia and quantitative anaysis, 33(3), [9] Mievsky, M.A. & Robinson C. (2000). Sef-Annuitization and Ruin in Retirement, North American Actuaria Journa, 4(4),
17 [10] Vanduffe, S., Dhaene, J., Goovaerts, M.J. & Kaas, R. (2003). The hurde-race probem, Insurance: Mathematics & Economics, 33(2), [11] Vanduffe, S., Hoedemakers, T. & Dhaene, J. (2004). Comparing approximations for sums of non-independent ognorma random variabes, Research Report OR 0418, Department of Appied Economics, K.U.Leuven. [12] Vanmaee, M., Dhaene, J., Deestra, G., Liinev, J., Goovaerts M.J. (2004). Bounds for the price of discretey samped arithmetic Asian options, European Journa of Operationa Research, toappear. 17
CS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationProvisions estimation for portfolio of CDO in Gaussian financial environment
Technica report, IDE1123, October 27, 2011 Provisions estimation for portfoio of CDO in Gaussian financia environment Master s Thesis in Financia Mathematics Oeg Maximchuk and Yury Vokov Schoo of Information
More informationu(x) s.t. px w x 0 Denote the solution to this problem by ˆx(p, x). In order to obtain ˆx we may simply solve the standard problem max x 0
Bocconi University PhD in Economics - Microeconomics I Prof M Messner Probem Set 4 - Soution Probem : If an individua has an endowment instead of a monetary income his weath depends on price eves In particuar,
More informationHYDROGEN ATOM SELECTION RULES TRANSITION RATES
DOING PHYSICS WITH MATLAB QUANTUM PHYSICS Ian Cooper Schoo of Physics, University of Sydney ian.cooper@sydney.edu.au HYDROGEN ATOM SELECTION RULES TRANSITION RATES DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS
More informationAppendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model
Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna
More informationAkaike Information Criterion for ANOVA Model with a Simple Order Restriction
Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike
More informationGeneral Certificate of Education Advanced Level Examination June 2010
Genera Certificate of Education Advanced Leve Examination June 2010 Human Bioogy HBI6T/Q10/task Unit 6T A2 Investigative Skis Assignment Task Sheet The effect of using one or two eyes on the perception
More informationUniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity
More informationA Comparison Study of the Test for Right Censored and Grouped Data
Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More informationFRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA)
1 FRST 531 -- Mutivariate Statistics Mutivariate Discriminant Anaysis (MDA) Purpose: 1. To predict which group (Y) an observation beongs to based on the characteristics of p predictor (X) variabes, using
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More information6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7
6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the
More informationTwo-sample inference for normal mean vectors based on monotone missing data
Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department
More information(1 ) = 1 for some 2 (0; 1); (1 + ) = 0 for some > 0:
Answers, na. Economics 4 Fa, 2009. Christiano.. The typica househod can engage in two types of activities producing current output and studying at home. Athough time spent on studying at home sacrices
More informationSmoothness equivalence properties of univariate subdivision schemes and their projection analogues
Numerische Mathematik manuscript No. (wi be inserted by the editor) Smoothness equivaence properties of univariate subdivision schemes and their projection anaogues Phiipp Grohs TU Graz Institute of Geometry
More informationc 2016 Georgios Rovatsos
c 2016 Georgios Rovatsos QUICKEST CHANGE DETECTION WITH APPLICATIONS TO LINE OUTAGE DETECTION BY GEORGIOS ROVATSOS THESIS Submitted in partia fufiment of the requirements for the degree of Master of Science
More informationDIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM
DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More informationSeparation of Variables and a Spherical Shell with Surface Charge
Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation
More informationStatistical Inference, Econometric Analysis and Matrix Algebra
Statistica Inference, Econometric Anaysis and Matrix Agebra Bernhard Schipp Water Krämer Editors Statistica Inference, Econometric Anaysis and Matrix Agebra Festschrift in Honour of Götz Trenker Physica-Verag
More informationFORECASTING TELECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODELS
FORECASTING TEECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODES Niesh Subhash naawade a, Mrs. Meenakshi Pawar b a SVERI's Coege of Engineering, Pandharpur. nieshsubhash15@gmai.com
More informationAge of Information: The Gamma Awakening
Age of Information: The Gamma Awakening Eie Najm and Rajai Nasser LTHI, EPFL, Lausanne, Switzerand Emai: {eie.najm, rajai.nasser}@epf.ch arxiv:604.086v [cs.it] 5 Apr 06 Abstract Status update systems is
More informationDetermining The Degree of Generalization Using An Incremental Learning Algorithm
Determining The Degree of Generaization Using An Incrementa Learning Agorithm Pabo Zegers Facutad de Ingeniería, Universidad de os Andes San Caros de Apoquindo 22, Las Condes, Santiago, Chie pzegers@uandes.c
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationarxiv: v1 [math.ca] 6 Mar 2017
Indefinite Integras of Spherica Besse Functions MIT-CTP/487 arxiv:703.0648v [math.ca] 6 Mar 07 Joyon K. Boomfied,, Stephen H. P. Face,, and Zander Moss, Center for Theoretica Physics, Laboratory for Nucear
More informationImproving the Reliability of a Series-Parallel System Using Modified Weibull Distribution
Internationa Mathematica Forum, Vo. 12, 217, no. 6, 257-269 HIKARI Ltd, www.m-hikari.com https://doi.org/1.12988/imf.217.611155 Improving the Reiabiity of a Series-Parae System Using Modified Weibu Distribution
More informationSome Measures for Asymmetry of Distributions
Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester
More informationAutomobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn
Automobie Prices in Market Equiibrium Berry, Pakes and Levinsohn Empirica Anaysis of demand and suppy in a differentiated products market: equiibrium in the U.S. automobie market. Oigopoistic Differentiated
More informationExplicit overall risk minimization transductive bound
1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,
More informationCoupling of LWR and phase transition models at boundary
Couping of LW and phase transition modes at boundary Mauro Garaveo Dipartimento di Matematica e Appicazioni, Università di Miano Bicocca, via. Cozzi 53, 20125 Miano Itay. Benedetto Piccoi Department of
More informationA MODEL FOR ESTIMATING THE LATERAL OVERLAP PROBABILITY OF AIRCRAFT WITH RNP ALERTING CAPABILITY IN PARALLEL RNAV ROUTES
6 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES A MODEL FOR ESTIMATING THE LATERAL OVERLAP PROBABILITY OF AIRCRAFT WITH RNP ALERTING CAPABILITY IN PARALLEL RNAV ROUTES Sakae NAGAOKA* *Eectronic
More informationA proposed nonparametric mixture density estimation using B-spline functions
A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),
More informationManipulation in Financial Markets and the Implications for Debt Financing
Manipuation in Financia Markets and the Impications for Debt Financing Leonid Spesivtsev This paper studies the situation when the firm is in financia distress and faces bankruptcy or debt restructuring.
More informationORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION
J. Korean Math. Soc. 46 2009, No. 2, pp. 281 294 ORHOGONAL MLI-WAVELES FROM MARIX FACORIZAION Hongying Xiao Abstract. Accuracy of the scaing function is very crucia in waveet theory, or correspondingy,
More informationConverting Z-number to Fuzzy Number using. Fuzzy Expected Value
ISSN 1746-7659, Engand, UK Journa of Information and Computing Science Vo. 1, No. 4, 017, pp.91-303 Converting Z-number to Fuzzy Number using Fuzzy Expected Vaue Mahdieh Akhbari * Department of Industria
More informationLecture Note 3: Stationary Iterative Methods
MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or
More informationDo Schools Matter for High Math Achievement? Evidence from the American Mathematics Competitions Glenn Ellison and Ashley Swanson Online Appendix
VOL. NO. DO SCHOOLS MATTER FOR HIGH MATH ACHIEVEMENT? 43 Do Schoos Matter for High Math Achievement? Evidence from the American Mathematics Competitions Genn Eison and Ashey Swanson Onine Appendix Appendix
More informationComponentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems
Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,
More informationC. Fourier Sine Series Overview
12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a
More informationProceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds.
Proceedings of the 2012 Winter Simuation Conference C. aroque, J. Himmespach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. TIGHT BOUNDS FOR AMERICAN OPTIONS VIA MUTIEVE MONTE CARO Denis Beomestny Duisburg-Essen
More informationTHINKING IN PYRAMIDS
ECS 178 Course Notes THINKING IN PYRAMIDS Kenneth I. Joy Institute for Data Anaysis and Visuaization Department of Computer Science University of Caifornia, Davis Overview It is frequenty usefu to think
More informationT.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA
ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network
More informationThe EM Algorithm applied to determining new limit points of Mahler measures
Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,
More informationAST 418/518 Instrumentation and Statistics
AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the
More informationAALBORG UNIVERSITY. The distribution of communication cost for a mobile service scenario. Jesper Møller and Man Lung Yiu. R June 2009
AALBORG UNIVERSITY The distribution of communication cost for a mobie service scenario by Jesper Møer and Man Lung Yiu R-29-11 June 29 Department of Mathematica Sciences Aaborg University Fredrik Bajers
More information12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes
Maima and Minima 1. Introduction In this Section we anayse curves in the oca neighbourhood of a stationary point and, from this anaysis, deduce necessary conditions satisfied by oca maima and oca minima.
More informationStatistics for Applications. Chapter 7: Regression 1/43
Statistics for Appications Chapter 7: Regression 1/43 Heuristics of the inear regression (1) Consider a coud of i.i.d. random points (X i,y i ),i =1,...,n : 2/43 Heuristics of the inear regression (2)
More informationBP neural network-based sports performance prediction model applied research
Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied
More informationInternational Journal of Mass Spectrometry
Internationa Journa of Mass Spectrometry 280 (2009) 179 183 Contents ists avaiabe at ScienceDirect Internationa Journa of Mass Spectrometry journa homepage: www.esevier.com/ocate/ijms Stark mixing by ion-rydberg
More informationRate-Distortion Theory of Finite Point Processes
Rate-Distortion Theory of Finite Point Processes Günther Koiander, Dominic Schuhmacher, and Franz Hawatsch, Feow, IEEE Abstract We study the compression of data in the case where the usefu information
More information8 Digifl'.11 Cth:uits and devices
8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,
More informationNumerical simulation of javelin best throwing angle based on biomechanical model
ISSN : 0974-7435 Voume 8 Issue 8 Numerica simuation of javein best throwing ange based on biomechanica mode Xia Zeng*, Xiongwei Zuo Department of Physica Education, Changsha Medica University, Changsha
More informationConsistent linguistic fuzzy preference relation with multi-granular uncertain linguistic information for solving decision making problems
Consistent inguistic fuzzy preference reation with muti-granuar uncertain inguistic information for soving decision making probems Siti mnah Binti Mohd Ridzuan, and Daud Mohamad Citation: IP Conference
More informationA unified framework for Regularization Networks and Support Vector Machines. Theodoros Evgeniou, Massimiliano Pontil, Tomaso Poggio
MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER FOR BIOLOGICAL AND COMPUTATIONAL LEARNING DEPARTMENT OF BRAIN AND COGNITIVE SCIENCES A.I. Memo No. 1654 March23, 1999
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process
More informationResearch Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
Appied Mathematics and Stochastic Anaysis Voume 007, Artice ID 74191, 8 pages doi:10.1155/007/74191 Research Artice On the Lower Bound for the Number of Rea Roots of a Random Agebraic Equation Takashi
More informationDistributed average consensus: Beyond the realm of linearity
Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,
More informationMULTI-PERIOD MODEL FOR PART FAMILY/MACHINE CELL FORMATION. Objectives included in the multi-period formulation
ationa Institute of Technoogy aicut Department of echanica Engineering ULTI-PERIOD ODEL FOR PART FAILY/AHIE ELL FORATIO Given a set of parts, processing requirements, and avaiabe resources The objective
More informationXSAT of linear CNF formulas
XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open
More informationA Statistical Framework for Real-time Event Detection in Power Systems
1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem
More informationCryptanalysis of PKP: A New Approach
Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in
More informationStatistical Learning Theory: A Primer
Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO
More informationBayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?
Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine
More informationInvestigation on spectrum of the adjacency matrix and Laplacian matrix of graph G l
Investigation on spectrum of the adjacency matrix and Lapacian matrix of graph G SHUHUA YIN Computer Science and Information Technoogy Coege Zhejiang Wani University Ningbo 3500 PEOPLE S REPUBLIC OF CHINA
More informationTheory and implementation behind: Universal surface creation - smallest unitcell
Teory and impementation beind: Universa surface creation - smaest unitce Bjare Brin Buus, Jaob Howat & Tomas Bigaard September 15, 218 1 Construction of surface sabs Te aim for tis part of te project is
More informationAlberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain
CORRECTIONS TO CLASSICAL PROCEDURES FOR ESTIMATING THURSTONE S CASE V MODEL FOR RANKING DATA Aberto Maydeu Oivares Instituto de Empresa Marketing Dept. C/Maria de Moina -5 28006 Madrid Spain Aberto.Maydeu@ie.edu
More informationQuantifying uncertain system outputs via the multilevel Monte Carlo method Part I: Central moment estimation
MATHICSE Institute of Mathematics Schoo of Basic Sciences MATHICSE Technica Report Nr. 3.017 October 017 Quantifying uncertain system outputs via the mutieve Monte Caro method Part I: Centra moment estimation
More information6 Wave Equation on an Interval: Separation of Variables
6 Wave Equation on an Interva: Separation of Variabes 6.1 Dirichet Boundary Conditions Ref: Strauss, Chapter 4 We now use the separation of variabes technique to study the wave equation on a finite interva.
More informationB. Brown, M. Griebel, F.Y. Kuo and I.H. Sloan
Wegeerstraße 6 53115 Bonn Germany phone +49 8 73-347 fax +49 8 73-757 www.ins.uni-bonn.de B. Brown, M. Griebe, F.Y. Kuo and I.H. Soan On the expected uniform error of geometric Brownian motion approximated
More informationMA 201: Partial Differential Equations Lecture - 10
MA 201: Partia Differentia Equations Lecture - 10 Separation of Variabes, One dimensiona Wave Equation Initia Boundary Vaue Probem (IBVP) Reca: A physica probem governed by a PDE may contain both boundary
More informationA CLUSTERING LAW FOR SOME DISCRETE ORDER STATISTICS
J App Prob 40, 226 241 (2003) Printed in Israe Appied Probabiity Trust 2003 A CLUSTERING LAW FOR SOME DISCRETE ORDER STATISTICS SUNDER SETHURAMAN, Iowa State University Abstract Let X 1,X 2,,X n be a sequence
More informationFirst-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries
c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationSUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS
ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia
More informationSTA 216 Project: Spline Approach to Discrete Survival Analysis
: Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea- Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process Management,
More informationMATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES
MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is
More informationDiscrete Techniques. Chapter Introduction
Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, we as various
More informationIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University
More informationAn explicit Jordan Decomposition of Companion matrices
An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057
More informationResearch of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance
Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient
More information2M2. Fourier Series Prof Bill Lionheart
M. Fourier Series Prof Bi Lionheart 1. The Fourier series of the periodic function f(x) with period has the form f(x) = a 0 + ( a n cos πnx + b n sin πnx ). Here the rea numbers a n, b n are caed the Fourier
More informationGeneral Certificate of Education Advanced Level Examination June 2010
Genera Certificate of Education Advanced Leve Examination June 2010 Human Bioogy HBI6T/P10/task Unit 6T A2 Investigative Skis Assignment Task Sheet The effect of temperature on the rate of photosynthesis
More informationResearch Article Numerical Range of Two Operators in Semi-Inner Product Spaces
Abstract and Appied Anaysis Voume 01, Artice ID 846396, 13 pages doi:10.1155/01/846396 Research Artice Numerica Range of Two Operators in Semi-Inner Product Spaces N. K. Sahu, 1 C. Nahak, 1 and S. Nanda
More informationTwo view learning: SVM-2K, Theory and Practice
Two view earning: SVM-2K, Theory and Practice Jason D.R. Farquhar jdrf99r@ecs.soton.ac.uk Hongying Meng hongying@cs.york.ac.uk David R. Hardoon drh@ecs.soton.ac.uk John Shawe-Tayor jst@ecs.soton.ac.uk
More informationDiscrete Techniques. Chapter Introduction
Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, as we as various
More informationFitting Algorithms for MMPP ATM Traffic Models
Fitting Agorithms for PP AT Traffic odes A. Nogueira, P. Savador, R. Vaadas University of Aveiro / Institute of Teecommunications, 38-93 Aveiro, Portuga; e-mai: (nogueira, savador, rv)@av.it.pt ABSTRACT
More informationMoreau-Yosida Regularization for Grouped Tree Structure Learning
Moreau-Yosida Reguarization for Grouped Tree Structure Learning Jun Liu Computer Science and Engineering Arizona State University J.Liu@asu.edu Jieping Ye Computer Science and Engineering Arizona State
More informationA NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC
(January 8, 2003) A NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC DAMIAN CLANCY, University of Liverpoo PHILIP K. POLLETT, University of Queensand Abstract
More informationAsynchronous Control for Coupled Markov Decision Systems
INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of
More informationA SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS
A SIPLIFIED DESIGN OF ULTIDIENSIONAL TRANSFER FUNCTION ODELS Stefan Petrausch, Rudof Rabenstein utimedia Communications and Signa Procesg, University of Erangen-Nuremberg, Cauerstr. 7, 958 Erangen, GERANY
More informationApproximation and Fast Calculation of Non-local Boundary Conditions for the Time-dependent Schrödinger Equation
Approximation and Fast Cacuation of Non-oca Boundary Conditions for the Time-dependent Schrödinger Equation Anton Arnod, Matthias Ehrhardt 2, and Ivan Sofronov 3 Universität Münster, Institut für Numerische
More informationNew Efficiency Results for Makespan Cost Sharing
New Efficiency Resuts for Makespan Cost Sharing Yvonne Beischwitz a, Forian Schoppmann a, a University of Paderborn, Department of Computer Science Fürstenaee, 3302 Paderborn, Germany Abstract In the context
More informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
More information$, (2.1) n="# #. (2.2)
Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier
More informationStructural Control of Probabilistic Boolean Networks and Its Application to Design of Real-Time Pricing Systems
Preprints of the 9th Word Congress The Internationa Federation of Automatic Contro Structura Contro of Probabiistic Booean Networks and Its Appication to Design of Rea-Time Pricing Systems Koichi Kobayashi
More informationEfficiently Generating Random Bits from Finite State Markov Chains
1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More information