STA 216 Project: Spline Approach to Discrete Survival Analysis
|
|
- Brook Stafford
- 6 years ago
- Views:
Transcription
1 : Spine Approach to Discrete Surviva Anaysis November 4, Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing approach. By seecting a set of knots and grouping the continuous surviva time into bins, we can buid a discrete hazard mode on continuous surviva data. For exampe, put piecewise constant baseine hazard in Cox s semi-parametric proportiona hazard mode woud ead to the same resut as a compementary og og ink to a discrete hazard mode. Even in the continuous surviva anaysis, grouping the data into bins wi have some nice interpretation and modeing perspective. For instance, [Gustafson et a.(003)gustafson, Aeschiman & R.] use MCMC method to fit a piecewise inear og-gamma hazard mode. This cass project investigates the piecewise inear discrete hazard mode. Section describes the mode at fixed knots, and the possibe mode averaging approach. Section 3 describes an important samping stretage to cacuate the margina ikeihood for a given mode, hence provide criterions of comparing modes with different knots specification. We aso incude the BIC approximation here for comparison. Section 4 appies our method to a rea data set in a toxicoogy and carcinogenesis study of ethybenzene. Section 5 discusses the imitation of our work and proposes possibe ways to modify this approach. Piecewise Linear Discrete Hazard Mode Suppose we have fixed knots 0 x 1 < x < < x C < x C+1, where x 1 is fixed(coud be zero, or some positive vaue, meaning data truncated beow certain initia period). For simpicity, suppose there is no covariates at this stage(we sha incude the dose effect as a covariate in section 4). Another assumption is made that ife time between x 1 and x C are a observed, and ife time between x C and x C+1 are a censored to the right. This is ony for notation simpicity, and generay, this method coud dea with paired observations (t i,δ i ), where δ i denotes the censoring state. Denote I j = [x j,x j+1 ) is the jth bin, then the usua discrete hazard mode can be written as P(T I j T j I ) = Φ(α j ), j = 1,,...,C 1. (1) then the ikeihood of the time is { Φ (α P(T) = j ) j 1 =1 [1 Φ(α )], if j < C; C 1 =1 [1 Φ(α )], if j = C. where T I j. () 1
2 A direct modification of this mode is to repace α j in equation (1) and () with a piecewise inear function of T. Whie keeping the mode in the discrete time framework, we change the discrete hazard with ( P(T T j I ) = Φ a j + T x ) j (a j+1 a j ), if T I j, for j {1,...,C 1}. (3) x j+1 x j and we coud pick some points in I j, and evauate the hazard at those point to represent the average hazard in that interva. For exampe, we chose the mid-points of I j, which is x j+x j+1, and ( ) aj + a j+1 P(T I j T j I ) = Φ, j {1,,...,C 1}. (4) Combining (3) and (4), we can get the ikeihood of T as ( ) Φ a j + T x j j 1 [ ] x P(T) = j+1 x j (a j+1 a j ) =1 1 Φ( a +a +1 ), if j < C; [ ] C 1 =1 1 Φ( a +a +1 ), if j = C. (5) where T I j. We can use data augmentation trick to impement this method. Suppose T i I j with j < C, repace T i with a ength j vector y (i) = (0,...,0,1) T and corresponding j C design matrix X (i) as Let z (i) where X (i) = = T x j x j+1 x j x j+1 T x j+1 x j N(X (i) T a,1), where a = (a1,...,a C 1,a C ) T, then P(z (i) < 0) = P(y (i) = 0) = 1 Φ(X (i) T a), As before, the joint ikeihood can be written as j(i) j(i) n n π(z, a y, X) = π(y (i) z (i) ) π(y (i) z (i) ) = 1 (i) z i=1 =1 >0 y(i) i=1 =1 P(z (i) π(z (i) y (i) 0) = P(y (i),x (i) X (i) T 1 X (i) T... X (i) T j 1 X (i) T j (6) = 1) = Φ(X (i) T a). (7),a) π(a). (8) + 1 (i) z (1 y(i) 0 ). (9) The fu conditionas of z (i) s are truncated normas as { π(z (i) y (i),x (i) N,a) + (z (i) ;X (i) T (i) a), when y = 1, N (z (i) ;X (i) T (i) a), when y = 0. (10)
3 If we have norma prior on a N(a 0,Σ 0 ), then the fu conditiona of a is π(a z,y,x) = N(ˆΣ(Σ 1 0 a 0 + X T z), ˆΣ = (Σ X T X) 1 ). (11) Equation (11) can be easiy modified to a truncated norma distribution, if we have a truncated norma prior on a. Suppose we have a covariate d caed dose eve, and we are interested in the differences of surviva among those different dose groups. Denote d = 1 is the contro, and there is an increasing order of dose from 1,,..., up to the maximum eve D. Repace the th eement a in vector a with d h=1 b[h]. We can interpret b [0] as the baseine hazard, and b [d] as the hazard difference between dose group d and d 1 for d > 1. A natura seection of prior for b is that norma with arge variance on b [1], and mixture of point mass at 0 with a truncated norma beow zero for b [d] when d > 1, if the dose is supposed to be detrimenta. Or we can remove the sign constrain when there is no prior information that the dose is good or bad. Foowing this prior, we can appy gibbs agorithm, as the fu conditionas are described in equation (10) and (11). Note, (11) then becomes a mixture of point mass at zero and a (truncated) norma distribution. Discarding the first severa iterations of the gibbs samper for convergence, we can obtain posterior sampers of the mode. We can count the proportions of each mode in the samper, and this can be viewed as approximations of the posterior probabiities of the mode, as ong as the mode space is not too arge. We can obtain a averaged mode based on the posterior sampers, or we can cacuate the best severa modes based on the samper. 3 Margina Likeihood For a fixed knots, we can compare different modes under that knots setting as described in section, but we may aso interested comparing different modes under different knots setting. Given mode γ, i.e. we fixed a set of knots, and denote θ as the non-zero parameters in the mode(a or b [d] in section ). The prior on θ given γ is no onger mixtures, but norma or truncated norma. We woud ike to estimate the margina ikeihood of the data given this mode p(y γ) = p(y θ, γ)π(θ γ) dθ (1) = p(y θ,γ) π(θ γ) q(θ γ)dθ (13) q(θ γ) We cannot sampe θ directy from the prior, and cacuate the Monte Caro estimates of equation (1), because there maybe arge different between the prior and the posterior distribution of θ, and the direct estimation has very ow efficiency. However, if we can come up with good estimates of the posterior of θ, say q(θ), then an important samping on (13) woud have fairy high efficiency. Actuay, we can run our gibbs samping agorithm in section, and get the posterior sampers of θ. Cacuate the estimates of the first two moments of each θ, and reconstruct norma or truncated norma distributions centered on the first moment estimator, with variance equa to the second moment estimator, and ca this distribution q(θ). Sampe θ (i) from q(θ), and compute p(y θ (i),γ) with weights w i = π(θ (i) γ)/q(θ (i) γ), and estimate p(y γ) N i=1 w ip(y θ (i),γ) N i=1 w. (14) i 3
4 A comparison of this cacuation and mode proportion in the posterior sampes for a fixed knots specification is shown in section 4, which indicates this method is reasonabe. Moreover, this method can aso compare modes with different knots specification. Another method is to cacuate the margina ikeihood is to use Lapace approximation. However, Lapace approximation approach cannot dea with the sign constraints, such as the truncated norma prior. Nevertheess, we sha briefy describe the BIC approximation using Lapace method in the foowing paragraphs. Again we want to estimate equation (1), for carity, we ignore the mode γ in foowing discussion, since we ony focus on the ikeihood for one mode. Denote g(θ) = og{p(y θ)π(θ)}, by Tayor expansion, we have g(θ) = g( θ) + (θ θ) T g ( θ) + 1 (θ θ) T g ( θ)(θ θ) + o( θ θ ) (15) Set θ to be the maximum point, then g ( θ) = 0. The approximation is not good uness θ is cose to θ. However, when n is arge, this rationa is vaid, and for a forma argument see [Tierney & Kadane(1986)]. Then p(y) = exp[g(θ)] dθ (16) exp[g( θ)] exp[ 1 (θ θ) T g ( θ)(θ θ)]dθ (17) = exp[g( θ)](π) d/ g ( θ) 1/. (18) where d is the dimension of θ, and the error in equation (18) is O(n 1 ) on the og scae. In arge sampes, θ = ˆθ, which ˆθ is the MLE, and g ( θ) ni, where i is the expected Fisher information matrix for one observation. Therefore g ( θ) n d i, and this introduces O(n 1 ) error, hence equation (18) becomes og p(y) = og p(y ˆθ) + og π(ˆθ) + d og(π) d og n 1 og i + O(n 1 ) (19) Suppose the prior π(θ) is mutivariate norma with mean ˆθ and variance matrix i 1. It seems to be a reasonabe representation that the prior contains the same amount of information as, on average, one observation. Then og p(ˆθ) = d og(π) + 1 og i, (0) substituting (0) into (19) gives og p(y) = og p(y ˆθ) d og n + O(n 1 ). (1) When the baseine mode is a saturated mode, et D res (γ) denotes the difference in twice the og-ikeihood between saturated mode and current mode γ. Then the BIC for mode γ, denoted as BIC γ can be written as BIC γ = (n og n D res (γ)) + dog n. () In R, we can use the standard gm function to give the output of D res, and use equation () to cacuate the BIC. Moreover, the BM A package in R wi provide the automated BIC for modes 4
5 at a given knots setting. Generay speaking, we can use the margina ikeihood(or the deviance) to compare/seect/average different modes under different knots setting, or we can use other criterions ike BIC to perform simiar anaysis. 4 Exampe We appied our method to a Nationa Toxicoogy Program (NTP) year study of ethybenzene (CASE No ). Groups of 50 mae F344/N rats were exposed to 0, 75, 50 or 750 ppm ethybenzene by inhaation, 6 hours per day, 5 days per week, for years. The number of surviva rats in each group is 15, 14, 13 and respectivey, and they are a kied on day 734. The histogram of the surviva time in each group(without censored data) is shown in Figure 1. As described in section, et the number of dose group D = 4 here. Put norma prior on b [1], and mixture prior on b [d], d > 1. We experimented with four choice of knots, shown in Tabe 1. We tried the mode averaging agorithm, with and without the sign constrains in b [d], d > 1. For each mixture prior, set equa probabiity of 0.5 for each coefficient to be in or out of the mode. The norma or truncated norma part of the prior used mean 0 and standard deviation of 5. Discard first 000 iterations, which is sufficient for a burning period here, we averaged the hazard curve and surviva curve based on an additiona 5000 iterations. The resut are shown through Figure to 9. We concude that there is not much difference among the first three dose groups, but the dose 750 group differs greaty from the other three groups. The dose 750 group have much higher hazard compared to the other groups, and it suggest the hazard curve are amost the same for before day 505, and then the dose 750 group deveops higher risk than the rest groups by knots choice 3 and 4. However, the second statement may come from the artifact of the random choice of knots. In any event, the anaysis woud agree the concusion from NTP: there was cear evidence of carcinogenic activity of ethybenzene in mae F344/N rats based on increased incidences of rena tubue neopasms. For knots choice with no sign constraints, we run the gibbs samper, and obtained 0,000 posterior sampes discard the first 3,000 iterations. Tabe shows the best 6 modes in the posterior sampes, its number of appearance(namey counts), and reative proportion of counts among the six modes. It aso incude a point estimate(important samping mean) of the ikeihood, and its reative proportion among the six modes(for uniform prior on mode space). We can see that athough there are some numeric uncertainty for the cacuation of the margina ikeihood, the method described in section 3 shoud work. We aso compared our method of mode seection, and the inherent function bic.gm() in the BMA package, and they end up having the same best mode, but they woud differ at the choice of the second best, third best modes etc, see Tabe 3. However, there are some other compications. Suppose we use knots choice 1, but vary the second knot x from day 430 to day 670 for some grid of points. For each setting, we find the best mode through the gibbs agorithm, and cacuate the margina ikeihood. We pot this ikeihood versus x in Figure 10. It behaves as a U-shape, which indicates the knots near the boundaries wi have higher ikeihood, hence more preferabe. If using the Lapace approximation, we end up having simiar U-shaped ikeihood, see Figure 11, by cacuating the deviance. The BIC vaues for these best modes under each knots setting woud prefer smaer x, shown in Figure 1, and this is not as what we expected. Another probem is to compare the best/averaged mode for different number of knots. In that case, the more knots, the ess ikey for the augmented data. We sha discuss these two probems in section 5. 5
6 5 Discussion The two probems arisen in the ast paragraph of section 4 do not appear by accident. It is the property of the discrete hazard mode(both piecewise constant and piecewise inear). Suppose the number of knots are given, and we ony move the position of one knot. For simpicity, et s just ook at the exampe in section 4. As the knot x moving from x 1 to x 3, most of the data points t i in I 1 I wi have corresponding y (i) switching from (0,1) to (1). The mode woud end up picking some estimate of a to favor the majority augmented data, which is (0,1) when x is near x 1, and is (1) when x is near x 3. When x is not cose to its boundaries x 1 and x 3, a the data ies in I 1 I woud have a baanced amount of (0,1) and (1), which wi bring down the margina ikeihood. As for BIC, a smaer x woud eads to a onger vector of y in genera, hence exercising ess penaty on the BIC term if the modes have the same/simiar dimensions (Note that the derivative of n in equation () is aways negative). Simiary, when the number of knots increases, the ength of y wi increase generay, hence modes with more knots wi have a smaer BIC. Simiar argument hods for the margina ikeihood of the data. We are no onger in a situation that to compare/seect/average modes for fixed sampe size n, and the criterion ony penaizes on the dimension of the mode p. Here we have n and p varying in the fu mode space. Margina ikeihood and BIC are bad in terms of mode comparison/seection/averaging. In terms of computationa efficiency, the Lapace approximation is much faster, but it cannot dea with constrains in the coefficients. However, if the constraint is not a big issue, and if we have a reasonabe criteria to compare the modes at different knots setting, we coud use reversibe jump(green, 1995) to move in the mode space. One possibe way to overcome the difficuty is to switch back to continuous time framework, and then the dimension of data T is fixed. Another improvement coud be incorporating the historica contro data to improve the baseine estimation, e.g. [Dunson & Dinse(000)]. References [Dunson & Dinse(000)] Dunson, D. B. & Dinse, G. E. (000). Distinguishing effects on tumor mutipicity and growth rate in chemoprevention experiments. Biometrics 56, [Gustafson et a.(003)gustafson, Aeschiman & R.] Gustafson, P., Aeschiman, D. & R., L. A. (003). A simpe approach to fitting bayesian survia modes. Lifetime data anaysis 9, [Tierney & Kadane(1986)] Tierney, L. & Kadane, J. B. (1986). Accurate approximations for posterior moments and margina densities. Journa of the American Statistica Association 81,
7 Tabe 1: Knots choice used in section method. Knots Choice 1 3, 631, 79, 743 Knots Choice 3, 561, 631, 79, 743 Knots Choice 3 169, 393, 505, 561, 617, 673, 701, 79, 743 Knots Choice 4 169, 393, 505, 561, 617, 645, 673, 701, 79, 743 Tabe : Gibbs samping method: best modes for knots choice. Rank Mode Variabes Counts(%) og ikeihood(%) (54.70) (57.18) (1.1) (1.86) (10.10) (7.8) (9.79) -67.3(9.39) (8.19) (7.53) (5.01) (5.3) Tabe 3: BIC method: best modes for knots choice. p!=0 EV SD mode 1 mode mode 3 mode 4 mode 5 Intercept X X X X X X X X X X X X X X X nvar BIC post prob
8 Histogram of Life[Life < 734 & Dose == 1] Histogram of Life[Life < 734 & Dose == ] Frequency Frequency Life[Life < 734 & Dose == 1] Life[Life < 734 & Dose == ] Histogram of Life[Life < 734 & Dose == 3] Histogram of Life[Life < 734 & Dose == 4] Frequency Frequency Life[Life < 734 & Dose == 3] Life[Life < 734 & Dose == 4] Figure 1: Histogram of the non-censored surviva time in each dose group. 0.0 Surviva Probabiity Figure : Hazard and surviva curve for knots choice 1, no sign constraints. 8
9 0.0 Surviva Probabiity Figure 3: Hazard and surviva curve for knots choice, no sign constraints Surviva Probabiity Figure 4: Hazard and surviva curve for knots choice 3, no sign constraints. 9
10 Surviva Probabiity Figure 5: Hazard and surviva curve for knots choice 4, no sign constraints. 0.0 Surviva Probabiity Figure 6: Hazard and surviva curve for knots choice 1, with sign constraints. 10
11 0.0 Surviva Probabiity Figure 7: Hazard and surviva curve for knots choice, with sign constraints Surviva Probabiity Figure 8: Hazard and surviva curve for knots choice 3, with sign constraints. 11
12 Surviva Probabiity Figure 9: Hazard and surviva curve for knots choice 4, with sign constraints. og ikeihood x Figure 10: Important samping method: margina og ikeihood of data for the best mode for knots choice 1, with the second knot x varying, and no sign constraints. 1
13 og ikeihood x Figure 11: Lapace approximation method: margina og ikeihood of data for the best mode for knots choice 1, with the second knot x varying, and no sign constraints. BIC x Figure 1: BIC for the best mode(chosen by bic.gm() in BMA package in R) for knots choice 1, with the second knot x varying, and no sign constraints. 13
6.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 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 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 informationCS229 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 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 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 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 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 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 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 informationStochastic Variational Inference with Gradient Linearization
Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,
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 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 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 informationAppendix for Stochastic Gradient Monomial Gamma Sampler
3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 3 3 33 34 35 36 37 38 39 4 4 4 43 44 45 46 47 48 49 5 5 5 53 54 Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing
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 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 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 informationResearch Article Analysis of Heart Transplant Survival Data Using Generalized Additive Models
Hindawi Pubishing Corporation Computationa and Mathematica Methods in Medicine Voume 2013, Artice ID 609857, 7 pages http://dx.doi.org/10.1155/2013/609857 Research Artice Anaysis of Heart Transpant Surviva
More informationAppendix for Stochastic Gradient Monomial Gamma Sampler
Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing theorem to characterize the stationary distribution of the stochastic process with SDEs in (3) Theorem 3
More informationMath 124B January 31, 2012
Math 124B January 31, 212 Viktor Grigoryan 7 Inhomogeneous boundary vaue probems Having studied the theory of Fourier series, with which we successfuy soved boundary vaue probems for the homogeneous heat
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 informationChemical Kinetics Part 2
Integrated Rate Laws Chemica Kinetics Part 2 The rate aw we have discussed thus far is the differentia rate aw. Let us consider the very simpe reaction: a A à products The differentia rate reates the rate
More information4 1-D Boundary Value Problems Heat Equation
4 -D Boundary Vaue Probems Heat Equation The main purpose of this chapter is to study boundary vaue probems for the heat equation on a finite rod a x b. u t (x, t = ku xx (x, t, a < x < b, t > u(x, = ϕ(x
More informationHaar Decomposition and Reconstruction Algorithms
Jim Lambers MAT 773 Fa Semester 018-19 Lecture 15 and 16 Notes These notes correspond to Sections 4.3 and 4.4 in the text. Haar Decomposition and Reconstruction Agorithms Decomposition Suppose we approximate
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 informationExpectation-Maximization for Estimating Parameters for a Mixture of Poissons
Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating
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 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 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 informationStatistical Astronomy
Lectures for the 7 th IAU ISYA Ifrane, nd 3 rd Juy 4 p ( x y, I) p( y x, I) p( x, I) p( y, I) Statistica Astronomy Martin Hendry, Dept of Physics and Astronomy University of Gasgow, UK http://www.astro.ga.ac.uk/users/martin/isya/
More informationASummaryofGaussianProcesses Coryn A.L. Bailer-Jones
ASummaryofGaussianProcesses Coryn A.L. Baier-Jones Cavendish Laboratory University of Cambridge caj@mrao.cam.ac.uk Introduction A genera prediction probem can be posed as foows. We consider that the variabe
More informationII. PROBLEM. A. Description. For the space of audio signals
CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time
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 informationTesting for the Existence of Clusters
Testing for the Existence of Custers Caudio Fuentes and George Casea University of Forida November 13, 2008 Abstract The detection and determination of custers has been of specia interest, among researchers
More informationTechnical Appendix for Voting, Speechmaking, and the Dimensions of Conflict in the US Senate
Technica Appendix for Voting, Speechmaking, and the Dimensions of Confict in the US Senate In Song Kim John Londregan Marc Ratkovic Juy 6, 205 Abstract We incude here severa technica appendices. First,
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 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 informationLearning Fully Observed Undirected Graphical Models
Learning Fuy Observed Undirected Graphica Modes Sides Credit: Matt Gormey (2016) Kayhan Batmangheich 1 Machine Learning The data inspires the structures we want to predict Inference finds {best structure,
More informationA GENERALIZED SKEW LOGISTIC DISTRIBUTION
REVSTAT Statistica Journa Voume 11, Number 3, November 013, 317 338 A GENERALIZED SKEW LOGISTIC DISTRIBUTION Authors: A. Asgharzadeh Department of Statistics, University of Mazandaran Babosar, Iran a.asgharzadeh@umz.ac.ir
More informationChemical Kinetics Part 2. Chapter 16
Chemica Kinetics Part 2 Chapter 16 Integrated Rate Laws The rate aw we have discussed thus far is the differentia rate aw. Let us consider the very simpe reaction: a A à products The differentia rate reates
More informationAnalysis of rounded data in mixture normal model
Stat Papers (2012) 53:895 914 DOI 10.1007/s00362-011-0395-0 REGULAR ARTICLE Anaysis of rounded data in mixture norma mode Ningning Zhao Zhidong Bai Received: 13 August 2010 / Revised: 9 June 2011 / Pubished
More informationProcess Capability Proposal. with Polynomial Profile
Contemporary Engineering Sciences, Vo. 11, 2018, no. 85, 4227-4236 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ces.2018.88467 Process Capabiity Proposa with Poynomia Profie Roberto José Herrera
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 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 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 informationWeek 6 Lectures, Math 6451, Tanveer
Fourier Series Week 6 Lectures, Math 645, Tanveer In the context of separation of variabe to find soutions of PDEs, we encountered or and in other cases f(x = f(x = a 0 + f(x = a 0 + b n sin nπx { a n
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 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 informationMelodic contour estimation with B-spline models using a MDL criterion
Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex
More informationPartial permutation decoding for MacDonald codes
Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics
More informationStatistical Learning Theory: a Primer
??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa
More information<C 2 2. λ 2 l. λ 1 l 1 < C 1
Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima
More information4 Separation of Variables
4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE
More informationNEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION
NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen
More informationFOURIER SERIES ON ANY INTERVAL
FOURIER SERIES ON ANY INTERVAL Overview We have spent considerabe time earning how to compute Fourier series for functions that have a period of 2p on the interva (-p,p). We have aso seen how Fourier series
More informationA Novel Learning Method for Elman Neural Network Using Local Search
Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama
More informationHigh Spectral Resolution Infrared Radiance Modeling Using Optimal Spectral Sampling (OSS) Method
High Spectra Resoution Infrared Radiance Modeing Using Optima Spectra Samping (OSS) Method J.-L. Moncet and G. Uymin Background Optima Spectra Samping (OSS) method is a fast and accurate monochromatic
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 informationUnit 48: Structural Behaviour and Detailing for Construction. Deflection of Beams
Unit 48: Structura Behaviour and Detaiing for Construction 4.1 Introduction Defection of Beams This topic investigates the deformation of beams as the direct effect of that bending tendency, which affects
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 informationarxiv:hep-ph/ v1 15 Jan 2001
BOSE-EINSTEIN CORRELATIONS IN CASCADE PROCESSES AND NON-EXTENSIVE STATISTICS O.V.UTYUZH AND G.WILK The Andrzej So tan Institute for Nucear Studies; Hoża 69; 00-689 Warsaw, Poand E-mai: utyuzh@fuw.edu.p
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 informationMONTE CARLO SIMULATIONS
MONTE CARLO SIMULATIONS Current physics research 1) Theoretica 2) Experimenta 3) Computationa Monte Caro (MC) Method (1953) used to study 1) Discrete spin systems 2) Fuids 3) Poymers, membranes, soft matter
More informationLECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL HARMONICS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Eectromagnetism II October 7, 202 Prof. Aan Guth LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL
More informationFast Blind Recognition of Channel Codes
Fast Bind Recognition of Channe Codes Reza Moosavi and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the origina artice. 213 IEEE. Persona use of this materia is permitted.
More informationAuxiliary Gibbs Sampling for Inference in Piecewise-Constant Conditional Intensity Models
uxiiary Gibbs Samping for Inference in Piecewise-Constant Conditiona Intensity Modes Zhen Qin University of Caifornia, Riverside zqin001@cs.ucr.edu Christian R. Sheton University of Caifornia, Riverside
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 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 informationStochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract
Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer
More informationInductive Bias: How to generalize on novel data. CS Inductive Bias 1
Inductive Bias: How to generaize on nove data CS 478 - Inductive Bias 1 Overfitting Noise vs. Exceptions CS 478 - Inductive Bias 2 Non-Linear Tasks Linear Regression wi not generaize we to the task beow
More informationAn Algorithm for Pruning Redundant Modules in Min-Max Modular Network
An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai
More informationOnline Appendices for The Economics of Nationalism (Xiaohuan Lan and Ben Li)
Onine Appendices for The Economics of Nationaism Xiaohuan Lan and Ben Li) A. Derivation of inequaities 9) and 10) Consider Home without oss of generaity. Denote gobaized and ungobaized by g and ng, respectivey.
More informationControl Chart For Monitoring Nonparametric Profiles With Arbitrary Design
Contro Chart For Monitoring Nonparametric Profies With Arbitrary Design Peihua Qiu 1 and Changiang Zou 2 1 Schoo of Statistics, University of Minnesota, USA 2 LPMC and Department of Statistics, Nankai
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 informationGauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law
Gauss Law 1. Review on 1) Couomb s Law (charge and force) 2) Eectric Fied (fied and force) 2. Gauss s Law: connects charge and fied 3. Appications of Gauss s Law Couomb s Law and Eectric Fied Couomb s
More informationTurbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University
Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver
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 informationA GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS
A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS Jack W. Stokes, Microsoft Corporation One Microsoft Way, Redmond, WA 9852, jstokes@microsoft.com James A. Ritcey, University
More informationTarget Location Estimation in Wireless Sensor Networks Using Binary Data
Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344
More informationApplied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation
22.101 Appied Nucear Physics (Fa 2006) Lecture 7 (10/2/06) Overview of Cross Section Cacuation References P. Roman, Advanced Quantum Theory (Addison-Wesey, Reading, 1965), Chap 3. A. Foderaro, The Eements
More informationInference Using Biased Coin Randomization. Victoria Plamadeala
Inference Using Biased Coin Randomization A dissertation submitted in partia fufiment of the requirements for the degree of Doctor of Phiosophy at George Mason University By Victoria Pamadeaa Master of
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 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 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 informationFrom Margins to Probabilities in Multiclass Learning Problems
From Margins to Probabiities in Muticass Learning Probems Andrea Passerini and Massimiiano Ponti 2 and Paoo Frasconi 3 Abstract. We study the probem of muticass cassification within the framework of error
More informationMore Scattering: the Partial Wave Expansion
More Scattering: the Partia Wave Expansion Michae Fower /7/8 Pane Waves and Partia Waves We are considering the soution to Schrödinger s equation for scattering of an incoming pane wave in the z-direction
More informationRandom maps and attractors in random Boolean networks
LU TP 04-43 Rom maps attractors in rom Booean networks Björn Samuesson Car Troein Compex Systems Division, Department of Theoretica Physics Lund University, Sövegatan 4A, S-3 6 Lund, Sweden Dated: 005-05-07)
More informationA Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)
A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,
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 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 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 informationCopyright information to be inserted by the Publishers. Unsplitting BGK-type Schemes for the Shallow. Water Equations KUN XU
Copyright information to be inserted by the Pubishers Unspitting BGK-type Schemes for the Shaow Water Equations KUN XU Mathematics Department, Hong Kong University of Science and Technoogy, Cear Water
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 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 information17 Lecture 17: Recombination and Dark Matter Production
PYS 652: Astrophysics 88 17 Lecture 17: Recombination and Dark Matter Production New ideas pass through three periods: It can t be done. It probaby can be done, but it s not worth doing. I knew it was
More informationParagraph Topic Classification
Paragraph Topic Cassification Eugene Nho Graduate Schoo of Business Stanford University Stanford, CA 94305 enho@stanford.edu Edward Ng Department of Eectrica Engineering Stanford University Stanford, CA
More informationLecture 6 Povh Krane Enge Williams Properties of 2-nucleon potential
Lecture 6 Povh Krane Enge Wiiams Properties of -nuceon potentia 16.1 4.4 3.6 9.9 Meson Theory of Nucear potentia 4.5 3.11 9.10 I recommend Eisberg and Resnik notes as distributed Probems, Lecture 6 1 Consider
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 informationTechnical Data for Profiles. Groove position, external dimensions and modular dimensions
Technica Data for Profies Extruded Profie Symbo A Mg Si 0.5 F 25 Materia number.206.72 Status: artificiay aged Mechanica vaues (appy ony in pressing direction) Tensie strength Rm min. 245 N/mm 2 Yied point
More information