First-generation linkage map for the European tree frog (Hyla arborea) with utility in congeneric species.

BACKGROUND: Western Palearctic tree frogs (Hyla arborea group) represent a strong potential for evolutionary and conservation genetic research, so far underexploited due to limited molecular resources. New microsatellite markers have recently been developed for Hyla arborea, with high cross-species utility across the entire circum-Mediterranean radiation. Here we conduct sibship analyses to map available markers for use in future population genetic applications. FINDINGS: We characterized eight linkage groups, including one sex-linked, all showing drastically reduced recombination in males compared to females, as previously documented in this species. Mapping of the new 15 markers to the ~200 My diverged Xenopus tropicalis genome suggests a generally conserved synteny with only one confirmed major chromosome rearrangement. CONCLUSIONS: The new microsatellites are representative of several chromosomes of H. arborea that are likely to be conserved across closely-related species. Our linkage map provides an important resource for genetic research in European Hylids, notably for studies of speciation, genome evolution and conservation.

The set of undominated imputations and the core: an axiomatic approach

This paper provides an axiomatic framework to compare the D-core (the set of undominatedimputations) and the core of a cooperative game with transferable utility. Theorem1 states that the D-core is the only solution satisfying projection consistency, reasonableness (from above), (*)-antimonotonicity, and modularity. Theorem 2 characterizes the core replacing (*)-antimonotonicity by antimonotonicity. Moreover, these axioms alsocharacterize the core on the domain of convex games, totally balanced games, balancedgames, and superadditive games

Optimal generalized quantum measurements for arbitrary spin systems

Positive-operator-valued measurements on a finite number of N identically prepared systems of arbitrary spin J are discussed. Pure states are characterized in terms of Bloch-like vectors restricted by a SU(2J+1) covariant constraint. This representation allows for a simple description of the equations to be fulfilled by optimal measurements. We explicitly find the minimal positive-operator-valued measurement for the N=2 case, a rigorous bound for N=3, and set up the analysis for arbitrary N.

Gauge transformations in the Lagrangian and Hamilton formalisms of generally covariant theories

We study spacetime diffeomorphisms in the Hamiltonian and Lagrangian formalisms of generally covariant systems. We show that the gauge group for such a system is characterized by having generators which are projectable under the Legendre map. The gauge group is found to be much larger than the original group of spacetime diffeomorphisms, since its generators must depend on the lapse function and shift vector of the spacetime metric in a given coordinate patch. Our results are generalizations of earlier results by Salisbury and Sundermeyer. They arise in a natural way from using the requirement of equivalence between Lagrangian and Hamiltonian formulations of the system, and they are new in that the symmetries are realized on the full set of phase space variables. The generators are displayed explicitly and are applied to the relativistic string and to general relativity.

State of Iowa Transportation Map, 2011

This document is the State Map of Iowa, both front and back of the year in the title. All maps were are in pdf format and can be used as a historical reference.

Vehicle Traffic Map, 2010

Vehicle Traffic Map produced by the Iowa Department of Transportation.

Truck Traffic Map, 2010

Vehicle Traffic Map produced by the Iowa Department of Transportation.

Iowa State Railroad Map, July 1, 2010

Iowa railroad map of Iowa trains.

2009 Iowa Transportation Map for Bicyclists, 2009

This online Adobe Portable Document Format (PDF) version of the 2009 Iowa Transportation Map for Bicyclists was developed using the same electronic files that were used to create the widely distributed paper version of the map. The files have been translated to allow access for the viewing customers while still maintaining the detail necessary to display the map content. The PDF conversion utility from Adobe compressed the 75MB main map image file down to a 4.2MB file. This 4.2MB file may still take time to download so please be patient. We believe the end result is well worth the wait. The city detail maps are much smaller and will download more quickly.

Interstate Highway Map Indicating Vertical Clearance, May 15, 2011

The State of Iowa [STATE] and the Iowa Department of Transportation [IDOT] hereby is claim any warranty of any kind, express or implied, in reference to the information contained herein. The STATE and the IDOT neither assume nor authorize any person to assume for the STATE or the IDOT any liability in connection with the information contained herein, and there are no oral agreements or warranties regarding the information contained herein. Each and every person is hereby notified that the vertical clearances specified herein are subject to change due to resurfacing, surface buckling, weather conditions, or any other event. It is the responsibility of each and every vehicle operator to ascertain whether sufficient ACTUAL vertical clearance exists to move his vehicle or motor vehicle between the roadway and the underpasses and bridges listed herein. The May 15 date on this map reflects the end of the update schedule for the previous calendar year. Any vertical clearance restrictions which could or may change AFTER this date will not be reflected on this map. For the latest information on vertical clearance restrictions call the Office of Motor Carrier Services in Ankeny, (515) 237-3264 or visit http://www.iowadot.gov/mvd/omcs.

Exporting Contours to DICOM-RT Structure Set

This paper presents an ITK implementation for exportingthe contours of the automated segmentation results toDICOM-RT Structure Set format. The âeurooeradiotherapystructure setâeuro (RTSTRUCT) object of the DICOM standard isused for the transfer of patient structures and relateddata, between the devices found within and outside theradiotherapy department. It mainly contains theinformation of regions of interest (ROIs) and points ofinterest (E.g. dose reference points). In many cases,rather than manually drawing these ROIs on the CT images,one can indeed benefit from the automated segmentationalgorithms already implemented in ITK. But at present, itis not possible to export the ROIs obtained from ITK toRTSTRUCT format. In order to bridge this gap, we havedeveloped a framework for exporting contour data toRTSTRUCT. We provide here the complete implementation ofRTSTRUCT exporter and present the details of the pipelineused. Results on a 3-D CT image of the Head and Neck(H&N) region are presented.

An appropriate data set size for digital soil mapping in Erechim, Rio Grande do Sul, Brazil

Digital information generates the possibility of a high degree of redundancy in the data available for fitting predictive models used for Digital Soil Mapping (DSM). Among these models, the Decision Tree (DT) technique has been increasingly applied due to its capacity of dealing with large datasets. The purpose of this study was to evaluate the impact of the data volume used to generate the DT models on the quality of soil maps. An area of 889.33 km² was chosen in the Northern region of the State of Rio Grande do Sul. The soil-landscape relationship was obtained from reambulation of the studied area and the alignment of the units in the 1:50,000 scale topographic mapping. Six predictive covariates linked to the factors soil formation, relief and organisms, together with data sets of 1, 3, 5, 10, 15, 20 and 25 % of the total data volume, were used to generate the predictive DT models in the data mining program Waikato Environment for Knowledge Analysis (WEKA). In this study, sample densities below 5 % resulted in models with lower power of capturing the complexity of the spatial distribution of the soil in the study area. The relation between the data volume to be handled and the predictive capacity of the models was best for samples between 5 and 15 %. For the models based on these sample densities, the collected field data indicated an accuracy of predictive mapping close to 70 %.

A linkage map of spring turnip rape based on RFLP and RAPD markers

Selostus: RAPD- ja RFLP-markkereista koostuva rypsin kytkentäkartta

Computational problems in perfect phylogeny haplotyping: typing without calling the allele.

A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics, and is a variant of the perfect phylogeny haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is "full" genotypes, here we assume less informative input, and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time, by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by that tree they map onto, and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes, and present a linear algorithm for identifying those genotypes.