Statistics and Probability Commons^™

Fixed Point Theorems For Non-Self Maps I, Troy L. Hicks, Unda Marie Sauga

Mathematics and Statistics Faculty Research & Creative Works

Suppose f:C→X where C is a closed subset of X. Necessary and sufficient conditions are given for f to have a fixed point. All results hold when X is complete metric space. Several results hold in a much more general setting. © 1994, Hindawi Publishing Corporation. All rights reserved.

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 …

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 …

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.

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 …

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

The Management Of Replicated Data, Hsueh-Chi Shih, C. Y. Ho, S. Alptekin

Computer Science Technical Reports

Data replication, which has the benefits of improving system availability and read performance, proved to be indispensable to many database applications. In a replicated database, the one-copy serializability of transaction executions can be ensured by employing a replica control mechanism on top of the traditional concurrency control mechanism. This work contains two replica control algorithms and a read-only transaction processing algorithm. Both replica control algorithms handle multiple site, communication and partitioning failures. The replica control algorithms achieve read operation efficiency by always translating a logical read operation into one local physical read operation and by taking advantage of the locality …

An Animation System For Shift Reduce Parsers, M. S. Mandl, T. J. Sager, D. C. St. Clair

Computer Science Technical Reports

This paper presents the design and implementation of the Parse Display Utility (POU) system. This system introduces a mechanism to augment traditional methods of exploring parsing theory by providing a PRESENTATION scheme which allows a user to view the operation of a shift-reduce parser.

The overall operation of the tool revolves around an LALR (LookAhead LR) parser/parser generator and is managed by a Graphical User-Interface (GUI) developed using Borland's Turbo Vision product. The GUI allows access to a facility which draws derivation trees in Turbo Pascal graphics. This parse tree facility utilizes an algorithm which can easily be ported to …

Effects Of Nonsymmetric Release Times On Rate Monotonic Scheduling, R. G. Karl, T. L. Lo, D. C. St. Clair

Computer Science Technical Reports

This paper discusses problems associated with scheduling periodic tasks in a hard, real-time processing or computing environment using a static-priority, preemptive-resume operating system . The scheduling problems associated with a task set containing a single periodic task which has two fixed release periods of unequal length are examined. Some real-world applications may require task release times which are periodic, but whose tasking periods are not symmetric. A scheduling algorithm for task sets with a single nonsymmetric task has been developed for staticpriority, preemptive-resume operating systems. The nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher …

Design Of Backpropagation Neural Network Architectures Using A Decision Tree Classifier, B. M. Van Horn, D. C. St. Clair

Computer Science Technical Reports

The backpropagation neural network algorithm is a popular machine learning methodology. One difficulty with using the algorithm is that the network architecture must be designed before learning can occur. This includes deciding the number of layers, the number of nodes in each layer, and the number of connections. Traditionally this problem is solved by heuristics gained by an expert through experience.

This paper presents an algorithm for using ID3 decision trees to design the network architecture. Previous approaches rely on binary decision trees. The proposed technique utilizes n-ary trees. These trees are easier to understand, are better suited for continuous-valued …

Optimizing Accuracy And Generalization In Numeric Classification Systems, M. D. Walters, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms that take training instances as input and produce a set of rules as output. The classifier systems focused on in this paper represent the knowledge they learn in the form of decision trees, and are built upon Quinlan's [ 1986] inductive algorithm ID3.

The ID3 algorithm suffers from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a continuous domain or from a domain with a large number of discrete values. A number of approaches have been developed for extending ID3 to handle …

The Identification And Processing Of Don't-Care Attribute Values In Id3 Decision Tree Construction, P. D. Dorr, D. C. St. Clair

Computer Science Technical Reports

ID3 is most successful when used with sets of training and testing data that contain no missing attribute values. Many times, however, real-world domains have attributes with missing values. Sometimes these attribute values may not be needed to classify an instance. Such attribute values are called don't-care attribute values. In other cases, the values are needed but are unavailable. These values are called unknown attribute values. This paper describes the difference between unknown and don't-care attribute values and discusses several ways of identifying don't-care attribute values in ID3. Numerical results are described which validate the practicality of these approaches.

