Physical Sciences and Mathematics Commons^™

Banach Spaces On Infinitely Branching Trees, Annette B. Locke

Electronic Theses and Dissertations

An example of a Banach space, X_∞, with a nonseparable dual such that l₁ does not imbed in X_∞ is investigated. Not every weakly null sequence has a subsequence equivalent to the usual basis of c₀, but c₀ imbeds in many subspaces of X_∞. The space l₁ does imbed in X_∞^∗, the dual space of X_∞, yet weakly converging sequences in X_∞^∗ need not converge in norm.

The Burden Of Fetching Water: Using Caloric Expenditure As An Indicator Of Access To Safe Drinking Water—A Case Study From Xieng Khouang Province, Lao Pdr, Jeff La Frenierre

Electronic Theses and Dissertations

The Millennium Development Goals measure ‘access to improved drinking water’ using an indicator that defines access as the presence of an improved water source within 1 kilometer of a person’s dwelling. This purely linear measurement has significant shortcomings, including a lack of consideration for the difficulty of the terrain being traversed and the weight of the loads being carried. This paper examines in detail the human energy costs associated with fetching water, first using two Lao villages as case studies, then applying a predictive energy expenditure model to measure the potential caloric effect of variations in the age and gender …

Routing In The Dark: Pitch Black, Nathan S. Evans

Electronic Theses and Dissertations

In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Friendto-friend “darknet” networks have been shown to commonly have a small-world topology; while short paths exist between any pair of nodes in small-world networks, it is non-trivial to determine such paths with a distributed algorithm. Recently, Clarke and Sandberg proposed the first decentralized routing algorithm that achieves efficient routing in such small-world networks.

Herein this thesis we discuss the first independent security analysis of Clarke and Sandberg’s routing algorithm. We show that a relatively weak participating adversary can render …

Heuristics For Improved Enterprise Intrusion Detection, James J. Treinen

Electronic Theses and Dissertations

One of the greatest challenges facing network operators today is the identification of malicious activity on their networks. The current approach is to deploy a set of intrusion detection sensors (IDSs) in various locations throughout the network and on strategic hosts. Unfortunately, the available intrusion detection technologies generate an overwhelming volume of false alarms, making the task of identifying genuine attacks nearly impossible. This problem is very difficult to solve even in networks of nominal size. The task of uncovering attacks in enterprise class networks quickly becomes unmanageable.

Research on improving intrusion detection sensors is ongoing, but given the nature …

Analysis And Treatment Of Emerging Polar Contaminants, Daniel E. Connors

Electronic Theses and Dissertations

Two major classes of polar compounds have recently become a major focus as sources of contamination of water systems. Pharmaceuticals and personal care products (PPCPs) enter water through wastewater streams, and many of these compounds survive current wastewater treatment processes. High production volume chemicals (HPVCs), defined as chemicals produced in excess of one million pounds per year have numerous entries into surface and drinking waters due to their ubiquity. The commonality between many of these compounds is their polarity, which makes them water-soluble.

While both PPCPs and HPVCs have been entering into the environment for decades, advances in analyte detection …

Permutation Patterns, Reduced Decompositions With Few Repetitions And The Bruhat Order, Daniel Alan Daly

Electronic Theses and Dissertations

This thesis is concerned with problems involving permutations. The main focus is on connections between permutation patterns and reduced decompositions with few repetitions. Connections between permutation patterns and reduced decompositions were first studied various mathematicians including Stanley, Billey and Tenner. In particular, they studied pattern avoidance conditions on reduced decompositions with no repeated elements. This thesis classifies the pattern avoidance and containment conditions on reduced decompositions with one and two elements repeated. This classification is then used to obtain new enumeration results for pattern classes related to the reduced decompositions and introduces the technique of counting pattern classes via reduced …