A comprehensive data processing plan for crop calendar MSS signature development from satellite imagery

There are no author-identified significant results in this report

Composite Protocols and Networking Services

Active Networking is concerned with the rapid definition and deployment of innovative, but reliable and robust, networking services. Towards this end we have developed a composite protocol and networking services architecture that encourages re-use of protocol functions, is well defined, and facilitates automatic checking of interfaces and protocol component properties. The architecture has been used to implement common Internet protocols and services. We will report on this work at the workshop

Assessing Nutritional Health Knowledge in Sharing Clinic Patients with Diabetes

Effective diabetes prevention and management relies on nutritional behaviors, thus a basic level of health knowledge is important for patients with diabetes and their caregivers in their quest to acquire acute glycemic control and minimize negative health outcomes (Ley et al., 2014). The purpose of this study was to assess the nutrition-related health knowledge of patients living with diabetes who are seen at the UNMC Sharing Clinic by use of a verbal questionnaire. This nutritional health knowledge assessment was a quantitative, prospective, survey-based study utilizing descriptive statistics. Approximately 86% of patients were proficient in food group and nutritious foods knowledge but only 57%, 44%, and 29% of patients were proficient in the categories of meal timing, hypoglycemia safety, and carbohydrate counting respectively. These results suggest there is significant room for nutritional education that could positively impact chronic disease state management as well as glycemic safety in Sharing Clinic patients

On Subcomplete Forcing

I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make the subject somewhat more approachable to set theorists, while showing various properties of subcomplete forcing which one might desire of a forcing class, drawing comparisons between subcomplete forcing and countably closed forcing. In particular, I look at the interaction between subcomplete forcing and $\omega_1$-trees, preservation properties of subcomplete forcing, the subcomplete maximality principle, the subcomplete resurrection axiom, and show that generalized diagonal Prikry forcing is subcomplete.Comment: This is my PhD dissertatio