Network Key Management In A Large Distributed Environment, J. J. Stapleton, D. C. St. Clair

Computer Science Technical Reports

The technique of using encryption for protecting information in a network environment involves managing encryption keys within that same network. In large distributed networks the goal of achieving a secure environment requires a secure method of performing network key management. Network security, system security, and application security by means of data encryption rely on encryption keys remaining secret.

Both international and domestic standards organizations such as the International Organization for Standardization (ISO), the American National Standards Institute (ANSI), and the National Institute of Standards and Technology (NIST) address the issues of encryption through various standards. However, these standards discuss methods …

Boundedness And Periodic Solutions In Infinite Delay Systems, Roger H. Hering

Mathematics and Statistics Faculty Research & Creative Works

Liapunov methods are used to give conditions ensuring that solutions of infinite delay equations are uniformly bounded and uniformly ultimately bounded with respect to unbounded (Cg) initial function spaces; and the connection to proving existence of periodic solutions is examined. Several examples illustrate the application of these results, especially to integrodifferential equations. © 1992.

Fixed Point Theorems For D-Complete Topological Spaces I, Troy L. Hicks

Mathematics and Statistics Faculty Research & Creative Works

Generalizations of Banach's fixed point theorem are proved for a large class of non-metric spaces. These include d-complete symmetric (semi-metric) spaces and complete quasi-metric spaces. The distance function used need not be symmetric and need not satisfy the triangular inequality. © 1992, Hindawi Publishing Corporation. All rights reserved.

Prediction Intervals, Based On Ranges And Waiting Times, For An Exponential Distribution, Laura Colangelo, Jagdish K. Patel

Mathematics and Statistics Faculty Research & Creative Works

This article contains two prediction intervals applicable to a 2-parameter as well as a 1-parameter exponential distribution. One can be used to predict a future sample range on the basis of an observed sample range. Appropriate prediction factors are tabulated. The other can be used to predict a waiting time between two future successive failures on the basis of an observed waiting time between two previous successive failures. © 1992 IEEE

Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair

Computer Science Faculty Research & Creative Works

Many learning systems have been designed to construct classification trees from a set of training examples. One of the most widely used approaches for constructing decision trees is the ID3 algorithm [Quinlan 1986]. Decision trees are ill-suited to handle attributes with ordinal values. Problems arise when a node representing an ordinal attribute has a branch for each value of the ordinal attribute in the training set. This is generally infeasible when the set of ordinal values is very large. Past approaches have sought to cluster large sets of ordinal values before the classification tree is constructed [Quinlan 1986; Lebowitz 1985; …

Incremental Learning Of Numeric Clusters In Classifier Systems, K. R. Hacke, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms which take training instances as input and produce a set of rules as output Many classifier systems represent the knowledge they learn in the form of one or more decision trees. Accurate knowledgebase systems for a variety of domains have been constructed by generating decision trees using J. R. Quinlan's (1986) inductive algorithm ID3 and P. E. Utgoffs (1988) IDS. IDS is an incremental version of ID3.

Unfortunately, all these algorithms suffer from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a …

Modeling The Software Design Project, C. C. Dziedzic, D. C. St. Clair

Computer Science Technical Reports

The information content of the software design product as needed by various user communities is identified. Definitions of design in classical engineering disciplines are investigated and then applied specifically to the area of software design. The Entity-Relationship model is used to describe the information content of the software design product. All the relationship types and entity types that compose the design product are described in detail. The Military Standard: Defense System Software Development, DOD-STD-2167A, is analyzed to determine how it meets the relationship type requirements.

Incremental Learning Of Numeric Clusters In Classifier Systems, K. R. Hacke, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms which take training instances as input and produce a set of rules as output Many classifier systems represent the knowledge they learn in the form of one or more decision trees. Accurate knowledgebase systems for a variety of domains have been constructed by generating decision trees using J. R. Quinlan's (1986) inductive algorithm ID3 and P. E. Utgoffs (1988) IDS. IDS is an incremental version of ID3.

Unfortunately, all these algorithms suffer from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a …

Modeling The Software Design Project, C. C. Dziedzic, D. C. St. Clair

Computer Science Technical Reports

The information content of the software design product as needed by various user communities is identified. Definitions of design in classical engineering disciplines are investigated and then applied specifically to the area of software design. The Entity-Relationship model is used to describe the information content of the software design product. All the relationship types and entity types that compose the design product are described in detail. The Military Standard: Defense System Software Development, DOD-STD-2167A, is analyzed to determine how it meets the relationship type requirements.

Oscillations In Lotka-Volterra Systems Of Chemical Reactions, Roger H. Hering

Mathematics and Statistics Faculty Research & Creative Works

For a chemical reaction system modeled by x =k₁Ax -k₂x² -k₃xy +k₄y², y =k₃xy -k₄y² -k₅y +k₆B, it is shown that for each positive choice of parameters k₁A, B there exists a unique stationary state which is globally asymptotically stable in the positive quadrant. A criterion for the non-existence of periodic solutions is given for the generalized Lotka-Volterra system:x = f(x)h(x, y), y. © 1990 J.C. Baltzer AG, Scientific Publishing Company.

Robustness & Precision Of Parametric & Distribution-Free Tolerance Limits For Two Lifetime Distributions, Wei Kei Shiue, Lee J. Bain

Mathematics and Statistics Faculty Research & Creative Works

Exact parametric tolerance limits or confidence limits on reliability are not available for the gamma distribution, and it is, difficult to determine approximate methods which are accurate for all parameter values. The precision lost by using the distribution-free tolerance-limit method based on the first order statistic, compared to using an approximate gamma tolerance limit method is studied. The robustness of the approximate gamma tolerance limit when the true model is Weibull and the robustness of a Weibull tolerance limit when the true model is gamma are also studied. The efficiency of the distribution-free method ranges from about 0.60 to 0.90 …

Periodic Points For Homeomorphisms Of Hereditarily Decomposable Chainable Continua, W. T. Ingram

Mathematics and Statistics Faculty Research & Creative Works

In this paper it is shown that homeomorphisms of hereditarily decomposable chainable continua cannot have periodic points whose periods are not powers of two. Examples show that for each power of two there is a hereditarily decomposable chainable continuum and a homeomorphism of it which has a periodic point of period that power of two. © 1989 American Mathematical Society.

Sharp Lower Bounds For A Generalized Jensen Inequality, A. K. Rigler, S. Y. Trimble, R. S. Varga

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

Impedance Controlled Connector Interface, Stephen L. Clark

Mathematics and Statistics Faculty Research & Creative Works

A connector interface for electrically mating a multi-row connector with a printed circuit board is defined by a flex circuit in the form of laminated polyimide layers having conductive traces for each interconnect pair with connection fields at the opposite ends of the traces for electrical connection to the terminal pins on the connector and the conductive pads or pins on the circuit board. The conductive traces are all of equal length to provide equal resistance and impedance paths for each of the circuit interconnects.

Concerning Periodic Points In Mappings Of Continua, W. (William) T. (Thomas) Ingram

Mathematics and Statistics Faculty Research & Creative Works

In this paper we present some conditions which are sufficient for a mapping to have periodic points. © 1988 American Mathematical Society.

Computer Science—A Mathematical Science And Accreditation, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

Recruiting More Computer Science Students - What To Do After The "Glamour" Has Gone Away?, William E. Mcbride, James Calhoun, James Richards, Harriet Taylor, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

The moderator will first focus on the question: "Are enrollments actually declining in computer science programs across this country?" He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments.

Recruiting More Computer Science Students—What To Do After The “Glamour” Has Gone Away?, William E. Mcbride, James Calhoun, James L. Richards, Harriet G. Taylor, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

The moderator will first focus on the question: "Are enrollments actually declining in computer science programs across this country?" He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments. © 1988, ACM. All rights reserved.