Distribution of Rain Gardens in Lincoln Nebraska: Are Rain Gardens more Likely to be Built Near Bodies of Water

Abstract Rain gardens are an important tool in reducing the amount of stormwater runoff and accompanying pollutants from entering the city’s streams and lakes, and reducing their water quality. This thesis project analyzed the number of rain gardens installed through the City of Lincoln Nebraska Watershed Management’s Rain Garden Water Quality Project in distance intervals of one-eighth mile from streams and lakes. This data shows the distribution of these rain gardens in relation to streams and lakes and attempts to determine if proximity to streams and lakes is a factor in homeowners installing rain gardens. ArcGIS was used to create a map with layers to determine the number of houses with rain gardens in 1/8 mile distance increments from the city’s streams and lakes and their distances from a stream or lake. The total area, number of house parcels, and the type and location of each parcel type were also determined for comparison between the distance interval increments. The study revealed that fifty-eight percent of rain gardens were installed within a quarter mile of a stream or lake (an area covering 60% of the city and including 58.5% of the city’s house parcels), and that eighty percent of rain gardens were installed within three-eighth mile of streams or lakes (an area covering 75% of the city and 78.5% of the city’s house parcels). All parcels in the city are within 1 mile of a stream or lake. Alone the number of project houses per distance intervals suggested that proximity to a stream or lake was a factor in people’s decisions to install rain gardens. However, when compared to the number of house parcels available, proximity disappears as a factor in project participation.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.