Physical Sciences and Mathematics Commons^™

Performance Of Bootstrap Confidence Intervals For L-Moments And Ratios Of L-Moments., Suzanne Glass

Electronic Theses and Dissertations

L-moments are defined as linear combinations of expected values of order statistics of a variable.(Hosking 1990) L-moments are estimated from samples using functions of weighted means of order statistics. The advantages of L-moments over classical moments are: able to characterize a wider range of distributions; L-moments are more robust to the presence of outliers in the data when estimated from a sample; and L-moments are less subject to bias in estimation and approximate their asymptotic normal distribution more closely.

Hosking (1990) obtained an asymptotic result specifying the sample L-moments have a multivariate normal distribution as n approaches infinity. The standard …

Statistical Power Analysis Of Dissertations Completed By Students Majoring In Educational Leadership At Tennessee Universities, Heping Deng

Electronic Theses and Dissertations

The purpose of this study was to estimate the level of statistical power demonstrated in recent dissertations in the field of educational leadership. Power tables provided in Cohen's (1988) Statistical Power Analysis for the Behavioral Sciences were used to determine the power of the statistical tests conducted in dissertations selected from five universities in Tennessee. The meta-analytic approach was used to summarize and synthesize the findings. The population of this study consisted of all dissertations successfully defended by doctoral students majoring in educational leadership/administration at East Tennessee State University, the University of Tennessee at Knoxville, Tennessee State University, the University …

Mode Vertices And Mode Graphs., Jobriath Scott Kauffman

Electronic Theses and Dissertations

The eccentricity of a vertex, v, of a connected graph, G, is the distance to a furthest vertex from v. A mode vertex of a connected graph, G, is a vertex whose eccentricity occurs as often in the eccentricity sequence of G as the eccentricity of any other vertex. The mode of a graph, G, is the subgraph induced by the mode vertices of G. A mode graph is a connected graph for which each vertex is a mode vertex. Note that mode graphs are a generalization of self-centered graphs. This paper presents some …

A Study Of Disk Performance Optimization., Richard Scott Gray

Electronic Theses and Dissertations

Response time is one of the most important performance measures associated with a typical multi-user system. Response time, in turn, is bounded by the performance of the input/output (I/O) subsystem. Other than the end user and some external peripherals, the slowest component of the I/O subsystem is the disk drive.

One standard strategy for improving I/O subsystem performance uses high-performance hardware like Small Computer Systems Interface (SCSI) drives to improve overall response time. SCSI hardware, unfortunately, is often too expensive to use in low-end multi-user systems. The low-end multi-user systems commonly use inexpensive Integrated Drive Electronics (IDE) disk drives to …

Vertices In Total Dominating Sets., Robert Elmer Dautermann Iii

Electronic Theses and Dissertations

Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and …