16 Pages

chap2.4

Course: BST 466, Fall 2009
School: Rochester
Rating:
 
 
 
 
 

Word Count: 2544

Document Preview

test McNemars By employing essentially the same procedure as for comparing two conditional proportions (p1 and p2), but taking into account b b the dependence between p2+ and p+2, we can develop a chisquare test statistic: (n12 n21)2 2. n12 + n21 This statistic is known as McNemars test. A version of McNemars test after correction of continuity is: (|n12 n21| 1)2 2. n12 + n21 Sign test. If the sample size is...

Register Now

Unformatted Document Excerpt

Coursehero >> New York >> Rochester >> BST 466

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
test McNemars By employing essentially the same procedure as for comparing two conditional proportions (p1 and p2), but taking into account b b the dependence between p2+ and p+2, we can develop a chisquare test statistic: (n12 n21)2 2. n12 + n21 This statistic is known as McNemars test. A version of McNemars test after correction of continuity is: (|n12 n21| 1)2 2. n12 + n21 Sign test. If the sample size is small, or more specically, if n12 + n21 is small, then the McNemar test discussed above is not appropriate. Since the two proportions agree under the null, a subject with discordant X and Y is equally likely to be in either (1,2) or (2,1) cell. So, conditional on such subjects, we are essentially facing a Bernoulli distribution and testing whether the parameter p = .5. This is known as a sign test (a special case for testing proportions). In SAS, we can ask for McNemars test by including the "AGREE " option in TABLE statement. Exact test may be requested by including the "EXACT MCNEM" option. 4. Sets of 2 2 tables. Sometimes, we may have a set of similar contingency tables. For example, suppose that a new treatment is being tested against a control condition (e.g. placebo) at several hospitals across different cites in a multi-center randomized trial. We are interested in learning if the treatment has (superior) eects over the control condition. In other words, we want to test if the odds ratio is greater than 1 in favor of the new treatment. Since patients from dierent sites may be dierent in terms of their health conditions and varying levels of quality of healthcare services they receive from the dierent hospitals, the new treatment is likely to yield dierential treatment eects across the sites. So, if we pull all patients data into one contingency table regardless of the dierence among patients and hospitals, we may not have the opportunity to study the impact of dierences among patients and hospitals on treatment eect. In some cases, pulling data across tables may have far more serious ramications as the next example illustrates. Example. Suppose that there are two hospitals serving residents in a community. Hospital A (good) is staed with better surgeons than hospital B (bad) for some type of surgeries. The table below compares the success rates of surgery between the two hospitals over a period of time. Outcome Hospital Success Fail Total A (Good) 50 50 100 B (Bad) 68 32 100 Total 118 82 100 The data seem to suggest that the bad hospital had a higher 68 50 success rate ( 100 vs. 100 ). The odds ratio (or relative risk) in comparing the success rate is less than 1 in favor of the bad hospital. So, we may conclude based on the evidence in the data that the bad hospital actually performed better! What is going on? Is the data lying here? Actually, there is nothing wrong with the data. The problem is that the data in the above table does not tell the whole story about surgeries performed between the two hospitals. If we stratify the data by disease severity before surgery, we obtain the following table: Outcome Severity Hospital Success Fail Total Less severe (1) A (Good) 18 2 20 B (Bad) 64 16 80 More severe (2) A (Good) 32 48 80 B (Bad) 4 16 20 If we compare success rates for each level of severity before surgery, we can see that Hospital A (good) always performed better than Hospital B (bad). However, in comparison to hospital B (bad), hospital A (good) received far more patients with a more severe disease status before surgery. This selection bias in receiving patients is what is causing Hospital A to have a lower overall success rate when disease severity is ignored. This phenomenon is called the Simpsons paradox. Selection bias is one of the most important issues in the eld of statistics and biostatistics. In fact, most cutting-edge topics in statistical research in recent years such as causal inference and longitudinal analysis all address this key issue. In this example, more severe patients selected (either self-select or through referrals) the good hospital and this disproportionality lowered the overall success rate for this hospital. Variables that cause selection bias are called confounding variables, confounders, covariates, etc. in the nomenclature of statistical applications. The above example shows that we cannot simply ignore confounding variables and collapse multiple tables into one. A correct approach is to account for dierences in the individual tables when making inference about the association between the 0 Observation period T HIV Infection AIDS onset Observed AIDS onset Unobserved row and column variables. For such multiple, stratied 2 2 tables, we may use the Mantel-Haenszel test. Sometimes, selection bias is dicult to detect. For example, as we discussed in Chapter 1, disease surveillance systems may under report caseloads if the disease of interest has a long latency such as HIV/AIDS. Here, selection bias is the result of our limited observation time and is less obvious than other confounding factors such as disease severity and demographic dierences in treatment and cohort studies. Note: Simpsons paradox illustrates the eect of selection bias by a covariate for categorical outcomes. The same phenomenon occurs for continuous responses as well. The diagram illustrates the eect of selection bias within the same setting of the example, but with a continuous response. Suppose that the lower the response the better the outcome. If we ignore disease severity before treatment, we may again conclude that hospital B (bad) performed better than hospital A (good). If we account for the confound eect of disease severity in the analysis, we will be able to tease out the eect of hospital from that of disease severity, leading to correct conclusions. Such a procedure is called "control for the eect of covariates" or "control for covariates" or "covariate analysis." When comparing the mean response of a continuous outcome among two or more groups, we often use the analysis of covariance (ANCOVA) model. Mean response . Lower is better severe . . . severe All patients . . Bad All patients not severe not severe Good Hospital Another related type of analysis that is becoming increasingly popular particularly in research in the behavioral and social sciences in recent years is moderation analysis. We will not discuss the concept of moderation in this chapter, but just want to make you aware that moderation analysis is not the same thing as analysis of covariance (covariate analysis or analysis by controlling for covariates). Mantel-Haenszel test for no row and column association Suppose that there are q number of 2 2 tables, each has the same row and column variables. Again, we are testing if there is association between the row and column variables. Y X 1 1 n1 11 0 n1 21 1 Tot n+1 0 n1 12 n1 22 1 n+2 Tot X 1 q n1 n11 , , 1 1+ q 0 n21 n1 2+ q Tot n+1 n1 Y 0 q n12 q n22 q n+2 Tot q n1+ q n2+ nq The null hypothesis is that there is no row by column association in any of the tables. Mantel-Haenszel suggested the following statistic: nP o q h mh ) 2 11 h=1(n11 , Pq h h=1 v11 h h h h h = nhph ph and v h = n1+n+1n2+n+2 are the where m11 1+ +1 11 (nh)2(nh1) expected value and variance of the count for the cell (1, 1) under the null hypothesis. is It approximately chi-square distributed if the sample size is large. Note: You can use the SAS PROC FREQ to perform the MantelHaenszel test. Output for the statistic and p-value are labeled under "Cochran-Mantel-Haenszel statistic". Testing for homogeneity of odds ratios. Sometimes, we know a priori that the odds are dierent from 1, but may vary across dierent tables. In this case, we are interested in testing whether the odds ratios are the same across all the dierent tables, i.e., the homogeneity of odds ratios. So, the null hypothesis is dierent from the null in the above setting which posits that there is no row by column dierence or all odds ratios are equal to 1. We can use the Breslow-Day test for testing such a null. Breslow-Day test. The Breslow-Day test is based on the Breslow-Day statistic which is computed as follows: 0 q X (nh mh )2 11 11 h0 v11 h=1 h0 where mh0 and v11 denote the expected value and variance, 11 respectively, under the null hypothesis of homogeneous odds h0 ratios. Note that mh0 and v11 are calculated based on the 11 null that all odds ratios are equal to 1 and thus in general, h h h h h0 6= mh = nhph ph and v h0 6= v h = n1+n+1n2+n+2 . m11 11 1+ +1 11 11 (nh)2(nh1) The Breslow-Day statistic has approximately a chi-square distribution of q 1 degrees of freedom if the sample is large. Note the the loss of 1 degree of freedom is due to the estimation of the common odds ratio across the tables. Unlike the MantelHaenszel statistic, the Breslow-Day test requires a relatively large sample size within each table. 5. General s r table Consider again two categorical outcomes X and Y . Now, suppose that X has s and Y has r levels. The outcomes of the pair (X, Y ) can again be displayed in a contingency table: X 1 1 n11 2 n21 . . . . s ns1 Total n+1 2 n12 n22 . . ns2 n+2 Y ... r n1r n2r . . nsr n+r Total n1+ n2+ . . ns+ n As in the 2 2 table case, we are again interested in association between X and Y and nature of such association when X and Y are associated. (a). Tests of association i). Pearsons tests for general association Pearsons chi-square statistic is dened for general s r tables and used to test general association between the row and column variables. In this test, both the row and column variables are treated as nominal variables, even if one or both may be ordinal. Pearsons chi-square statistic is dened as follows: QP = s r X X (nij mij )2 i=1 j=1 mij , where mij = i+ +j is the expected value for count in cell (i, j). n The statistic QP has an asymptotic chi-square distribution with (r 1)(s 1) degrees of freedom under the null of no row by column association. The degree of freedom is based on the fact that with xed marginal counts, cell counts in any (r 1)(s1) submatrix will determine the whole table. In the 22 table case, one cell count in any of the four cells such as n11 determines the table. ii). Mean score test for ordinal column variable If the column variable Y is ordinal, and in addition, if its mean score is meaningful, then the mean score of Y for each row of X can be constructed and the association between X and Y can be stated in terms of such mean scores as follows: H0 : the mean scores of Y are the same across the rows of X. To compute the mean score, the levels used to indicate the ordinal column variable (i.e., 1, 2, . . . , r) are frequently used. Sometimes, however, to make the mean scores more meaningful or interpretable for a given application, other numerical scores n n may be assigned to each level of the column variable. For example, if r = 5 and the ve levels of Y represent: strongly disagree, disagree, neutral, agree, strongly agree, we can use the column levels 1, 2, 3, 4, 5 to compute the mean score of Y . Alternatively, if we regard the change from "strongly disagree" ("strongly disagree") to disagree (agree) as representing a bigger jump from the change between disagree (agree) and neutral, we may want to change the equal spacing in 1, 2, 3, 4, 5 to something like: 1, 4, 5, 6, 9 to emphasize the dierential eect when moving across the response categories. Thus, in general, let a = (a1, a2, . . . , ar ) Rr be a column vector of dimension r with aj representing new the score for the j th level of the original response Y . Then, the mean score for the ith row is fi = Pr j=1 aj nij ni+ , 1 i s. By using...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Rochester - BST - 466
Measures of Association for Cross Classifications III: Approximate Sampling Theory Leo A. Goodman; William H. Kruskal Journal of the American Statistical Association, Vol. 58, No. 302. (Jun., 1963), pp. 310-364.Stable URL: http:/links.jstor.org/sici
Rochester - BST - 466
Rochester - BST - 466
Chapter 3. Regression Models for Categorical Response 3.1 Introduction In Chapter 2, we discussed how to make inference about association between two variables with stratication (sets of contingency table) and without stratication (a single contingen
Rochester - BST - 466
5.4. Parametric methods The approaches described above for life-tables and the MantelCox test are non-parametric methods. Non-parametric methods do not assume any analytic or parametric distribution, and thus apply to survival data arising in most ap
Rochester - BST - 466
Chapter 4. Loglinear model This chapter introduces the loglinear model, a subclass of the generalized linear models, and its applications to count response and multi-way contingency table analysis. The application of loglinear model to count response
Rochester - BST - 466
Applied Discrete Outcome AnalysisWan Tang, Hua He and Xin Tu Copyrighted by the authors, June 22, 2007ContentsPreface 1 Introduction 1.1 Clarication of Discrete Outcome . . . . . . 1.2 Overview . . . . . . . . . . . . . . . . . . . 1.3 Review of
Rochester - BST - 466
Introduction G.O.F. Test for Logistic Regression with Continuous Covariates Comparison Between Dierent TestsGoodness-of-t Test for Logistic Regression with Continuous CovariatesPresented by Zhen Chen March 26, 2008Goodness-of-t Test for Logisti
Rochester - CSC - 256
Outline Background Protection and Isolation Recent Software InnovationsProtection and Extension in the Microsoft Singularity Operating SystemMichael Spear csc 256/456 25 April 2007 Singularity End to End System Trust -vs- Verification
Rochester - CSC - 256
Operating Systems3/20/2007Recap of the Last Class: Disk StorageMore on Disk Storage and File SystemCS 256/456 Dept. of Computer Science, University of RochesterDisk drivemechanical parts (cylinders, tracks, sectors) and how they move to acc
Rochester - CSC - 256
Operating Systems4/19/2006Multiprocessor HardwareMultiprocessor OSA computer system in which two or more CPUs share full access to the main memory Each CPU might have its own cache and the coherence among multiple cache is maintainedwrite op
Rochester - CSC - 256
Operating Systems2/23/2005Recap of the Last ClassMore on Virtual MemoryVirtual memory separation of user logical memory from physical memory.Only part of the program address space needs to be in physical memory for execution. Copy-on-write:
Rochester - CSC - 256
Operating Systems3/21/2005File System LayoutMore on File SystemPartition table MBRentire disk Disk partitionsCS 256/456 Dept. of Computer Science, University of RochesterBoot blk Super blk Free space mgmt I-nodes Root dir Files & directo
Rochester - CSC - 256
Operating Systems2/15/2004Recap of Last ClassIntroduction to NachosnClassic synchronization problemsq qBounded buffer (producer/consumer) Dining philosopher Monitor Condition variables (Hoare/Mesa semantics) OS kernel synchronization Use
Rochester - CSC - 257
Computer Networks9/5/2007Computer Networks IntroductionOutline: General course information. What are computer networks. Network architecture (Internet and OSI). Socket programming.General Course InformationCourse Web page Course email addres
Rochester - CSC - 256
Operating Systems1/25/2006Recap of the Last ClassProcesses & ThreadsHardware protection System componentskernel and user mode process management, memory management, I/O system, file and storage, networking, monolithic architecture, microke
Rochester - CSC - 573
Kai Shen1/24/2008Some Queueing TheoryPerformance Modeling of Servers - Queueing SystemsIf the facts dont match the theory, change the facts. - Albert Einstein Network server model in queueing systemsarrival process (inter-arrival time distri
Rochester - CSC - 573
Kai Shen1/29/2008Basic Queueing TheoryPerformance Modeling of Servers - Queueing Systems (cont.)Stochastic processes Markov processes/chains Birth-death processes Poisson processes Consider n(t) in an M/M/1 queue h = r/u (traffic intensity or
Rochester - CSC - 257
Computer Networks11/20/2007Multimedia and Quality of ServiceMultimedia NetworkingMultimedia applications: network audio and video (continuous media)Kai Shen Dept. of Computer Science, University of Rochesternetwork provides application wi
Rochester - CSC - 256
Operating Systems1/29/2007User/Kernel ThreadsCPU SchedulingUser threadsKernel threadsThread data structure is in user-mode memory scheduling/switching done at user mode Thread data structure is in kernel memory scheduling/switching done b
Rochester - CSC - 256
Operating Systems2/22/2006SegmentationVirtual MemoryOne-dimensional address space with growing pieces At compile time, one table may bump into another Segmentation:generate segmented logical address at compile time segmented logical address
Rochester - CSC - 256
Operating Systems2/13/2007Basic Memory ManagementBasic Memory ManagementProgram must be brought into memory and placed within a process for it to be run. Mono-programmingrunning a single user program at a timeNeed for multi-programminguti
Rochester - CSC - 257
Computer Networks9/17/2007Types of Multiple Access ProtocolsEthernetThree broad classes: Channel partitioningdivide channel into smaller pieces (time slots, frequency, code) allocate piece to node for exclusive useKai Shen Dept. of Compute
Rochester - CSC - 256
Operating Systems2/2/2004Recap of the Last ClassCPU SchedulingnProcessq q qProcess concept OS data structure for a process Operations on processes Thread concept Compared with processn nnThreadq qCS 256/456 Dept. of Computer Scie
Rochester - CSC - 257
Computer Networks9/17/2007Link Layer Multiple Access ProtocolsRecap of Last ClassLink layerhandle data transfer between neighboring network elements Encoding encode binary data into electromagnetic signals Framing encapsulate data into frame,
Rochester - CSC - 256
Operating Systems2/28/2007Recap of the Last ClassMore on Virtual MemoryVirtual memory separation of user logical memory from physical memory.Transparent page sharing: Only part of the program address space needs to be in physical memory for
Rochester - CSC - 256
Operating Systems2/20/2006Paging: Address Translation SchemePaging and SegmentationA logical address is divided into:Page number (p) used as an index into a page table which contains base address of each page in physical memory.CS 256/456
Rochester - CSC - 573
Kai Shen1/28/2003Web Server and Performance Measurement BasicsAssignment #1n nnnImplement a Web crawler Crawl a list of URLs at http:/tallinn:8080 all Internet drafts (150MB) After retrieving them, your program should save them to the l
Rochester - CSC - 573
Kai Shen2/13/2003Cluster Load Balancing Cluster-based Internet Services: ClusterLoad Balancing and Request DistributionnLoad indexn nnBroadcast policyn nnumber of active service requests CPU/memory/IO load let each node announce its wo
Rochester - CSC - 257
Computer Networks10/17/2007TCP: OverviewTCPconnection-oriented: pipelined:handshaking (exchange of control msgs) to initialize sender, receiver state before data exchange multiple in-flight segments bi-directional data flow in same connecti
Rochester - CSC - 256
Operating Systems1/18/2006General Course InformationIntroductionCS 256/456 Dept. of Computer Science, University of RochesterCourse Web page: www.cs.rochester.edu/~kshen/csc256 Course-related announcement/correspondence: Broadcast email: c
Rochester - CSC - 256
Operating Systems1/26/2005Recap of the Last ClassCPU SchedulingProcessProcess concept A processs image in the computer Operations on processesThreadCS 256/456 Dept. of Computer Science, University of RochesterThread concept Compared wi
Rochester - CSC - 256
Operating Systems4/5/2006Process QueuesCPU SchedulingCS 256/456 Dept. of Computer Science, University of RochesterReady queue set of all processes ready for execution. Device queues set of processes waiting for an I/O device. Process migr
Rochester - CSC - 256
Operating Systems3/20/2006Recap of the Last Class: Storage SystemsFile SystemDisk Structuremechanical parts (cylinders, tracks, sectors) and how they move to access disk data electronic part (disk controller main) exposes an onedimensionally
Rochester - ISSUE - 4
Margot Bouman - The Temporality of the Public Sphere: Orpheus Descending's Loop between Art and CultureBack to Issue 4The Temporality of the Public Sphere: Orpheus Descendings Loop between Art and Cultureby Margot Bouman 2002 Over the summer of
Rochester - ISSUE - 4
Introduction - To incorporate practice - issue 4Back to Issue 4Introduction: To Incorporate Practiceby T'ai Smith 2002 When the topic for this issue was initially formulatedto investigate the processes of work in distinction from the productthe
Rochester - PSC - 204
Loading Print07/07/2005 03:43 PMdialogues Does Abortion Prevent Crime? By Steven Levitt and Steve Sailer Updated Tuesday, Aug. 24, 1999, at 4:24 PM PTFrom: Steven Levitt To: Steve SailerPosted Monday, Aug. 23, 1999, at 5:32 PM PT In recent we
Rochester - PSC - 201
PSC 201 Spring 2009Solution Set #3Chapter 4 review exercises: 1. # 1 (a) The average () of the N = 6 numbers can be found by plugging x them in the formula x= N i=1 xiN=41 + 48 + 50 + 50 + 54 + 57 = 50 6The standard deviation (SD) is eq
Rochester - ISSUE - 9
Issue 9 - IntroBack to Issue 9Introduction: Nature Lovingby Lisa Uddin and Peter Hobbs 2005In the opening sequences of Luc Jacquets recent film for National Geographic, March of The Penguins (2005), audiences are shown spectacular vistas of a
Rochester - ISSUE - 6
Catherine Zuromskis - Issue 6: IntroductionBack to Issue 6Introduction: Visual Publics, Visible Publicsby Catherine Zuromskis 2003Our theoretical understanding of public is much changed since Jurgen Habermas first put forth his notion of the
Rochester - ISSUE - 7
hobbsBack to Issue 7Leaflet Drop: The Paper Landscapes of Warby Jennifer Gabrys 2004War. The possibility at last exists that war may be defeated on the linguistic plane. If war is an extreme metaphor, we may defeat it by devising metaphors tha
Rochester - WEB - 1
Low Gain v. High Gain ADC1000LvHadcL1S7 LvHadcL1S7 Entries Entries 4673 4673 Mean x 108.9 Mean y Mean y 86.8 RMS x RMS x 108.7 108.7 RMS y 28.54 28.548006004002000 02004006008001000
Rochester - WEB - 1
Low Gain v. High Gain ADC1000LvHadcL3S4 LvHadcL3S4 Entries Entries 4673 4673 Mean x 276.3 Mean y Mean y 97.96 RMS x RMS x 306.8 306.8 RMS y 72.19 72.198006004002000 02004006008001000
Rochester - WEB - 1
Low Gain v. High Gain ADC1000LvHadcL2S1 LvHadcL2S1 Entries Entries 4673 4673 Mean x 82.98 Mean y Mean y 64.76 RMS x RMS x 91.41 91.41 RMS y 26.05 26.058006004002000 02004006008001000
Rochester - WEB - 1
Low Gain v. High Gain ADC1000LvHadcL2S3 LvHadcL2S3 Entries Entries 4674 4674 Mean x 216.2 Mean y Mean y 98.38 RMS x RMS x 223.9 223.9 RMS y 41.91 41.918006004002000 02004006008001000
Rochester - WEB - 1
Low Gain v. High Gain ADC1000LvHadcL2S4 LvHadcL2S4 Entries Entries 4674 4674 Mean x 228.4 Mean y Mean y 102.1 RMS x RMS x 233.8 233.8 RMS y 45.9 45.98006004002000 02004006008001000
Rochester - WEB - 1
Low Gain v. High Gain ADC1000LvHadcL3S5 LvHadcL3S5 Entries Entries 4673 4673 Mean x 204.9 Mean y Mean y 80.58 RMS x RMS x 227.3 227.3 RMS y 38.89 38.898006004002000 02004006008001000
Rochester - WEB - 1
Low Gain v. High Gain ADC200 180 160 140 120 100 80 60 40 20 0 0 200 400 600LvHadcL3S7 LvHadcL3S7 Entries Entries 4674 4674 Mean 85.95 Mean y Mean y 78.81 78.81 RMS RMS 26.85 26.85 RMS y 4.531 4.531 2 / ndf 2 / ndf 30.97 / 17 30.97 / 17 Prob Prob
Rochester - WEB - 1
Low Gain v. High Gain ADC700 600 500 400 300 200 100 0 0 200 400 600LvHadcL2S7 LvHadcL2S7 Entries Entries 4673 4673 Mean 94.89 Mean y Mean y 83.27 83.27 RMS RMS 89.14 89.14 RMS y 28.97 28.97 2 / ndf 2 / ndf 86.52 / 38 86.52 / 38 Prob Prob 1.199e-
Rochester - WEB - 1
Low Gain v. High Gain ADC900 800 700 600 500 400 300 200 100 0 0 200 400 600LvHadcL2S3 LvHadcL2S3 Entries Entries 4674 4674 Mean 216.2 Mean y Mean y 98.38 98.38 RMS RMS 223.9 223.9 RMS y 41.91 41.91 2 / ndf 2 / ndf 83.87 / 58 83.87 / 58 Prob Prob
Rochester - WEB - 1
Low Gain v. High Gain ADC700 600 500 400 300 200 100 0 0LvHadcL3S4 LvHadcL3S4 Entries Entries 4673 4673 Mean 276.3 Mean y Mean y 97.96 97.96 RMS RMS 306.8 306.8 RMS y 72.19 72.19 2 / ndf 2 / ndf 75.36 / 58 75.36 / 58 Prob Prob 0.06242 0.06242 Slop
Rochester - WEB - 1
Low Gain v. High Gain ADC500400LvHadcL1S5 LvHadcL1S5 Entries Entries 4673 4673 Mean 285.8 Mean y Mean y 120.6 120.6 RMS RMS 306.3 306.3 RMS y 71.76 71.76 2 / ndf 2 / ndf 80.72 / 58 80.72 / 58 Prob Prob 0.02595 0.02595 Slope 0.1473 0.0004 0.147
Rochester - WEB - 1
Low Gain v. High Gain ADC900 800 700 600 500 400 300 200 100 0 0 200 400 600Entries Entries Mean Mean y Mean y RMS RMS RMS y 2 / ndf 2 / ndf Prob Prob Slope Offset OffsetLvHadcL3S1 LvHadcL3S1 4673 4673 106.9 89.88 89.88 111 111 35.63 35.63 95.41
Rochester - WEB - 1
Low Gain v. High Gain ADC900 800 700 600 500 400 300 200 100 0 0 200 400 600LvHadcL3S5 LvHadcL3S5 Entries Entries 4673 4673 Mean 204.9 Mean y Mean y 80.58 80.58 RMS RMS 227.3 227.3 RMS y 38.89 38.89 2 / ndf 2 / ndf 80.82 / 58 80.82 / 58 Prob Prob
Rochester - WEB - 1
Low Gain v. High Gain ADC900 800 700 600 500 400 300 200 100 0 0 200 400 600LvHadcL2S5 LvHadcL2S5 Entries Entries 4674 4674 Mean 272.5 Mean y Mean y 108.2 108.2 RMS RMS 295.2 295.2 RMS y 60.18 60.18 2 / ndf 2 / ndf 95 / 58 95 / 58 Prob Prob 0.0015
Rochester - WEB - 1
Low Gain v. High Gain ADC1000800600LvHadcL1S4 LvHadcL1S4 Entries Entries 4674 4674 Mean 270.1 Mean y Mean y 111.6 111.6 RMS RMS 286 286 RMS y 61.02 61.02 2 / ndf 2 / ndf 82.83 / 58 82.83 / 58 Prob Prob 0.01785 0.01785 Slope 0.1426 0.0003 0.14
Rochester - WEB - 1
Low Gain v. High Gain ADC1000800600LvHadcL2S2 LvHadcL2S2 Entries Entries 4673 4673 Mean 176.9 Mean y Mean y 77.4 77.4 RMS RMS 213.2 213.2 RMS y 39.36 39.36 2 / ndf 2 / ndf 80.35 / 58 80.35 / 58 Prob Prob 0.02767 0.02767 Slope 0.1402 0.0003 0.
Rochester - WEB - 1
Low Gain v. High Gain ADC900 800 700 600 500 400 300 200 100 0 0 200 400 600LvHadcL2S6 LvHadcL2S6 Entries Entries 4674 4674 Mean 218.5 Mean y Mean y 102 102 RMS RMS 264 264 RMS y 59.23 59.23 2 / ndf 2 / ndf 72.46 / 58 72.46 / 58 Prob Prob 0.09588
Rochester - WEB - 12
Rochester - WEB - 1
Light Loss in Y-11 Optical FiberHoward Budd* and Jesse Chvojka MINERA Note 001 November 2004 AbstractThe MINERvA experiment will use optical fiber for light collection. This fiber travels from the scintillator to the photosensor and must be bent al
Rochester - WEB - 1
Ofine Software UpdateSep 5, 07Move to new Gaudi/SLF4 Has been long awaited LHCb considers release that we are usingobsolete and removed (some of) the old binaries from their ftp archive which is near its end of life old version was only avail
Rochester - AST - 461
13 LECTURE 3 Einstein Coecients Kirchos law relating emission to absorption for a thermal emitter must involve microscopic physics. Consider system with two energy states with statistical weights g 1 and g2 respectively. Transition from 2 to 1 is b