Report on the Iowa Judicial Branch for the year ended June 30, 2007

Report on the Iowa Judicial Branch for the year ended June 30, 2007

Gall midge attack intensity and host-plant response in a Neotropical coastal ecosystem

The gall inducer Clusiamyia nitida Maia, 1996 (Diptera, Cecidomyiidae) often infests the shrub Clusia lanceolata (Camb.) (Clusiaceae) in the Neotropical vegetation of restinga of Rio de Janeiro State, Brazil. Leaves of Clusia lanceolata host up to 20 spheroid galls and show variation in their shape. We aimed to evaluate the effect of gall's intensity on leaves of Clusia lanceolata, and the extension of gall's impact on adjacent non-galled leaves. We analyzed the effect of the number of galls on leaf area, biomass, specific area and leaf appearance from 509 leaves of 14 individual plants. The results showed that differences of individual plants, pairs of leaves, and gall presence were responsible for more then 90% of variation on infested leaves. Variation on parasitic intensity level created differences in leaf response. Under moderate gall attack characterized by scattered galls on a leaf, the increase of the number of galls caused an increase of leaf biomass and area, and a decrease of specific area. The specific area was smaller also under high attack intensity, characterized by coalescent galls on a leaf. In those cases of extremely high parasitic intensity, galled leaves became deformed and the surface area was severely reduced. Leaf deformation due to gall attack led to early leaf abscission, indicated by the 90% of deformed leaves found in the youngest leaf pair of the branch. There was insufficient evidence that the impact of galls on leaf morpho-physiological parameters extended beyond the attacked leaves, because ungalled leaves did not change significantly when their opposite leaf had been galled.

Report on the Iowa Judicial Branch – County Clerks of District Courts, a part of the State of Iowa, for the year ended June 30, 2007

Report on the Iowa Judicial Branch – County Clerks of District Courts, a part of the State of Iowa, for the year ended June 30, 2007

Nest structure and occurrence of three species of Azteca (Hymenoptera, Formicidae) in Cecropia pachystachya (Urticaceae) in non-floodable and floodable pantanal areas

Thirty Cecropia pachystachya trees were examined in non-floodable and floodable areas to investigate the association between C. pachystachya and Azteca ants in the Pantanal of Mato Grosso do Sul, Brazil. The species Azteca ovaticeps, Azteca isthmica, and Azteca alfari were found nesting inside domatia of C. pachystachya. A. ovaticeps was the most frequent species in the trees in the floodable area, while A. isthmica and A. alfari, in the non-floodable area. A. ovaticeps and A. isthmica maintained more entrance/exit holes in comparison to A. alfari. All Azteca species maintained entrance/exit holes in the closest domatia to the apical area of the branch, due to proximity to Müllerian and pearl bodies, suggesting that these species of Azteca were influenced by their environment during evolution and became specialized. All internodal septa of each examined branch were perforated by ants, indicating the branches were inhabited by a single colony.

Worst-case bounds for the logarithmic loss of predictors

We investigate on-line prediction of individual sequences. Given a class of predictors, the goal is to predict as well as the best predictor in the class, where the loss is measured by the self information (logarithmic) loss function. The excess loss (regret) is closely related to the redundancy of the associated lossless universal code. Using Shtarkov's theorem and tools from empirical process theory, we prove a general upper bound on the best possible (minimax) regret. The bound depends on certain metric properties of the class of predictors. We apply the bound to both parametric and nonparametric classes ofpredictors. Finally, we point out a suboptimal behavior of the popular Bayesian weighted average algorithm.

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

Emergence of Cooperation on Static and Dynamic Networks

Game theory is a branch of applied mathematics used to analyze situation where two or more agents are interacting. Originally it was developed as a model for conflicts and collaborations between rational and intelligent individuals. Now it finds applications in social sciences, eco- nomics, biology (particularly evolutionary biology and ecology), engineering, political science, international relations, computer science, and philosophy. Networks are an abstract representation of interactions, dependencies or relationships. Net- works are extensively used in all the fields mentioned above and in many more. Many useful informations about a system can be discovered by analyzing the current state of a network representation of such system. In this work we will apply some of the methods of game theory to populations of agents that are interconnected. A population is in fact represented by a network of players where one can only interact with another if there is a connection between them. In the first part of this work we will show that the structure of the underlying network has a strong influence on the strategies that the players will decide to adopt to maximize their utility. We will then introduce a supplementary degree of freedom by allowing the structure of the population to be modified along the simulations. This modification allows the players to modify the structure of their environment to optimize the utility that they can obtain.

