Digital Commons Network^™

Factorization Of Polynomials And Real Analytic Function, Radoslaw L. Stefanski

Honors Theses

In this project, we address the question: When can a polynomial p(x, y) of two variables be factored as p(x, y) = f(x)g(y), where f and g are polynomials of one variable. We answer this question, using linear algebra, and create a Mathematica program which carries out this factorization. For example,

3+3x-5x^3+y+xy-5/3x^3y+y^2+xy^2-5/3x^3y^2 = (1+x-5/3x^3)(3+y+y^2)

We then generalize this concept and ask: When can p(x,y) can be written as

p(x,y) = f1(x)g2(y)+f2(x)g2(y)+...+fr(x)gr(y)

where fj,gj are polynomials. This can certainly be done (for large enough r). Which is the minimum such r? Again, we have a Mathematica program which carries out this …

Discovering The Potential For Advancements In Intrusion Detection Systems, Kenneth J. Buonforte

Honors Theses

An intrusion detection system (IDS) is a collection of monitors strategically placed on a network or individual host in order to detect anomalous behavior. Since James Anderson introduced one of the first frameworks for an intrusion detection system in [1]. researchers have extended the capabilities of these systems. IDSs take many forms, from systems as basic as command line audit logs to those that emulate the defense mechanisms of the human immune system. However, as intrusion detection has evolved, scientists and administrators alike are beginning to question the need for this technology due to its lack of quantifiable performance and …

Securing Distributed Computations : In Search Of Reliable Large-Scale Compute Power And Refreshed Redundancy, Edward P. Kenney

Honors Theses

The Internet may be the single largest technological advance or significant societal change in the last century. Not only does it allow access to more information than any human could ever hope to digest, but it produces the potential of having millions of computers combining their computational forces for the betterment of a single cause .. Tl is is the fundamental goal of distributed computing. A distributed system is defined to be a network of machines with some degree of centralized direction. In a distributed computational system each machine will accept computational tasks from a supervisor in a master-slave relationship. …

Tree-Like Continua And 2-To-1 Maps, Jo Heath, Van C. Nall

Department of Math & Statistics Faculty Publications

It is not known if there is a 2-to-1 map from a continuum onto a tree-like continuum. In fact, it is not known if there is a 2-to-1 map onto a hereditarily decomposable tree-like continuum. We show that the domain of such a map would have to contain an indecomposable continuum.

Prolongations And Cyclic Vectors, William T. Ross, Harold S. Shapiro

Department of Math & Statistics Faculty Publications

For functions belonging to invariant subspaces of the backward shift operator Bf = (f − f(0))/z on spaces of analytic functions on the unit disk D, we explore, in a systematic way, the continuation properties of these functions.

Zeros Of Functions With Finite Dirichlet Integral, William T. Ross, Stefan Richter, Carl Sundberg

Department of Math & Statistics Faculty Publications

In this paper, we refine a result of Nagel, Rudin, and Shapiro (1982) concerning the zeros of holomorphic functions on the unit disk with finite Dirichlet integral.

Common Cyclic Vectors For Normal Operators, William T. Ross, Warren R. Wogen

Department of Math & Statistics Faculty Publications

If μis a finite compactly supported measure on C, then the set S_μ of multiplication operators Mᵩ : L² (μ) --> L² (μ), Mᵩ f = ᵩ f, where ᵩ ϵ L ∞ (μ) is injective on a set of full μ measure, is the complete set of cyclic multiplication operators on L² (μ) In this paper, we explore the question as to whether or not S_μ has a common cyclic vector

The Backward Shift On The Space Of Chauchy Transforms, William T. Ross, Joseph A. Cima, Alec L. Matheson

Department of Math & Statistics Faculty Publications

This note examines the subspaces of the space of Cauchy transforms of measures on the unit circle that are invariant under the backward shift operator f --> z^-1 (f—f (0)). We examine this question when the space of Cauchy transforms is endowed with both the norm and weak* topologies.

Reliability Estimation Based On System Data With An Unknown Load Share Rule, Hyoungtae Kim, Paul H. Kvam

Department of Math & Statistics Faculty Publications

We consider a multicomponent load-sharing system in which the failure rate of a given component depends on the set of working components at any given time. Such systems can arise in software reliability models and in multivariate failure-time models in biostatistics, for example. A load-share rule dictates how stress or load is redistributed to the surviving components after a component fails within the system. In this paper, we assume the load share rule is unknown and derive methods for statistical inference on load-share parameters based on maximum likelihood. Components with (individual) constant failure rates are observed in two environments: (1) …

A Nonlinear Random Coefficients Model For Degradation Testing, Suk Joo Bae, Paul H. Kvam

Department of Math & Statistics Faculty Publications

As an alternative to traditional life testing, degradation tests can be effective in assessing product reliability when measurements of degradation leading to failure can be observed. This article presents a degradation model for highly reliable light displays, such as plasma display panels and vacuum fluorescent displays (VFDs). Standard degradation models fail to capture the burn-in characteristics of VFDs, when emitted light actually increases up to a certain point in time before it decreases (or degrades) continuously. Random coefficients are used to model this phenomenon in a nonlinear way, which allows for a nonmonotonic degradation path. In many situations, the relative …

[Introduction To] Data Structures With Java, John R. Hubbard, Anita Huray

Bookshelf

For a freshman/sophomore-level course in Data Structures in Computer Science. This text teaches the use of direct source code implementations and the use of the Java libraries; it helps students prepare for later work on larger Java software solutions by adhering to software engineering principles and techniques such as the UML and the Java Collections Framework (JCF). Using the spiral approach to cover such topics as linked structures, recursion, and algorithm analysis, this text also provides revealing illustrations, summaries, review questions, and specialized reference sections.

[Introduction To] Schaum's Outline Of Programming With Java, John R. Hubbard

Bookshelf

Tough Test Questions? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices …