GIS Mapping: Creating Solutions for Rock Creek Lake, 2004

Rock Creek Lake is at risk. The centerpiece of Rock Creek State Park in Jasper County, Rock Creek Lake offers visitors a range of recreational opportunities, including the second busiest campground in Iowa and great fishing. However, many different factors are threatening the lake. Action is being taken to improve the lake for today’s visitors and to preserve the lake for future generations. GIS mapping is helping to make those improvements possible.

DNR Interactive Mapping: A tool for Iowa Agriculture, 2006

The planning tools you need to improve both your farming operation and Iowa’s streams and lakes are right at your fingertips. With DNR interactive mapping online, you can access a large amount of information for free and without special software.

Mapping Nursing language terms of Parkinson's disease

OBJECTIVE Implementing cross-mapping of Nursing language terms with the terminology of NANDA International, contained in records of patients with Parkinson's disease in rehabilitation. METHOD Descriptive study of cross mapping, carried out in three steps. A simple random sample of 67 files of patients who participated in the rehabilitation in the period between March 2009 and April 2013. RESULTS We identified 454 terms of Nursing language that resulted in 54 diagnoses after cross-mapping, present in 11 of the 13 taxonomy domains. The most mapped diagnosis was "Impaired urinary elimination" (59.7%), followed by "Urgent urinary incontinence" (55.2%), "Willingness to self-control improved health" (50.7%), "Constipation" (47.8%) and "Compromised physical mobility" (29.9%). Seven described terms were not mapped due to a corresponding defining characteristic being absent. CONCLUSION It was possible to determine the profile of patients, as well as the complexity of nursing care in the rehabilitation of patients with Parkinson's disease.

MP2RAGE, a self bias-field corrected sequence for improved segmentation and T1-mapping at high field.

The large spatial inhomogeneity in transmit B(1) field (B(1)(+)) observable in human MR images at high static magnetic fields (B(0)) severely impairs image quality. To overcome this effect in brain T(1)-weighted images, the MPRAGE sequence was modified to generate two different images at different inversion times, MP2RAGE. By combining the two images in a novel fashion, it was possible to create T(1)-weighted images where the result image was free of proton density contrast, T(2) contrast, reception bias field, and, to first order, transmit field inhomogeneity. MP2RAGE sequence parameters were optimized using Bloch equations to maximize contrast-to-noise ratio per unit of time between brain tissues and minimize the effect of B(1)(+) variations through space. Images of high anatomical quality and excellent brain tissue differentiation suitable for applications such as segmentation and voxel-based morphometry were obtained at 3 and 7 T. From such T(1)-weighted images, acquired within 12 min, high-resolution 3D T(1) maps were routinely calculated at 7 T with sub-millimeter voxel resolution (0.65-0.85 mm isotropic). T(1) maps were validated in phantom experiments. In humans, the T(1) values obtained at 7 T were 1.15+/-0.06 s for white matter (WM) and 1.92+/-0.16 s for grey matter (GM), in good agreement with literature values obtained at lower spatial resolution. At 3 T, where whole-brain acquisitions with 1 mm isotropic voxels were acquired in 8 min, the T(1) values obtained (0.81+/-0.03 s for WM and 1.35+/-0.05 for GM) were once again found to be in very good agreement with values in the literature.

Lack of Discipline in Cape Verdean Secondary Schools: The Need to Better Define the Problem and Develop Strategies to Prevent or Manage the Situation

This research paper has been written with the intention to discuss the problem of discipline in Cape Verdean secondary schools. While many of us discuss the effects that student misbehavior has on the student misbehavior has on the student, school and society as a whole, very few of us seek solutions which would impact on the prevention and management of this problem that each day becomes more complicated and harder to handle. This paper will discuss the need to better define discipline at the school level; identify the causes and factors that aggravate the problem, in addition, to provide what I hope to be useful strategies to better manage the problem as we make the effort to reclaim our schools and better educate our students. My research included surveys completed by teachers and student alike as they baffled over the question: what is discipline and how can we better manage discipline problems at our schools?

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

A mathematical excursion: From the three-door problem to a Cantor-type perfect set

We start with a generalization of the well-known three-door problem:the n-door problem. The solution of this new problem leads us toa beautiful representation system for real numbers in (0,1] as alternated series, known in the literature as Pierce expansions. A closer look to Pierce expansions will take us to some metrical properties of sets defined through the Pierce expansions of its elements. Finally, these metrical properties will enable us to present 'strange' sets, similar to the classical Cantor set.

Locating emergency services with priority rules: The priority queuing covering location problem

One of the assumptions of the Capacitated Facility Location Problem (CFLP) is thatdemand is known and fixed. Most often, this is not the case when managers take somestrategic decisions such as locating facilities and assigning demand points to thosefacilities. In this paper we consider demand as stochastic and we model each of thefacilities as an independent queue. Stochastic models of manufacturing systems anddeterministic location models are put together in order to obtain a formula for thebacklogging probability at a potential facility location.Several solution techniques have been proposed to solve the CFLP. One of the mostrecently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, isimplemented in order to solve the model formulated. We present some computationalexperiments in order to evaluate the heuristics performance and to illustrate the use ofthis new formulation for the CFLP. The paper finishes with a simple simulationexercise.

A multi-objective model for a multi-period distribution management problem

The problems arising in commercial distribution are complex and involve several players and decision levels. One important decision is relatedwith the design of the routes to distribute the products, in an efficient and inexpensive way.This article deals with a complex vehicle routing problem that can beseen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problemthat considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is costminimization, the second is balancing work levels and the third is amarketing objective. An application of the model on a small example, with5 clients and 3 days, is presented. The results of the model show the complexity of solving multi-objective combinatorial optimization problems and the contradiction between the several distribution management objective.

Mapping of the genes coding for the two major vaccinia virus core polypeptides.

We have mapped the genes coding for two major structural polypeptides of the vaccinia virus core by hybrid selection and transcriptional mapping. First, RNA was selected by hybridization to restriction fragments of the vaccinia virus genome, translated in vitro and the products were immunoprecipitated with antibodies against the two polypeptides. This approach allowed us to map the genes to the left hand end of the largest Hind III restriction fragment of 50 kilobase pairs. Second, transcriptional mapping of this region of the genome revealed the presence of the two expected RNAs. Both RNAs are transcribed from the leftward reading strand and the 5'-ends of the genes are separated by about 7.5 kilobase pairs of DNA. Thus, two genes encoding structural polypeptides with a similar location in the vaccinia virus particle are clustered at approximately 105 kilobase pairs from the left hand end of the 180 kilobase pair vaccinia virus genome.

Minimax lower bounds for the two-armed bandit problem

We obtain minimax lower bounds on the regret for the classicaltwo--armed bandit problem. We provide a finite--sample minimax version of the well--known log $n$ asymptotic lower bound of Lai and Robbins. Also, in contrast to the log $n$ asymptotic results on the regret, we show that the minimax regret is achieved by mere random guessing under fairly mild conditions on the set of allowable configurations of the two arms. That is, we show that for {\sl every} allocation rule and for {\sl every} $n$, there is a configuration such that the regret at time $n$ is at least 1 -- $\epsilon$ times the regret of random guessing, where $\epsilon$ is any small positive constant.

The contributions of rare objects in correspondence analysis

Correspondence analysis, when used to visualize relationships in a table of counts(for example, abundance data in ecology), has been frequently criticized as being too sensitiveto objects (for example, species) that occur with very low frequency or in very few samples. Inthis statistical report we show that this criticism is generally unfounded. We demonstrate this inseveral data sets by calculating the actual contributions of rare objects to the results ofcorrespondence analysis and canonical correspondence analysis, both to the determination ofthe principal axes and to the chi-square distance. It is a fact that rare objects are oftenpositioned as outliers in correspondence analysis maps, which gives the impression that theyare highly influential, but their low weight offsets their distant positions and reduces their effecton the results. An alternative scaling of the correspondence analysis solution, the contributionbiplot, is proposed as a way of mapping the results in order to avoid the problem of outlying andlow contributing rare objects.