Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Approximation theory (1)
- Bayesian Prediction (1)
- Computer networks (1)
- Computer science (1)
- Data structures (1)
-
- Empirical processes (1)
- Java programming (1)
- Meromorphic function (1)
- Operator theory (1)
- Order statistics (1)
- Poisson Distribution (1)
- Portfolio analysis (1)
- Regression analysis (1)
- Reliability (1)
- Set mathematics (1)
- Stochastic order (1)
- Theory of generalized analytic continuation studies (1)
- U-statistics (1)
- Upper Prediction Bounds (1)
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Entire DC Network
Advanced Portfolio Theory: Why Understanding The Math Matters, Tom Arnold
Advanced Portfolio Theory: Why Understanding The Math Matters, Tom Arnold
Finance Faculty Publications
The goal of this paper is to motivate the use of efficient set mathematics for portfolio analysis [as seen in Roll, 1977] in the classroom. Many treatments stop at the two asset portfolio case (avoiding the use of matrix algebra) and an alarming number of treatments rely on illustration and templates to provide a heuristic sense of the material without really teaching how efficient portfolios are generated. This is problematic considering that the benefits of understanding efficient set mathematics go beyond portfolio analysis and into such topics as regression analysis (as demonstrated here).
Self-Similarity In Network Traffic, Francisco Chinchilla
Self-Similarity In Network Traffic, Francisco Chinchilla
Honors Theses
It is critical to properly understand the nature of network traffic in order to effectively design models describing network behavior. These models are usually used to simulate network traffic, which in turn are used to construct congestion control techniques, perform capacity planning studies, and/or evaluate the behavior of new protocols. Using the wrong models could lead to potentially serious problems such as delayed packet transmissions or an increase in packet drop rates.
Traditionally, packet arrivals were assumed to follow a Poisson arrival process. Although Poisson processes have several properties that make them easy to work with, they do not accurately …
Nonparametric Estimation Of A Distribution Subject To A Stochastic Precedence Constraint, Miguel A. Arcones, Paul H. Kvam, Francisco J. Samaniego
Nonparametric Estimation Of A Distribution Subject To A Stochastic Precedence Constraint, Miguel A. Arcones, Paul H. Kvam, Francisco J. Samaniego
Department of Math & Statistics Faculty Publications
For any two random variables X and Y with distributions F and G defined on [0,∞), X is said to stochastically precede Y if P(X≤Y) ≥ 1/2. For independent X and Y, stochastic precedence (denoted by X≤spY) is equivalent to E[G(X–)] ≤ 1/2. The applicability of stochastic precedence in various statistical contexts, including reliability modeling, tests for distributional equality versus various alternatives, and the relative performance of comparable tolerance bounds, is discussed. The problem of estimating the underlying distribution(s) of experimental data under the assumption that they obey a …
Common Cause Failure Prediction Using Data Mapping, Paul H. Kvam, J. Glenn Miller
Common Cause Failure Prediction Using Data Mapping, Paul H. Kvam, J. Glenn Miller
Department of Math & Statistics Faculty Publications
To estimate power plant reliability, a probabilistic safety assessment might combine failure data from various sites. Because dependent failures are a critical concern in the nuclear industry, combining failure data from component groups of different sizes is a challenging problem. One procedure, called data mapping, translates failure data across component group sizes. This includes common cause failures, which are simultaneous failure events of two or more components in a group. In this paper, we present methods for predicting future plant reliability using mapped common cause failure data. The prediction technique is motivated by discrete failure data from emergency diesel generators …
[Introduction To] Data Structures With Java: A Laboratory Approach, Joe Kent, Lewis Barnett Iii
[Introduction To] Data Structures With Java: A Laboratory Approach, Joe Kent, Lewis Barnett Iii
Bookshelf
This book is designed to present the key topics in the second course for computer science students using the Java programming language. For convenience, we cover exceptions and file operations in Java, although this may have been covered in the first course. We also cover material on the binary representation of data and Java's bitwise operations, with applications.These are topics needed for computer organization an operating systems courses.
[Introduction To] Generalized Analytic Continuation, William T. Ross, Harold S. Shapiro
[Introduction To] Generalized Analytic Continuation, William T. Ross, Harold S. Shapiro
Bookshelf
The theory of generalized analytic continuation studies continuations of meromorphic functions in situations where traditional theory says there is a natural boundary. This broader theory touches on a remarkable array of topics in classical analysis, as described in the book. This book addresses the following questions: (1) When can we say, in some reasonable way, that component functions of a meromorphic function on a disconnected domain, are "continuations" of each other? (2) What role do such "continuations" play in certain aspects of approximation theory and operator theory? The authors use the strong analogy with the summability of divergent series …