--- _id: '3609' abstract: - lang: eng text: Bombina bombina and B. variegata are two anciently diverged toad taxa that have adapted to different breeding habitats yet hybridize freely in zones of overlap where their parapatric distributions meet. Here, we report on a joint genetic and ecological analysis of a hybrid zone in the vicinity of Stryi in western Ukraine. We used five unlinked allozyme loci, two nuclear single nucleotide polymorphisms and a mitochondrial DNA haplotype as genetic markers. Parallel allele frequency clines with a sharp central step occur across a sharp ecotone, where transitions in aquatic habitat, elevation, and terrestrial vegetation coincide. The width of the hybrid zone, estimated as the inverse of the maximum gradient in allele frequency, is 2.3 km. This is the smallest of four estimates derived from different clinal transects across Europe. We argue that the narrow cline near Stryi is mainly due to a combination of habitat distribution and habitat preference. Adult toads show a preference for either ponds (B. bombina) or puddles (B. variegata), which is known to affect the distribution of genotypes within the hybrid zones. At Stryi, it should cause a reduction of the dispersal rate across the ecotone and thus narrow the cline. A detailed comparison of all five intensively studied Bombina transects lends support to the hypothesis that habitat distribution plus habitat preference can jointly affect the structure of hybrid zones and, ultimately, the resulting barriers to gene flow between differentiated gene pools. This study also represents a resampling of an area that was last studied more than 70 years ago. Our allele-frequency clines largely coincide with those that were described then on the basis of morphological variation. However, we found asymmetrical introgression of B. variegata genes into B. bombina territory along the bank of a river. author: - first_name: Alexey full_name: Yanchukov, Alexey last_name: Yanchukov - first_name: Sebastian full_name: Hofman, Sebastian last_name: Hofman - first_name: Jacek full_name: Szymura, Jacek M last_name: Szymura - first_name: Sergey full_name: Mezhzherin, Sergey V last_name: Mezhzherin - first_name: Sviatoslav full_name: Morozov-Leonov, Sviatoslav last_name: Morozov Leonov - first_name: Nicholas H full_name: Nicholas Barton id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Beate full_name: Nürnberger, Beate last_name: Nürnberger citation: ama: 'Yanchukov A, Hofman S, Szymura J, et al. Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time. Evolution; International Journal of Organic Evolution. 2006;60(3):583-600. doi:10.1111/j.0014-3820.2006.tb01139.x' apa: 'Yanchukov, A., Hofman, S., Szymura, J., Mezhzherin, S., Morozov Leonov, S., Barton, N. H., & Nürnberger, B. (2006). Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time. Evolution; International Journal of Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.0014-3820.2006.tb01139.x' chicago: 'Yanchukov, Alexey, Sebastian Hofman, Jacek Szymura, Sergey Mezhzherin, Sviatoslav Morozov Leonov, Nicholas H Barton, and Beate Nürnberger. “Hybridization of Bombina Bombina and B. Variegata (Anura, Discoglossidae) at a Sharp Ecotone in Western Ukraine: Comparisons across Transects and over Time.” Evolution; International Journal of Organic Evolution. Wiley-Blackwell, 2006. https://doi.org/10.1111/j.0014-3820.2006.tb01139.x.' ieee: 'A. Yanchukov et al., “Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time,” Evolution; International Journal of Organic Evolution, vol. 60, no. 3. Wiley-Blackwell, pp. 583–600, 2006.' ista: 'Yanchukov A, Hofman S, Szymura J, Mezhzherin S, Morozov Leonov S, Barton NH, Nürnberger B. 2006. Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time. Evolution; International Journal of Organic Evolution. 60(3), 583–600.' mla: 'Yanchukov, Alexey, et al. “Hybridization of Bombina Bombina and B. Variegata (Anura, Discoglossidae) at a Sharp Ecotone in Western Ukraine: Comparisons across Transects and over Time.” Evolution; International Journal of Organic Evolution, vol. 60, no. 3, Wiley-Blackwell, 2006, pp. 583–600, doi:10.1111/j.0014-3820.2006.tb01139.x.' short: A. Yanchukov, S. Hofman, J. Szymura, S. Mezhzherin, S. Morozov Leonov, N.H. Barton, B. Nürnberger, Evolution; International Journal of Organic Evolution 60 (2006) 583–600. date_created: 2018-12-11T12:04:13Z date_published: 2006-03-01T00:00:00Z date_updated: 2021-01-12T07:44:38Z day: '01' doi: 10.1111/j.0014-3820.2006.tb01139.x extern: 1 intvolume: ' 60' issue: '3' month: '03' page: 583 - 600 publication: Evolution; International Journal of Organic Evolution publication_status: published publisher: Wiley-Blackwell publist_id: '2774' quality_controlled: 0 status: public title: 'Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time' type: journal_article volume: 60 year: '2006' ... --- _id: '3608' abstract: - lang: eng text: 'We study the evolution of inversions that capture locally adapted alleles when two populations are exchanging migrants or hybridizing. By suppressing recombination between the loci, a new inversion can spread. Neither drift nor coadaptation between the alleles (epistasis) is needed, so this local adaptation mechanism may apply to a broader range of genetic and demographic situations than alternative hypotheses that have been widely discussed. The mechanism can explain many features observed in inversion systems. It will drive an inversion to high frequency if there is no countervailing force, which could explain fixed differences observed between populations and species. An inversion can be stabilized at an intermediate frequency if it also happens to capture one or more deleterious recessive mutations, which could explain polymorphisms that are common in some species. This polymorphism can cycle in frequency with the changing selective advantage of the locally favored alleles. The mechanism can establish underdominant inversions that decrease heterokaryotype fitness by several percent if the cause of fitness loss is structural, while if the cause is genic there is no limit to the strength of underdominance that can result. The mechanism is expected to cause loci responsible for adaptive species-specific differences to map to inversions, as seen in recent QTL studies. We discuss data that support the hypothesis, review other mechanisms for inversion evolution, and suggest possible tests. ' author: - first_name: Mark full_name: Kirkpatrick, Mark last_name: Kirkpatrick - first_name: Nicholas H full_name: Nicholas Barton id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Kirkpatrick M, Barton NH. Chromosome inversions, local adaptation, and speciation. Genetics. 2006;173(1):419-434. doi:10.1534/genetics.105.047985 apa: Kirkpatrick, M., & Barton, N. H. (2006). Chromosome inversions, local adaptation, and speciation. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.105.047985 chicago: Kirkpatrick, Mark, and Nicholas H Barton. “Chromosome Inversions, Local Adaptation, and Speciation.” Genetics. Genetics Society of America, 2006. https://doi.org/10.1534/genetics.105.047985. ieee: M. Kirkpatrick and N. H. Barton, “Chromosome inversions, local adaptation, and speciation,” Genetics, vol. 173, no. 1. Genetics Society of America, pp. 419–434, 2006. ista: Kirkpatrick M, Barton NH. 2006. Chromosome inversions, local adaptation, and speciation. Genetics. 173(1), 419–434. mla: Kirkpatrick, Mark, and Nicholas H. Barton. “Chromosome Inversions, Local Adaptation, and Speciation.” Genetics, vol. 173, no. 1, Genetics Society of America, 2006, pp. 419–34, doi:10.1534/genetics.105.047985. short: M. Kirkpatrick, N.H. Barton, Genetics 173 (2006) 419–434. date_created: 2018-12-11T12:04:13Z date_published: 2006-05-01T00:00:00Z date_updated: 2021-01-12T07:44:37Z day: '01' doi: 10.1534/genetics.105.047985 extern: 1 intvolume: ' 173' issue: '1' month: '05' page: 419 - 434 publication: Genetics publication_status: published publisher: Genetics Society of America publist_id: '2775' quality_controlled: 0 status: public title: Chromosome inversions, local adaptation, and speciation type: journal_article volume: 173 year: '2006' ... --- _id: '3610' abstract: - lang: eng text: For a model of diallelic loci with arbitrary epistasis, Barton and Turelli [2004. Effects of genetic drift on variance components under a general model of epistasis. Evolution 58, 2111–2132] gave results for variances among and within replicate lines obtained by inbreeding without selection. Here, we discuss the relation between their population genetic methods and classical quantitative genetic arguments. In particular, we consider the case of no dominance using classical identity by descent arguments, which generalizes their results from two alleles to multiple alleles. To clarify the connections between the alternative methods, we obtain the same results using an intermediate method, which explicitly identifies the statistical effects of sets of loci. We also discuss the effects of population bottlenecks on covariances among relatives. author: - first_name: William full_name: Hill, William G last_name: Hill - first_name: Nicholas H full_name: Nicholas Barton id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Michael full_name: Turelli, Michael last_name: Turelli citation: ama: Hill W, Barton NH, Turelli M. Prediction of effects of genetic drift on variance components under a general model of epistasis. Theoretical Population Biology. 2006;70(1):56-62. doi:10.1016/j.tpb.2005.10.001 apa: Hill, W., Barton, N. H., & Turelli, M. (2006). Prediction of effects of genetic drift on variance components under a general model of epistasis. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2005.10.001 chicago: Hill, William, Nicholas H Barton, and Michael Turelli. “Prediction of Effects of Genetic Drift on Variance Components under a General Model of Epistasis.” Theoretical Population Biology. Academic Press, 2006. https://doi.org/10.1016/j.tpb.2005.10.001. ieee: W. Hill, N. H. Barton, and M. Turelli, “Prediction of effects of genetic drift on variance components under a general model of epistasis,” Theoretical Population Biology, vol. 70, no. 1. Academic Press, pp. 56–62, 2006. ista: Hill W, Barton NH, Turelli M. 2006. Prediction of effects of genetic drift on variance components under a general model of epistasis. Theoretical Population Biology. 70(1), 56–62. mla: Hill, William, et al. “Prediction of Effects of Genetic Drift on Variance Components under a General Model of Epistasis.” Theoretical Population Biology, vol. 70, no. 1, Academic Press, 2006, pp. 56–62, doi:10.1016/j.tpb.2005.10.001. short: W. Hill, N.H. Barton, M. Turelli, Theoretical Population Biology 70 (2006) 56–62. date_created: 2018-12-11T12:04:14Z date_published: 2006-08-01T00:00:00Z date_updated: 2021-01-12T07:44:39Z day: '01' doi: 10.1016/j.tpb.2005.10.001 extern: 1 intvolume: ' 70' issue: '1' month: '08' page: 56 - 62 publication: Theoretical Population Biology publication_status: published publisher: Academic Press publist_id: '2773' quality_controlled: 0 status: public title: Prediction of effects of genetic drift on variance components under a general model of epistasis type: journal_article volume: 70 year: '2006' ... --- _id: '3679' abstract: - lang: eng text: This paper describes a new system for "Finding Satellite Tracks” in astronomical images based on the modern geometric approach. There is an increasing need of using methods with solid mathematical and statistical foundation in astronomical image processing. Where the computational methods are serving in all disciplines of science, they are becoming popular in the field of astronomy as well. Currently different computational systems are required to be numerically optimized before to get applied on astronomical images. So at present there is no single system which solves the problems of astronomers using computational methods based on modern approaches. The system "Finding Satellite Tracks” is based on geometric matching method "Recognition by Adaptive Subdivision of Transformation Space (RAST)". alternative_title: - LNCS author: - first_name: Haider full_name: Ali,Haider last_name: Ali - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Thomas full_name: Breuel,Thomas M last_name: Breuel citation: ama: 'Ali H, Lampert C, Breuel T. Satellite tracks removal in astronomical images. In: Vol 4225. Springer; 2006:892-901. doi:10.1007/11892755_92' apa: 'Ali, H., Lampert, C., & Breuel, T. (2006). Satellite tracks removal in astronomical images (Vol. 4225, pp. 892–901). Presented at the CIARP: Iberoamerican Congress in Pattern Recognition, Springer. https://doi.org/10.1007/11892755_92' chicago: Ali, Haider, Christoph Lampert, and Thomas Breuel. “Satellite Tracks Removal in Astronomical Images,” 4225:892–901. Springer, 2006. https://doi.org/10.1007/11892755_92. ieee: 'H. Ali, C. Lampert, and T. Breuel, “Satellite tracks removal in astronomical images,” presented at the CIARP: Iberoamerican Congress in Pattern Recognition, 2006, vol. 4225, pp. 892–901.' ista: 'Ali H, Lampert C, Breuel T. 2006. Satellite tracks removal in astronomical images. CIARP: Iberoamerican Congress in Pattern Recognition, LNCS, vol. 4225, 892–901.' mla: Ali, Haider, et al. Satellite Tracks Removal in Astronomical Images. Vol. 4225, Springer, 2006, pp. 892–901, doi:10.1007/11892755_92. short: H. Ali, C. Lampert, T. Breuel, in:, Springer, 2006, pp. 892–901. conference: name: 'CIARP: Iberoamerican Congress in Pattern Recognition' date_created: 2018-12-11T12:04:35Z date_published: 2006-10-31T00:00:00Z date_updated: 2021-01-12T07:45:05Z day: '31' doi: 10.1007/11892755_92 extern: 1 intvolume: ' 4225' main_file_link: - open_access: '0' url: http://pub.ist.ac.at/~chl/papers/ali-ciarp2006.pdf month: '10' page: 892 - 901 publication_status: published publisher: Springer publist_id: '2700' quality_controlled: 0 status: public title: Satellite tracks removal in astronomical images type: conference volume: 4225 year: '2006' ... --- _id: '3677' abstract: - lang: eng text: We propose a video retrieval framework based on a novel combination of spatiograms and the Jensen-Shannon divergence, and validate its performance in two quantitative experiments on TRECVID BBC Rushes data. In the first experiment, color-based methods are tested by grouping redundant shots in an unsupervised clustering. Results of the second experiment show that motion-based spatiograms make a promising fast, compressed-domain descriptor for the detection of interview scenes. alternative_title: - TRECVID Notebook Papers and Slides author: - first_name: Adrian full_name: Ulges, Adrian last_name: Ulges - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Daniel full_name: Keysers,Daniel last_name: Keysers citation: ama: 'Ulges A, Lampert C, Keysers D. Spatiogram-based shot distances for video retrieval. In: NIST (National Institute of Standards and Technology, US Department of Commerce); 2006:1-10.' apa: Ulges, A., Lampert, C., & Keysers, D. (2006). Spatiogram-based shot distances for video retrieval (pp. 1–10). Presented at the TRECVID Workshop, NIST (National Institute of Standards and Technology, US Department of Commerce). chicago: Ulges, Adrian, Christoph Lampert, and Daniel Keysers. “Spatiogram-Based Shot Distances for Video Retrieval,” 1–10. NIST (National Institute of Standards and Technology, US Department of Commerce), 2006. ieee: A. Ulges, C. Lampert, and D. Keysers, “Spatiogram-based shot distances for video retrieval,” presented at the TRECVID Workshop, 2006, pp. 1–10. ista: Ulges A, Lampert C, Keysers D. 2006. Spatiogram-based shot distances for video retrieval. TRECVID Workshop, TRECVID Notebook Papers and Slides, , 1–10. mla: Ulges, Adrian, et al. Spatiogram-Based Shot Distances for Video Retrieval. NIST (National Institute of Standards and Technology, US Department of Commerce), 2006, pp. 1–10. short: A. Ulges, C. Lampert, D. Keysers, in:, NIST (National Institute of Standards and Technology, US Department of Commerce), 2006, pp. 1–10. conference: name: TRECVID Workshop date_created: 2018-12-11T12:04:34Z date_published: 2006-11-14T00:00:00Z date_updated: 2021-01-12T07:45:04Z day: '14' extern: 1 main_file_link: - open_access: '0' url: http://www-nlpir.nist.gov/projects/tvpubs/tv6.papers/dfki.pdf month: '11' page: 1 - 10 publication_status: published publisher: NIST (National Institute of Standards and Technology, US Department of Commerce) publist_id: '2702' quality_controlled: 0 status: public title: Spatiogram-based shot distances for video retrieval type: conference year: '2006' ... --- _id: '3680' abstract: - lang: eng text: The detection of counterfeit in printed documents is currently based mainly on built-in security features or on human expertise. We propose a classification system that supports non-expert users to distinguish original documents from PC-made forgeries by analyzing the printing technique used. Each letter in a document is classified using a support vector machine that has been trained to distinguish laser from inkjet printouts. A color-coded visualization helps the user to interpret the per-letter classification results author: - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Lin full_name: Mei,Lin last_name: Mei - first_name: Thomas full_name: Breuel,Thomas M last_name: Breuel citation: ama: 'Lampert C, Mei L, Breuel T. Printing technique classification for document counterfeit detection. In: Vol 1. IEEE; 2006:639-634. doi:10.1109/ICCIAS.2006.294214' apa: 'Lampert, C., Mei, L., & Breuel, T. (2006). Printing technique classification for document counterfeit detection (Vol. 1, pp. 639–634). Presented at the CIS: Computational Intelligence and Security, IEEE. https://doi.org/10.1109/ICCIAS.2006.294214' chicago: Lampert, Christoph, Lin Mei, and Thomas Breuel. “Printing Technique Classification for Document Counterfeit Detection,” 1:639–634. IEEE, 2006. https://doi.org/10.1109/ICCIAS.2006.294214. ieee: 'C. Lampert, L. Mei, and T. Breuel, “Printing technique classification for document counterfeit detection,” presented at the CIS: Computational Intelligence and Security, 2006, vol. 1, pp. 639–634.' ista: 'Lampert C, Mei L, Breuel T. 2006. Printing technique classification for document counterfeit detection. CIS: Computational Intelligence and Security vol. 1, 639–634.' mla: Lampert, Christoph, et al. Printing Technique Classification for Document Counterfeit Detection. Vol. 1, IEEE, 2006, pp. 639–634, doi:10.1109/ICCIAS.2006.294214. short: C. Lampert, L. Mei, T. Breuel, in:, IEEE, 2006, pp. 639–634. conference: name: 'CIS: Computational Intelligence and Security' date_created: 2018-12-11T12:04:35Z date_published: 2006-11-03T00:00:00Z date_updated: 2021-01-12T07:45:06Z day: '03' doi: 10.1109/ICCIAS.2006.294214 extern: 1 intvolume: ' 1' main_file_link: - open_access: '0' url: http://pub.ist.ac.at/~chl/papers/lampert-cis2006.pdf month: '11' page: 639 - 634 publication_status: published publisher: IEEE publist_id: '2698' quality_controlled: 0 status: public title: Printing technique classification for document counterfeit detection type: conference volume: 1 year: '2006' ... --- _id: '3695' abstract: - lang: eng text: We give an analytical and geometrical treatment of what it means to separate a Gaussian kernel along arbitrary axes in Ropfn, and we present a separation scheme that allows us to efficiently implement anisotropic Gaussian convolution filters for data of arbitrary dimensionality. Based on our previous analysis we show that this scheme is optimal with regard to the number of memory accesses and interpolation operations needed. The proposed method relies on nonorthogonal convolution axes and works completely in image space. Thus, it avoids the need for a fast Fourier transform (FFT)-subroutine. Depending on the accuracy and speed requirements, different interpolation schemes and methods to implement the one-dimensional Gaussian (finite impulse response and infinite impulse response) can be integrated. Special emphasis is put on analyzing the performance and accuracy of the new method. In particular, we show that without any special optimization of the source code, it can perform anisotropic Gaussian filtering faster than methods relying on the FFT. author: - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Oliver full_name: Wirjadi,Oliver last_name: Wirjadi citation: ama: Lampert C, Wirjadi O. An optimal non-orthogonal separation of the anisotropic Gaussian convolution filter. IEEE Transactions on Image Processing (TIP). 2006;15(11):3501-3513. doi: 10.1109/TIP.2006.877501 apa: Lampert, C., & Wirjadi, O. (2006). An optimal non-orthogonal separation of the anisotropic Gaussian convolution filter. IEEE Transactions on Image Processing (TIP). IEEE. https://doi.org/ 10.1109/TIP.2006.877501 chicago: Lampert, Christoph, and Oliver Wirjadi. “An Optimal Non-Orthogonal Separation of the Anisotropic Gaussian Convolution Filter.” IEEE Transactions on Image Processing (TIP). IEEE, 2006. https://doi.org/ 10.1109/TIP.2006.877501 . ieee: C. Lampert and O. Wirjadi, “An optimal non-orthogonal separation of the anisotropic Gaussian convolution filter,” IEEE Transactions on Image Processing (TIP), vol. 15, no. 11. IEEE, pp. 3501–3513, 2006. ista: Lampert C, Wirjadi O. 2006. An optimal non-orthogonal separation of the anisotropic Gaussian convolution filter. IEEE Transactions on Image Processing (TIP). 15(11), 3501–3513. mla: Lampert, Christoph, and Oliver Wirjadi. “An Optimal Non-Orthogonal Separation of the Anisotropic Gaussian Convolution Filter.” IEEE Transactions on Image Processing (TIP), vol. 15, no. 11, IEEE, 2006, pp. 3501–13, doi: 10.1109/TIP.2006.877501 . short: C. Lampert, O. Wirjadi, IEEE Transactions on Image Processing (TIP) 15 (2006) 3501–3513. date_created: 2018-12-11T12:04:40Z date_published: 2006-11-01T00:00:00Z date_updated: 2021-01-12T07:49:01Z day: '01' doi: ' 10.1109/TIP.2006.877501 ' extern: 1 intvolume: ' 15' issue: '11' main_file_link: - open_access: '1' url: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-14003 month: '11' oa: 1 page: 3501 - 3513 publication: IEEE Transactions on Image Processing (TIP) publication_status: published publisher: IEEE publist_id: '2669' quality_controlled: 0 status: public title: An optimal non-orthogonal separation of the anisotropic Gaussian convolution filter type: journal_article volume: 15 year: '2006' ... --- _id: '3693' abstract: - lang: eng text: Gaussian filtering in one, two or three dimensions is among the most commonly needed tasks in signal and image processing. Finite impulse response filters in the time domain with Gaussian masks are easy to implement in either floating or fixed point arithmetic, because Gaussian kernels are strictly positive and bounded. But these implementations are slow for large images or kernels. With the recursive IIR-filters and FFT-based methods, there are at least two alternative methods to perform Gaussian filtering in a faster way, but so far they are only applicable when floating-point hardware is available. In this paper, a fixed-point implementation of recursive Gaussian filtering is discussed and applied to isotropic and anisotropic image filtering by making use of a non-orthogonal separation scheme of the Gaussian filter. author: - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Oliver full_name: Wirjadi,Oliver last_name: Wirjadi citation: ama: 'Lampert C, Wirjadi O. Anisotropic Gaussian filtering using fixed point arithmetic. In: IEEE; 2006:1565-1568. doi:10.1109/ICIP.2006.312606' apa: 'Lampert, C., & Wirjadi, O. (2006). Anisotropic Gaussian filtering using fixed point arithmetic (pp. 1565–1568). Presented at the ICIP: IEEE International Conference on Image Processing, IEEE. https://doi.org/10.1109/ICIP.2006.312606' chicago: Lampert, Christoph, and Oliver Wirjadi. “Anisotropic Gaussian Filtering Using Fixed Point Arithmetic,” 1565–68. IEEE, 2006. https://doi.org/10.1109/ICIP.2006.312606. ieee: 'C. Lampert and O. Wirjadi, “Anisotropic Gaussian filtering using fixed point arithmetic,” presented at the ICIP: IEEE International Conference on Image Processing, 2006, pp. 1565–1568.' ista: 'Lampert C, Wirjadi O. 2006. Anisotropic Gaussian filtering using fixed point arithmetic. ICIP: IEEE International Conference on Image Processing, 1565–1568.' mla: Lampert, Christoph, and Oliver Wirjadi. Anisotropic Gaussian Filtering Using Fixed Point Arithmetic. IEEE, 2006, pp. 1565–68, doi:10.1109/ICIP.2006.312606. short: C. Lampert, O. Wirjadi, in:, IEEE, 2006, pp. 1565–1568. conference: name: 'ICIP: IEEE International Conference on Image Processing' date_created: 2018-12-11T12:04:39Z date_published: 2006-10-08T00:00:00Z date_updated: 2021-01-12T07:49:00Z day: '08' doi: 10.1109/ICIP.2006.312606 extern: 1 month: '10' page: 1565 - 1568 publication_status: published publisher: IEEE publist_id: '2670' quality_controlled: 0 status: public title: Anisotropic Gaussian filtering using fixed point arithmetic type: conference year: '2006' ... --- _id: '3692' author: - first_name: Daniel full_name: Keysers,Daniel last_name: Keysers - first_name: Christoph full_name: Christoph Lampert id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Thomas full_name: Breuel,Thomas M last_name: Breuel citation: ama: 'Keysers D, Lampert C, Breuel T. Color image dequantization by constrained diffusion. In: Vol 6058. SPIE; 2006. doi:10.1117/12.648713' apa: Keysers, D., Lampert, C., & Breuel, T. (2006). Color image dequantization by constrained diffusion (Vol. 6058). Presented at the SPIE Electronic Imaging, SPIE. https://doi.org/10.1117/12.648713 chicago: Keysers, Daniel, Christoph Lampert, and Thomas Breuel. “Color Image Dequantization by Constrained Diffusion,” Vol. 6058. SPIE, 2006. https://doi.org/10.1117/12.648713. ieee: D. Keysers, C. Lampert, and T. Breuel, “Color image dequantization by constrained diffusion,” presented at the SPIE Electronic Imaging, 2006, vol. 6058. ista: Keysers D, Lampert C, Breuel T. 2006. Color image dequantization by constrained diffusion. SPIE Electronic Imaging vol. 6058. mla: Keysers, Daniel, et al. Color Image Dequantization by Constrained Diffusion. Vol. 6058, SPIE, 2006, doi:10.1117/12.648713. short: D. Keysers, C. Lampert, T. Breuel, in:, SPIE, 2006. conference: name: SPIE Electronic Imaging date_created: 2018-12-11T12:04:39Z date_published: 2006-01-15T00:00:00Z date_updated: 2019-05-10T12:19:52Z day: '15' doi: 10.1117/12.648713 extern: 1 intvolume: ' 6058' month: '01' publication_status: published publisher: SPIE publist_id: '2674' quality_controlled: 0 status: public title: Color image dequantization by constrained diffusion type: conference volume: 6058 year: '2006' ... --- _id: '3729' abstract: - lang: eng text: Measuring the visco-elastic properties of biological macromolecules constitutes an important step towards the understanding of dynamic biological processes, such as cell adhesion, muscle function, or plant cell wall stability. Force spectroscopy techniques based on the atomic force microscope (AFM) are increasingly used to study the complex visco-elastic response of (bio-)molecules on a single-molecule level. These experiments either require that the AFM cantilever is actively oscillated or that the molecule is clamped at constant force to monitor thermal cantilever motion. Here we demonstrate that the visco-elasticity of single bio-molecules can readily be extracted from the Brownian cantilever motion during conventional force-extension measurements. It is shown that the characteristics of the cantilever determine the signal-to-noise (S/N) ratio and time resolution. Using a small cantilever, the visco-elastic properties of single dextran molecules were resolved with a time resolution of 8.3 ms. The presented approach can be directly applied to probe the dynamic response of complex bio-molecular systems or proteins in force-extension experiments. author: - first_name: Christian full_name: Bippes, Christian A last_name: Bippes - first_name: Andrew full_name: Humphris, Andrew D last_name: Humphris - first_name: Martin full_name: Stark, Martin last_name: Stark - first_name: Daniel full_name: Mueller, Daniel J last_name: Mueller - first_name: Harald L full_name: Harald Janovjak id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 citation: ama: Bippes C, Humphris A, Stark M, Mueller D, Janovjak HL. Direct measurement of single-molecule visco-elasticity in atomic force microscope force-extension experiments. European Biophysics Journal. 2006;35(3):287-292. doi:10.1007/s00249-005-0023-9 apa: Bippes, C., Humphris, A., Stark, M., Mueller, D., & Janovjak, H. L. (2006). Direct measurement of single-molecule visco-elasticity in atomic force microscope force-extension experiments. European Biophysics Journal. Springer. https://doi.org/10.1007/s00249-005-0023-9 chicago: Bippes, Christian, Andrew Humphris, Martin Stark, Daniel Mueller, and Harald L Janovjak. “Direct Measurement of Single-Molecule Visco-Elasticity in Atomic Force Microscope Force-Extension Experiments.” European Biophysics Journal. Springer, 2006. https://doi.org/10.1007/s00249-005-0023-9. ieee: C. Bippes, A. Humphris, M. Stark, D. Mueller, and H. L. Janovjak, “Direct measurement of single-molecule visco-elasticity in atomic force microscope force-extension experiments,” European Biophysics Journal, vol. 35, no. 3. Springer, pp. 287–292, 2006. ista: Bippes C, Humphris A, Stark M, Mueller D, Janovjak HL. 2006. Direct measurement of single-molecule visco-elasticity in atomic force microscope force-extension experiments. European Biophysics Journal. 35(3), 287–292. mla: Bippes, Christian, et al. “Direct Measurement of Single-Molecule Visco-Elasticity in Atomic Force Microscope Force-Extension Experiments.” European Biophysics Journal, vol. 35, no. 3, Springer, 2006, pp. 287–92, doi:10.1007/s00249-005-0023-9. short: C. Bippes, A. Humphris, M. Stark, D. Mueller, H.L. Janovjak, European Biophysics Journal 35 (2006) 287–292. date_created: 2018-12-11T12:04:51Z date_published: 2006-02-01T00:00:00Z date_updated: 2021-01-12T07:51:46Z day: '01' doi: 10.1007/s00249-005-0023-9 extern: 1 intvolume: ' 35' issue: '3' month: '02' page: 287 - 292 publication: European Biophysics Journal publication_status: published publisher: Springer publist_id: '2500' quality_controlled: 0 status: public title: Direct measurement of single-molecule visco-elasticity in atomic force microscope force-extension experiments type: journal_article volume: 35 year: '2006' ... --- _id: '3728' abstract: - lang: eng text: Mechanical unfolding of single bacteriorhodopsins from a membrane bilayer is studied using molecular dynamics simulations. The initial conformation of the lipid membrane is determined through all-atom simulations and then its coarse-grained representation is used in the studies of stretching. A Go-like model with a realistic contact map and with Lennard–Jones contact interactions is applied to model the protein–membrane system. The model qualitatively reproduces the experimentally observed differences between force-extension patterns obtained on bacteriorhodopsin at different temperatures and predicts a lack of symmetry in the choice of the terminus to pull by. It also illustrates the decisive role of the interactions of the protein with the membrane in determining the force pattern and thus the stability of transmembrane proteins. author: - first_name: Marek full_name: Cieplak, Marek last_name: Cieplak - first_name: Sławomir full_name: Filipek, Sławomir last_name: Filipek - first_name: Harald L full_name: Harald Janovjak id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 - first_name: Krystiana full_name: Krzysko, Krystiana A last_name: Krzysko citation: ama: 'Cieplak M, Filipek S, Janovjak HL, Krzysko K. Pulling single bacteriorhodopsin out of a membrane: Comparison of simulation and experiment. Biochimica et Biophysica Acta (BBA) - Biomembranes. 2006;1758(4):537-544. doi:10.1016/j.bbamem.2006.03.028' apa: 'Cieplak, M., Filipek, S., Janovjak, H. L., & Krzysko, K. (2006). Pulling single bacteriorhodopsin out of a membrane: Comparison of simulation and experiment. Biochimica et Biophysica Acta (BBA) - Biomembranes. Elsevier. https://doi.org/10.1016/j.bbamem.2006.03.028' chicago: 'Cieplak, Marek, Sławomir Filipek, Harald L Janovjak, and Krystiana Krzysko. “Pulling Single Bacteriorhodopsin out of a Membrane: Comparison of Simulation and Experiment.” Biochimica et Biophysica Acta (BBA) - Biomembranes. Elsevier, 2006. https://doi.org/10.1016/j.bbamem.2006.03.028.' ieee: 'M. Cieplak, S. Filipek, H. L. Janovjak, and K. Krzysko, “Pulling single bacteriorhodopsin out of a membrane: Comparison of simulation and experiment,” Biochimica et Biophysica Acta (BBA) - Biomembranes, vol. 1758, no. 4. Elsevier, pp. 537–544, 2006.' ista: 'Cieplak M, Filipek S, Janovjak HL, Krzysko K. 2006. Pulling single bacteriorhodopsin out of a membrane: Comparison of simulation and experiment. Biochimica et Biophysica Acta (BBA) - Biomembranes. 1758(4), 537–544.' mla: 'Cieplak, Marek, et al. “Pulling Single Bacteriorhodopsin out of a Membrane: Comparison of Simulation and Experiment.” Biochimica et Biophysica Acta (BBA) - Biomembranes, vol. 1758, no. 4, Elsevier, 2006, pp. 537–44, doi:10.1016/j.bbamem.2006.03.028.' short: M. Cieplak, S. Filipek, H.L. Janovjak, K. Krzysko, Biochimica et Biophysica Acta (BBA) - Biomembranes 1758 (2006) 537–544. date_created: 2018-12-11T12:04:50Z date_published: 2006-04-01T00:00:00Z date_updated: 2021-01-12T07:51:46Z day: '01' doi: 10.1016/j.bbamem.2006.03.028 extern: 1 intvolume: ' 1758' issue: '4' month: '04' page: 537 - 544 publication: Biochimica et Biophysica Acta (BBA) - Biomembranes publication_status: published publisher: Elsevier publist_id: '2502' quality_controlled: 0 status: public title: 'Pulling single bacteriorhodopsin out of a membrane: Comparison of simulation and experiment' type: journal_article volume: 1758 year: '2006' ... --- _id: '3722' author: - first_name: Harald L full_name: Harald Janovjak id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 - first_name: Daniel full_name: Mueller, Daniel J last_name: Mueller citation: ama: 'Janovjak HL, Mueller D. Rastersondenmikroskopie. In: Bioanalytik. Spektrum Akademischer Verlag; 2006.' apa: Janovjak, H. L., & Mueller, D. (2006). Rastersondenmikroskopie. In Bioanalytik. Spektrum Akademischer Verlag. chicago: Janovjak, Harald L, and Daniel Mueller. “Rastersondenmikroskopie.” In Bioanalytik. Spektrum Akademischer Verlag, 2006. ieee: H. L. Janovjak and D. Mueller, “Rastersondenmikroskopie,” in Bioanalytik, Spektrum Akademischer Verlag, 2006. ista: 'Janovjak HL, Mueller D. 2006.Rastersondenmikroskopie. In: Bioanalytik. .' mla: Janovjak, Harald L., and Daniel Mueller. “Rastersondenmikroskopie.” Bioanalytik, Spektrum Akademischer Verlag, 2006. short: H.L. Janovjak, D. Mueller, in:, Bioanalytik, Spektrum Akademischer Verlag, 2006. date_created: 2018-12-11T12:04:48Z date_published: 2006-06-16T00:00:00Z date_updated: 2021-01-12T07:51:44Z day: '16' extern: 1 month: '06' publication: Bioanalytik publication_status: published publisher: Spektrum Akademischer Verlag publist_id: '2508' quality_controlled: 0 status: public title: Rastersondenmikroskopie type: book_chapter year: '2006' ... --- _id: '3755' abstract: - lang: eng text: A primitive example of adaptation in gene expression is the balance between the rate of synthesis and degradation of cellular RNA, which allows rapid responses to environmental signals. Here, we investigate how multidrug efflux pump systems mediate the dynamics of a simple drug-inducible system in response to a steady level of inducer. Using fluorescence correlation spectroscopy, we measured in real time within a single bacterium the transcription activity at the RNA level of the acrAB-TolC multidrug efflux pump system. When cells are exposed to constant level of anhydrotetracycline inducer and are adsorbed onto a poly-L-lysine-coated surface, we found that the acrAB-TolC promoter is steadily active. We also monitored the activity of the tet promoter to characterize the effect of this efflux system on the dynamics of drug-inducible transcription. We found that the transcriptional response of the tet promoter to a steady level of aTc rises and then falls back to its preinduction level. The rate of RNA degradation was constant throughout the transcriptional pulse, indicating that the modulation of intracellular inducer concentration alone can produce this pulsating response. Single-cell experiments together with numerical simulations suggest that such pulsating response in drug-inducible genetic systems is a property emerging from the dependence of drug-inducible transcription on multidrug efflux systems. author: - first_name: Thuc full_name: Le,Thuc T. last_name: Le - first_name: Thierry full_name: Emonet,Thierry last_name: Emonet - first_name: Sébastien full_name: Harlepp, Sébastien last_name: Harlepp - first_name: Calin C full_name: Calin Guet id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Philippe full_name: Cluzel,Philippe last_name: Cluzel citation: ama: Le T, Emonet T, Harlepp S, Guet CC, Cluzel P. Dynamical determinants of drug-inducible gene expression in a single bacterium. Biophysical Journal. 2006;90(9):3315-3321. doi:10.1529/biophysj.105.073353 apa: Le, T., Emonet, T., Harlepp, S., Guet, C. C., & Cluzel, P. (2006). Dynamical determinants of drug-inducible gene expression in a single bacterium. Biophysical Journal. Biophysical Society. https://doi.org/10.1529/biophysj.105.073353 chicago: Le, Thuc, Thierry Emonet, Sébastien Harlepp, Calin C Guet, and Philippe Cluzel. “Dynamical Determinants of Drug-Inducible Gene Expression in a Single Bacterium.” Biophysical Journal. Biophysical Society, 2006. https://doi.org/10.1529/biophysj.105.073353. ieee: T. Le, T. Emonet, S. Harlepp, C. C. Guet, and P. Cluzel, “Dynamical determinants of drug-inducible gene expression in a single bacterium,” Biophysical Journal, vol. 90, no. 9. Biophysical Society, pp. 3315–3321, 2006. ista: Le T, Emonet T, Harlepp S, Guet CC, Cluzel P. 2006. Dynamical determinants of drug-inducible gene expression in a single bacterium. Biophysical Journal. 90(9), 3315–3321. mla: Le, Thuc, et al. “Dynamical Determinants of Drug-Inducible Gene Expression in a Single Bacterium.” Biophysical Journal, vol. 90, no. 9, Biophysical Society, 2006, pp. 3315–21, doi:10.1529/biophysj.105.073353. short: T. Le, T. Emonet, S. Harlepp, C.C. Guet, P. Cluzel, Biophysical Journal 90 (2006) 3315–3321. date_created: 2018-12-11T12:04:59Z date_published: 2006-01-01T00:00:00Z date_updated: 2021-01-12T07:51:58Z day: '01' doi: 10.1529/biophysj.105.073353 extern: 1 intvolume: ' 90' issue: '9' main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1432126/ month: '01' oa: 1 page: 3315 - 3321 publication: Biophysical Journal publication_status: published publisher: Biophysical Society publist_id: '2472' quality_controlled: 0 status: public title: Dynamical determinants of drug-inducible gene expression in a single bacterium type: journal_article volume: 90 year: '2006' ... --- _id: '3758' abstract: - lang: eng text: Control of physical simulation has become a popular topic in the field of computer graphics. Keyframe control has been applied to simulations of rigid bodies, smoke, liquid, flocks, and finite element-based elastic bodies. In this paper, we create a framework for controlling systems of interacting particles -- paying special attention to simulations of cloth and flocking behavior. We introduce a novel integrator-swapping approximation in order to apply the adjoint method to linearized implicit schemes appropriate for cloth simulation. This allows the control of cloth while avoiding computationally infeasible derivative calculations. Meanwhile, flocking control using the adjoint method is significantly more efficient than currently-used methods for constraining group behaviors, allowing the controlled simulation of greater numbers of agents in fewer optimization iterations. article_processing_charge: No author: - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Peter full_name: Mucha, Peter last_name: Mucha - first_name: Greg full_name: Turk, Greg last_name: Turk citation: ama: 'Wojtan C, Mucha P, Turk G. Keyframe control of complex particle systems using the adjoint method. In: ACM; 2006:15-23.' apa: 'Wojtan, C., Mucha, P., & Turk, G. (2006). Keyframe control of complex particle systems using the adjoint method (pp. 15–23). Presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, ACM.' chicago: Wojtan, Chris, Peter Mucha, and Greg Turk. “Keyframe Control of Complex Particle Systems Using the Adjoint Method,” 15–23. ACM, 2006. ieee: 'C. Wojtan, P. Mucha, and G. Turk, “Keyframe control of complex particle systems using the adjoint method,” presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 2006, pp. 15–23.' ista: 'Wojtan C, Mucha P, Turk G. 2006. Keyframe control of complex particle systems using the adjoint method. SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 15–23.' mla: Wojtan, Chris, et al. Keyframe Control of Complex Particle Systems Using the Adjoint Method. ACM, 2006, pp. 15–23. short: C. Wojtan, P. Mucha, G. Turk, in:, ACM, 2006, pp. 15–23. conference: name: 'SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation' date_created: 2018-12-11T12:05:00Z date_published: 2006-09-01T00:00:00Z date_updated: 2023-02-23T11:41:22Z day: '01' extern: '1' language: - iso: eng main_file_link: - url: http://www.amath.unc.edu/Faculty/mucha/Reprints/SCAclothcontrolpreprint.pdf month: '09' oa_version: None page: 15 - 23 publication_status: published publisher: ACM publist_id: '2469' status: public title: Keyframe control of complex particle systems using the adjoint method type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2006' ... --- _id: '3818' abstract: - lang: eng text: Rigorous analysis of synaptic transmission in the central nervous system requires access to presynaptic terminals. However, cortical terminals have been largely inaccessible to presynaptic patch-clamp recording, due to their small size. Using improved patch-clamp techniques in brain slices, we recorded from mossy fiber terminals in the CA3 region of the hippocampus, which have a diameter of 2-5 microm. The major steps of improvement were the enhanced visibility provided by high-numerical aperture objectives and infrared illumination, the development of vibratomes with minimal vertical blade vibrations and the use of sucrose-based solutions for storage and cutting. Based on these improvements, we describe a protocol that allows us to routinely record from hippocampal mossy fiber boutons. Presynaptic recordings can be obtained in slices from both rats and mice. Presynaptic recordings can be also obtained in slices from transgenic mice in which terminals are labeled with enhanced green fluorescent protein. author: - first_name: Josef full_name: Bischofberger, Josef last_name: Bischofberger - first_name: Dominique full_name: Engel, Dominique last_name: Engel - first_name: Liyi full_name: Li, Liyi last_name: Li - first_name: Jörg full_name: Geiger, Jörg R last_name: Geiger - first_name: Peter M full_name: Peter Jonas id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: Bischofberger J, Engel D, Li L, Geiger J, Jonas PM. Patch-clamp recording from mossy fiber terminals in hippocampal slices. Nature Protocols. 2006;1(4):2075-2081. doi:10.1038/nprot.2006.312 apa: Bischofberger, J., Engel, D., Li, L., Geiger, J., & Jonas, P. M. (2006). Patch-clamp recording from mossy fiber terminals in hippocampal slices. Nature Protocols. Nature Publishing Group. https://doi.org/10.1038/nprot.2006.312 chicago: Bischofberger, Josef, Dominique Engel, Liyi Li, Jörg Geiger, and Peter M Jonas. “Patch-Clamp Recording from Mossy Fiber Terminals in Hippocampal Slices.” Nature Protocols. Nature Publishing Group, 2006. https://doi.org/10.1038/nprot.2006.312 . ieee: J. Bischofberger, D. Engel, L. Li, J. Geiger, and P. M. Jonas, “Patch-clamp recording from mossy fiber terminals in hippocampal slices,” Nature Protocols, vol. 1, no. 4. Nature Publishing Group, pp. 2075–81, 2006. ista: Bischofberger J, Engel D, Li L, Geiger J, Jonas PM. 2006. Patch-clamp recording from mossy fiber terminals in hippocampal slices. Nature Protocols. 1(4), 2075–81. mla: Bischofberger, Josef, et al. “Patch-Clamp Recording from Mossy Fiber Terminals in Hippocampal Slices.” Nature Protocols, vol. 1, no. 4, Nature Publishing Group, 2006, pp. 2075–81, doi:10.1038/nprot.2006.312 . short: J. Bischofberger, D. Engel, L. Li, J. Geiger, P.M. Jonas, Nature Protocols 1 (2006) 2075–81. date_created: 2018-12-11T12:05:20Z date_published: 2006-01-01T00:00:00Z date_updated: 2021-01-12T07:52:25Z day: '01' doi: '10.1038/nprot.2006.312 ' extern: 1 intvolume: ' 1' issue: '4' month: '01' page: 2075 - 81 publication: Nature Protocols publication_status: published publisher: Nature Publishing Group publist_id: '2392' quality_controlled: 0 status: public title: Patch-clamp recording from mossy fiber terminals in hippocampal slices type: journal_article volume: 1 year: '2006' ... --- _id: '3890' abstract: - lang: eng text: We consider two-player infinite games played on graphs. The games are concurrent, in that at each state the players choose their moves simultaneously and independently, and stochastic, in that the moves determine a probability distribution for the successor state. The value of a game is the maximal probability with which a player can guarantee the satisfaction of her objective. We show that the values of concurrent games with w-regular objectives expressed as parity conditions can be decided in NP boolean AND coNP. This result substantially improves the best known previous bound of 3EXPTIME. It also shows that the full class of concurrent parity games is no harder than the special case of turn-based stochastic reachability games, for which NP boolean AND coNP is the best known bound. While the previous, more restricted NP boolean AND coNP results for graph games relied on the existence of particularly simple (pure memoryless) optimal strategies, in concurrent games with parity objectives optimal strategies may not exist, and epsilon-optimal strategies (which achieve the value of the game within a parameter epsilon > 0) require in general both randomization and infinite memory. Hence our proof must rely on a more detailed analysis of strategies and, in addition to the main result, yields two results that are interesting on their own. First, we show that there exist epsilon-optimal strategies that in the limit coincide with memoryless strategies; this parallels the celebrated result of Mertens-Neyman for concurrent games with limit-average objectives. Second, we complete the characterization of the memory requirements for epsilon-optimal strategies for concurrent games with parity conditions, by showing that memoryless strategies suffice for epsilon-optimality for coBachi conditions. acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and the NSF ITR grant CCR-0225610. author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Luca full_name: de Alfaro, Luca last_name: De Alfaro - first_name: Thomas A full_name: Thomas Henzinger id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: 'Chatterjee K, De Alfaro L, Henzinger TA. The complexity of quantitative concurrent parity games. In: SIAM; 2006:678-687. doi:10.1145/1109557.1109631' apa: 'Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). The complexity of quantitative concurrent parity games (pp. 678–687). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1145/1109557.1109631' chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Quantitative Concurrent Parity Games,” 678–87. SIAM, 2006. https://doi.org/10.1145/1109557.1109631. ieee: 'K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of quantitative concurrent parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2006, pp. 678–687.' ista: 'Chatterjee K, De Alfaro L, Henzinger TA. 2006. The complexity of quantitative concurrent parity games. SODA: Symposium on Discrete Algorithms, 678–687.' mla: Chatterjee, Krishnendu, et al. The Complexity of Quantitative Concurrent Parity Games. SIAM, 2006, pp. 678–87, doi:10.1145/1109557.1109631. short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2006, pp. 678–687. conference: name: 'SODA: Symposium on Discrete Algorithms' date_created: 2018-12-11T12:05:43Z date_published: 2006-01-01T00:00:00Z date_updated: 2021-01-12T07:52:59Z day: '01' doi: 10.1145/1109557.1109631 extern: 1 month: '01' page: 678 - 687 publication_status: published publisher: SIAM publist_id: '2273' quality_controlled: 0 status: public title: The complexity of quantitative concurrent parity games type: conference year: '2006' ... --- _id: '3889' abstract: - lang: eng text: We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective. The fixed point is computed in the lattice of antichains of state sets. This algorithm has the advantages of being directed by the objective and of avoiding an explicit subset construction on the game graph. Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buchi objective. This set is of interest because in the absence of perfect information, randomized strategies are more powerful than deterministic ones. We show that our algorithms are optimal by proving matching lower bounds. acknowledgement: This research was supported in part by the NSF grants CCR-0225610 and CCR-0234690, by the SNSF under the Indo-Swiss Joint Research Programme, and by the FRFC project “Centre Fédéré en Vérification” funded by the FNRS under grant 2.4530.02. alternative_title: - LNCS author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Thomas A full_name: Thomas Henzinger id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jean full_name: Raskin, Jean-François last_name: Raskin citation: ama: 'Chatterjee K, Doyen L, Henzinger TA, Raskin J. Algorithms for omega-regular games with imperfect information. In: Vol 4207. Springer; 2006:287-302. doi:10.1007/11874683_19' apa: 'Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2006). Algorithms for omega-regular games with imperfect information (Vol. 4207, pp. 287–302). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_19' chicago: Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information,” 4207:287–302. Springer, 2006. https://doi.org/10.1007/11874683_19. ieee: 'K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 287–302.' ista: 'Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2006. Algorithms for omega-regular games with imperfect information. CSL: Computer Science Logic, LNCS, vol. 4207, 287–302.' mla: Chatterjee, Krishnendu, et al. Algorithms for Omega-Regular Games with Imperfect Information. Vol. 4207, Springer, 2006, pp. 287–302, doi:10.1007/11874683_19. short: K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 287–302. conference: name: 'CSL: Computer Science Logic' date_created: 2018-12-11T12:05:43Z date_published: 2006-11-13T00:00:00Z date_updated: 2021-01-12T07:52:59Z day: '13' doi: 10.1007/11874683_19 extern: 1 intvolume: ' 4207' month: '11' page: 287 - 302 publication_status: published publisher: Springer publist_id: '2276' quality_controlled: 0 status: public title: Algorithms for omega-regular games with imperfect information type: conference volume: 4207 year: '2006' ... --- _id: '3891' abstract: - lang: eng text: 'We study infinite stochastic games played by two-players over a finite state space, with objectives specified by sets of infinite traces. The games are concurrent (players make moves simultaneously and independently), stochastic (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and infinite (proceeds for infinite number of rounds). The analysis of concurrent stochastic games can be classified into: quantitative analysis, analyzing the optimum value of the game; and qualitative analysis, analyzing the set of states with optimum value 1. We consider concurrent games with tail objectives, i.e., objectives that are independent of the finite-prefix of traces, and show that the class of tail objectives are strictly richer than the omega-regular objectives. We develop new proof techniques to extend several properties of concurrent games with omega-regular objectives to concurrent games with tail objectives. We prove the positive limit-one property for tail objectives, that states for all concurrent games if the optimum value for a player is positive for a tail objective Phi at some state, then there is a state where the optimum value is 1 for Phi, for the player. We also show that the optimum values of zero-sum (strictly conflicting objectives) games with tail objectives can be related to equilibrium values of nonzero-sum (not strictly conflicting objectives) games with simpler reachability objectives. A consequence of our analysis presents a polynomial time reduction of the quantitative analysis of tail objectives to the qualitative analysis for the sub-class of one-player stochastic games (Markov decision processes).' alternative_title: - 'LNCS ' author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Chatterjee K. Concurrent games with tail objectives. In: Vol 4207. Springer; 2006:256-270. doi:10.1007/11874683_17' apa: 'Chatterjee, K. (2006). Concurrent games with tail objectives (Vol. 4207, pp. 256–270). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_17' chicago: Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives,” 4207:256–70. Springer, 2006. https://doi.org/10.1007/11874683_17. ieee: 'K. Chatterjee, “Concurrent games with tail objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 256–270.' ista: 'Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 256–270.' mla: Chatterjee, Krishnendu. Concurrent Games with Tail Objectives. Vol. 4207, Springer, 2006, pp. 256–70, doi:10.1007/11874683_17. short: K. Chatterjee, in:, Springer, 2006, pp. 256–270. conference: name: 'CSL: Computer Science Logic' date_created: 2018-12-11T12:05:44Z date_published: 2006-09-28T00:00:00Z date_updated: 2021-01-12T07:53:00Z day: '28' doi: 10.1007/11874683_17 extern: 1 intvolume: ' 4207' month: '09' page: 256 - 270 publication_status: published publisher: Springer publist_id: '2272' quality_controlled: 0 status: public title: Concurrent games with tail objectives type: conference volume: 4207 year: '2006' ... --- _id: '3888' abstract: - lang: eng text: A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with omega-regular winning conditions specified as Rabin or Streett objectives. These games are NP-complete and coNP-complete, respectively. The value of the game for a player at a state s given an objective Phi is the maximal probability with which the player can guarantee the satisfaction of Phi from s. We present a strategy-improvement algorithm to compute values in stochastic Rabin games, where an improvement step involves solving Markov decision processes (MDPs) and nonstochastic Rabin games. The algorithm also computes values for stochastic Streett games but does not directly yield an optimal strategy for Streett objectives. We then show how to obtain an optimal strategy for Streett objectives by solving certain nonstochastic Streett games. acknowledgement: This research was supported in part by the NSF grants CCR-0225610 and CCR-0234690, and by the SNSF under the Indo-Swiss Joint Research Programme. alternative_title: - LNCS author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Thomas Henzinger id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: 'Chatterjee K, Henzinger TA. Strategy improvement for stochastic Rabin and Streett games. In: Vol 4137. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2006:375-389. doi:10.1007/11817949_25' apa: 'Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement for stochastic Rabin and Streett games (Vol. 4137, pp. 375–389). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11817949_25' chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement for Stochastic Rabin and Streett Games,” 4137:375–89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006. https://doi.org/10.1007/11817949_25. ieee: 'K. Chatterjee and T. A. Henzinger, “Strategy improvement for stochastic Rabin and Streett games,” presented at the CONCUR: Concurrency Theory, 2006, vol. 4137, pp. 375–389.' ista: 'Chatterjee K, Henzinger TA. 2006. Strategy improvement for stochastic Rabin and Streett games. CONCUR: Concurrency Theory, LNCS, vol. 4137, 375–389.' mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. Strategy Improvement for Stochastic Rabin and Streett Games. Vol. 4137, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006, pp. 375–89, doi:10.1007/11817949_25. short: K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006, pp. 375–389. conference: name: 'CONCUR: Concurrency Theory' date_created: 2018-12-11T12:05:43Z date_published: 2006-08-10T00:00:00Z date_updated: 2021-01-12T07:52:58Z day: '10' doi: 10.1007/11817949_25 extern: 1 intvolume: ' 4137' month: '08' page: 375 - 389 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '2278' quality_controlled: 0 status: public title: Strategy improvement for stochastic Rabin and Streett games type: conference volume: 4137 year: '2006' ... --- _id: '3908' abstract: - lang: eng text: 'It is commonly believed that both the average length and the frequency of microsatellites correlate with genome size. We have estimated the frequency and the average length for 69 perfect dinucleotide microsatellites in an insect with an exceptionally large genome: Chorthippus biguttulus (Orthoptera, Acrididae). Dinucleotide microsatellites are not more frequent in C. biguttulus, but repeat arrays are 1.4 to 2 times longer than in other insect species. The average repeat number in C. biguttulus lies in the range of higher vertebrates. Natural populations are highly variable. At least 30 alleles per locus were found and the expected heterozygosity is above 0.95 at all three loci studied. In contrast, the observed heterozygosity is much lower (≤0.51), which could be caused by long null alleles.' author: - first_name: Jana full_name: Ustinova, Jana last_name: Ustinova - first_name: Roland full_name: Achmann, Roland last_name: Achmann - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 - first_name: Frieder full_name: Mayer, Frieder last_name: Mayer citation: ama: 'Ustinova J, Achmann R, Cremer S, Mayer F. Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus. Journal of Molecular Evolution. 2006;62(2):158-167. doi:10.1007/s00239-005-0022-6' apa: 'Ustinova, J., Achmann, R., Cremer, S., & Mayer, F. (2006). Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus. Journal of Molecular Evolution. Springer. https://doi.org/10.1007/s00239-005-0022-6' chicago: 'Ustinova, Jana, Roland Achmann, Sylvia Cremer, and Frieder Mayer. “Long Repeats in a Huge Gemome: Microsatellite Loci in the Grasshopper Chorthippus Biguttulus.” Journal of Molecular Evolution. Springer, 2006. https://doi.org/10.1007/s00239-005-0022-6.' ieee: 'J. Ustinova, R. Achmann, S. Cremer, and F. Mayer, “Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus,” Journal of Molecular Evolution, vol. 62, no. 2. Springer, pp. 158–167, 2006.' ista: 'Ustinova J, Achmann R, Cremer S, Mayer F. 2006. Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus. Journal of Molecular Evolution. 62(2), 158–167.' mla: 'Ustinova, Jana, et al. “Long Repeats in a Huge Gemome: Microsatellite Loci in the Grasshopper Chorthippus Biguttulus.” Journal of Molecular Evolution, vol. 62, no. 2, Springer, 2006, pp. 158–67, doi:10.1007/s00239-005-0022-6.' short: J. Ustinova, R. Achmann, S. Cremer, F. Mayer, Journal of Molecular Evolution 62 (2006) 158–167. date_created: 2018-12-11T12:05:49Z date_published: 2006-02-01T00:00:00Z date_updated: 2021-01-12T07:53:07Z day: '01' doi: 10.1007/s00239-005-0022-6 extern: '1' intvolume: ' 62' issue: '2' language: - iso: eng month: '02' oa_version: None page: 158 - 167 publication: Journal of Molecular Evolution publication_status: published publisher: Springer publist_id: '2242' status: public title: 'Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 62 year: '2006' ...