An experimental study of discharge partitioning and flow structure at symmetrical bifurcations

Recent research has examined the factors controlling the geometrical configuration of bifurcations, determined the range of stability conditions for a number of bifurcation types and assessed the impact of perturbations on bifurcation evolution. However, the flow division process and the parameters that influence flow and sediment partitioning are still poorly characterized. To identify and isolate these parameters, three-dimensional velocities were measured at 11 cross-sections in a fixed-walled experimental bifurcation. Water surface gradients were controlled, and systematically varied, using a weir in each distributary. As may be expected, the steepest distributary conveyed the most discharge ( was dominant) while the mildest distributary conveyed the least discharge ( was subordinate). A zone of water surface super-elevation was co-located with the bifurcation in symmetric cases or displaced into the subordinate branch in asymmetric cases. Downstream of a relatively acute-angled bifurcation, primary velocity cores were near to the water surface and against the inner banks, with near-bed zones of lower primary velocity at the outer banks. Downstream of an obtuse-angled bifurcation, velocity cores were initially at the outer banks, with near-bed zones of lower velocities at the inner banks, but patterns soon reverted to match the acute-angled case. A single secondary flow cell was generated in each distributary, with water flowing inwards at the water surface and outwards at the bed. Circulation was relatively enhanced within the subordinate branch, which may help explain why subordinate distributaries remain open, may play a role in determining the size of commonly-observed topographic features, and may thus exert some control on the stability of asymmetric bifurcations. Further, because larger values of circulation result from larger gradient disadvantages, the length of confluence-diffluence units in braided rivers or between diffluences within delta distributary networks may vary depending upon flow structures inherited from upstream and whether, and how, they are fed by dominant or subordinate distributaries. Copyright (C) 2011 John Wiley & Sons, Ltd.

A data-dependent skeleton estimate and a scale-sensitive dimension for classification

The classical binary classification problem is investigatedwhen it is known in advance that the posterior probability function(or regression function) belongs to some class of functions. We introduceand analyze a method which effectively exploits this knowledge. The methodis based on minimizing the empirical risk over a carefully selected``skeleton'' of the class of regression functions. The skeleton is acovering of the class based on a data--dependent metric, especiallyfitted for classification. A new scale--sensitive dimension isintroduced which is more useful for the studied classification problemthan other, previously defined, dimension measures. This fact isdemonstrated by performance bounds for the skeleton estimate in termsof the new dimension.

Audit report on the City of West Branch, Iowa for the year ended June 30, 2008

Audit report on the City of West Branch, Iowa for the year ended June 30, 2008

Report on the Iowa Judicial Branch for the year ended June 30, 2008

Report on the Iowa Judicial Branch for the year ended June 30, 2008

A Report on the Restructuring and Downsizing of Iowa State Government, prepared by Peat, Marwick, Mitchell & Co., 1985.

This report investigates the structure, form, and financial situation of the Executive branch of the State of Iowa. And makes suggestions on how to reduce infrastructure in order to reach the goal of saving money and balancing the budget.

Maximum-likelihood estimation of specific differential phase and attenuation in rain

Precise estimation of propagation parameters inprecipitation media is of interest to improve the performanceof communications systems and in remote sensing applications.In this paper, we present maximum-likelihood estimators ofspecific attenuation and specific differential phase in rain. Themodel used for obtaining the cited estimators assumes coherentpropagation, reflection symmetry of the medium, and Gaussianstatistics of the scattering matrix measurements. No assumptionsabout the microphysical properties of the medium are needed.The performance of the estimators is evaluated through simulateddata. Results show negligible estimators bias and variances closeto Cramer–Rao bounds.

Department of Agriculture and Land Stewardship Facts FY2007

These Facts sheets have been developed to provide a multitude of information about executive branch agencies/departments on a single sheet of paper. The Facts provides general information, contact information, workforce data, leave & benefits information, and affirmative action data.