An Engineering Study to Update the Iowa Transportation Laws Annotated: HR 324a January 1995

Research project HR-234A was sponsored by the Iowa Highway Research Board and the Iowa Department of Transportation. In the preparation of this compilation of highway and street laws of Iowa, an attempt has been made to include those sections of the Iowa Code Annotated and Iowa Digest to which reference is frequently required by the Department of Transportation, counties, cities and towns in their conduct of highway and street administration, construction and maintenance. This publication is offered with the hope and belief that it will prove to be of value and assistance to those concerned with the problems of establishing, maintaining and administering a highway and street program. Because of the broad scope of highway and street work and the many interrelated provisions of Iowa law, and usable size, some Code provision which are insignificant to the principal subject were omitted out of necessity; others were omitted to avoid repetition. A general index is provided at the end of the text of this volume. Each major topic is divided into subtopics and is accompanied by appropriate Code sections. Specific section numbers as they appear in the Code are in.

Potencial de mercado y estructura espacial de los salarios en las regiones españolas, 1955-1995

En este artículo se examina la relación existente entre los salarios de las regiones españolas y su potencial de mercado en el período 1955-1995. Se prueba la existencia de una estructura espacial de los salarios, en la que los salarios disminuyen al alejarnos de las regiones de renta elevada. Este resultado refuerza la hipótesis de la existencia de una dinámica aglomerativa en España durante la segunda mitad del siglo XX. Sin embargo, el efecto del potencial de mercado sobre los salarios disminuye en la segunda parte del período (1975-1995). Este resultado es consistente con la apertura de una senda de dispersión en la localización de la actividad industrial a partir de mediados de los setenta

Were Spanish migrants attracted by industrial agglomerations?: an analysis for the interwar years in the light of the new economic geography

In this paper we examine whether access to markets had a significant influence onmigration choices of Spanish internal migrants in the inter-war years. We perform astructural contrast of a New Economic Geography model that focus on the forwardlinkage that links workers location choice with the geography of industrial production,one of the centripetal forces that drive agglomeration in the NEG models. The resultshighlight the presence of this forward linkage in the Spanish economy of the inter-warperiod. That is, we prove the existence of a direct relation between workers¿ localizationdecisions and the market potential of the host regions. In addition, the direct estimationof the values associated with key parameters in the NEG model allows us to simulatethe migratory flows derived from different scenarios of the relative size of regions andthe distances between them. We show that in Spain the power of attraction of theagglomerations grew as they increased in size, but the high elasticity estimated for themigration costs reduced the intensity of the migratory flows. This could help to explainthe apparently low intensity of internal migrations in Spain until its upsurge during the1920s. This also explains the geography of migrations in Spain during this period,which hardly affected the regions furthest from the large industrial agglomerations (i.e.,regions such as Andalusia, Estremadura and Castile-La Mancha) but had an intenseeffect on the provinces nearest to the principal centres of industrial development.

Determinacy and Weakly Ramsey sets in Banach spaces

We give a sufficient condition for a set of block subspaces in an infinite-dimensional Banach space to be weakly Ramsey. Using this condition we prove that in the Levy-collapse of a Mahlo cardinal, every projective set is weakly Ramsey. This, together with a construction of W. H. Woodin, is used to show that the Axiom of Projective Determinacy implies that every projective set is weakly Ramsey. In the case of co we prove similar results for a stronger Ramsey property. And for hereditarily indecomposable spaces we show that the Axiom of Determinacy plus the Axiom of Dependent Choices imply that every set is weakly Ramsey. These results are the generalizations to the class of projective sets of some theorems from W. T. Gowers, and our paper "Weakly Ramsey sets in Banach spaces."

Strange nonchaotic attractors in Harper maps

We study the existence of strange nonchaotic attractors (SNA) in the family of Harper maps. We prove that for a set of parameters of positive measure, the map possesses a SNA. However, the set is nowhere dense. By changing the parameter arbitrarily small amounts, the attractor is a smooth curve and not a SNA.

On the configuration of Herman rings of meromorphic functions

We prove some results concerning the possible configuration s of Herman rings for transcendental meromorphic functions. We show that one pole is enough to obtain cycles of Herman rings of arbitrary period a nd give a sufficient condition for a configuration to be realizable.

Equidistribution of Fekete Points on the Sphere

Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polynomial Lagrange interpolation formula. They are well suited points for interpolation formulas and numerical integration. We prove the asymptotic equidistribution of Fekete points in the sphere. The way we proceed is by showing their connection to other arrays of points, the so-called Marcinkiewicz-Zygmund arrays and interpolating arrays, that have been studied recently.

Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

