Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Statistics and Probability

Missouri University of Science and Technology

Series

1993

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond Mar 1993

Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond

Computer Science Faculty Research & Creative Works

Quinlan's ID3 machine learning algorithm induces classification trees (rules) from a set of training examples. The algorithm is extremely effective when training examples are composed of attributes whose values are taken from small discrete domains. The classification accuracy of ID3-produced trees on domains whose attributes are many-valued tends to be marginal due to the large number of possible values which may be associated with each attribute. Attempts to solve this problem by a priori grouping of attribute values into distinct subsets has met with limited success. The dynamic ID3 algorithm improves the performance of ID3 on this type of problem …

Go to article

Prediction Intervals Based On Partial Observations For Some Discrete Distributions, Lee J. Bain, Jagdish K. Patel Jan 1993

Prediction Intervals Based On Partial Observations For Some Discrete Distributions, Lee J. Bain, Jagdish K. Patel

Mathematics and Statistics Faculty Research & Creative Works

Prediction limits of the following type are considered for the binomial, hypergeometric, and negative-binomial distributions. For the binomial distribution, suppose Xr successes have occurred in the first r trials, and based on this partial information it is desired to predict the total number of successes Xs (r < s), which will have occurred by trial s. Similar results are considered for the Poisson and negative-binomial distributions. The results are expressed in terms of well-known distributions which have been tabulated, but it is quite tedious to carry out the procedures based on available tables. Normal (Gaussian) approximations are provided which makes these methods convenient to apply. © 1993 IEEE

Go to article

Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling, R. G. Karl, T. L. Lo, Daniel C. St. Clair Jan 1993

Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling, R. G. Karl, T. L. Lo, Daniel C. St. Clair

Mathematics and Statistics Faculty Research & Creative Works

This paper discusses problems associated with scheduling periodic task on a uniprocessor in a hard, real-time processing environment using a static-priority, preemptive-resume operating system. Task sets containing a single periodic task with two Ned release periocis of unequal length are examined. Ihe nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher task priorities to tasks with shorter release periods. me effects on processor utilization using two dirkrent priority assignment schemes are examined; one with task priorities sorted by the average release periods and the other with priorities sorted using the short nonsymmetric task period with …

Go to article

Fixed Points For Pairs Of Mappings In D-Complete Topological Spaces, Troy L. Hicks, B. E. Rhoades Jan 1993

Fixed Points For Pairs Of Mappings In D-Complete Topological Spaces, Troy L. Hicks, B. E. Rhoades

Mathematics and Statistics Faculty Research & Creative Works

Several important metric space fixed point theorems axe proved for a large class of non-metric spaces. In some cases, the metric space proofs need only minor changes. This is surprising since the distance function used need not be symmetric and need not satisfy the triangular inequality. © 1993, Hindawi Publishing Corporation. All rights reserved.

Go to article

The Next Linear Collider Test Accelerator, R. D. Ruth, C. Adolphsen, K. Bane, R. F. Boyce, D. L. Burke, R. Calin, G. Caryotakis, R. Cassel, Stephen L. Clark, H. Deruyter, K. Fant, R. Fuller, S. Heifets, H. Hoag, R. Humphrey, S. Kheifets, R. Koontz, N. M. Kroll, R. T. Lavine, G. A. Loew, A. Menegat, R. H. Miller, C. Nantista, J. M. Patterson, C. Pearson, R. Phillips, J. Rifkin, J. Spencer, S. Tantawi, K. A. Thompson, A. Vlieks, V. Vylet, J. W. Wang, P. B. Wilson, A. Yeremian, B. Youngman Jan 1993

The Next Linear Collider Test Accelerator, R. D. Ruth, C. Adolphsen, K. Bane, R. F. Boyce, D. L. Burke, R. Calin, G. Caryotakis, R. Cassel, Stephen L. Clark, H. Deruyter, K. Fant, R. Fuller, S. Heifets, H. Hoag, R. Humphrey, S. Kheifets, R. Koontz, N. M. Kroll, R. T. Lavine, G. A. Loew, A. Menegat, R. H. Miller, C. Nantista, J. M. Patterson, C. Pearson, R. Phillips, J. Rifkin, J. Spencer, S. Tantawi, K. A. Thompson, A. Vlieks, V. Vylet, J. W. Wang, P. B. Wilson, A. Yeremian, B. Youngman

Mathematics and Statistics Faculty Research & Creative Works

During the past several years, there has been tremendous progress on the development of the RF system and accelerating structures for a Next Linear Collider (NLC). Developments include high-power klystrons, RF pulse compression systems and damped/detuned accelerator structures to reduce wakefields. In order to integrate these separate development efforts into an actual X-band accelerator capable of accelerating the electron beams necessary for an NLC, we are building an NLC Test Accelerator (NLCTA). The goal of the NLCTA is to bring together all elements of the entire accelerating system by constructing and reliably operating an engineered model of a high-gradient linac …

Go to article