[{"month":"03","day":"01","date_published":"2006-03-01T00:00:00Z","doi":"10.1111/j.0014-3820.2006.tb01139.x","quality_controlled":0,"page":"583 - 600","publication":"Evolution; International Journal of Organic Evolution","citation":{"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.","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","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.","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","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.","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."},"extern":1,"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."}],"publist_id":"2774","issue":"3","type":"journal_article","date_created":"2018-12-11T12:04:13Z","date_updated":"2021-01-12T07:44:38Z","volume":60,"author":[{"full_name":"Yanchukov, Alexey","last_name":"Yanchukov","first_name":"Alexey"},{"full_name":"Hofman, Sebastian","first_name":"Sebastian","last_name":"Hofman"},{"full_name":"Szymura, Jacek M","last_name":"Szymura","first_name":"Jacek"},{"last_name":"Mezhzherin","first_name":"Sergey","full_name":"Mezhzherin, Sergey V"},{"last_name":"Morozov Leonov","first_name":"Sviatoslav","full_name":"Morozov-Leonov, Sviatoslav"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Nicholas Barton"},{"first_name":"Beate","last_name":"Nürnberger","full_name":"Nürnberger, Beate"}],"title":"Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time","publication_status":"published","status":"public","intvolume":" 60","publisher":"Wiley-Blackwell","_id":"3609","year":"2006"},{"date_created":"2018-12-11T12:04:13Z","date_updated":"2021-01-12T07:44:37Z","volume":173,"author":[{"full_name":"Kirkpatrick, Mark","first_name":"Mark","last_name":"Kirkpatrick"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Nicholas Barton"}],"publication_status":"published","title":"Chromosome inversions, local adaptation, and speciation","status":"public","intvolume":" 173","publisher":"Genetics Society of America","year":"2006","_id":"3608","extern":1,"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. "}],"publist_id":"2775","issue":"1","type":"journal_article","doi":"10.1534/genetics.105.047985","date_published":"2006-05-01T00:00:00Z","quality_controlled":0,"page":"419 - 434","publication":"Genetics","citation":{"short":"M. Kirkpatrick, N.H. Barton, Genetics 173 (2006) 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.","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.","ama":"Kirkpatrick M, Barton NH. Chromosome inversions, local adaptation, and speciation. Genetics. 2006;173(1):419-434. doi: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.","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","ista":"Kirkpatrick M, Barton NH. 2006. Chromosome inversions, local adaptation, and speciation. Genetics. 173(1), 419–434."},"day":"01","month":"05"},{"type":"journal_article","abstract":[{"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.","lang":"eng"}],"publist_id":"2773","issue":"1","extern":1,"year":"2006","_id":"3610","status":"public","title":"Prediction of effects of genetic drift on variance components under a general model of epistasis","publication_status":"published","publisher":"Academic Press","intvolume":" 70","author":[{"last_name":"Hill","first_name":"William","full_name":"Hill, William G"},{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Nicholas Barton"},{"full_name":"Turelli, Michael","last_name":"Turelli","first_name":"Michael"}],"date_updated":"2021-01-12T07:44:39Z","date_created":"2018-12-11T12:04:14Z","volume":70,"month":"08","day":"01","publication":"Theoretical Population Biology","citation":{"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.","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.","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","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","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.","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."},"quality_controlled":0,"page":"56 - 62","date_published":"2006-08-01T00:00:00Z","doi":"10.1016/j.tpb.2005.10.001"},{"day":"31","month":"10","main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/ali-ciarp2006.pdf","open_access":"0"}],"citation":{"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.","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.","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.","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.","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","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"},"page":"892 - 901","quality_controlled":0,"doi":"10.1007/11892755_92","date_published":"2006-10-31T00:00:00Z","conference":{"name":"CIARP: Iberoamerican Congress in Pattern Recognition"},"type":"conference","alternative_title":["LNCS"],"publist_id":"2700","abstract":[{"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)".","lang":"eng"}],"extern":1,"year":"2006","_id":"3679","intvolume":" 4225","publisher":"Springer","title":"Satellite tracks removal in astronomical images","status":"public","publication_status":"published","author":[{"full_name":"Ali,Haider","last_name":"Ali","first_name":"Haider"},{"full_name":"Christoph Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"},{"full_name":"Breuel,Thomas M","first_name":"Thomas","last_name":"Breuel"}],"volume":4225,"date_updated":"2021-01-12T07:45:05Z","date_created":"2018-12-11T12:04:35Z"},{"conference":{"name":"TRECVID Workshop"},"date_published":"2006-11-14T00:00:00Z","quality_controlled":0,"page":"1 - 10","citation":{"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.","short":"A. Ulges, C. Lampert, D. Keysers, in:, NIST (National Institute of Standards and Technology, US Department of Commerce), 2006, pp. 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.","ieee":"A. Ulges, C. Lampert, and D. Keysers, “Spatiogram-based shot distances for video retrieval,” presented at the TRECVID Workshop, 2006, pp. 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).","ista":"Ulges A, Lampert C, Keysers D. 2006. Spatiogram-based shot distances for video retrieval. TRECVID Workshop, TRECVID Notebook Papers and Slides, , 1–10.","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."},"main_file_link":[{"url":"http://www-nlpir.nist.gov/projects/tvpubs/tv6.papers/dfki.pdf","open_access":"0"}],"month":"11","day":"14","date_updated":"2021-01-12T07:45:04Z","date_created":"2018-12-11T12:04:34Z","author":[{"first_name":"Adrian","last_name":"Ulges","full_name":"Ulges, Adrian"},{"full_name":"Christoph Lampert","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Keysers,Daniel","last_name":"Keysers","first_name":"Daniel"}],"publication_status":"published","status":"public","title":"Spatiogram-based shot distances for video retrieval","publisher":"NIST (National Institute of Standards and Technology, US Department of Commerce)","_id":"3677","year":"2006","extern":1,"abstract":[{"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.","lang":"eng"}],"publist_id":"2702","alternative_title":["TRECVID Notebook Papers and Slides"],"type":"conference"},{"quality_controlled":0,"page":"639 - 634","citation":{"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","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.","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","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.","short":"C. Lampert, L. Mei, T. Breuel, in:, IEEE, 2006, pp. 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."},"main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-cis2006.pdf","open_access":"0"}],"conference":{"name":"CIS: Computational Intelligence and Security"},"doi":"10.1109/ICCIAS.2006.294214","date_published":"2006-11-03T00:00:00Z","day":"03","month":"11","status":"public","title":"Printing technique classification for document counterfeit detection","publication_status":"published","intvolume":" 1","publisher":"IEEE","year":"2006","_id":"3680","date_created":"2018-12-11T12:04:35Z","date_updated":"2021-01-12T07:45:06Z","volume":1,"author":[{"full_name":"Christoph Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"},{"first_name":"Lin","last_name":"Mei","full_name":"Mei,Lin"},{"last_name":"Breuel","first_name":"Thomas","full_name":"Breuel,Thomas M"}],"type":"conference","extern":1,"abstract":[{"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","lang":"eng"}],"publist_id":"2698"},{"type":"journal_article","extern":1,"issue":"11","publist_id":"2669","abstract":[{"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.","lang":"eng"}],"publisher":"IEEE","intvolume":" 15","publication_status":"published","title":"An optimal non-orthogonal separation of the anisotropic Gaussian convolution filter","status":"public","year":"2006","_id":"3695","volume":15,"date_created":"2018-12-11T12:04:40Z","date_updated":"2021-01-12T07:49:01Z","author":[{"full_name":"Christoph Lampert","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wirjadi,Oliver","last_name":"Wirjadi","first_name":"Oliver"}],"day":"01","month":"11","page":"3501 - 3513","quality_controlled":0,"citation":{"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.","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 ","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.","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 ","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 .","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."},"main_file_link":[{"open_access":"1","url":"http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-14003"}],"oa":1,"publication":"IEEE Transactions on Image Processing (TIP)","doi":" 10.1109/TIP.2006.877501 ","date_published":"2006-11-01T00:00:00Z"},{"author":[{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Christoph Lampert"},{"full_name":"Wirjadi,Oliver","first_name":"Oliver","last_name":"Wirjadi"}],"date_updated":"2021-01-12T07:49:00Z","date_created":"2018-12-11T12:04:39Z","year":"2006","_id":"3693","publisher":"IEEE","title":"Anisotropic Gaussian filtering using fixed point arithmetic","status":"public","publication_status":"published","publist_id":"2670","abstract":[{"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.","lang":"eng"}],"extern":1,"type":"conference","doi":"10.1109/ICIP.2006.312606","date_published":"2006-10-08T00:00:00Z","conference":{"name":"ICIP: IEEE International Conference on Image Processing"},"citation":{"short":"C. Lampert, O. Wirjadi, in:, IEEE, 2006, pp. 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.","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.","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","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."},"page":"1565 - 1568","quality_controlled":0,"month":"10","day":"08"},{"year":"2006","_id":"3692","publisher":"SPIE","intvolume":" 6058","publication_status":"published","status":"public","title":"Color image dequantization by constrained diffusion","author":[{"full_name":"Keysers,Daniel","last_name":"Keysers","first_name":"Daniel"},{"full_name":"Christoph Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"last_name":"Breuel","first_name":"Thomas","full_name":"Breuel,Thomas M"}],"volume":6058,"date_updated":"2019-05-10T12:19:52Z","date_created":"2018-12-11T12:04:39Z","type":"conference","publist_id":"2674","extern":1,"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","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.","short":"D. Keysers, C. Lampert, T. Breuel, in:, SPIE, 2006.","mla":"Keysers, Daniel, et al. Color Image Dequantization by Constrained Diffusion. Vol. 6058, SPIE, 2006, doi: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."},"quality_controlled":0,"doi":"10.1117/12.648713","date_published":"2006-01-15T00:00:00Z","conference":{"name":"SPIE Electronic Imaging"},"month":"01","day":"15"},{"year":"2006","_id":"3729","status":"public","title":"Direct measurement of single-molecule visco-elasticity in atomic force microscope force-extension experiments","publication_status":"published","intvolume":" 35","publisher":"Springer","author":[{"full_name":"Bippes, Christian A","last_name":"Bippes","first_name":"Christian"},{"last_name":"Humphris","first_name":"Andrew","full_name":"Humphris, Andrew D"},{"last_name":"Stark","first_name":"Martin","full_name":"Stark, Martin"},{"first_name":"Daniel","last_name":"Mueller","full_name":"Mueller, Daniel J"},{"full_name":"Harald Janovjak","last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:04:51Z","date_updated":"2021-01-12T07:51:46Z","volume":35,"type":"journal_article","abstract":[{"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.","lang":"eng"}],"publist_id":"2500","issue":"3","extern":1,"publication":"European Biophysics Journal","citation":{"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","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.","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","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.","short":"C. Bippes, A. Humphris, M. Stark, D. Mueller, H.L. Janovjak, European Biophysics Journal 35 (2006) 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."},"quality_controlled":0,"page":"287 - 292","doi":"10.1007/s00249-005-0023-9","date_published":"2006-02-01T00:00:00Z","day":"01","month":"02"},{"status":"public","title":"Pulling single bacteriorhodopsin out of a membrane: Comparison of simulation and experiment","publication_status":"published","intvolume":" 1758","publisher":"Elsevier","year":"2006","_id":"3728","date_updated":"2021-01-12T07:51:46Z","date_created":"2018-12-11T12:04:50Z","volume":1758,"author":[{"full_name":"Cieplak, Marek","first_name":"Marek","last_name":"Cieplak"},{"full_name":"Filipek, Sławomir","first_name":"Sławomir","last_name":"Filipek"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","full_name":"Harald Janovjak"},{"full_name":"Krzysko, Krystiana A","last_name":"Krzysko","first_name":"Krystiana"}],"type":"journal_article","extern":1,"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."}],"issue":"4","publist_id":"2502","quality_controlled":0,"page":"537 - 544","publication":"Biochimica et Biophysica Acta (BBA) - Biomembranes","citation":{"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.","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.","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","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","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.","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_published":"2006-04-01T00:00:00Z","doi":"10.1016/j.bbamem.2006.03.028","month":"04","day":"01"},{"publist_id":"2508","extern":1,"type":"book_chapter","author":[{"full_name":"Harald Janovjak","first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315"},{"first_name":"Daniel","last_name":"Mueller","full_name":"Mueller, Daniel J"}],"date_updated":"2021-01-12T07:51:44Z","date_created":"2018-12-11T12:04:48Z","year":"2006","_id":"3722","publication_status":"published","title":"Rastersondenmikroskopie","status":"public","publisher":"Spektrum Akademischer Verlag","month":"06","day":"16","date_published":"2006-06-16T00:00:00Z","publication":"Bioanalytik","citation":{"ieee":"H. L. Janovjak and D. Mueller, “Rastersondenmikroskopie,” in Bioanalytik, Spektrum Akademischer Verlag, 2006.","apa":"Janovjak, H. L., & Mueller, D. (2006). Rastersondenmikroskopie. In Bioanalytik. Spektrum Akademischer Verlag.","ista":"Janovjak HL, Mueller D. 2006.Rastersondenmikroskopie. In: Bioanalytik. .","ama":"Janovjak HL, Mueller D. Rastersondenmikroskopie. In: Bioanalytik. Spektrum Akademischer Verlag; 2006.","chicago":"Janovjak, Harald L, and Daniel Mueller. “Rastersondenmikroskopie.” In Bioanalytik. Spektrum Akademischer Verlag, 2006.","short":"H.L. Janovjak, D. Mueller, in:, Bioanalytik, Spektrum Akademischer Verlag, 2006.","mla":"Janovjak, Harald L., and Daniel Mueller. “Rastersondenmikroskopie.” Bioanalytik, Spektrum Akademischer Verlag, 2006."},"quality_controlled":0},{"date_published":"2006-01-01T00:00:00Z","doi":"10.1529/biophysj.105.073353","quality_controlled":0,"page":"3315 - 3321","publication":"Biophysical Journal","citation":{"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","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.","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","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.","short":"T. Le, T. Emonet, S. Harlepp, C.C. Guet, P. Cluzel, Biophysical Journal 90 (2006) 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."},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1432126/"}],"oa":1,"day":"01","month":"01","date_created":"2018-12-11T12:04:59Z","date_updated":"2021-01-12T07:51:58Z","volume":90,"author":[{"first_name":"Thuc","last_name":"Le","full_name":"Le,Thuc T."},{"last_name":"Emonet","first_name":"Thierry","full_name":"Emonet,Thierry"},{"full_name":"Harlepp, Sébastien","first_name":"Sébastien","last_name":"Harlepp"},{"first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Calin Guet"},{"first_name":"Philippe","last_name":"Cluzel","full_name":"Cluzel,Philippe"}],"title":"Dynamical determinants of drug-inducible gene expression in a single bacterium","publication_status":"published","status":"public","intvolume":" 90","publisher":"Biophysical Society","year":"2006","_id":"3755","extern":1,"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."}],"publist_id":"2472","issue":"9","type":"journal_article"},{"month":"09","day":"01","article_processing_charge":"No","conference":{"name":"SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation"},"date_published":"2006-09-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"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.","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.","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.","ama":"Wojtan C, Mucha P, Turk G. Keyframe control of complex particle systems using the adjoint method. In: ACM; 2006:15-23.","chicago":"Wojtan, Chris, Peter Mucha, and Greg Turk. “Keyframe Control of Complex Particle Systems Using the Adjoint Method,” 15–23. ACM, 2006.","short":"C. Wojtan, P. Mucha, G. Turk, in:, ACM, 2006, pp. 15–23.","mla":"Wojtan, Chris, et al. Keyframe Control of Complex Particle Systems Using the Adjoint Method. ACM, 2006, pp. 15–23."},"main_file_link":[{"url":"http://www.amath.unc.edu/Faculty/mucha/Reprints/SCAclothcontrolpreprint.pdf"}],"page":"15 - 23","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."}],"publist_id":"2469","extern":"1","type":"conference","author":[{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J","full_name":"Wojtan, Christopher J"},{"first_name":"Peter","last_name":"Mucha","full_name":"Mucha, Peter"},{"full_name":"Turk, Greg","last_name":"Turk","first_name":"Greg"}],"date_updated":"2023-02-23T11:41:22Z","date_created":"2018-12-11T12:05:00Z","oa_version":"None","_id":"3758","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2006","publication_status":"published","status":"public","title":"Keyframe control of complex particle systems using the adjoint method","publisher":"ACM"},{"day":"01","month":"01","date_published":"2006-01-01T00:00:00Z","doi":"10.1038/nprot.2006.312 ","citation":{"short":"J. Bischofberger, D. Engel, L. Li, J. Geiger, P.M. Jonas, Nature Protocols 1 (2006) 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 .","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 .","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 ","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.","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 ","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."},"publication":"Nature Protocols","page":"2075 - 81","quality_controlled":0,"publist_id":"2392","issue":"4","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."}],"extern":1,"type":"journal_article","author":[{"last_name":"Bischofberger","first_name":"Josef","full_name":"Bischofberger, Josef"},{"last_name":"Engel","first_name":"Dominique","full_name":"Engel, Dominique"},{"last_name":"Li","first_name":"Liyi","full_name":"Li, Liyi"},{"full_name":"Geiger, Jörg R","last_name":"Geiger","first_name":"Jörg"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","full_name":"Peter Jonas"}],"volume":1,"date_updated":"2021-01-12T07:52:25Z","date_created":"2018-12-11T12:05:20Z","year":"2006","_id":"3818","intvolume":" 1","publisher":"Nature Publishing Group","title":"Patch-clamp recording from mossy fiber terminals in hippocampal slices","status":"public","publication_status":"published"},{"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1145/1109557.1109631","date_published":"2006-01-01T00:00:00Z","quality_controlled":0,"page":"678 - 687","citation":{"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.","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2006, pp. 678–687.","mla":"Chatterjee, Krishnendu, et al. The Complexity of Quantitative Concurrent Parity Games. SIAM, 2006, pp. 678–87, 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","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.","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"},"month":"01","day":"01","date_updated":"2021-01-12T07:52:59Z","date_created":"2018-12-11T12:05:43Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"de Alfaro, Luca"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"}],"publication_status":"published","title":"The complexity of quantitative concurrent parity games","status":"public","publisher":"SIAM","year":"2006","_id":"3890","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and the NSF ITR grant CCR-0225610.","extern":1,"abstract":[{"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.","lang":"eng"}],"publist_id":"2273","type":"conference"},{"author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"full_name":"Raskin, Jean-François","last_name":"Raskin","first_name":"Jean"}],"volume":4207,"date_updated":"2021-01-12T07:52:59Z","date_created":"2018-12-11T12:05:43Z","_id":"3889","year":"2006","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.","intvolume":" 4207","publisher":"Springer","title":"Algorithms for omega-regular games with imperfect information","publication_status":"published","status":"public","publist_id":"2276","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."}],"extern":1,"type":"conference","alternative_title":["LNCS"],"doi":"10.1007/11874683_19","date_published":"2006-11-13T00:00:00Z","conference":{"name":"CSL: Computer Science Logic"},"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","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.","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.","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","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.","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."},"page":"287 - 302","quality_controlled":0,"day":"13","month":"11"},{"month":"09","day":"28","citation":{"ama":"Chatterjee K. Concurrent games with tail objectives. In: Vol 4207. Springer; 2006:256-270. doi:10.1007/11874683_17","ista":"Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 256–270.","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","ieee":"K. Chatterjee, “Concurrent games with tail objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 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.","chicago":"Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives,” 4207:256–70. Springer, 2006. https://doi.org/10.1007/11874683_17."},"quality_controlled":0,"page":"256 - 270","conference":{"name":"CSL: Computer Science Logic"},"date_published":"2006-09-28T00:00:00Z","doi":"10.1007/11874683_17","type":"conference","alternative_title":["LNCS "],"abstract":[{"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).","lang":"eng"}],"publist_id":"2272","extern":1,"year":"2006","_id":"3891","publication_status":"published","title":"Concurrent games with tail objectives","status":"public","publisher":"Springer","intvolume":" 4207","author":[{"full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"}],"date_updated":"2021-01-12T07:53:00Z","date_created":"2018-12-11T12:05:44Z","volume":4207},{"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.","_id":"3888","year":"2006","intvolume":" 4137","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","status":"public","title":"Strategy improvement for stochastic Rabin and Streett games","author":[{"full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"}],"volume":4137,"date_created":"2018-12-11T12:05:43Z","date_updated":"2021-01-12T07:52:58Z","type":"conference","alternative_title":["LNCS"],"publist_id":"2278","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."}],"extern":1,"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","ista":"Chatterjee K, Henzinger TA. 2006. Strategy improvement for stochastic Rabin and Streett games. CONCUR: Concurrency Theory, LNCS, vol. 4137, 375–389.","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.","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","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.","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."},"page":"375 - 389","quality_controlled":0,"doi":"10.1007/11817949_25","date_published":"2006-08-10T00:00:00Z","conference":{"name":"CONCUR: Concurrency Theory"},"month":"08","day":"10"},{"type":"journal_article","abstract":[{"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.","lang":"eng"}],"publist_id":"2242","issue":"2","extern":"1","year":"2006","_id":"3908","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Long repeats in a huge gemome: microsatellite loci in the grasshopper Chorthippus biguttulus","publisher":"Springer","intvolume":" 62","author":[{"first_name":"Jana","last_name":"Ustinova","full_name":"Ustinova, Jana"},{"full_name":"Achmann, Roland","first_name":"Roland","last_name":"Achmann"},{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"},{"last_name":"Mayer","first_name":"Frieder","full_name":"Mayer, Frieder"}],"date_updated":"2021-01-12T07:53:07Z","date_created":"2018-12-11T12:05:49Z","oa_version":"None","volume":62,"day":"01","month":"02","publication":"Journal of Molecular Evolution","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","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.","short":"J. Ustinova, R. Achmann, S. Cremer, F. Mayer, Journal of Molecular Evolution 62 (2006) 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.","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."},"page":"158 - 167","date_published":"2006-02-01T00:00:00Z","doi":"10.1007/s00239-005-0022-6","language":[{"iso":"eng"}]},{"volume":119,"date_created":"2018-12-11T12:05:58Z","date_updated":"2021-01-12T07:53:18Z","author":[{"first_name":"Mihaela","last_name":"Drumea Mirancea","full_name":"Drumea-Mirancea, Mihaela"},{"full_name":"Wessels, Johannes T","first_name":"Johannes","last_name":"Wessels"},{"full_name":"Müller, Claudia A","first_name":"Claudia","last_name":"Müller"},{"full_name":"Essl, Mike","last_name":"Essl","first_name":"Mike"},{"last_name":"Eble","first_name":"Johannes","full_name":"Eble, Johannes A"},{"full_name":"Tolosa, Eva","first_name":"Eva","last_name":"Tolosa"},{"full_name":"Koch, Manuel","first_name":"Manuel","last_name":"Koch"},{"last_name":"Reinhardt","first_name":"Dieter","full_name":"Reinhardt, Dieter P"},{"full_name":"Michael Sixt","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sorokin","first_name":"Lydia","full_name":"Sorokin, Lydia"},{"first_name":"York","last_name":"Stierhof","full_name":"Stierhof, York-Dieter"},{"first_name":"Heinz","last_name":"Schwarz","full_name":"Schwarz, Heinz"},{"last_name":"Klein","first_name":"Gerd","full_name":"Klein, Gerd"}],"intvolume":" 119","publisher":"Company of Biologists","publication_status":"published","status":"public","title":"Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules","_id":"3934","year":"2006","extern":1,"issue":"Pt 7","publist_id":"2192","abstract":[{"lang":"eng","text":"T cells develop in the thymus in a highly specialized cellular and extracellular microenvironment. The basement membrane molecule, laminin-5 (LN-5), is predominantly found in the medulla of the human thymic lobules. Using high-resolution light microscopy, we show here that LN-5 is localized in a bi-membranous conduit-like structure, together with other typical basement membrane components including collagen type IV, nidogen and perlecan. Other interstitial matrix components, such as fibrillin-1 or -2, tenascin-C or fibrillar collagen types, were also associated with these structures. Three-dimensional (3D) confocal microscopy suggested a tubular structure, whereas immunoelectron and transmission electron microscopy showed that the core of these tubes contained fibrillar collagens enwrapped by the LN-5-containing membrane. These medullary conduits are surrounded by thymic epithelial cells, which in vitro were found to bind LN-5, but also fibrillin and tenascin-C. Dendritic cells were also detected in close vicinity to the conduits. Both of these stromal cell types express major histocompatibility complex (MHC) class II molecules capable of antigen presentation. The conduits are connected to blood vessels but, with an average diameter of 2 mum, they are too small to transport cells. However, evidence is provided that smaller molecules such as a 10 kDa dextran, but not large molecules (>500 kDa), can be transported in the conduits. These results clearly demonstrate that a conduit system, which is also known from secondary lymphatic organs such as lymph nodes and spleen, is present in the medulla of the human thymus, and that it might serve to transport small blood-borne molecules or chemokines to defined locations within the medulla."}],"type":"journal_article","date_published":"2006-04-01T00:00:00Z","doi":"10.1242/jcs.02840","page":"1396 - 1405","quality_controlled":0,"citation":{"ieee":"M. Drumea Mirancea et al., “Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules,” Journal of Cell Science, vol. 119, no. Pt 7. Company of Biologists, pp. 1396–1405, 2006.","apa":"Drumea Mirancea, M., Wessels, J., Müller, C., Essl, M., Eble, J., Tolosa, E., … Klein, G. (2006). Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.02840","ista":"Drumea Mirancea M, Wessels J, Müller C, Essl M, Eble J, Tolosa E, Koch M, Reinhardt D, Sixt MK, Sorokin L, Stierhof Y, Schwarz H, Klein G. 2006. Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules. Journal of Cell Science. 119(Pt 7), 1396–1405.","ama":"Drumea Mirancea M, Wessels J, Müller C, et al. Characterization of a conduit system containing laminin-5 in the human thymus: a potential transport system for small molecules. Journal of Cell Science. 2006;119(Pt 7):1396-1405. doi:10.1242/jcs.02840","chicago":"Drumea Mirancea, Mihaela, Johannes Wessels, Claudia Müller, Mike Essl, Johannes Eble, Eva Tolosa, Manuel Koch, et al. “Characterization of a Conduit System Containing Laminin-5 in the Human Thymus: A Potential Transport System for Small Molecules.” Journal of Cell Science. Company of Biologists, 2006. https://doi.org/10.1242/jcs.02840.","short":"M. Drumea Mirancea, J. Wessels, C. Müller, M. Essl, J. Eble, E. Tolosa, M. Koch, D. Reinhardt, M.K. Sixt, L. Sorokin, Y. Stierhof, H. Schwarz, G. Klein, Journal of Cell Science 119 (2006) 1396–1405.","mla":"Drumea Mirancea, Mihaela, et al. “Characterization of a Conduit System Containing Laminin-5 in the Human Thymus: A Potential Transport System for Small Molecules.” Journal of Cell Science, vol. 119, no. Pt 7, Company of Biologists, 2006, pp. 1396–405, doi:10.1242/jcs.02840."},"publication":"Journal of Cell Science","day":"01","month":"04"},{"author":[{"full_name":"Chu, Haiyan","first_name":"Haiyan","last_name":"Chu"},{"full_name":"Thievessen, Ingo","last_name":"Thievessen","first_name":"Ingo"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Michael Sixt"},{"full_name":"Lämmermann, Tim","first_name":"Tim","last_name":"Lämmermann"},{"full_name":"Waisman, Ari","last_name":"Waisman","first_name":"Ari"},{"last_name":"Braun","first_name":"Attila","full_name":"Braun, Attila"},{"full_name":"Noegel, Angelika A","last_name":"Noegel","first_name":"Angelika"},{"last_name":"Fässler","first_name":"Reinhard","full_name":"Fässler, Reinhard"}],"date_created":"2018-12-11T12:05:58Z","date_updated":"2021-01-12T07:53:18Z","volume":26,"year":"2006","_id":"3935","publication_status":"published","title":"γ-Parvin is dispensable for hematopoiesis, leukocyte trafficking, and T-cell-dependent antibody response","status":"public","intvolume":" 26","publisher":"American Society for Microbiology","abstract":[{"lang":"eng","text":"Integrins regulate cell behavior through the assembly of multiprotein complexes at the site of cell adhesion. Parvins are components of such a multiprotein complex. They consist of three members (alpha-, beta-, and gamma-parvin), form a functional complex with integrin-linked kinase (ILK) and PINCH, and link integrins to the actin cytoskeleton. Whereas alpha- and beta-parvins are widely expressed, gamma-parvin has been reported to be expressed in hematopoietic organs. In the present study, we report the expression pattern of the parvins in hematopoietic cells and the phenotypic analysis of gamma-parvin-deficient mice. Whereas alpha-parvin is not expressed in hematopoietic cells, beta-parvin is only found in myeloid cells and gamma-parvin is present in both cells of the myeloid and lymphoid lineages, where it binds ILK. Surprisingly, loss of gamma-parvin expression had no effect on blood cell differentiation, proliferation, and survival and no consequence for the T-cell-dependent antibody response and lymphocyte and dendritic cell migration. These data indicate that despite the high expression of gamma-parvin in hematopoietic cells it must play a more subtle role for blood cell homeostasis."}],"publist_id":"2193","issue":"5","extern":1,"type":"journal_article","doi":"10.1128/MCB.26.5.1817-1825.2006","date_published":"2006-03-01T00:00:00Z","publication":"Molecular and Cellular Biology","citation":{"ama":"Chu H, Thievessen I, Sixt MK, et al. γ-Parvin is dispensable for hematopoiesis, leukocyte trafficking, and T-cell-dependent antibody response. Molecular and Cellular Biology. 2006;26(5):1817-1825. doi:10.1128/MCB.26.5.1817-1825.2006","apa":"Chu, H., Thievessen, I., Sixt, M. K., Lämmermann, T., Waisman, A., Braun, A., … Fässler, R. (2006). γ-Parvin is dispensable for hematopoiesis, leukocyte trafficking, and T-cell-dependent antibody response. Molecular and Cellular Biology. American Society for Microbiology. https://doi.org/10.1128/MCB.26.5.1817-1825.2006","ieee":"H. Chu et al., “γ-Parvin is dispensable for hematopoiesis, leukocyte trafficking, and T-cell-dependent antibody response,” Molecular and Cellular Biology, vol. 26, no. 5. American Society for Microbiology, pp. 1817–1825, 2006.","ista":"Chu H, Thievessen I, Sixt MK, Lämmermann T, Waisman A, Braun A, Noegel A, Fässler R. 2006. γ-Parvin is dispensable for hematopoiesis, leukocyte trafficking, and T-cell-dependent antibody response. Molecular and Cellular Biology. 26(5), 1817–1825.","short":"H. Chu, I. Thievessen, M.K. Sixt, T. Lämmermann, A. Waisman, A. Braun, A. Noegel, R. Fässler, Molecular and Cellular Biology 26 (2006) 1817–1825.","mla":"Chu, Haiyan, et al. “γ-Parvin Is Dispensable for Hematopoiesis, Leukocyte Trafficking, and T-Cell-Dependent Antibody Response.” Molecular and Cellular Biology, vol. 26, no. 5, American Society for Microbiology, 2006, pp. 1817–25, doi:10.1128/MCB.26.5.1817-1825.2006.","chicago":"Chu, Haiyan, Ingo Thievessen, Michael K Sixt, Tim Lämmermann, Ari Waisman, Attila Braun, Angelika Noegel, and Reinhard Fässler. “γ-Parvin Is Dispensable for Hematopoiesis, Leukocyte Trafficking, and T-Cell-Dependent Antibody Response.” Molecular and Cellular Biology. American Society for Microbiology, 2006. https://doi.org/10.1128/MCB.26.5.1817-1825.2006."},"quality_controlled":0,"page":"1817 - 1825","month":"03","day":"01"},{"date_updated":"2021-01-12T07:53:19Z","date_created":"2018-12-11T12:05:59Z","volume":18,"author":[{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Michael Sixt"},{"last_name":"Bauer","first_name":"Martina","full_name":"Bauer, Martina"},{"last_name":"Lämmermann","first_name":"Tim","full_name":"Lämmermann, Tim"},{"full_name":"Fässler, Reinhard","first_name":"Reinhard","last_name":"Fässler"}],"publication_status":"published","title":"β1 integrins: zip codes and signaling relay for blood cells","status":"public","publisher":"Elsevier","intvolume":" 18","_id":"3936","year":"2006","extern":1,"abstract":[{"text":"At least eight of the twelve known members of the beta1 integrin family are expressed on hematopoietic cells. Among these, the VCAM-1 receptor alpha4beta1 has received most attention as a main factor mediating firm adhesion to the endothelium during blood cell extravasation. Therapeutic trials are ongoing into the use of antibodies and small molecule inhibitors to target this interaction and hence obtain anti-inflammatory effects. However, extravasation is only one possible process that is mediated by beta1 integrins and there is evidence that they also mediate leukocyte retention and positioning in the tissue, lymphocyte activation and possibly migration within the interstitium. Genetic mouse models where integrins are selectively deleted on blood cells have been used to investigate these functions and further studies will be invaluable to critically evaluate therapeutic trials.","lang":"eng"}],"issue":"5","publist_id":"2191","type":"journal_article","date_published":"2006-10-01T00:00:00Z","doi":"10.1016/j.ceb.2006.08.007","quality_controlled":0,"page":"482 - 490","publication":"Current Opinion in Cell Biology","citation":{"mla":"Sixt, Michael K., et al. “Β1 Integrins: Zip Codes and Signaling Relay for Blood Cells.” Current Opinion in Cell Biology, vol. 18, no. 5, Elsevier, 2006, pp. 482–90, doi:10.1016/j.ceb.2006.08.007.","short":"M.K. Sixt, M. Bauer, T. Lämmermann, R. Fässler, Current Opinion in Cell Biology 18 (2006) 482–490.","chicago":"Sixt, Michael K, Martina Bauer, Tim Lämmermann, and Reinhard Fässler. “Β1 Integrins: Zip Codes and Signaling Relay for Blood Cells.” Current Opinion in Cell Biology. Elsevier, 2006. https://doi.org/10.1016/j.ceb.2006.08.007.","ama":"Sixt MK, Bauer M, Lämmermann T, Fässler R. β1 integrins: zip codes and signaling relay for blood cells. Current Opinion in Cell Biology. 2006;18(5):482-490. doi:10.1016/j.ceb.2006.08.007","ista":"Sixt MK, Bauer M, Lämmermann T, Fässler R. 2006. β1 integrins: zip codes and signaling relay for blood cells. Current Opinion in Cell Biology. 18(5), 482–490.","ieee":"M. K. Sixt, M. Bauer, T. Lämmermann, and R. Fässler, “β1 integrins: zip codes and signaling relay for blood cells,” Current Opinion in Cell Biology, vol. 18, no. 5. Elsevier, pp. 482–490, 2006.","apa":"Sixt, M. K., Bauer, M., Lämmermann, T., & Fässler, R. (2006). β1 integrins: zip codes and signaling relay for blood cells. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2006.08.007"},"day":"01","month":"10"},{"article_processing_charge":"No","day":"04","month":"12","language":[{"iso":"eng"}],"doi":"10.1083/jcb.200606017","date_published":"2006-12-04T00:00:00Z","page":"791 - 802","citation":{"ama":"Witzel S, Zimyanin V, Carreira Barbosa F, Tada M, Heisenberg C-PJ. Wnt11 controls cell contact persistence by local accumulation of Frizzled 7 at the plasma membrane. Journal of Cell Biology. 2006;175(5):791-802. doi:10.1083/jcb.200606017","ista":"Witzel S, Zimyanin V, Carreira Barbosa F, Tada M, Heisenberg C-PJ. 2006. Wnt11 controls cell contact persistence by local accumulation of Frizzled 7 at the plasma membrane. Journal of Cell Biology. 175(5), 791–802.","apa":"Witzel, S., Zimyanin, V., Carreira Barbosa, F., Tada, M., & Heisenberg, C.-P. J. (2006). Wnt11 controls cell contact persistence by local accumulation of Frizzled 7 at the plasma membrane. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.200606017","ieee":"S. Witzel, V. Zimyanin, F. Carreira Barbosa, M. Tada, and C.-P. J. Heisenberg, “Wnt11 controls cell contact persistence by local accumulation of Frizzled 7 at the plasma membrane,” Journal of Cell Biology, vol. 175, no. 5. Rockefeller University Press, pp. 791–802, 2006.","mla":"Witzel, Sabine, et al. “Wnt11 Controls Cell Contact Persistence by Local Accumulation of Frizzled 7 at the Plasma Membrane.” Journal of Cell Biology, vol. 175, no. 5, Rockefeller University Press, 2006, pp. 791–802, doi:10.1083/jcb.200606017.","short":"S. Witzel, V. Zimyanin, F. Carreira Barbosa, M. Tada, C.-P.J. Heisenberg, Journal of Cell Biology 175 (2006) 791–802.","chicago":"Witzel, Sabine, Vitaly Zimyanin, Filipa Carreira Barbosa, Masazumi Tada, and Carl-Philipp J Heisenberg. “Wnt11 Controls Cell Contact Persistence by Local Accumulation of Frizzled 7 at the Plasma Membrane.” Journal of Cell Biology. Rockefeller University Press, 2006. https://doi.org/10.1083/jcb.200606017."},"publication":"Journal of Cell Biology","extern":"1","publist_id":"1980","issue":"5","abstract":[{"lang":"eng","text":"Wnt11 is a key signal, determining cell polarization and migration during vertebrate gastrulation. It is known that Wnt11 functionally interacts with several signaling components, the homologues of which control planar cell polarity in Drosophila melanogaster. Although in D. melanogaster these components are thought to polarize cells by asymmetrically localizing at the plasma membrane, it is not yet clear whether their subcellular localization plays a similarly important role in vertebrates. We show that in zebrafish embryonic cells, Wnt11 locally functions at the plasma membrane by accumulating its receptor, Frizzled 7, on adjacent sites of cell contacts. Wnt11-induced Frizzled 7 accumulations recruit the intracellular Wnt signaling mediator Dishevelled, as well as Wnt11 itself, and locally increase cell contact persistence. This increase in cell contact persistence is mediated by the local interaction of Wnt11, Frizzled 7, and the atypical cadherin Flamingo at the plasma membrane, and it does not require the activity of further downstream effectors of Wnt11 signaling, such as RhoA and Rok2. We propose that Wnt11, by interacting with Frizzled 7 and Flamingo, modulates local cell contact persistence to coordinate cell movements during gastrulation."}],"type":"journal_article","oa_version":"None","volume":175,"date_updated":"2021-01-12T07:54:48Z","date_created":"2018-12-11T12:07:11Z","author":[{"full_name":"Witzel, Sabine","last_name":"Witzel","first_name":"Sabine"},{"full_name":"Zimyanin, Vitaly","last_name":"Zimyanin","first_name":"Vitaly"},{"full_name":"Carreira Barbosa, Filipa","last_name":"Carreira Barbosa","first_name":"Filipa"},{"full_name":"Tada, Masazumi","first_name":"Masazumi","last_name":"Tada"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Rockefeller University Press","intvolume":" 175","publication_status":"published","status":"public","title":"Wnt11 controls cell contact persistence by local accumulation of Frizzled 7 at the plasma membrane","year":"2006","_id":"4140","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"12","day":"01","article_processing_charge":"No","publication":"Biotechniques","citation":{"ama":"Tonelli D, Calegari F, Fei J, et al. Single-cell detection of microRNAs in developing vertebrate embryos after acute administration of a dual-fluorescence reporter/sensor plasmid. Biotechniques. 2006;41(6):727-732. doi:10.2144/000112296","ista":"Tonelli D, Calegari F, Fei J, Nomura T, Osumi N, Heisenberg C-PJ, Huttner W. 2006. Single-cell detection of microRNAs in developing vertebrate embryos after acute administration of a dual-fluorescence reporter/sensor plasmid. Biotechniques. 41(6), 727–732.","apa":"Tonelli, D., Calegari, F., Fei, J., Nomura, T., Osumi, N., Heisenberg, C.-P. J., & Huttner, W. (2006). Single-cell detection of microRNAs in developing vertebrate embryos after acute administration of a dual-fluorescence reporter/sensor plasmid. Biotechniques. Informa Healthcare. https://doi.org/10.2144/000112296","ieee":"D. Tonelli et al., “Single-cell detection of microRNAs in developing vertebrate embryos after acute administration of a dual-fluorescence reporter/sensor plasmid,” Biotechniques, vol. 41, no. 6. Informa Healthcare, pp. 727–732, 2006.","mla":"Tonelli, Davide, et al. “Single-Cell Detection of MicroRNAs in Developing Vertebrate Embryos after Acute Administration of a Dual-Fluorescence Reporter/Sensor Plasmid.” Biotechniques, vol. 41, no. 6, Informa Healthcare, 2006, pp. 727–32, doi:10.2144/000112296.","short":"D. Tonelli, F. Calegari, J. Fei, T. Nomura, N. Osumi, C.-P.J. Heisenberg, W. Huttner, Biotechniques 41 (2006) 727–732.","chicago":"Tonelli, Davide, Frederico Calegari, Ji Fei, Tadashi Nomura, Noriko Osumi, Carl-Philipp J Heisenberg, and Wieland Huttner. “Single-Cell Detection of MicroRNAs in Developing Vertebrate Embryos after Acute Administration of a Dual-Fluorescence Reporter/Sensor Plasmid.” Biotechniques. Informa Healthcare, 2006. https://doi.org/10.2144/000112296."},"page":"727 - 732","doi":"10.2144/000112296","date_published":"2006-12-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"The detection of microRNAs (miRNAs) at single-cell resolution is important for studying the role of these posttranscriptional regulators. Here, we use a dual-fluorescent green fluorescent protein (GFP)-reporter/monomeric red fluorescent protein (mRFP)-sensor (DFRS) plasmid, injected into zebrafish blastomeres or electroporated into defined tissues of mouse embryos in utero or ex utero, to monitor the dynamics of specific miRNAs in individual live cells. This approach reveals, for example, that in the developing mouse central nervous system,, miR-124a is expressed not only in postmitotic neurons but also in neuronal progenitor cells. Collectively, our results demonstrate that acute administration of DFRS plasmids.offers an alternative to previous in situ hybridization and transgenic approaches and allows the monitoring of miRNA appearance and disappearance in defined cell lineages during vertebrate development.","lang":"eng"}],"issue":"6","publist_id":"1974","extern":"1","_id":"4145","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2006","title":"Single-cell detection of microRNAs in developing vertebrate embryos after acute administration of a dual-fluorescence reporter/sensor plasmid","status":"public","publication_status":"published","publisher":"Informa Healthcare","intvolume":" 41","author":[{"last_name":"Tonelli","first_name":"Davide","full_name":"Tonelli, Davide"},{"last_name":"Calegari","first_name":"Frederico","full_name":"Calegari, Frederico"},{"full_name":"Fei, Ji","first_name":"Ji","last_name":"Fei"},{"full_name":"Nomura, Tadashi","last_name":"Nomura","first_name":"Tadashi"},{"last_name":"Osumi","first_name":"Noriko","full_name":"Osumi, Noriko"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"},{"first_name":"Wieland","last_name":"Huttner","full_name":"Huttner, Wieland"}],"date_created":"2018-12-11T12:07:12Z","date_updated":"2021-01-12T07:54:50Z","oa_version":"None","volume":41},{"article_processing_charge":"No","month":"05","day":"15","language":[{"iso":"eng"}],"date_published":"2006-05-15T00:00:00Z","doi":"10.1242/jcs.02928","page":"2073 - 2083","citation":{"ista":"Link V, Carvalho L, Castanon I, Stockinger P, Shevchenko A, Heisenberg C-PJ. 2006. Identification of regulators of germ layer morphogenesis using proteomics in zebrafish. Journal of Cell Science. 119(10), 2073–2083.","ieee":"V. Link, L. Carvalho, I. Castanon, P. Stockinger, A. Shevchenko, and C.-P. J. Heisenberg, “Identification of regulators of germ layer morphogenesis using proteomics in zebrafish,” Journal of Cell Science, vol. 119, no. 10. Company of Biologists, pp. 2073–2083, 2006.","apa":"Link, V., Carvalho, L., Castanon, I., Stockinger, P., Shevchenko, A., & Heisenberg, C.-P. J. (2006). Identification of regulators of germ layer morphogenesis using proteomics in zebrafish. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.02928","ama":"Link V, Carvalho L, Castanon I, Stockinger P, Shevchenko A, Heisenberg C-PJ. Identification of regulators of germ layer morphogenesis using proteomics in zebrafish. Journal of Cell Science. 2006;119(10):2073-2083. doi:10.1242/jcs.02928","chicago":"Link, Vinzenz, Lara Carvalho, Irinka Castanon, Petra Stockinger, Andrej Shevchenko, and Carl-Philipp J Heisenberg. “Identification of Regulators of Germ Layer Morphogenesis Using Proteomics in Zebrafish.” Journal of Cell Science. Company of Biologists, 2006. https://doi.org/10.1242/jcs.02928.","mla":"Link, Vinzenz, et al. “Identification of Regulators of Germ Layer Morphogenesis Using Proteomics in Zebrafish.” Journal of Cell Science, vol. 119, no. 10, Company of Biologists, 2006, pp. 2073–83, doi:10.1242/jcs.02928.","short":"V. Link, L. Carvalho, I. Castanon, P. Stockinger, A. Shevchenko, C.-P.J. Heisenberg, Journal of Cell Science 119 (2006) 2073–2083."},"publication":"Journal of Cell Science","extern":"1","publist_id":"1944","issue":"10","abstract":[{"text":"During vertebrate gastrulation, a well-orchestrated series of morphogenetic changes leads to the formation of the three germ layers: the ectoderm, mesoderm and endoderm. The analysis of gene expression patterns during gastrulation has been central to the identification of genes involved in germ layer formation. However, many proteins are regulated on a translational or post-translational level and are thus undetectable by gene expression analysis. Therefore, we developed a 2D-gel-based comparative proteomic approach to target proteins involved in germ layer morphogenesis during zebrafish gastrulation. Proteomes of ectodermal and mesendodermal progenitor cells were compared and 35 significantly regulated proteins were identified by mass spectrometry, including several proteins with predicted functions in cytoskeletal organization. A comparison of our proteomic results with data obtained in an accompanying microarray-based gene expression analysis revealed no significant overlap, confirming the complementary nature of proteomics and transcriptomics. The regulation of ezrin2, which was identified based on a reduction in spot intensity in mesendodermal cells, was independently validated. Furthermore, we show that ezrin2 is activated by phosphorylation in mesendodermal cells and is required for proper germ layer morphogenesis. We demonstrate the feasibility of proteomics in zebrafish, concluding that proteomics is a valuable tool for analysis of early development.","lang":"eng"}],"type":"journal_article","volume":119,"oa_version":"None","date_updated":"2021-01-12T07:55:04Z","date_created":"2018-12-11T12:07:24Z","author":[{"first_name":"Vinzenz","last_name":"Link","full_name":"Link, Vinzenz"},{"full_name":"Carvalho, Lara","last_name":"Carvalho","first_name":"Lara"},{"full_name":"Castanon, Irinka","first_name":"Irinka","last_name":"Castanon"},{"full_name":"Stockinger, Petra","last_name":"Stockinger","first_name":"Petra"},{"last_name":"Shevchenko","first_name":"Andrej","full_name":"Shevchenko, Andrej"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J"}],"publisher":"Company of Biologists","intvolume":" 119","publication_status":"published","title":"Identification of regulators of germ layer morphogenesis using proteomics in zebrafish","status":"public","_id":"4176","year":"2006","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"journal_article","publist_id":"1945","abstract":[{"lang":"eng","text":"Background: Zebrafish (D. rerio) has become a powerful and widely used model system for the analysis of vertebrate embryogenesis and organ development. While genetic methods are readily available in zebrafish, protocols for two dimensional (2D) gel electrophoresis and proteomics have yet to be developed. Results: As a prerequisite to carry out proteomic experiments with early zebrafish embryos, we developed a method to efficiently remove the yolk from large batches of embryos. This method enabled high resolution 2D gel electrophoresis and improved Western blotting considerably. Here, we provide detailed protocols for proteomics in zebrafish from sample preparation to mass spectrometry (MS), including a comparison of databases for MS identification of zebrafish proteins. Conclusion: The provided protocols for proteomic analysis of early embryos enable research to be taken in novel directions in embryogenesis."}],"extern":"1","license":"https://creativecommons.org/licenses/by/4.0/","year":"2006","_id":"4173","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"BioMed Central","intvolume":" 6","title":"Proteomics of early zebrafish embryos","status":"public","publication_status":"published","author":[{"full_name":"Link, Vinzenz","first_name":"Vinzenz","last_name":"Link"},{"last_name":"Shevchenko","first_name":"Andrej","full_name":"Shevchenko, Andrej"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J"}],"oa_version":"None","volume":6,"date_created":"2018-12-11T12:07:23Z","date_updated":"2021-01-12T07:55:02Z","article_processing_charge":"No","day":"13","month":"01","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ama":"Link V, Shevchenko A, Heisenberg C-PJ. Proteomics of early zebrafish embryos. BMC Developmental Biology. 2006;6:1-9. doi:10.1186/1471-213X-6-1","ieee":"V. Link, A. Shevchenko, and C.-P. J. Heisenberg, “Proteomics of early zebrafish embryos,” BMC Developmental Biology, vol. 6. BioMed Central, pp. 1–9, 2006.","apa":"Link, V., Shevchenko, A., & Heisenberg, C.-P. J. (2006). Proteomics of early zebrafish embryos. BMC Developmental Biology. BioMed Central. https://doi.org/10.1186/1471-213X-6-1","ista":"Link V, Shevchenko A, Heisenberg C-PJ. 2006. Proteomics of early zebrafish embryos. BMC Developmental Biology. 6, 1–9.","short":"V. Link, A. Shevchenko, C.-P.J. Heisenberg, BMC Developmental Biology 6 (2006) 1–9.","mla":"Link, Vinzenz, et al. “Proteomics of Early Zebrafish Embryos.” BMC Developmental Biology, vol. 6, BioMed Central, 2006, pp. 1–9, doi:10.1186/1471-213X-6-1.","chicago":"Link, Vinzenz, Andrej Shevchenko, and Carl-Philipp J Heisenberg. “Proteomics of Early Zebrafish Embryos.” BMC Developmental Biology. BioMed Central, 2006. https://doi.org/10.1186/1471-213X-6-1."},"main_file_link":[{"url":"http://www.biomedcentral.com/1471-213X/6/1","open_access":"1"}],"publication":"BMC Developmental Biology","page":"1 - 9","date_published":"2006-01-13T00:00:00Z","doi":"10.1186/1471-213X-6-1","language":[{"iso":"eng"}]},{"oa_version":"None","volume":235,"date_updated":"2021-01-12T07:55:04Z","date_created":"2018-12-11T12:07:25Z","author":[{"full_name":"Langenberg, Tobias","last_name":"Langenberg","first_name":"Tobias"},{"last_name":"Dracz","first_name":"Tadeusz","full_name":"Dracz, Tadeusz"},{"first_name":"Andrew","last_name":"Oates","full_name":"Oates, Andrew"},{"full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J"},{"first_name":"Michael","last_name":"Brand","full_name":"Brand, Michael"}],"publisher":"Wiley-Blackwell","intvolume":" 235","title":"Analysis and visualization of cell movement in the developing zebrafish brain","publication_status":"published","status":"public","_id":"4178","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2006","extern":"1","issue":"4","publist_id":"1940","abstract":[{"lang":"eng","text":"Detailed reconstruction of the spatiotemporal history of embryonic cells is key to understanding tissue formation processes but is often complicated by the large number of cells involved, particularly so in vertebrates. Through a combination of high-resolution time-lapse lineage tracing and antibody staining, we have analyzed the movement of mesencephalic and metencephalic cell populations in the early zebrafish embryo. To facilitate the analysis of our cell tracking data, we have created TracePilot, a software tool that allows interactive manipulation and visualization of tracking data. We demonstrate its utility by showing novel visualizations of cell movement in the developing zebrafish brain. TracePilot (http://www.mpi-cbg.de/tracepilot) is Java-based, available free of charge, and has a program structure that allows the incorporation of additional analysis tools."}],"type":"journal_article","language":[{"iso":"eng"}],"date_published":"2006-04-01T00:00:00Z","doi":"10.1002/dvdy.20692","page":"928 - 933","citation":{"ista":"Langenberg T, Dracz T, Oates A, Heisenberg C-PJ, Brand M. 2006. Analysis and visualization of cell movement in the developing zebrafish brain. Developmental Dynamics. 235(4), 928–933.","ieee":"T. Langenberg, T. Dracz, A. Oates, C.-P. J. Heisenberg, and M. Brand, “Analysis and visualization of cell movement in the developing zebrafish brain,” Developmental Dynamics, vol. 235, no. 4. Wiley-Blackwell, pp. 928–933, 2006.","apa":"Langenberg, T., Dracz, T., Oates, A., Heisenberg, C.-P. J., & Brand, M. (2006). Analysis and visualization of cell movement in the developing zebrafish brain. Developmental Dynamics. Wiley-Blackwell. https://doi.org/10.1002/dvdy.20692","ama":"Langenberg T, Dracz T, Oates A, Heisenberg C-PJ, Brand M. Analysis and visualization of cell movement in the developing zebrafish brain. Developmental Dynamics. 2006;235(4):928-933. doi:10.1002/dvdy.20692","chicago":"Langenberg, Tobias, Tadeusz Dracz, Andrew Oates, Carl-Philipp J Heisenberg, and Michael Brand. “Analysis and Visualization of Cell Movement in the Developing Zebrafish Brain.” Developmental Dynamics. Wiley-Blackwell, 2006. https://doi.org/10.1002/dvdy.20692.","mla":"Langenberg, Tobias, et al. “Analysis and Visualization of Cell Movement in the Developing Zebrafish Brain.” Developmental Dynamics, vol. 235, no. 4, Wiley-Blackwell, 2006, pp. 928–33, doi:10.1002/dvdy.20692.","short":"T. Langenberg, T. Dracz, A. Oates, C.-P.J. Heisenberg, M. Brand, Developmental Dynamics 235 (2006) 928–933."},"publication":"Developmental Dynamics","article_processing_charge":"No","day":"01","month":"04"},{"page":"2671 - 2681","publication":"Development","citation":{"chicago":"Köppen, Mathias, Beatriz Fernández, Lara Carvalho, António Jacinto, and Carl-Philipp J Heisenberg. “Coordinated Cell-Shape Changes Control Epithelial Movement in Zebrafish and Drosophila.” Development. Company of Biologists, 2006. https://doi.org/doi: 10.1242/dev.02439.","short":"M. Köppen, B. Fernández, L. Carvalho, A. Jacinto, C.-P.J. Heisenberg, Development 133 (2006) 2671–2681.","mla":"Köppen, Mathias, et al. “Coordinated Cell-Shape Changes Control Epithelial Movement in Zebrafish and Drosophila.” Development, vol. 133, no. 14, Company of Biologists, 2006, pp. 2671–81, doi:doi: 10.1242/dev.02439.","apa":"Köppen, M., Fernández, B., Carvalho, L., Jacinto, A., & Heisenberg, C.-P. J. (2006). Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila. Development. Company of Biologists. https://doi.org/doi: 10.1242/dev.02439","ieee":"M. Köppen, B. Fernández, L. Carvalho, A. Jacinto, and C.-P. J. Heisenberg, “Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila,” Development, vol. 133, no. 14. Company of Biologists, pp. 2671–2681, 2006.","ista":"Köppen M, Fernández B, Carvalho L, Jacinto A, Heisenberg C-PJ. 2006. Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila. Development. 133(14), 2671–2681.","ama":"Köppen M, Fernández B, Carvalho L, Jacinto A, Heisenberg C-PJ. Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila. Development. 2006;133(14):2671-2681. doi:doi: 10.1242/dev.02439"},"language":[{"iso":"eng"}],"doi":"doi: 10.1242/dev.02439","date_published":"2006-07-15T00:00:00Z","month":"07","day":"15","article_processing_charge":"No","publication_status":"published","status":"public","title":"Coordinated cell-shape changes control epithelial movement in zebrafish and Drosophila","publisher":"Company of Biologists","intvolume":" 133","_id":"4184","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2006","date_created":"2018-12-11T12:07:27Z","date_updated":"2021-01-12T07:55:08Z","volume":133,"oa_version":"None","author":[{"first_name":"Mathias","last_name":"Köppen","full_name":"Köppen, Mathias"},{"full_name":"Fernández, Beatriz","first_name":"Beatriz","last_name":"Fernández"},{"full_name":"Carvalho, Lara","first_name":"Lara","last_name":"Carvalho"},{"full_name":"Jacinto, António","last_name":"Jacinto","first_name":"António"},{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"type":"journal_article","extern":"1","abstract":[{"text":"Epithelial morphogenesis depends on coordinated changes in cell shape, a process that is still poorly understood. During zebrafish epiboly and Drosophila dorsal closure, cell-shape changes at the epithelial margin are of critical importance. Here evidence is provided for a conserved mechanism of local actin and myosin 2 recruitment during theses events. It was found that during epiboly of the zebrafish embryo, the movement of the outer epithelium (enveloping layer) over the yolk cell surface involves the constriction of marginal cells. This process depends on the recruitment of actin and myosin 2 within the yolk cytoplasm along the margin of the enveloping layer. Actin and myosin 2 recruitment within the yolk cytoplasm requires the Ste20-like kinase Msn1, an orthologue of Drosophila Misshapen. Similarly, in Drosophila, actin and myosin 2 localization and cell constriction at the margin of the epidermis mediate dorsal closure and are controlled by Misshapen. Thus, this study has characterized a conserved mechanism underlying coordinated cell-shape changes during epithelial morphogenesis.","lang":"eng"}],"publist_id":"1935","issue":"14"},{"volume":11,"oa_version":"None","date_created":"2018-12-11T12:07:39Z","date_updated":"2021-01-12T07:55:23Z","author":[{"first_name":"Heiko","last_name":"Blaser","full_name":"Blaser, Heiko"},{"first_name":"Michal","last_name":"Reichman Fried","full_name":"Reichman Fried, Michal"},{"full_name":"Castanon, Irinka","last_name":"Castanon","first_name":"Irinka"},{"first_name":"Karin","last_name":"Dumstrei","full_name":"Dumstrei, Karin"},{"first_name":"Florence","last_name":"Marlow","full_name":"Marlow, Florence"},{"last_name":"Kawakami","first_name":"Koichi","full_name":"Kawakami, Koichi"},{"full_name":"Solnica Krezel, Lilianna","last_name":"Solnica Krezel","first_name":"Lilianna"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg"},{"full_name":"Raz, Erez","first_name":"Erez","last_name":"Raz"}],"publisher":"Cell Press","intvolume":" 11","status":"public","publication_status":"published","title":"Migration of zebrafish primordial germ cells: A role for myosin contraction and cytoplasmic flow","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"4218","year":"2006","extern":"1","issue":"5","publist_id":"1898","abstract":[{"lang":"eng","text":"The molecular and cellular mechanisms governing cell motility and directed migration in response to the chemokine SDF-1 are largely unknown. Here, we demonstrate that zebrafish primordial germ cells whose migration is guided by SDF-1 generate bleb-like protrusions that are powered by cytoplasmic flow. Protrusions are formed at sites of higher levels of free calcium where activation of myosin contraction occurs. Separation of the acto-myosin cortex from the plasma membrane at these sites is followed by a flow of cytoplasm into the forming bleb. We propose that polarized activation of the receptor CXCR4 leads to a rise in free calcium that in turn activates myosin contraction in the part of the cell responding to higher levels of the ligand SDF-1. The biased formation of new protrusions in a particular region of the cell in response to SDF-1 defines the leading edge and the direction of cell migration."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1016/j.devcel.2006.09.023","date_published":"2006-11-06T00:00:00Z","page":"613 - 627","citation":{"ama":"Blaser H, Reichman Fried M, Castanon I, et al. Migration of zebrafish primordial germ cells: A role for myosin contraction and cytoplasmic flow. Developmental Cell. 2006;11(5):613-627. doi:10.1016/j.devcel.2006.09.023","ieee":"H. Blaser et al., “Migration of zebrafish primordial germ cells: A role for myosin contraction and cytoplasmic flow,” Developmental Cell, vol. 11, no. 5. Cell Press, pp. 613–627, 2006.","apa":"Blaser, H., Reichman Fried, M., Castanon, I., Dumstrei, K., Marlow, F., Kawakami, K., … Raz, E. (2006). Migration of zebrafish primordial germ cells: A role for myosin contraction and cytoplasmic flow. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2006.09.023","ista":"Blaser H, Reichman Fried M, Castanon I, Dumstrei K, Marlow F, Kawakami K, Solnica Krezel L, Heisenberg C-PJ, Raz E. 2006. Migration of zebrafish primordial germ cells: A role for myosin contraction and cytoplasmic flow. Developmental Cell. 11(5), 613–627.","short":"H. Blaser, M. Reichman Fried, I. Castanon, K. Dumstrei, F. Marlow, K. Kawakami, L. Solnica Krezel, C.-P.J. Heisenberg, E. Raz, Developmental Cell 11 (2006) 613–627.","mla":"Blaser, Heiko, et al. “Migration of Zebrafish Primordial Germ Cells: A Role for Myosin Contraction and Cytoplasmic Flow.” Developmental Cell, vol. 11, no. 5, Cell Press, 2006, pp. 613–27, doi:10.1016/j.devcel.2006.09.023.","chicago":"Blaser, Heiko, Michal Reichman Fried, Irinka Castanon, Karin Dumstrei, Florence Marlow, Koichi Kawakami, Lilianna Solnica Krezel, Carl-Philipp J Heisenberg, and Erez Raz. “Migration of Zebrafish Primordial Germ Cells: A Role for Myosin Contraction and Cytoplasmic Flow.” Developmental Cell. Cell Press, 2006. https://doi.org/10.1016/j.devcel.2006.09.023."},"publication":"Developmental Cell","article_processing_charge":"No","day":"06","month":"11"},{"month":"01","day":"01","article_processing_charge":"No","doi":"3802","date_published":"2006-01-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Journal of Theoretical Biology","citation":{"chicago":"Vladar, Harold de. “Density-Dependence as a Size-Independent Regulatory Mechanism.” Journal of Theoretical Biology. Elsevier, 2006. https://doi.org/3802.","mla":"de Vladar, Harold. “Density-Dependence as a Size-Independent Regulatory Mechanism.” Journal of Theoretical Biology, vol. 238, no. 2, Elsevier, 2006, pp. 245–56, doi:3802.","short":"H. de Vladar, Journal of Theoretical Biology 238 (2006) 245–256.","ista":"de Vladar H. 2006. Density-dependence as a size-independent regulatory mechanism. Journal of Theoretical Biology. 238(2), 245–256.","ieee":"H. de Vladar, “Density-dependence as a size-independent regulatory mechanism,” Journal of Theoretical Biology, vol. 238, no. 2. Elsevier, pp. 245–256, 2006.","apa":"de Vladar, H. (2006). Density-dependence as a size-independent regulatory mechanism. Journal of Theoretical Biology. Elsevier. https://doi.org/3802","ama":"de Vladar H. Density-dependence as a size-independent regulatory mechanism. Journal of Theoretical Biology. 2006;238(2):245-256. doi:3802"},"page":"245 - 256","abstract":[{"text":"The growth function of populations is central in biomathematics. The main dogma is the existence of density-dependence mechanisms, which can be modelled with distinct functional forms that depend on the size of the Population. One important class of regulatory functions is the theta-logistic, which generalizes the logistic equation. Using this model as a motivation, this paper introduces a simple dynamical reformulation that generalizes many growth functions. The reformulation consists of two equations, one for population size, and one for the growth rate. Furthermore, the model shows that although population is density-dependent, the dynamics of the growth rate does not depend either on population size, nor on the carrying capacity. Actually, the growth equation is uncoupled from the population size equation, and the model has only two parameters, a Malthusian parameter rho and a competition coefficient theta. Distinct sign combinations of these parameters reproduce not only the family of theta-logistics, but also the van Bertalanffy, Gompertz and Potential Growth equations, among other possibilities. It is also shown that, except for two critical points, there is a general size-scaling relation that includes those appearing in the most important allometric theories, including the recently proposed Metabolic Theory of Ecology. With this model, several issues of general interest are discussed such as the growth of animal population, extinctions, cell growth and allometry, and the effect of environment over a population. (c) 2005 Elsevier Ltd. All rights reserved.","lang":"eng"}],"publist_id":"1878","issue":"2","extern":"1","type":"journal_article","author":[{"orcid":"0000-0002-5985-7653","id":"2A181218-F248-11E8-B48F-1D18A9856A87","last_name":"de Vladar","first_name":"Harold","full_name":"de Vladar, Harold"}],"date_created":"2018-12-11T12:07:46Z","date_updated":"2021-01-12T07:55:31Z","oa_version":"None","volume":238,"year":"2006","_id":"4237","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Density-dependence as a size-independent regulatory mechanism","publication_status":"published","status":"public","publisher":"Elsevier","intvolume":" 238"},{"type":"journal_article","publist_id":"1879","extern":1,"year":"2006","_id":"4235","title":"Dynamic response of cancer under the influence of immunological activity and therapy","publication_status":"published","status":"public","publisher":"Elsevier","author":[{"full_name":"Harold Vladar","last_name":"Vladar","first_name":"Harold","orcid":"0000-0002-5985-7653","id":"2A181218-F248-11E8-B48F-1D18A9856A87"},{"last_name":"González","first_name":"J.","full_name":"González,J. A"}],"date_updated":"2021-01-12T07:55:30Z","date_created":"2018-12-11T12:07:45Z","month":"01","day":"01","publication":"Journal of Theoretical Biology","citation":{"short":"H. de Vladar, J. González, Journal of Theoretical Biology (2006) 91–109.","mla":"de Vladar, Harold, and J. González. “Dynamic Response of Cancer under the Influence of Immunological Activity and Therapy.” Journal of Theoretical Biology, Elsevier, 2006, pp. 91–109.","chicago":"Vladar, Harold de, and J. González. “Dynamic Response of Cancer under the Influence of Immunological Activity and Therapy.” Journal of Theoretical Biology. Elsevier, 2006.","ama":"de Vladar H, González J. Dynamic response of cancer under the influence of immunological activity and therapy. Journal of Theoretical Biology. 2006:91-109.","ieee":"H. de Vladar and J. González, “Dynamic response of cancer under the influence of immunological activity and therapy,” Journal of Theoretical Biology. Elsevier, pp. 91–109, 2006.","apa":"de Vladar, H., & González, J. (2006). Dynamic response of cancer under the influence of immunological activity and therapy. Journal of Theoretical Biology. Elsevier.","ista":"de Vladar H, González J. 2006. Dynamic response of cancer under the influence of immunological activity and therapy. Journal of Theoretical Biology., 91–109."},"quality_controlled":0,"page":"91 - 109","date_published":"2006-01-01T00:00:00Z"},{"date_published":"2006-07-01T00:00:00Z","doi":"10.1534/genetics.106.058586 ","quality_controlled":0,"page":"1793 - 1811","publication":"Genetics","citation":{"mla":"Roze, Denis, and Nicholas H. Barton. “The Hill-Robertson Effect and the Evolution of Recombination.” Genetics, vol. 173, no. 3, Genetics Society of America, 2006, pp. 1793–811, doi:10.1534/genetics.106.058586 .","short":"D. Roze, N.H. Barton, Genetics 173 (2006) 1793–1811.","chicago":"Roze, Denis, and Nicholas H Barton. “The Hill-Robertson Effect and the Evolution of Recombination.” Genetics. Genetics Society of America, 2006. https://doi.org/10.1534/genetics.106.058586 .","ama":"Roze D, Barton NH. The Hill-Robertson effect and the evolution of recombination. Genetics. 2006;173(3):1793-1811. doi:10.1534/genetics.106.058586 ","ista":"Roze D, Barton NH. 2006. The Hill-Robertson effect and the evolution of recombination. Genetics. 173(3), 1793–1811.","apa":"Roze, D., & Barton, N. H. (2006). The Hill-Robertson effect and the evolution of recombination. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.106.058586 ","ieee":"D. Roze and N. H. Barton, “The Hill-Robertson effect and the evolution of recombination,” Genetics, vol. 173, no. 3. Genetics Society of America, pp. 1793–1811, 2006."},"month":"07","day":"01","date_created":"2018-12-11T12:07:50Z","date_updated":"2021-01-12T07:55:36Z","volume":173,"author":[{"full_name":"Roze, Denis","last_name":"Roze","first_name":"Denis"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Nicholas Barton"}],"publication_status":"published","status":"public","title":"The Hill-Robertson effect and the evolution of recombination","intvolume":" 173","publisher":"Genetics Society of America","year":"2006","_id":"4248","extern":1,"abstract":[{"lang":"eng","text":"In finite populations, genetic drift generates interference between selected loci, causing advantageous alleles to be found more often on different chromosomes than on the same chromosome, which reduces the rate of adaptation. This “Hill–Robertson effect” generates indirect selection to increase recombination rates. We present a new method to quantify the strength of this selection. Our model represents a new beneficial allele (A) entering a population as a single copy, while another beneficial allele (B) is sweeping at another locus. A third locus affects the recombination rate between selected loci. Using a branching process model, we calculate the probability distribution of the number of copies of A on the different genetic backgrounds, after it is established but while it is still rare. Then, we use a deterministic model to express the change in frequency of the recombination modifier, due to hitchhiking, as A goes to fixation. We show that this method can give good estimates of selection for recombination. Moreover, it shows that recombination is selected through two different effects: it increases the fixation probability of new alleles, and it accelerates selective sweeps. The relative importance of these two effects depends on the relative times of occurrence of the beneficial alleles."}],"publist_id":"1854","issue":"3","type":"journal_article"},{"month":"08","day":"22","publication":"Current Biology","citation":{"ieee":"N. H. Barton, “Evolutionary Biology: How did the human species form?,” Current Biology, vol. 16, no. 16. Cell Press, pp. 647–650, 2006.","apa":"Barton, N. H. (2006). Evolutionary Biology: How did the human species form? Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2006.07.032","ista":"Barton NH. 2006. Evolutionary Biology: How did the human species form? Current Biology. 16(16), 647–650.","ama":"Barton NH. Evolutionary Biology: How did the human species form? Current Biology. 2006;16(16):647-650. doi:10.1016/j.cub.2006.07.032","chicago":"Barton, Nicholas H. “Evolutionary Biology: How Did the Human Species Form?” Current Biology. Cell Press, 2006. https://doi.org/10.1016/j.cub.2006.07.032.","short":"N.H. Barton, Current Biology 16 (2006) 647–650.","mla":"Barton, Nicholas H. “Evolutionary Biology: How Did the Human Species Form?” Current Biology, vol. 16, no. 16, Cell Press, 2006, pp. 647–50, doi:10.1016/j.cub.2006.07.032."},"quality_controlled":0,"page":"647 - 650","date_published":"2006-08-22T00:00:00Z","doi":"10.1016/j.cub.2006.07.032","type":"review","abstract":[{"lang":"eng","text":"A recent analysis has shown that divergence between human and chimpanzee varies greatly across the genome. Although this is consistent with ‘hybridisation’ between the diverging human and chimp lineages, such observations can be explained more simply by the null model of allopatric speciation."}],"publist_id":"1850","issue":"16","extern":1,"year":"2006","_id":"4250","title":"Evolutionary Biology: How did the human species form?","publication_status":"published","status":"public","publisher":"Cell Press","intvolume":" 16","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Nicholas Barton"}],"date_updated":"2019-04-26T07:22:41Z","date_created":"2018-12-11T12:07:51Z","volume":16},{"date_updated":"2021-01-12T07:56:23Z","date_created":"2018-12-11T12:08:27Z","author":[{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Wies"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"},{"full_name":"Lam,Patrick","first_name":"Patrick","last_name":"Lam"},{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski,Andreas"},{"full_name":"Rinard,Martin","first_name":"Martin","last_name":"Rinard"}],"publication_status":"published","status":"public","title":"Field Constraint Analysis","publisher":"Springer","year":"2006","_id":"4359","extern":1,"publist_id":"1097","alternative_title":["LNCS 3855"],"type":"conference","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"doi":"1551","date_published":"2006-01-01T00:00:00Z","quality_controlled":0,"page":"157 - 173","citation":{"chicago":"Wies, Thomas, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin Rinard. “Field Constraint Analysis,” 157–73. Springer, 2006. https://doi.org/1551.","short":"T. Wies, V. Kuncak, P. Lam, A. Podelski, M. Rinard, in:, Springer, 2006, pp. 157–173.","mla":"Wies, Thomas, et al. Field Constraint Analysis. Springer, 2006, pp. 157–73, doi:1551.","ieee":"T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard, “Field Constraint Analysis,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2006, pp. 157–173.","apa":"Wies, T., Kuncak, V., Lam, P., Podelski, A., & Rinard, M. (2006). Field Constraint Analysis (pp. 157–173). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Springer. https://doi.org/1551","ista":"Wies T, Kuncak V, Lam P, Podelski A, Rinard M. 2006. Field Constraint Analysis. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS 3855, , 157–173.","ama":"Wies T, Kuncak V, Lam P, Podelski A, Rinard M. Field Constraint Analysis. In: Springer; 2006:157-173. doi:1551"},"month":"01","day":"01"},{"author":[{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"full_name":"Dejan Nickovic","first_name":"Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pnueli,Amir","first_name":"Amir","last_name":"Pnueli"}],"date_created":"2018-12-11T12:08:31Z","date_updated":"2021-01-12T07:56:29Z","_id":"4373","year":"2006","publisher":"Springer","title":"Real Time Temporal Logic: Past, Present, Future","status":"public","publication_status":"published","publist_id":"1084","extern":1,"type":"conference","alternative_title":["LNCS"],"date_published":"2006-01-23T00:00:00Z","doi":"1571","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"citation":{"ista":"Maler O, Nickovic D, Pnueli A. 2006. Real Time Temporal Logic: Past, Present, Future. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, , 2–16.","ieee":"O. Maler, D. Nickovic, and A. Pnueli, “Real Time Temporal Logic: Past, Present, Future,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2006, pp. 2–16.","apa":"Maler, O., Nickovic, D., & Pnueli, A. (2006). Real Time Temporal Logic: Past, Present, Future (pp. 2–16). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/1571","ama":"Maler O, Nickovic D, Pnueli A. Real Time Temporal Logic: Past, Present, Future. In: Springer; 2006:2-16. doi:1571","chicago":"Maler, Oded, Dejan Nickovic, and Amir Pnueli. “Real Time Temporal Logic: Past, Present, Future,” 2–16. Springer, 2006. https://doi.org/1571.","mla":"Maler, Oded, et al. Real Time Temporal Logic: Past, Present, Future. Springer, 2006, pp. 2–16, doi:1571.","short":"O. Maler, D. Nickovic, A. Pnueli, in:, Springer, 2006, pp. 2–16."},"page":"2 - 16","quality_controlled":0,"month":"01","day":"23"},{"publist_id":"1085","extern":1,"type":"conference","alternative_title":["LNCS"],"author":[{"last_name":"Maler","first_name":"Oded","full_name":"Maler, Oded"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Dejan Nickovic"},{"full_name":"Pnueli,Amir","last_name":"Pnueli","first_name":"Amir"}],"date_created":"2018-12-11T12:08:31Z","date_updated":"2021-01-12T07:56:30Z","_id":"4374","year":"2006","publisher":"Springer","status":"public","publication_status":"published","title":"From MITL to Timed Automata","month":"10","day":"19","doi":"1570","date_published":"2006-10-19T00:00:00Z","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"citation":{"ama":"Maler O, Nickovic D, Pnueli A. From MITL to Timed Automata. In: Springer; 2006:274-289. doi:1570","ista":"Maler O, Nickovic D, Pnueli A. 2006. From MITL to Timed Automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, , 274–289.","ieee":"O. Maler, D. Nickovic, and A. Pnueli, “From MITL to Timed Automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2006, pp. 274–289.","apa":"Maler, O., Nickovic, D., & Pnueli, A. (2006). From MITL to Timed Automata (pp. 274–289). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/1570","mla":"Maler, Oded, et al. From MITL to Timed Automata. Springer, 2006, pp. 274–89, doi:1570.","short":"O. Maler, D. Nickovic, A. Pnueli, in:, Springer, 2006, pp. 274–289.","chicago":"Maler, Oded, Dejan Nickovic, and Amir Pnueli. “From MITL to Timed Automata,” 274–89. Springer, 2006. https://doi.org/1570."},"page":"274 - 289","quality_controlled":0},{"day":"08","month":"08","doi":"10.1007/11817963_5","date_published":"2006-08-08T00:00:00Z","conference":{"name":"CAV: Computer Aided Verification"},"page":"17 - 30","quality_controlled":0,"citation":{"ama":"De Wulf M, Doyen L, Henzinger TA, Raskin J. Antichains: A new algorithm for checking universality of finite automata. In: Vol 4144. Springer; 2006:17-30. doi:10.1007/11817963_5","ieee":"M. De Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, “Antichains: A new algorithm for checking universality of finite automata,” presented at the CAV: Computer Aided Verification, 2006, vol. 4144, pp. 17–30.","apa":"De Wulf, M., Doyen, L., Henzinger, T. A., & Raskin, J. (2006). Antichains: A new algorithm for checking universality of finite automata (Vol. 4144, pp. 17–30). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/11817963_5","ista":"De Wulf M, Doyen L, Henzinger TA, Raskin J. 2006. Antichains: A new algorithm for checking universality of finite automata. CAV: Computer Aided Verification, LNCS, vol. 4144, 17–30.","short":"M. De Wulf, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 17–30.","mla":"De Wulf, Martin, et al. Antichains: A New Algorithm for Checking Universality of Finite Automata. Vol. 4144, Springer, 2006, pp. 17–30, doi:10.1007/11817963_5.","chicago":"De Wulf, Martin, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Antichains: A New Algorithm for Checking Universality of Finite Automata,” 4144:17–30. Springer, 2006. https://doi.org/10.1007/11817963_5."},"extern":1,"publist_id":"326","abstract":[{"lang":"eng","text":"We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata."}],"alternative_title":["LNCS"],"type":"conference","volume":4144,"date_updated":"2021-01-12T07:56:45Z","date_created":"2018-12-11T12:08:41Z","author":[{"full_name":"De Wulf, Martin","last_name":"De Wulf","first_name":"Martin"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"full_name":"Raskin, Jean-François","last_name":"Raskin","first_name":"Jean"}],"publisher":"Springer","intvolume":" 4144","title":"Antichains: A new algorithm for checking universality of finite automata","status":"public","publication_status":"published","acknowledgement":"This research was supported in part by the NSF grants CCR-0234690 and CCR-0225610, and the Belgian FNRS grant 2.4530.02 of the FRFC project “Centre Fédéré en Vérification.”","_id":"4406","year":"2006"},{"day":"01","month":"01","quality_controlled":0,"page":"107 - 118","citation":{"short":"R. Alur, P. Cerny, S. Zdancewic, in:, Springer, 2006, pp. 107–118.","mla":"Alur, Rajeev, et al. Preserving Secrecy Under Refinement. Springer, 2006, pp. 107–18, doi:1543.","chicago":"Alur, Rajeev, Pavol Cerny, and Steve Zdancewic. “Preserving Secrecy Under Refinement,” 107–18. Springer, 2006. https://doi.org/1543.","ama":"Alur R, Cerny P, Zdancewic S. Preserving Secrecy Under Refinement. In: Springer; 2006:107-118. doi:1543","ieee":"R. Alur, P. Cerny, and S. Zdancewic, “Preserving Secrecy Under Refinement,” presented at the ICALP: Automata, Languages and Programming, 2006, pp. 107–118.","apa":"Alur, R., Cerny, P., & Zdancewic, S. (2006). Preserving Secrecy Under Refinement (pp. 107–118). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/1543","ista":"Alur R, Cerny P, Zdancewic S. 2006. Preserving Secrecy Under Refinement. ICALP: Automata, Languages and Programming, LNCS, , 107–118."},"conference":{"name":"ICALP: Automata, Languages and Programming"},"date_published":"2006-01-01T00:00:00Z","doi":"1543","alternative_title":["LNCS"],"type":"conference","extern":1,"publist_id":"1054","title":"Preserving Secrecy Under Refinement","publication_status":"published","status":"public","publisher":"Springer","year":"2006","_id":"4401","date_created":"2018-12-11T12:08:40Z","date_updated":"2021-01-12T07:56:42Z","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"full_name":"Pavol Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"full_name":"Zdancewic,Steve","first_name":"Steve","last_name":"Zdancewic"}]},{"publisher":"Springer","intvolume":" 4207","status":"public","publication_status":"published","title":"Solving games without determinization","_id":"4437","year":"2006","acknowledgement":"This research was supported in part by the Swiss National Science Foundation.","volume":4207,"date_updated":"2021-01-12T07:56:58Z","date_created":"2018-12-11T12:08:51Z","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"alternative_title":["LNCS"],"type":"conference","extern":1,"publist_id":"295","abstract":[{"text":"The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the objective is specified by a linear temporal logic formula or nondeterministic Büchi automaton, then previous algorithms for solving the game require the construction of an equivalent deterministic automaton. However, determinization for automata on infinite words is extremely complicated, and current implementations fail to produce deterministic automata even for relatively small inputs. We show how to construct, from a given nondeterministic Büchi automaton, an equivalent nondeterministic parity automaton that is good for solving games with objective . The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministic automaton. In this way, we omit the determinization step in game solving and reactive synthesis. The fact that our automata are nondeterministic makes them surprisingly simple, amenable to symbolic implementation, and allows an incremental search for winning strategies.","lang":"eng"}],"page":"395 - 410","quality_controlled":0,"citation":{"ista":"Henzinger TA, Piterman N. 2006. Solving games without determinization. CSL: Computer Science Logic, LNCS, vol. 4207, 395–410.","apa":"Henzinger, T. A., & Piterman, N. (2006). Solving games without determinization (Vol. 4207, pp. 395–410). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_26","ieee":"T. A. Henzinger and N. Piterman, “Solving games without determinization,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 395–410.","ama":"Henzinger TA, Piterman N. Solving games without determinization. In: Vol 4207. Springer; 2006:395-410. doi:10.1007/11874683_26","chicago":"Henzinger, Thomas A, and Nir Piterman. “Solving Games without Determinization,” 4207:395–410. Springer, 2006. https://doi.org/10.1007/11874683_26.","mla":"Henzinger, Thomas A., and Nir Piterman. Solving Games without Determinization. Vol. 4207, Springer, 2006, pp. 395–410, doi:10.1007/11874683_26.","short":"T.A. Henzinger, N. Piterman, in:, Springer, 2006, pp. 395–410."},"date_published":"2006-09-20T00:00:00Z","doi":"10.1007/11874683_26","conference":{"name":"CSL: Computer Science Logic"},"day":"20","month":"09"},{"day":"24","month":"04","quality_controlled":0,"page":"253 - 266","citation":{"ama":"Henzinger TA, Matic S. An interface algebra for real-time components. In: IEEE; 2006:253-266. doi:10.1109/RTAS.2006.11","apa":"Henzinger, T. A., & Matic, S. (2006). An interface algebra for real-time components (pp. 253–266). Presented at the RTAS: Real-time and Embedded Technology and Applications Symposium, IEEE. https://doi.org/10.1109/RTAS.2006.11","ieee":"T. A. Henzinger and S. Matic, “An interface algebra for real-time components,” presented at the RTAS: Real-time and Embedded Technology and Applications Symposium, 2006, pp. 253–266.","ista":"Henzinger TA, Matic S. 2006. An interface algebra for real-time components. RTAS: Real-time and Embedded Technology and Applications Symposium, 253–266.","short":"T.A. Henzinger, S. Matic, in:, IEEE, 2006, pp. 253–266.","mla":"Henzinger, Thomas A., and Slobodan Matic. An Interface Algebra for Real-Time Components. IEEE, 2006, pp. 253–66, doi:10.1109/RTAS.2006.11.","chicago":"Henzinger, Thomas A, and Slobodan Matic. “An Interface Algebra for Real-Time Components,” 253–66. IEEE, 2006. https://doi.org/10.1109/RTAS.2006.11."},"conference":{"name":"RTAS: Real-time and Embedded Technology and Applications Symposium"},"doi":"10.1109/RTAS.2006.11","date_published":"2006-04-24T00:00:00Z","type":"conference","extern":1,"abstract":[{"text":"We present an assume-guarantee interface algebra for real-time components. In our formalism a component implements a set of task sequences that share a resource. A component interface consists of an arrival rate function and a latency for each task sequence, and a capacity function for the shared resource. The interface specifies that the component guarantees certain task latencies depending on assumptions about task arrival rates and allocated resource capacities. Our algebra defines compatibility and refinement relations on interfaces. Interface compatibility can be checked on partial designs, even when some component interfaces are yet unknown. In this case interface composition computes as new assumptions the weakest constraints on the unknown components that are necessary to satisfy the specified guarantees. Interface refinement is defined in a way that ensures that compatible interfaces can be refined and implemented independently. Our algebra thus formalizes an interface-based design methodology that supports both the incremental addition of new components and the independent stepwise refinement of existing components. We demonstrate the flexibility and efficiency of the framework through simulation experiments.","lang":"eng"}],"publist_id":"294","publication_status":"published","title":"An interface algebra for real-time components","status":"public","publisher":"IEEE","_id":"4436","year":"2006","date_updated":"2021-01-12T07:56:57Z","date_created":"2018-12-11T12:08:50Z","author":[{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Matic, Slobodan","first_name":"Slobodan","last_name":"Matic"}]},{"month":"09","day":"19","doi":"10.1007/11867340_1","date_published":"2006-09-19T00:00:00Z","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"page":"1 - 17","quality_controlled":0,"citation":{"short":"T.A. Henzinger, V. Prabhu, in:, Springer, 2006, pp. 1–17.","mla":"Henzinger, Thomas A., and Vinayak Prabhu. Timed Alternating-Time Temporal Logic. Vol. 4202, Springer, 2006, pp. 1–17, doi:10.1007/11867340_1.","chicago":"Henzinger, Thomas A, and Vinayak Prabhu. “Timed Alternating-Time Temporal Logic,” 4202:1–17. Springer, 2006. https://doi.org/10.1007/11867340_1.","ama":"Henzinger TA, Prabhu V. Timed alternating-time temporal logic. In: Vol 4202. Springer; 2006:1-17. doi:10.1007/11867340_1","apa":"Henzinger, T. A., & Prabhu, V. (2006). Timed alternating-time temporal logic (Vol. 4202, pp. 1–17). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/11867340_1","ieee":"T. A. Henzinger and V. Prabhu, “Timed alternating-time temporal logic,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2006, vol. 4202, pp. 1–17.","ista":"Henzinger TA, Prabhu V. 2006. Timed alternating-time temporal logic. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 4202, 1–17."},"extern":1,"publist_id":"296","abstract":[{"lang":"eng","text":"We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems for physically meaningful strategies, and we show that for timed automaton games, the optimal answers can be approximated to within any degree of precision."}],"alternative_title":["LNCS"],"type":"conference","volume":4202,"date_updated":"2021-01-12T07:56:56Z","date_created":"2018-12-11T12:08:49Z","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Thomas Henzinger"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak S"}],"publisher":"Springer","intvolume":" 4202","status":"public","publication_status":"published","title":"Timed alternating-time temporal logic","acknowledgement":"This research was supported in part by the NSF grants CCR-0208875, CCR-0225610, and CCR-0234690.","_id":"4432","year":"2006"},{"date_published":"2006-08-10T00:00:00Z","doi":"10.1007/11813040_1","conference":{"name":"FM: Formal Methods"},"citation":{"apa":"Henzinger, T. A., & Sifakis, J. (2006). The embedded systems design challenge (Vol. 4085, pp. 1–15). Presented at the FM: Formal Methods, Springer. https://doi.org/10.1007/11813040_1","ieee":"T. A. Henzinger and J. Sifakis, “The embedded systems design challenge,” presented at the FM: Formal Methods, 2006, vol. 4085, pp. 1–15.","ista":"Henzinger TA, Sifakis J. 2006. The embedded systems design challenge. FM: Formal Methods, LNCS, vol. 4085, 1–15.","ama":"Henzinger TA, Sifakis J. The embedded systems design challenge. In: Vol 4085. Springer; 2006:1-15. doi:10.1007/11813040_1","chicago":"Henzinger, Thomas A, and Joseph Sifakis. “The Embedded Systems Design Challenge,” 4085:1–15. Springer, 2006. https://doi.org/10.1007/11813040_1.","short":"T.A. Henzinger, J. Sifakis, in:, Springer, 2006, pp. 1–15.","mla":"Henzinger, Thomas A., and Joseph Sifakis. The Embedded Systems Design Challenge. Vol. 4085, Springer, 2006, pp. 1–15, doi:10.1007/11813040_1."},"page":"1 - 15","quality_controlled":0,"month":"08","day":"10","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"},{"full_name":"Sifakis, Joseph","last_name":"Sifakis","first_name":"Joseph"}],"volume":4085,"date_created":"2018-12-11T12:08:49Z","date_updated":"2021-01-12T07:56:55Z","year":"2006","_id":"4431","acknowledgement":"Supported in part by the ARTIST2 European Network of Excellence on Embedded Systems Design, by the NSF ITR Center on Hybrid and Embedded Software Systems (CHESS), and by the SNSF NCCR on Mobile Information and Communication Systems (MICS).","publisher":"Springer","intvolume":" 4085","title":"The embedded systems design challenge","status":"public","publication_status":"published","publist_id":"301","abstract":[{"text":"We summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap between safety-critical and best-effort engineering practices. We call for a coherent scientific foundation for embedded systems design, and we discuss a few key demands on such a foundation: the need for encompassing several manifestations of heterogeneity, and the need for constructivity in design. We believe that the development of a satisfactory Embedded Systems Design Science provides a timely challenge and opportunity for reinvigorating computer science.","lang":"eng"}],"extern":1,"type":"conference","alternative_title":["LNCS"]},{"date_published":"2006-03-28T00:00:00Z","doi":"10.1016/j.tcs.2005.11.015","page":"173 - 186","quality_controlled":0,"citation":{"apa":"Henzinger, T. A., Kupferman, O., & Majumdar, R. (2006). On the universal and existential fragments of the mu-calculus. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2005.11.015","ieee":"T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential fragments of the mu-calculus,” Theoretical Computer Science, vol. 354, no. 2. Elsevier, pp. 173–186, 2006.","ista":"Henzinger TA, Kupferman O, Majumdar R. 2006. On the universal and existential fragments of the mu-calculus. Theoretical Computer Science. 354(2), 173–186.","ama":"Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments of the mu-calculus. Theoretical Computer Science. 2006;354(2):173-186. doi:10.1016/j.tcs.2005.11.015","chicago":"Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal and Existential Fragments of the Mu-Calculus.” Theoretical Computer Science. Elsevier, 2006. https://doi.org/10.1016/j.tcs.2005.11.015.","short":"T.A. Henzinger, O. Kupferman, R. Majumdar, Theoretical Computer Science 354 (2006) 173–186.","mla":"Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of the Mu-Calculus.” Theoretical Computer Science, vol. 354, no. 2, Elsevier, 2006, pp. 173–86, doi:10.1016/j.tcs.2005.11.015."},"publication":"Theoretical Computer Science","month":"03","day":"28","volume":354,"date_created":"2018-12-11T12:08:55Z","date_updated":"2021-01-12T07:57:04Z","author":[{"full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"full_name":"Majumdar, Ritankar S","last_name":"Majumdar","first_name":"Ritankar"}],"intvolume":" 354","publisher":"Elsevier","publication_status":"published","title":"On the universal and existential fragments of the mu-calculus","status":"public","year":"2006","_id":"4451","extern":1,"issue":"2","publist_id":"276","abstract":[{"text":"One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternation-free fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment.","lang":"eng"}],"type":"journal_article"},{"page":"117 - 127","quality_controlled":0,"citation":{"ama":"Gulavani B, Henzinger TA, Kannan Y, Nori A, Rajamani S. Synergy: A new algorithm for property checking. In: ACM; 2006:117-127. doi:10.1145/1181775.1181790","apa":"Gulavani, B., Henzinger, T. A., Kannan, Y., Nori, A., & Rajamani, S. (2006). Synergy: A new algorithm for property checking (pp. 117–127). Presented at the FSE: Foundations of Software Engineering, ACM. https://doi.org/10.1145/1181775.1181790","ieee":"B. Gulavani, T. A. Henzinger, Y. Kannan, A. Nori, and S. Rajamani, “Synergy: A new algorithm for property checking,” presented at the FSE: Foundations of Software Engineering, 2006, pp. 117–127.","ista":"Gulavani B, Henzinger TA, Kannan Y, Nori A, Rajamani S. 2006. Synergy: A new algorithm for property checking. FSE: Foundations of Software Engineering, 117–127.","short":"B. Gulavani, T.A. Henzinger, Y. Kannan, A. Nori, S. Rajamani, in:, ACM, 2006, pp. 117–127.","mla":"Gulavani, Bhargav, et al. Synergy: A New Algorithm for Property Checking. ACM, 2006, pp. 117–27, doi:10.1145/1181775.1181790.","chicago":"Gulavani, Bhargav, Thomas A Henzinger, Yamini Kannan, Aditya Nori, and Sriram Rajamani. “Synergy: A New Algorithm for Property Checking,” 117–27. ACM, 2006. https://doi.org/10.1145/1181775.1181790."},"doi":"10.1145/1181775.1181790","date_published":"2006-01-01T00:00:00Z","conference":{"name":"FSE: Foundations of Software Engineering"},"day":"01","month":"01","publisher":"ACM","publication_status":"published","status":"public","title":"Synergy: A new algorithm for property checking","year":"2006","_id":"4523","date_created":"2018-12-11T12:09:18Z","date_updated":"2021-01-12T07:59:26Z","author":[{"full_name":"Gulavani, Bhargav S","first_name":"Bhargav","last_name":"Gulavani"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Kannan","first_name":"Yamini","full_name":"Kannan, Yamini"},{"last_name":"Nori","first_name":"Aditya","full_name":"Nori, Aditya V"},{"first_name":"Sriram","last_name":"Rajamani","full_name":"Rajamani, Sriram K"}],"type":"conference","extern":1,"publist_id":"206","abstract":[{"lang":"eng","text":"We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and for these programs the property checking problem is undecidable. Two broad approaches to property checking are testing and verification. Testing tries to find inputs and executions which demonstrate violations of the property. Verification tries to construct a formal proof which shows that all executions of the program satisfy the property. Testing works best when errors are easy to find, but it is often difficult to achieve sufficient coverage for correct programs. On the other hand, verification methods are most successful when proofs are easy to find, but they are often inefficient at discovering errors. We propose a new algorithm, Synergy, which combines testing and verification. Synergy unifies several ideas from the literature, including counterexample-guided model checking, directed testing, and partition refinement.This paper presents a description of the Synergy algorithm, its theoretical properties, a comparison with related algorithms, and a prototype implementation called Yogi."}]},{"status":"public","title":"A hierarchical coordination language for interacting real-time tasks","publication_status":"published","publisher":"ACM","_id":"4526","year":"2006","date_updated":"2021-01-12T07:59:27Z","date_created":"2018-12-11T12:09:18Z","author":[{"first_name":"Arkadeb","last_name":"Ghosal","full_name":"Ghosal, Arkadeb"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"},{"full_name":"Iercan, Daniel","last_name":"Iercan","first_name":"Daniel"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph M"},{"last_name":"Sangiovanni Vincentelli","first_name":"Alberto","full_name":"Sangiovanni-Vincentelli, Alberto"}],"type":"conference","extern":1,"abstract":[{"lang":"eng","text":"We designed and implemented a new programming language called Hierarchical Timing Language (HTL) for hard realtime systems. Critical timing constraints are specified within the language,and ensured by the compiler. Programs in HTL are extensible in two dimensions without changing their timing behavior: new program modules can be added, and individual program tasks can be refined. The mechanism supporting time invariance under parallel composition is that different program modules communicate at specified instances of time. Time invariance under refinement is achieved by conservative scheduling of the top level. HTL is a coordination language, in that individual tasks can be implemented in "foreign" languages. As a case study, we present a distributed HTL implementation of an automotive steer-by-wire controller."}],"publist_id":"201","quality_controlled":0,"page":"132 - 141","citation":{"ama":"Ghosal A, Henzinger TA, Iercan D, Kirsch C, Sangiovanni Vincentelli A. A hierarchical coordination language for interacting real-time tasks. In: ACM; 2006:132-141. doi:10.1145/1176887.1176907","apa":"Ghosal, A., Henzinger, T. A., Iercan, D., Kirsch, C., & Sangiovanni Vincentelli, A. (2006). A hierarchical coordination language for interacting real-time tasks (pp. 132–141). Presented at the EMSOFT: Embedded Software , ACM. https://doi.org/10.1145/1176887.1176907","ieee":"A. Ghosal, T. A. Henzinger, D. Iercan, C. Kirsch, and A. Sangiovanni Vincentelli, “A hierarchical coordination language for interacting real-time tasks,” presented at the EMSOFT: Embedded Software , 2006, pp. 132–141.","ista":"Ghosal A, Henzinger TA, Iercan D, Kirsch C, Sangiovanni Vincentelli A. 2006. A hierarchical coordination language for interacting real-time tasks. EMSOFT: Embedded Software , 132–141.","short":"A. Ghosal, T.A. Henzinger, D. Iercan, C. Kirsch, A. Sangiovanni Vincentelli, in:, ACM, 2006, pp. 132–141.","mla":"Ghosal, Arkadeb, et al. A Hierarchical Coordination Language for Interacting Real-Time Tasks. ACM, 2006, pp. 132–41, doi:10.1145/1176887.1176907.","chicago":"Ghosal, Arkadeb, Thomas A Henzinger, Daniel Iercan, Christoph Kirsch, and Alberto Sangiovanni Vincentelli. “A Hierarchical Coordination Language for Interacting Real-Time Tasks,” 132–41. ACM, 2006. https://doi.org/10.1145/1176887.1176907."},"conference":{"name":"EMSOFT: Embedded Software "},"doi":"10.1145/1176887.1176907","date_published":"2006-01-01T00:00:00Z","day":"01","month":"01"},{"date_published":"2006-12-03T00:00:00Z","doi":"10.1109/WSC.2006.322942","conference":{"name":"WSC: Winter Simulation Conference"},"page":"1675 - 1682","quality_controlled":0,"citation":{"chicago":"Fisher, Jasmin, and Thomas A Henzinger. “Executable Biology,” 1675–82. IEEE, 2006. https://doi.org/10.1109/WSC.2006.322942.","mla":"Fisher, Jasmin, and Thomas A. Henzinger. Executable Biology. IEEE, 2006, pp. 1675–82, doi:10.1109/WSC.2006.322942.","short":"J. Fisher, T.A. Henzinger, in:, IEEE, 2006, pp. 1675–1682.","ista":"Fisher J, Henzinger TA. 2006. Executable biology. WSC: Winter Simulation Conference, 1675–1682.","ieee":"J. Fisher and T. A. Henzinger, “Executable biology,” presented at the WSC: Winter Simulation Conference, 2006, pp. 1675–1682.","apa":"Fisher, J., & Henzinger, T. A. (2006). Executable biology (pp. 1675–1682). Presented at the WSC: Winter Simulation Conference, IEEE. https://doi.org/10.1109/WSC.2006.322942","ama":"Fisher J, Henzinger TA. Executable biology. In: IEEE; 2006:1675-1682. doi:10.1109/WSC.2006.322942"},"day":"03","month":"12","date_updated":"2021-01-12T07:59:28Z","date_created":"2018-12-11T12:09:19Z","author":[{"last_name":"Fisher","first_name":"Jasmin","full_name":"Fisher, Jasmin"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"publisher":"IEEE","title":"Executable biology","status":"public","publication_status":"published","year":"2006","_id":"4528","extern":1,"publist_id":"197","abstract":[{"lang":"eng","text":"Computational modeling of biological systems is becoming increasingly common as scientists attempt to understand biological phenomena in their full complexity. Here we distinguish between two types of biological models mathematical and computational - according to their different representations of biological phenomena and their diverse potential. We call the approach of constructing computational models of biological systems executable biology, as it focuses on the design of executable computer algorithms that mimic biological phenomena. We give an overview of the main modeling efforts in this direction, and discuss some of the new challenges that executable biology poses for computer science and biology. We argue that for executable biology to reach its full potential as a mainstream biological technique, formal and algorithmic approaches must be integrated into biological research, driving biology towards a more precise engineering discipline."}],"type":"conference"},{"page":"257 - 271","quality_controlled":0,"citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. Finitary Winning in Omega-Regular Games. Vol. 3920, Springer, 2006, pp. 257–71, doi:10.1007/11691372_17.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 257–271.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular Games,” 3920:257–71. Springer, 2006. https://doi.org/10.1007/11691372_17.","ama":"Chatterjee K, Henzinger TA. Finitary winning in omega-regular games. In: Vol 3920. Springer; 2006:257-271. doi:10.1007/11691372_17","ista":"Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920, 257–271.","apa":"Chatterjee, K., & Henzinger, T. A. (2006). Finitary winning in omega-regular games (Vol. 3920, pp. 257–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/11691372_17","ieee":"K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2006, vol. 3920, pp. 257–271."},"date_published":"2006-03-15T00:00:00Z","doi":"10.1007/11691372_17","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"month":"03","day":"15","publisher":"Springer","intvolume":" 3920","publication_status":"published","status":"public","title":"Finitary winning in omega-regular games","_id":"4539","year":"2006","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and the NSF ITR grant CCR-0225610.","volume":3920,"date_created":"2018-12-11T12:09:22Z","date_updated":"2021-01-12T07:59:32Z","author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger"}],"alternative_title":["LNCS"],"type":"conference","extern":1,"publist_id":"183","abstract":[{"lang":"eng","text":"Games on graphs with ω-regular objectives provide a model for the control and synthesis of reactive systems. Every ω-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Büchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett (fairness) objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound."}]},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Thomas Henzinger"}],"date_updated":"2021-01-12T07:59:32Z","date_created":"2018-12-11T12:09:22Z","volume":3884,"_id":"4538","year":"2006","title":"Strategy improvement and randomized subexponential algorithms for stochastic parity games","publication_status":"published","status":"public","publisher":"Springer","intvolume":" 3884","abstract":[{"text":"A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improvement algorithm we obtain a randomized subexponential-time algorithm to solve such games.","lang":"eng"}],"publist_id":"184","extern":1,"type":"conference","alternative_title":["LNCS"],"conference":{"name":"STACS: Theoretical Aspects of Computer Science"},"date_published":"2006-02-14T00:00:00Z","doi":"10.1007/11672142_42","citation":{"chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games,” 3884:512–23. Springer, 2006. https://doi.org/10.1007/11672142_42.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. Vol. 3884, Springer, 2006, pp. 512–23, doi:10.1007/11672142_42.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 512–523.","ista":"Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 512–523.","apa":"Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games (Vol. 3884, pp. 512–523). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_42","ieee":"K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential algorithms for stochastic parity games,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 512–523.","ama":"Chatterjee K, Henzinger TA. Strategy improvement and randomized subexponential algorithms for stochastic parity games. In: Vol 3884. Springer; 2006:512-523. doi:10.1007/11672142_42"},"quality_controlled":0,"page":"512 - 523","month":"02","day":"14"},{"alternative_title":["LNCS"],"type":"conference","extern":1,"publist_id":"161","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple discounted reward objectives. Such MDPs occur in design problems where one wishes to simultaneously optimize several criteria, for example, latency and power. The possible trade-offs between the different objectives are characterized by the Pareto curve. We show that every Pareto-optimal point can be achieved by a memoryless strategy; however, unlike in the single-objective case, the memoryless strategy may require randomization. Moreover, we show that the Pareto curve can be approximated in polynomial time in the size of the MDP. Additionally, we study the problem if a given value vector is realizable by any strategy, and show that it can be decided in polynomial time; but the question whether it is realizable by a deterministic memoryless strategy is NP-complete. These results provide efficient algorithms for design exploration in MDP models with multiple objectives.\nThis research was supported in part by the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202. ","lang":"eng"}],"intvolume":" 3884","publisher":"Springer","publication_status":"published","title":"Markov decision processes with multiple objectives","status":"public","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202.","_id":"4551","year":"2006","volume":3884,"date_updated":"2021-01-12T07:59:38Z","date_created":"2018-12-11T12:09:26Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee"},{"full_name":"Majumdar, Ritankar S","first_name":"Ritankar","last_name":"Majumdar"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"}],"day":"14","month":"02","page":"325 - 336","quality_controlled":0,"citation":{"chicago":"Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Markov Decision Processes with Multiple Objectives,” 3884:325–36. Springer, 2006. https://doi.org/10.1007/11672142_26.","mla":"Chatterjee, Krishnendu, et al. Markov Decision Processes with Multiple Objectives. Vol. 3884, Springer, 2006, pp. 325–36, doi:10.1007/11672142_26.","short":"K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2006, pp. 325–336.","ista":"Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 325–336.","apa":"Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2006). Markov decision processes with multiple objectives (Vol. 3884, pp. 325–336). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_26","ieee":"K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Markov decision processes with multiple objectives,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 325–336.","ama":"Chatterjee K, Majumdar R, Henzinger TA. Markov decision processes with multiple objectives. In: Vol 3884. Springer; 2006:325-336. doi:10.1007/11672142_26"},"date_published":"2006-02-14T00:00:00Z","doi":"10.1007/11672142_26","conference":{"name":"STACS: Theoretical Aspects of Computer Science"}}]