A Note on Shapley's convex measure games

L. S. Shapley, in his paper 'Cores of Convex Games', introduces Convex Measure Games, those that are induced by a convex function on R, acting over a measure on the coalitions. But in a note he states that if this function is a function of several variables, then convexity for the function does not imply convexity of the game or even superadditivity. We prove that if the function is directionally convex, the game is convex, and conversely, any convex game can be induced by a directionally convex function acting over measures on the coalitions, with as many measures as players

Uniform-price assignment markets

Uniform-price assignment games are introduced as those assignment markets with the core reduced to a segment. In these games, for all active agents, competitive prices are uniform although products may be non-homogeneous. A characterization in terms of the assignment matrix is given. The only assignment markets where all submarkets are uniform are the Bohm-Bawerk horse markets. We prove that for uniform-price assignment games the kernel, or set of symmetrically-pairwise bargained allocations, either coincides with the core or reduces to the nucleolus

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game

All assignment games with the same core have the same nucleolus

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of an assignment game coincides with that of its buyer-seller exact representative

Symmetrically multilateral-bargained allocations in multi-sided assignment markets

[cat] Aquest treball tracta d’extendre la noció d’equilibri simètric de negociació bilateral introduït per Rochford (1983) a jocs d’assignació multilateral. Un pagament corresponent a un equilibri simètric de negociación multilateral (SMB) és una imputación del core que garanteix que qualsevol agent es troba en equilibri respecte a un procés de negociación entre tots els agents basat en allò que cadascun d’ells podria rebre -i fer servir com a amenaça- en un ’matching’ òptim diferent al que s’ha format. Es prova que, en el cas de jocs d’assignació multilaterals, el conjunt de SMB és sempre no buit i que, a diferència del cas bilateral, no sempre coincideix amb el kernel (Davis and Maschler, 1965). Finalment, responem una pregunta oberta per Rochford (1982) tot introduïnt un conjunt basat en la idea de kernel, que, conjuntament amb el core, ens permet caracteritzar el conjunt de SMB.

Complements and substitutes in multilateral assignment markets

[cat] En aquest treball provo que, en mercats d’assignació amb més de dos costats, agents de diferents sectors poden no ser complementaris mentre que agents del mateix sector poden no ser substituts. Shapley (1962) va provar que això mai pot succeïr quan el mercat d’assignació només té dos costats. No obstant, demostro que existeixen condicions suficients que garanteixen la substitutabilitat i la complementarietat entre agents en aquests tipus de mercats. A més, provo que, quan els béns al mercat son homogenis, el resultat de Shapley (1962) es manté.

Comparative performance of supertree algorithms in large data sets using the soapberry family (Sapindaceae) as a case study.

For the last 2 decades, supertree reconstruction has been an active field of research and has seen the development of a large number of major algorithms. Because of the growing popularity of the supertree methods, it has become necessary to evaluate the performance of these algorithms to determine which are the best options (especially with regard to the supermatrix approach that is widely used). In this study, seven of the most commonly used supertree methods are investigated by using a large empirical data set (in terms of number of taxa and molecular markers) from the worldwide flowering plant family Sapindaceae. Supertree methods were evaluated using several criteria: similarity of the supertrees with the input trees, similarity between the supertrees and the total evidence tree, level of resolution of the supertree and computational time required by the algorithm. Additional analyses were also conducted on a reduced data set to test if the performance levels were affected by the heuristic searches rather than the algorithms themselves. Based on our results, two main groups of supertree methods were identified: on one hand, the matrix representation with parsimony (MRP), MinFlip, and MinCut methods performed well according to our criteria, whereas the average consensus, split fit, and most similar supertree methods showed a poorer performance or at least did not behave the same way as the total evidence tree. Results for the super distance matrix, that is, the most recent approach tested here, were promising with at least one derived method performing as well as MRP, MinFlip, and MinCut. The output of each method was only slightly improved when applied to the reduced data set, suggesting a correct behavior of the heuristic searches and a relatively low sensitivity of the algorithms to data set sizes and missing data. Results also showed that the MRP analyses could reach a high level of quality even when using a simple heuristic search strategy, with the exception of MRP with Purvis coding scheme and reversible parsimony. The future of supertrees lies in the implementation of a standardized heuristic search for all methods and the increase in computing power to handle large data sets. The latter would prove to be particularly useful for promising approaches such as the maximum quartet fit method that yet requires substantial computing power.