[{"day":"01","publication":"Communications in Mathematical Physics","year":"2012","publication_status":"published","issue":"3","date_published":"2012-09-01T00:00:00Z","doi":"10.1007/s00220-012-1527-7","volume":314,"date_created":"2018-12-11T11:59:32Z","page":"587 - 640","abstract":[{"text":"We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption pN≫N2/3 , we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erdős-Rényi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erdős-Rényi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least 4 + ε moments.","lang":"eng"}],"month":"09","intvolume":" 314","quality_controlled":0,"publisher":"Springer","extern":1,"date_updated":"2021-01-12T06:59:37Z","citation":{"chicago":"Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues.” Communications in Mathematical Physics. Springer, 2012. https://doi.org/10.1007/s00220-012-1527-7.","ista":"Erdös L, Knowles A, Yau H, Yin J. 2012. Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. Communications in Mathematical Physics. 314(3), 587–640.","mla":"Erdös, László, et al. “Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues.” Communications in Mathematical Physics, vol. 314, no. 3, Springer, 2012, pp. 587–640, doi:10.1007/s00220-012-1527-7.","ama":"Erdös L, Knowles A, Yau H, Yin J. Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. Communications in Mathematical Physics. 2012;314(3):587-640. doi:10.1007/s00220-012-1527-7","apa":"Erdös, L., Knowles, A., Yau, H., & Yin, J. (2012). Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1527-7","short":"L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics 314 (2012) 587–640.","ieee":"L. Erdös, A. Knowles, H. Yau, and J. Yin, “Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues,” Communications in Mathematical Physics, vol. 314, no. 3. Springer, pp. 587–640, 2012."},"title":"Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"László Erdös","last_name":"Erdös"},{"first_name":"Antti","last_name":"Knowles","full_name":"Knowles, Antti"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng-Tzer"},{"full_name":"Yin, Jun","last_name":"Yin","first_name":"Jun"}],"publist_id":"4114","_id":"2776","status":"public","type":"journal_article"},{"date_created":"2018-12-11T11:59:31Z","date_published":"2012-06-01T00:00:00Z","volume":312,"issue":"3","doi":"10.1007/s00220-012-1468-1","page":"847 - 882","publication":"Communications in Mathematical Physics","day":"01","year":"2012","publication_status":"published","intvolume":" 312","month":"06","publisher":"Springer","quality_controlled":0,"abstract":[{"text":"We consider a large neutral molecule with total nuclear charge Z in non-relativistic quantum mechanics with a self-generated classical electromagnetic field. To ensure stability, we assume that Zα 2 ≤ κ 0 for a sufficiently small κ 0, where α denotes the fine structure constant. We show that, in the simultaneous limit Z → ∞, α → 0 such that κ = Zα 2 is fixed, the ground state energy of the system is given by a two term expansion c 1Z 7/3 + c 2(κ) Z 2 + o(Z 2). The leading term is given by the non-magnetic Thomas-Fermi theory. Our result shows that the magnetic field affects only the second (so-called Scott) term in the expansion.","lang":"eng"}],"title":"Scott correction for large atoms and molecules in a self-generated magnetic field","publist_id":"4116","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"László Erdös","orcid":"0000-0001-5366-9603","last_name":"Erdös"},{"first_name":"Søren","full_name":"Fournais, Søren","last_name":"Fournais"},{"full_name":"Solovej, Jan P","last_name":"Solovej","first_name":"Jan"}],"extern":1,"citation":{"ieee":"L. Erdös, S. Fournais, and J. Solovej, “Scott correction for large atoms and molecules in a self-generated magnetic field,” Communications in Mathematical Physics, vol. 312, no. 3. Springer, pp. 847–882, 2012.","short":"L. Erdös, S. Fournais, J. Solovej, Communications in Mathematical Physics 312 (2012) 847–882.","ama":"Erdös L, Fournais S, Solovej J. Scott correction for large atoms and molecules in a self-generated magnetic field. Communications in Mathematical Physics. 2012;312(3):847-882. doi:10.1007/s00220-012-1468-1","apa":"Erdös, L., Fournais, S., & Solovej, J. (2012). Scott correction for large atoms and molecules in a self-generated magnetic field. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1468-1","mla":"Erdös, László, et al. “Scott Correction for Large Atoms and Molecules in a Self-Generated Magnetic Field.” Communications in Mathematical Physics, vol. 312, no. 3, Springer, 2012, pp. 847–82, doi:10.1007/s00220-012-1468-1.","ista":"Erdös L, Fournais S, Solovej J. 2012. Scott correction for large atoms and molecules in a self-generated magnetic field. Communications in Mathematical Physics. 312(3), 847–882.","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Scott Correction for Large Atoms and Molecules in a Self-Generated Magnetic Field.” Communications in Mathematical Physics. Springer, 2012. https://doi.org/10.1007/s00220-012-1468-1."},"date_updated":"2021-01-12T06:59:36Z","status":"public","type":"journal_article","_id":"2774"},{"abstract":[{"lang":"eng","text":"Recently we proved [3, 4, 6, 7, 9, 10, 11] that the eigenvalue correlation functions of a general class of random matrices converge, weakly with respect to the energy, to the corresponding ones of Gaussian matrices. Tao and Vu [15] gave a proof that for the special case of Hermitian Wigner matrices the convergence can be strengthened to vague convergence at any fixed energy in the bulk. In this article we show that this theorem is an immediate corollary of our earlier results. Indeed, a more general form of this theorem also follows directly from our work [2]."}],"month":"04","intvolume":" 17","publisher":"Institute of Mathematical Statistics","quality_controlled":0,"day":"10","publication":"Electronic Journal of Probability","publication_status":"published","year":"2012","doi":"10.1214/EJP.v17-1779","date_published":"2012-04-10T00:00:00Z","volume":17,"date_created":"2018-12-11T11:59:31Z","_id":"2773","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:59:36Z","citation":{"mla":"Erdös, László, and Horng Yau. “A Comment on the Wigner-Dyson-Mehta Bulk Universality Conjecture for Wigner Matrices.” Electronic Journal of Probability, vol. 17, Institute of Mathematical Statistics, 2012, doi:10.1214/EJP.v17-1779.","ama":"Erdös L, Yau H. A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices. Electronic Journal of Probability. 2012;17. doi:10.1214/EJP.v17-1779","apa":"Erdös, L., & Yau, H. (2012). A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/EJP.v17-1779","ieee":"L. Erdös and H. Yau, “A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices,” Electronic Journal of Probability, vol. 17. Institute of Mathematical Statistics, 2012.","short":"L. Erdös, H. Yau, Electronic Journal of Probability 17 (2012).","chicago":"Erdös, László, and Horng Yau. “A Comment on the Wigner-Dyson-Mehta Bulk Universality Conjecture for Wigner Matrices.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2012. https://doi.org/10.1214/EJP.v17-1779.","ista":"Erdös L, Yau H. 2012. A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices. Electronic Journal of Probability. 17."},"title":"A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices","publist_id":"4117","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"László Erdös"},{"first_name":"Horng","full_name":"Yau, Horng-Tzer","last_name":"Yau"}]},{"abstract":[{"lang":"eng","text":"We consider a magnetic Schrödinger operator in two dimensions. The magnetic field is given as the sum of a large and constant magnetic field and a random magnetic field. Moreover, we allow for an additional deterministic potential as well as a magnetic field which are both periodic. We show that the spectrum of this operator is contained in broadened bands around the Landau levels and that the edges of these bands consist of pure point spectrum with exponentially decaying eigenfunctions. The proof is based on a recent Wegner estimate obtained in Erdos and Hasler (Commun. Math. Phys., preprint, arXiv:1012.5185) and a multiscale analysis."}],"publisher":"Springer","quality_controlled":0,"intvolume":" 146","month":"03","year":"2012","publication_status":"published","publication":"Journal of Statistical Physics","day":"01","page":"900 - 923","date_created":"2018-12-11T11:59:31Z","date_published":"2012-03-01T00:00:00Z","volume":146,"issue":"5","doi":"10.1007/s10955-012-0445-6","_id":"2771","type":"journal_article","status":"public","date_updated":"2021-01-12T06:59:35Z","citation":{"chicago":"Erdös, László, and David Hasler. “Anderson Localization at Band Edges for Random Magnetic Fields.” Journal of Statistical Physics. Springer, 2012. https://doi.org/10.1007/s10955-012-0445-6.","ista":"Erdös L, Hasler D. 2012. Anderson localization at band edges for random magnetic fields. Journal of Statistical Physics. 146(5), 900–923.","mla":"Erdös, László, and David Hasler. “Anderson Localization at Band Edges for Random Magnetic Fields.” Journal of Statistical Physics, vol. 146, no. 5, Springer, 2012, pp. 900–23, doi:10.1007/s10955-012-0445-6.","ieee":"L. Erdös and D. Hasler, “Anderson localization at band edges for random magnetic fields,” Journal of Statistical Physics, vol. 146, no. 5. Springer, pp. 900–923, 2012.","short":"L. Erdös, D. Hasler, Journal of Statistical Physics 146 (2012) 900–923.","ama":"Erdös L, Hasler D. Anderson localization at band edges for random magnetic fields. Journal of Statistical Physics. 2012;146(5):900-923. doi:10.1007/s10955-012-0445-6","apa":"Erdös, L., & Hasler, D. (2012). Anderson localization at band edges for random magnetic fields. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-012-0445-6"},"extern":1,"author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"László Erdös","orcid":"0000-0001-5366-9603"},{"full_name":"Hasler, David G","last_name":"Hasler","first_name":"David"}],"publist_id":"4119","title":"Anderson localization at band edges for random magnetic fields"},{"date_created":"2018-12-11T11:59:33Z","doi":"10.1063/1.4751478","volume":53,"issue":"9","date_published":"2012-09-28T00:00:00Z","publication":"Journal of Mathematical Physics","day":"28","year":"2012","publication_status":"published","intvolume":" 53","month":"09","publisher":"American Institute of Physics","quality_controlled":0,"abstract":[{"text":"We prove the bulk universality of the β-ensembles with non-convex regular analytic potentials for any β > 0. This removes the convexity assumption appeared in the earlier work [P. Bourgade, L. Erdös, and H.-T. Yau, Universality of general β-ensembles, preprint arXiv:0907.5605 (2011)]. The convexity condition enabled us to use the logarithmic Sobolev inequality to estimate events with small probability. The new idea is to introduce a "convexified measure" so that the local statistics are preserved under this convexification.","lang":"eng"}],"title":"Bulk universality of general β-ensembles with non-convex potential","author":[{"full_name":"Bourgade, Paul","last_name":"Bourgade","first_name":"Paul"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"László Erdös"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng-Tzer"}],"publist_id":"4112","extern":1,"date_updated":"2021-01-12T06:59:38Z","citation":{"mla":"Bourgade, Paul, et al. “Bulk Universality of General β-Ensembles with Non-Convex Potential.” Journal of Mathematical Physics, vol. 53, no. 9, American Institute of Physics, 2012, doi:10.1063/1.4751478.","apa":"Bourgade, P., Erdös, L., & Yau, H. (2012). Bulk universality of general β-ensembles with non-convex potential. Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4751478","ama":"Bourgade P, Erdös L, Yau H. Bulk universality of general β-ensembles with non-convex potential. Journal of Mathematical Physics. 2012;53(9). doi:10.1063/1.4751478","ieee":"P. Bourgade, L. Erdös, and H. Yau, “Bulk universality of general β-ensembles with non-convex potential,” Journal of Mathematical Physics, vol. 53, no. 9. American Institute of Physics, 2012.","short":"P. Bourgade, L. Erdös, H. Yau, Journal of Mathematical Physics 53 (2012).","chicago":"Bourgade, Paul, László Erdös, and Horng Yau. “Bulk Universality of General β-Ensembles with Non-Convex Potential.” Journal of Mathematical Physics. American Institute of Physics, 2012. https://doi.org/10.1063/1.4751478.","ista":"Bourgade P, Erdös L, Yau H. 2012. Bulk universality of general β-ensembles with non-convex potential. Journal of Mathematical Physics. 53(9)."},"status":"public","type":"journal_article","_id":"2778"},{"type":"journal_article","status":"public","_id":"2779","author":[{"full_name":"László Erdös","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hasler","full_name":"Hasler, David G","first_name":"David"}],"publist_id":"4111","title":"Wegner estimate for random magnetic Laplacian on ℤ 2","citation":{"short":"L. Erdös, D. Hasler, Annales Henri Poincare 13 (2012) 1719–1731.","ieee":"L. Erdös and D. Hasler, “Wegner estimate for random magnetic Laplacian on ℤ 2,” Annales Henri Poincare, vol. 13, no. 8. Birkhäuser, pp. 1719–1731, 2012.","ama":"Erdös L, Hasler D. Wegner estimate for random magnetic Laplacian on ℤ 2. Annales Henri Poincare. 2012;13(8):1719-1731. doi:10.1007/s00023-012-0177-9","apa":"Erdös, L., & Hasler, D. (2012). Wegner estimate for random magnetic Laplacian on ℤ 2. Annales Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-012-0177-9","mla":"Erdös, László, and David Hasler. “Wegner Estimate for Random Magnetic Laplacian on ℤ 2.” Annales Henri Poincare, vol. 13, no. 8, Birkhäuser, 2012, pp. 1719–31, doi:10.1007/s00023-012-0177-9.","ista":"Erdös L, Hasler D. 2012. Wegner estimate for random magnetic Laplacian on ℤ 2. Annales Henri Poincare. 13(8), 1719–1731.","chicago":"Erdös, László, and David Hasler. “Wegner Estimate for Random Magnetic Laplacian on ℤ 2.” Annales Henri Poincare. Birkhäuser, 2012. https://doi.org/10.1007/s00023-012-0177-9."},"date_updated":"2021-01-12T06:59:38Z","extern":1,"quality_controlled":0,"publisher":"Birkhäuser","intvolume":" 13","month":"12","abstract":[{"lang":"eng","text":"We consider a two-dimensional magnetic Schrödinger operator on a square lattice with a spatially stationary random magnetic field. We prove Anderson localization near the spectral edges. We use a new approach to establish a Wegner estimate that does not rely on the monotonicity of the energy on the random parameters."}],"page":"1719 - 1731","date_created":"2018-12-11T11:59:33Z","date_published":"2012-12-01T00:00:00Z","volume":13,"doi":"10.1007/s00023-012-0177-9","issue":"8","year":"2012","publication_status":"published","publication":"Annales Henri Poincare","day":"01"},{"intvolume":" 52","month":"05","quality_controlled":0,"publisher":"Springer","abstract":[{"text":"When a binary fluid demixes under a slow temperature ramp, nucleation, coarsening and sedimentation of droplets lead to an oscillatory evolution of the phase-separating system. The advection of the sedimenting droplets is found to be chaotic. The flow is driven by density differences between two phases. Here, we show how image processing can be combined with particle tracking to resolve droplet size and velocity simultaneously. Droplets are used as tracer particles, and the sedimentation velocity is determined. Taking these effects into account, droplets with radii in the range of 4-40 μm are detected and tracked. Based on these data, we resolve the oscillations in the droplet size distribution that are coupled to the convective flow.","lang":"eng"}],"date_created":"2018-12-11T11:59:40Z","date_published":"2012-05-05T00:00:00Z","issue":"5","volume":52,"doi":"10.1007/s00348-011-1243-7","page":"1187 - 1200","publication":"Experiments in Fluids","day":"05","year":"2012","publication_status":"published","status":"public","type":"journal_article","_id":"2802","title":"Particle tracking for polydisperse sedimenting droplets in phase separation","publist_id":"4087","author":[{"last_name":"Lapp","full_name":"Lapp, Tobias","first_name":"Tobias"},{"first_name":"Martin","full_name":"Rohloff, Martin","last_name":"Rohloff"},{"first_name":"Jürgen","last_name":"Vollmer","full_name":"Vollmer, Jürgen T"},{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Björn Hof","last_name":"Hof"}],"extern":1,"date_updated":"2021-01-12T06:59:49Z","citation":{"mla":"Lapp, Tobias, et al. “Particle Tracking for Polydisperse Sedimenting Droplets in Phase Separation.” Experiments in Fluids, vol. 52, no. 5, Springer, 2012, pp. 1187–200, doi:10.1007/s00348-011-1243-7.","ama":"Lapp T, Rohloff M, Vollmer J, Hof B. Particle tracking for polydisperse sedimenting droplets in phase separation. Experiments in Fluids. 2012;52(5):1187-1200. doi:10.1007/s00348-011-1243-7","apa":"Lapp, T., Rohloff, M., Vollmer, J., & Hof, B. (2012). Particle tracking for polydisperse sedimenting droplets in phase separation. Experiments in Fluids. Springer. https://doi.org/10.1007/s00348-011-1243-7","short":"T. Lapp, M. Rohloff, J. Vollmer, B. Hof, Experiments in Fluids 52 (2012) 1187–1200.","ieee":"T. Lapp, M. Rohloff, J. Vollmer, and B. Hof, “Particle tracking for polydisperse sedimenting droplets in phase separation,” Experiments in Fluids, vol. 52, no. 5. Springer, pp. 1187–1200, 2012.","chicago":"Lapp, Tobias, Martin Rohloff, Jürgen Vollmer, and Björn Hof. “Particle Tracking for Polydisperse Sedimenting Droplets in Phase Separation.” Experiments in Fluids. Springer, 2012. https://doi.org/10.1007/s00348-011-1243-7.","ista":"Lapp T, Rohloff M, Vollmer J, Hof B. 2012. Particle tracking for polydisperse sedimenting droplets in phase separation. Experiments in Fluids. 52(5), 1187–1200."}},{"_id":"2803","type":"journal_article","status":"public","citation":{"mla":"De Lózar, Alberto, et al. “Edge State in Pipe Flow Experiments.” Physical Review Letters, vol. 108, no. 21, American Physical Society, 2012, doi:10.1103/PhysRevLett.108.214502.","ama":"De Lózar A, Mellibovsky F, Avila M, Hof B. Edge state in pipe flow experiments. Physical Review Letters. 2012;108(21). doi:10.1103/PhysRevLett.108.214502","apa":"De Lózar, A., Mellibovsky, F., Avila, M., & Hof, B. (2012). Edge state in pipe flow experiments. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.108.214502","ieee":"A. De Lózar, F. Mellibovsky, M. Avila, and B. Hof, “Edge state in pipe flow experiments,” Physical Review Letters, vol. 108, no. 21. American Physical Society, 2012.","short":"A. De Lózar, F. Mellibovsky, M. Avila, B. Hof, Physical Review Letters 108 (2012).","chicago":"De Lózar, Alberto, Fernando Mellibovsky, Marc Avila, and Björn Hof. “Edge State in Pipe Flow Experiments.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.108.214502.","ista":"De Lózar A, Mellibovsky F, Avila M, Hof B. 2012. Edge state in pipe flow experiments. Physical Review Letters. 108(21)."},"date_updated":"2021-01-12T06:59:49Z","extern":1,"author":[{"last_name":"De Lózar","full_name":"de Lózar, Alberto","first_name":"Alberto"},{"full_name":"Mellibovsky, Fernando","last_name":"Mellibovsky","first_name":"Fernando"},{"first_name":"Marc","full_name":"Avila, Marc","last_name":"Avila"},{"last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Björn Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4086","title":"Edge state in pipe flow experiments","abstract":[{"text":"Recent numerical studies suggest that in pipe and related shear flows, the region of phase space separating laminar from turbulent motion is organized by a chaotic attractor, called an edge state, which mediates the transition process. We here confirm the existence of the edge state in laboratory experiments. We observe that it governs the dynamics during the decay of turbulence underlining its potential relevance for turbulence control. In addition we unveil two unstable traveling wave solutions underlying the experimental flow fields. This observation corroborates earlier suggestions that unstable solutions organize turbulence and its stability border.","lang":"eng"}],"publisher":"American Physical Society","quality_controlled":0,"month":"05","intvolume":" 108","publication_status":"published","year":"2012","day":"21","publication":"Physical Review Letters","issue":"21","date_published":"2012-05-21T00:00:00Z","volume":108,"doi":"10.1103/PhysRevLett.108.214502","date_created":"2018-12-11T11:59:41Z"},{"year":"2012","publication_status":"published","publication":"Physical Review Letters","day":"10","date_created":"2018-12-11T11:59:41Z","issue":"6","doi":"10.1103/PhysRevLett.109.068701","volume":109,"date_published":"2012-08-10T00:00:00Z","abstract":[{"lang":"eng","text":"The analysis of the size distribution of droplets condensing on a substrate (breath figures) is a test ground for scaling theories. Here, we show that a faithful description of these distributions must explicitly deal with the growth mechanisms of the droplets. This finding establishes a gateway connecting nucleation and growth of the smallest droplets on surfaces to gross features of the evolution of the droplet size distribution"}],"publisher":"American Physical Society","quality_controlled":0,"intvolume":" 109","month":"08","date_updated":"2021-01-12T06:59:50Z","citation":{"chicago":"Blaschke, Johannes, Tobias Lapp, Björn Hof, and Jürgen Vollmer. “Breath Figures: Nucleation, Growth, Coalescence, and the Size Distribution of Droplets.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.109.068701.","ista":"Blaschke J, Lapp T, Hof B, Vollmer J. 2012. Breath figures: Nucleation, growth, coalescence, and the size distribution of droplets. Physical Review Letters. 109(6).","mla":"Blaschke, Johannes, et al. “Breath Figures: Nucleation, Growth, Coalescence, and the Size Distribution of Droplets.” Physical Review Letters, vol. 109, no. 6, American Physical Society, 2012, doi:10.1103/PhysRevLett.109.068701.","ieee":"J. Blaschke, T. Lapp, B. Hof, and J. Vollmer, “Breath figures: Nucleation, growth, coalescence, and the size distribution of droplets,” Physical Review Letters, vol. 109, no. 6. American Physical Society, 2012.","short":"J. Blaschke, T. Lapp, B. Hof, J. Vollmer, Physical Review Letters 109 (2012).","apa":"Blaschke, J., Lapp, T., Hof, B., & Vollmer, J. (2012). Breath figures: Nucleation, growth, coalescence, and the size distribution of droplets. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.109.068701","ama":"Blaschke J, Lapp T, Hof B, Vollmer J. Breath figures: Nucleation, growth, coalescence, and the size distribution of droplets. Physical Review Letters. 2012;109(6). doi:10.1103/PhysRevLett.109.068701"},"extern":1,"author":[{"full_name":"Blaschke, Johannes","last_name":"Blaschke","first_name":"Johannes"},{"last_name":"Lapp","full_name":"Lapp, Tobias","first_name":"Tobias"},{"last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Björn Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vollmer","full_name":"Vollmer, Jürgen T","first_name":"Jürgen"}],"publist_id":"4085","title":"Breath figures: Nucleation, growth, coalescence, and the size distribution of droplets","_id":"2804","type":"journal_article","status":"public"},{"conference":{"name":"NIPS: Neural Information Processing Systems","end_date":"2012-12-06","location":"Lake Tahoe, NV, United States","start_date":"2012-12-03"},"type":"conference","status":"public","_id":"2825","author":[{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"publist_id":"3975","department":[{"_id":"ChLa"}],"title":"Dynamic pruning of factor graphs for maximum marginal prediction","date_updated":"2021-01-12T06:59:59Z","citation":{"chicago":"Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction,” 1:82–90. Neural Information Processing Systems, 2012.","ista":"Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction. NIPS: Neural Information Processing Systems vol. 1, 82–90.","mla":"Lampert, Christoph. Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction. Vol. 1, Neural Information Processing Systems, 2012, pp. 82–90.","apa":"Lampert, C. (2012). Dynamic pruning of factor graphs for maximum marginal prediction (Vol. 1, pp. 82–90). Presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States: Neural Information Processing Systems.","ama":"Lampert C. Dynamic pruning of factor graphs for maximum marginal prediction. In: Vol 1. Neural Information Processing Systems; 2012:82-90.","ieee":"C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,” presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States, 2012, vol. 1, pp. 82–90.","short":"C. Lampert, in:, Neural Information Processing Systems, 2012, pp. 82–90."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","scopus_import":1,"publisher":"Neural Information Processing Systems","intvolume":" 1","month":"12","abstract":[{"text":"We study the problem of maximum marginal prediction (MMP) in probabilistic graphical models, a task that occurs, for example, as the Bayes optimal decision rule under a Hamming loss. MMP is typically performed as a two-stage procedure: one estimates each variable's marginal probability and then forms a prediction from the states of maximal probability. In this work we propose a simple yet effective technique for accelerating MMP when inference is sampling-based: instead of the above two-stage procedure we directly estimate the posterior probability of each decision variable. This allows us to identify the point of time when we are sufficiently certain about any individual decision. Whenever this is the case, we dynamically prune the variables we are confident about from the underlying factor graph. Consequently, at any time only samples of variables whose decision is still uncertain need to be created. Experiments in two prototypical scenarios, multi-label classification and image inpainting, show that adaptive sampling can drastically accelerate MMP without sacrificing prediction accuracy.","lang":"eng"}],"oa_version":"None","page":"82 - 90","date_created":"2018-12-11T11:59:48Z","date_published":"2012-12-01T00:00:00Z","volume":1,"year":"2012","publication_status":"published","language":[{"iso":"eng"}],"day":"01"},{"volume":301,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/"}],"month":"05","intvolume":" 301","abstract":[{"text":"We study evolutionary game theory in a setting where individuals learn from each other. We extend the traditional approach by assuming that a population contains individuals with different learning abilities. In particular, we explore the situation where individuals have different search spaces, when attempting to learn the strategies of others. The search space of an individual specifies the set of strategies learnable by that individual. The search space is genetically given and does not change under social evolutionary dynamics. We introduce a general framework and study a specific example in the context of direct reciprocity. For this example, we obtain the counter intuitive result that cooperation can only evolve for intermediate benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection. Our paper is a step toward making a connection between computational learning theory and evolutionary game dynamics.","lang":"eng"}],"oa_version":"Submitted Version","pmid":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-01-12T07:00:12Z","type":"journal_article","status":"public","_id":"2848","page":"161 - 173","doi":"10.1016/j.jtbi.2012.02.021","date_published":"2012-05-21T00:00:00Z","date_created":"2018-12-11T11:59:55Z","year":"2012","day":"21","publication":"Journal of Theoretical Biology","quality_controlled":"1","publisher":"Elsevier","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"publist_id":"3946","external_id":{"pmid":["22394652"]},"title":"Evolutionary game dynamics in populations with different learners","citation":{"ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.","chicago":"Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.","ieee":"K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier, pp. 161–173, 2012.","short":"K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.","apa":"Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021","ama":"Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 2012;301:161-173. doi:10.1016/j.jtbi.2012.02.021","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"title":"On the configuration space of Steiner minimal trees","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Nataliya","full_name":"Strelkova, Nataliya","last_name":"Strelkova"}],"publist_id":"3943","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” Russian Mathematical Surveys, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.","apa":"Edelsbrunner, H., & Strelkova, N. (2012). On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. IOP Publishing Ltd. https://doi.org/10.1070/RM2012v067n06ABEH004820","ama":"Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 2012;67(6):1167-1168. doi:10.1070/RM2012v067n06ABEH004820","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” Russian Mathematical Surveys. IOP Publishing Ltd., 2012. https://doi.org/10.1070/RM2012v067n06ABEH004820.","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168."},"oa":1,"publisher":"IOP Publishing Ltd.","quality_controlled":"1","date_created":"2018-12-11T11:59:55Z","doi":"10.1070/RM2012v067n06ABEH004820","date_published":"2012-01-01T00:00:00Z","page":"1167 - 1168","publication":"Russian Mathematical Surveys","day":"01","year":"2012","has_accepted_license":"1","pubrep_id":"546","status":"public","type":"journal_article","_id":"2849","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:51Z","ddc":["000"],"date_updated":"2021-01-12T07:00:13Z","intvolume":" 67","month":"01","scopus_import":1,"oa_version":"Submitted Version","issue":"6","volume":67,"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf","date_created":"2018-12-12T10:14:26Z","creator":"system","file_size":392021,"date_updated":"2020-07-14T12:45:51Z","file_id":"5078","checksum":"44ee8d173487e8ed41a51136816bbeb4","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published"},{"publisher":"Elsevier","quality_controlled":0,"intvolume":" 79","month":"07","abstract":[{"lang":"eng","text":"Cytokinin (CK) activity is regulated by the complex interplay of their metabolism, transport, stability and cellular/tissue localization. O-glucosides of zeatin-type CKs are postulated to be storage and/or transport forms. Active CK levels are determined in part by their differential distribution of CK metabolites across different subcellular compartments. We have previously shown that overexpressing chloroplast-localized Zm-p60.1, a maize β-glucosidase capable of releasing active cytokinins from their O- and N3-glucosides, perturbs CK homeostasis in transgenic tobacco. We obtained tobacco (Nicotiana tabacum L., cv Petit Havana SR1) plants overexpressing a recombinant Zm-p60.1 that is targeted to the vacuole. The protein is correctly processed and localized to the vacuole. When grown on medium containing exogenous zeatin, transgenic seedlings rapidly accumulate fresh weight due to ectopic growths at the base of the hypocotyl. The presence of the enzyme in these ectopic structures is shown by histochemical staining. CK quantification reveals that these transgenic seedlings are unable to accumulate zeatin-O-glucoside to levels similar to those observed in the wild type. When crossed with tobacco overexpressing the zeatin-O-glucosyltransferase gene from Phaseolus, the vacuolar variant shows an almost complete reversion in the root elongation assay. This is the first evidence from intact plants that the vacuole is the storage organelle for CK O-glucosides and that they are available to attack by Zm-p60.1. We propose the use of Zm-p60.1 as a robust molecular tool that exploits the reversibility of O-glucosylation and enables delicate manipulations of active CK content at the cellular level."}],"page":"67 - 77","date_created":"2018-12-11T12:00:05Z","date_published":"2012-07-01T00:00:00Z","volume":79,"doi":"10.1016/j.phytochem.2012.03.012","publication_status":"published","year":"2012","publication":"Phytochemistry","day":"01","type":"journal_article","status":"public","_id":"2876","author":[{"full_name":"Kiran, Nagavalli S","last_name":"Kiran","first_name":"Nagavalli"},{"last_name":"Benková","full_name":"Eva Benková","orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Reková","full_name":"Reková, Alena","first_name":"Alena"},{"full_name":"Dubová, Jaroslava","last_name":"Dubová","first_name":"Jaroslava"},{"first_name":"Jiří","full_name":"Malbeck, Jiří","last_name":"Malbeck"},{"full_name":"Palme, Klaus","last_name":"Palme","first_name":"Klaus"},{"first_name":"Břetislav","full_name":"Brzobohatý, Břetislav","last_name":"Brzobohatý"}],"publist_id":"3886","title":"Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole","date_updated":"2021-01-12T07:00:25Z","citation":{"mla":"Kiran, Nagavalli, et al. “Retargeting a Maize β-Glucosidase to the Vacuole - Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the Vacuole.” Phytochemistry, vol. 79, Elsevier, 2012, pp. 67–77, doi:10.1016/j.phytochem.2012.03.012.","ieee":"N. Kiran et al., “Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole,” Phytochemistry, vol. 79. Elsevier, pp. 67–77, 2012.","short":"N. Kiran, E. Benková, A. Reková, J. Dubová, J. Malbeck, K. Palme, B. Brzobohatý, Phytochemistry 79 (2012) 67–77.","ama":"Kiran N, Benková E, Reková A, et al. Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry. 2012;79:67-77. doi:10.1016/j.phytochem.2012.03.012","apa":"Kiran, N., Benková, E., Reková, A., Dubová, J., Malbeck, J., Palme, K., & Brzobohatý, B. (2012). Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry. Elsevier. https://doi.org/10.1016/j.phytochem.2012.03.012","chicago":"Kiran, Nagavalli, Eva Benková, Alena Reková, Jaroslava Dubová, Jiří Malbeck, Klaus Palme, and Břetislav Brzobohatý. “Retargeting a Maize β-Glucosidase to the Vacuole - Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the Vacuole.” Phytochemistry. Elsevier, 2012. https://doi.org/10.1016/j.phytochem.2012.03.012.","ista":"Kiran N, Benková E, Reková A, Dubová J, Malbeck J, Palme K, Brzobohatý B. 2012. Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry. 79, 67–77."},"extern":1},{"publication_status":"published","year":"2012","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","day":"05","page":"1469 - 1478","date_created":"2018-12-11T12:00:05Z","doi":"10.1098/rstb.2011.0233","volume":367,"issue":"1595","date_published":"2012-06-05T00:00:00Z","abstract":[{"text":"Phytohormones are important plant growth regulators that control many developmental processes, such as cell division, cell differentiation, organogenesis and morphogenesis. They regulate a multitude of apparently unrelated physiological processes, often with overlapping roles, and they mutually modulate their effects. These features imply important synergistic and antagonistic interactions between the various plant hormones. Auxin and cytokinin are central hormones involved in the regulation of plant growth and development, including processes determining root architecture, such as root pole establishment during early embryogenesis, root meristem maintenance and lateral root organogenesis. Thus, to control root development both pathways put special demands on the mechanisms that balance their activities and mediate their interactions. Here, we summarize recent knowledge on the role of auxin and cytokinin in the regulation of root architecture with special focus on lateral root organogenesis, discuss the latest findings on the molecular mechanisms of their interactions, and present forward genetic screen as a tool to identify novel molecular components of the auxin and cytokinin crosstalk.","lang":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3321684/","open_access":"1"}],"oa":1,"quality_controlled":0,"publisher":"Royal Society, The","intvolume":" 367","month":"06","date_updated":"2021-01-12T07:00:25Z","citation":{"ista":"Bielach A, Duclercq J, Marhavý P, Benková E. 2012. Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 367(1595), 1469–1478.","chicago":"Bielach, Agnieszka, Jérôme Duclercq, Peter Marhavý, and Eva Benková. “Genetic Approach towards the Identification of Auxin - Cytokinin Crosstalk Components Involved in Root Development.” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. Royal Society, The, 2012. https://doi.org/10.1098/rstb.2011.0233.","ama":"Bielach A, Duclercq J, Marhavý P, Benková E. Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. Philosophical Transactions of the Royal Society of London Series B, Biological Sciences. 2012;367(1595):1469-1478. doi:10.1098/rstb.2011.0233","apa":"Bielach, A., Duclercq, J., Marhavý, P., & Benková, E. (2012). Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. Royal Society, The. https://doi.org/10.1098/rstb.2011.0233","ieee":"A. Bielach, J. Duclercq, P. Marhavý, and E. Benková, “Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development,” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences, vol. 367, no. 1595. Royal Society, The, pp. 1469–1478, 2012.","short":"A. Bielach, J. Duclercq, P. Marhavý, E. Benková, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 367 (2012) 1469–1478.","mla":"Bielach, Agnieszka, et al. “Genetic Approach towards the Identification of Auxin - Cytokinin Crosstalk Components Involved in Root Development.” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences, vol. 367, no. 1595, Royal Society, The, 2012, pp. 1469–78, doi:10.1098/rstb.2011.0233."},"extern":1,"author":[{"full_name":"Bielach, Agnieszka","last_name":"Bielach","first_name":"Agnieszka"},{"first_name":"Jérôme","last_name":"Duclercq","full_name":"Duclercq, Jérôme"},{"orcid":"0000-0001-5227-5741","full_name":"Peter Marhavy","last_name":"Marhavy","id":"3F45B078-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Eva Benková","last_name":"Benková"}],"publist_id":"3887","title":"Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development","_id":"2875","type":"journal_article","status":"public"},{"status":"public","type":"journal_article","_id":"2878","title":"Pin1 independent leaf initiation in Arabidopsis","publist_id":"3884","author":[{"full_name":"Guenot, Bernadette","last_name":"Guenot","first_name":"Bernadette"},{"full_name":"Bayer, Emmanuelle","last_name":"Bayer","first_name":"Emmanuelle"},{"first_name":"Daniel","last_name":"Kierzkowski","full_name":"Kierzkowski, Daniel"},{"full_name":"Smith, Richard S","last_name":"Smith","first_name":"Richard"},{"last_name":"Mandel","full_name":"Mandel, Therese","first_name":"Therese"},{"last_name":"Žádníková","full_name":"Žádníková, Petra","first_name":"Petra"},{"full_name":"Eva Benková","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kuhlemeier","full_name":"Kuhlemeier, Cris","first_name":"Cris"}],"extern":1,"date_updated":"2021-01-12T07:00:26Z","citation":{"mla":"Guenot, Bernadette, et al. “Pin1 Independent Leaf Initiation in Arabidopsis.” Plant Physiology, vol. 159, no. 4, American Society of Plant Biologists, 2012, pp. 1501–10, doi:10.1104/pp.112.200402.","apa":"Guenot, B., Bayer, E., Kierzkowski, D., Smith, R., Mandel, T., Žádníková, P., … Kuhlemeier, C. (2012). Pin1 independent leaf initiation in Arabidopsis. Plant Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.112.200402","ama":"Guenot B, Bayer E, Kierzkowski D, et al. Pin1 independent leaf initiation in Arabidopsis. Plant Physiology. 2012;159(4):1501-1510. doi:10.1104/pp.112.200402","ieee":"B. Guenot et al., “Pin1 independent leaf initiation in Arabidopsis,” Plant Physiology, vol. 159, no. 4. American Society of Plant Biologists, pp. 1501–1510, 2012.","short":"B. Guenot, E. Bayer, D. Kierzkowski, R. Smith, T. Mandel, P. Žádníková, E. Benková, C. Kuhlemeier, Plant Physiology 159 (2012) 1501–1510.","chicago":"Guenot, Bernadette, Emmanuelle Bayer, Daniel Kierzkowski, Richard Smith, Therese Mandel, Petra Žádníková, Eva Benková, and Cris Kuhlemeier. “Pin1 Independent Leaf Initiation in Arabidopsis.” Plant Physiology. American Society of Plant Biologists, 2012. https://doi.org/10.1104/pp.112.200402.","ista":"Guenot B, Bayer E, Kierzkowski D, Smith R, Mandel T, Žádníková P, Benková E, Kuhlemeier C. 2012. Pin1 independent leaf initiation in Arabidopsis. Plant Physiology. 159(4), 1501–1510."},"intvolume":" 159","month":"08","quality_controlled":0,"publisher":"American Society of Plant Biologists","abstract":[{"text":"Phyllotaxis, the regular arrangement of leaves and flowers around the stem, is a key feature of plant architecture. Current models propose that the spatiotemporal regulation of organ initiation is controlled by a positive feedback loop between the plant hormone auxin and its efflux carrier PIN-FORMED1 (PIN1). Consequently, pin1 mutants give rise to naked inflorescence stalks with few or no flowers, indicating that PIN1 plays a crucial role in organ initiation. However, pin1 mutants do produce leaves. In order to understand the regulatory mechanisms controlling leaf initiation in Arabidopsis (Arabidopsis thaliana) rosettes, we have characterized the vegetative pin1 phenotype in detail. We show that although the timing of leaf initiation in vegetative pin1 mutants is variable and divergence angles clearly deviate from the canonical 137° value, leaves are not positioned at random during early developmental stages. Our data further indicate that other PIN proteins are unlikely to explain the persistence of leaf initiation and positioning during pin1 vegetative development. Thus, phyllotaxis appears to be more complex than suggested by current mechanistic models.","lang":"eng"}],"date_created":"2018-12-11T12:00:06Z","doi":"10.1104/pp.112.200402","volume":159,"issue":"4","date_published":"2012-08-01T00:00:00Z","page":"1501 - 1510","publication":"Plant Physiology","day":"01","publication_status":"published","year":"2012"},{"author":[{"last_name":"Bencivenga","full_name":"Bencivenga, Stefano","first_name":"Stefano"},{"full_name":"Simonini, Sara","last_name":"Simonini","first_name":"Sara"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","full_name":"Eva Benková","orcid":"0000-0002-8510-9739","last_name":"Benková"},{"full_name":"Colombo, Lucia","last_name":"Colombo","first_name":"Lucia"}],"publist_id":"3885","title":"The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis","date_updated":"2021-01-12T07:00:26Z","citation":{"mla":"Bencivenga, Stefano, et al. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” Plant Cell, vol. 24, no. 7, American Society of Plant Biologists, 2012, pp. 2886–97, doi:10.1105/tpc.112.100164.","ama":"Bencivenga S, Simonini S, Benková E, Colombo L. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. Plant Cell. 2012;24(7):2886-2897. doi:10.1105/tpc.112.100164","apa":"Bencivenga, S., Simonini, S., Benková, E., & Colombo, L. (2012). The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.112.100164","ieee":"S. Bencivenga, S. Simonini, E. Benková, and L. Colombo, “The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis,” Plant Cell, vol. 24, no. 7. American Society of Plant Biologists, pp. 2886–2897, 2012.","short":"S. Bencivenga, S. Simonini, E. Benková, L. Colombo, Plant Cell 24 (2012) 2886–2897.","chicago":"Bencivenga, Stefano, Sara Simonini, Eva Benková, and Lucia Colombo. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” Plant Cell. American Society of Plant Biologists, 2012. https://doi.org/10.1105/tpc.112.100164.","ista":"Bencivenga S, Simonini S, Benková E, Colombo L. 2012. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. Plant Cell. 24(7), 2886–2897."},"extern":1,"type":"journal_article","status":"public","_id":"2879","page":"2886 - 2897","date_created":"2018-12-11T12:00:06Z","volume":24,"issue":"7","doi":"10.1105/tpc.112.100164","date_published":"2012-07-01T00:00:00Z","publication_status":"published","year":"2012","publication":"Plant Cell","day":"01","quality_controlled":0,"publisher":"American Society of Plant Biologists","intvolume":" 24","month":"07","abstract":[{"lang":"eng","text":"Hormones, such as auxin and cytokinin, are involved in the complex molecular network that regulates the coordinated development of plant organs. Genes controlling ovule patterning have been identified and studied in detail; however, the roles of auxin and cytokinin in ovule development are largely unknown. Here we show that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3 triple mutant with severely reduced cytokinin perception, expression of the auxin efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle (spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3 triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin N6-benzylaminopurine also altered both auxin distribution and patterning of the ovule; this process required the homeodomain transcription factor BELL1 (BEL1). Thus, this article shows that cytokinin regulates ovule development through the regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously described as key regulators of ovule development, are needed for the auxin and cytokinin signaling pathways for the correct patterning of the ovule."}]},{"acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"has_accepted_license":"1","year":"2012","day":"01","publication":"Leibniz International Proceedings in Informatics","page":"362 - 373","date_published":"2012-12-01T00:00:00Z","doi":"10.4230/LIPIcs.FSTTCS.2012.362","date_created":"2018-12-11T12:00:10Z","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"citation":{"chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In Leibniz International Proceedings in Informatics, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362.","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” Leibniz International Proceedings in Informatics, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in Leibniz International Proceedings in Informatics, Hyderabad, India, 2012, vol. 18, pp. 362–373.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","apa":"Boker, U., & Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In Leibniz International Proceedings in Informatics (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: Leibniz International Proceedings in Informatics. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:10.4230/LIPIcs.FSTTCS.2012.362"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"3867","title":"Approximate determinization of quantitative automata","abstract":[{"lang":"eng","text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"12","intvolume":" 18","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4826","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","date_updated":"2020-07-14T12:45:52Z","file_size":559069,"creator":"system","date_created":"2018-12-12T10:10:37Z","file_name":"IST-2017-805-v1+1_34.pdf"}],"language":[{"iso":"eng"}],"volume":18,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"_id":"2891","type":"conference","conference":{"location":"Hyderabad, India","end_date":"2012-12-17","start_date":"2012-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","pubrep_id":"805","date_updated":"2021-01-12T07:00:31Z","ddc":["004"],"file_date_updated":"2020-07-14T12:45:52Z","department":[{"_id":"ToHe"}]},{"citation":{"chicago":"Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings of the Tenth ACM International Conference on Embedded Software, 53–62. ACM, 2012. https://doi.org/10.1145/2380356.2380371.","ista":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.","mla":"Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62, doi:10.1145/2380356.2380371.","short":"P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62.","ieee":"P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in Proceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.","ama":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: Proceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:53-62. doi:10.1145/2380356.2380371","apa":"Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012). Synthesis from incompatible specifications. In Proceedings of the tenth ACM international conference on Embedded software (pp. 53–62). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380371"},"date_updated":"2021-01-12T07:00:30Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3868","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gopi, Sivakanth","last_name":"Gopi","first_name":"Sivakanth"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"full_name":"Totla, Nishant","last_name":"Totla","first_name":"Nishant"}],"department":[{"_id":"ToHe"}],"title":"Synthesis from incompatible specifications","_id":"2890","conference":{"start_date":"2012-10-07","end_date":"2012-10-12","location":"Tampere, Finland","name":"EMSOFT: Embedded Software "},"type":"conference","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"status":"public","publication_status":"published","year":"2012","language":[{"iso":"eng"}],"publication":"Proceedings of the tenth ACM international conference on Embedded software","day":"01","page":"53 - 62","ec_funded":1,"date_created":"2018-12-11T12:00:10Z","date_published":"2012-10-01T00:00:00Z","doi":"10.1145/2380356.2380371","abstract":[{"lang":"eng","text":"Systems are often specified using multiple requirements on their behavior. In practice, these requirements can be contradictory. The classical approach to specification, verification, and synthesis demands more detailed specifications that resolve any contradictions in the requirements. These detailed specifications are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative frameworks allow the formalization of the intuitive idea that what is desired is an implementation that comes "closest" to satisfying the mutually incompatible requirements, according to a measure of fit that can be defined by the requirements engineer. One flexible framework for quantifying how "well" an implementation satisfies a specification is offered by simulation distances that are parameterized by an error model. We introduce this framework, study its properties, and provide an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite-state implementation that minimizes the maximal simulation distance to the given requirements. Furthermore, we generalize the framework to handle infinite alphabets (for example, realvalued domains). We also demonstrate how quantitative specifications based on simulation distances might lead to smaller and easier to modify specifications. Finally, we illustrate our approach using case studies on error correcting codes and scheduler synthesis."}],"oa_version":"None","publisher":"ACM","scopus_import":1,"quality_controlled":"1","month":"10"},{"ec_funded":1,"volume":7590,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 7590","month":"09","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"None","abstract":[{"text":"Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.","lang":"eng"}],"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:00:29Z","status":"public","conference":{"start_date":"2012-09-30","end_date":"2012-10-05","location":"Innsbruck, Austria","name":"MODELS: Model-driven Engineering Languages and Systems"},"type":"conference","_id":"2888","date_created":"2018-12-11T12:00:09Z","doi":"10.1007/978-3-642-33666-9_1","date_published":"2012-09-01T00:00:00Z","page":"1 - 2","publication":"Conference proceedings MODELS 2012","day":"01","year":"2012","publisher":"Springer","quality_controlled":"1","title":"Quantitative reactive models","publist_id":"3870","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Henzinger, T. A. (2012). Quantitative reactive models. In Conference proceedings MODELS 2012 (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. https://doi.org/10.1007/978-3-642-33666-9_1","ama":"Henzinger TA. Quantitative reactive models. In: Conference Proceedings MODELS 2012. Vol 7590. Springer; 2012:1-2. doi:10.1007/978-3-642-33666-9_1","short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","ieee":"T. A. Henzinger, “Quantitative reactive models,” in Conference proceedings MODELS 2012, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” Conference Proceedings MODELS 2012, vol. 7590, Springer, 2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In Conference Proceedings MODELS 2012, 7590:1–2. Springer, 2012. https://doi.org/10.1007/978-3-642-33666-9_1."},"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}]},{"date_published":"2012-08-06T00:00:00Z","doi":"10.1109/ISVD.2012.11","date_created":"2018-12-11T12:00:15Z","page":"41 - 48","day":"06","has_accepted_license":"1","year":"2012","publisher":"IEEE","quality_controlled":"1","oa":1,"title":"The adaptive topology of a digital image","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","last_name":"Symonova"}],"publist_id":"3844","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.","chicago":"Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. https://doi.org/10.1109/ISVD.2012.11.","ieee":"H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.","short":"H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.","ama":"Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In: IEEE; 2012:41-48. doi:10.1109/ISVD.2012.11","apa":"Edelsbrunner, H., & Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/ISVD.2012.11","mla":"Edelsbrunner, Herbert, and Olga Symonova. The Adaptive Topology of a Digital Image. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11."},"file":[{"creator":"system","file_size":760548,"date_updated":"2020-07-14T12:45:52Z","file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","date_created":"2018-12-12T10:09:41Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"444869a4e8abf07834f88b6e5cb5e9c3","file_id":"4765"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"08","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images.","lang":"eng"}],"department":[{"_id":"HeEd"},{"_id":"MaJö"}],"file_date_updated":"2020-07-14T12:45:52Z","ddc":["000"],"date_updated":"2021-01-12T07:00:35Z","status":"public","pubrep_id":"545","type":"conference","conference":{"start_date":"2012-06-27","end_date":"2012-06-29","location":"New Brunswick, NJ, USA ","name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering"},"_id":"2903"},{"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1733"}]},"volume":96,"ec_funded":1,"abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.2450"}],"month":"10","intvolume":" 96","date_updated":"2023-02-23T10:12:05Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"2916","type":"conference","conference":{"start_date":"2012-09-06","location":"Napoli, Italy","end_date":"2012-09-08","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"status":"public","year":"2012","day":"07","publication":"Electronic Proceedings in Theoretical Computer Science","page":"29 - 42","date_published":"2012-10-07T00:00:00Z","doi":"10.4204/EPTCS.96.3","date_created":"2018-12-11T12:00:19Z","quality_controlled":"1","publisher":"EPTCS","oa":1,"citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS; 2012:29-42. doi:10.4204/EPTCS.96.3","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3827","author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1210.2450"]},"title":"Interface Simulation Distances","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"oa_version":"None","abstract":[{"lang":"eng","text":"The search for extra-terrestrial intelligence (SETI) has been performed principally as a one-way survey, listening of radio frequencies across the Milky Way and other galaxies. However, scientists have engaged in an active messaging only rarely. This suggests the simple rationale that if other civilizations exist and take a similar approach to ours, namely listening but not broadcasting, the result is a silent universe. A simple game theoretical model, the prisoner's dilemma, explains this situation: each player (civilization) can passively search (defect), or actively search and broadcast (cooperate). In order to maximize the payoff (or, equivalently, minimize the risks) the best strategy is not to broadcast. In fact, the active search has been opposed on the basis that it might be dangerous to expose ourselves. However, most of these ideas have not been based on objective arguments, and ignore accounting of the possible gains and losses. Thus, the question stands: should we perform an active search? I develop a game-theoretical framework where civilizations can be of different types, and explicitly apply it to a situation where societies are either interested in establishing a two-way communication or belligerent and in urge to exploit ours. The framework gives a quantitative solution (a mixed-strategy), which is how frequent we should perform the active SETI. This frequency is roughly proportional to the inverse of the risk, and can be extremely small. However, given the immense amount of stars being scanned, it supports active SETI. The model is compared with simulations, and the possible actions are evaluated through the San Marino scale, measuring the risks of messaging."}],"month":"11","intvolume":" 12","quality_controlled":"1","scopus_import":1,"publisher":"Cambridge University Press","day":"06","language":[{"iso":"eng"}],"publication":"International Journal of Astrobiology","year":"2012","publication_status":"published","issue":"1","doi":"10.1017/S1473550412000407","volume":12,"date_published":"2012-11-06T00:00:00Z","date_created":"2018-12-11T12:00:19Z","page":"53 - 62","_id":"2917","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"de Vladar H. The game of active search for extra terrestrial intelligence Breaking the Great Silence . International Journal of Astrobiology. 2012;12(1):53-62. doi:10.1017/S1473550412000407","apa":"de Vladar, H. (2012). The game of active search for extra terrestrial intelligence Breaking the Great Silence . International Journal of Astrobiology. Cambridge University Press. https://doi.org/10.1017/S1473550412000407","ieee":"H. de Vladar, “The game of active search for extra terrestrial intelligence Breaking the Great Silence ,” International Journal of Astrobiology, vol. 12, no. 1. Cambridge University Press, pp. 53–62, 2012.","short":"H. de Vladar, International Journal of Astrobiology 12 (2012) 53–62.","mla":"de Vladar, Harold. “The Game of Active Search for Extra Terrestrial Intelligence Breaking the Great Silence .” International Journal of Astrobiology, vol. 12, no. 1, Cambridge University Press, 2012, pp. 53–62, doi:10.1017/S1473550412000407.","ista":"de Vladar H. 2012. The game of active search for extra terrestrial intelligence Breaking the Great Silence . International Journal of Astrobiology. 12(1), 53–62.","chicago":"Vladar, Harold de. “The Game of Active Search for Extra Terrestrial Intelligence Breaking the Great Silence .” International Journal of Astrobiology. Cambridge University Press, 2012. https://doi.org/10.1017/S1473550412000407."},"date_updated":"2021-01-12T07:00:41Z","title":"The game of active search for extra terrestrial intelligence Breaking the Great Silence ","department":[{"_id":"NiBa"}],"author":[{"first_name":"Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","last_name":"Vladar","full_name":"Vladar, Harold","orcid":"0000-0002-5985-7653"}],"publist_id":"3821"},{"abstract":[{"lang":"eng","text":"We have selected problems that may not yet be well known, but have the\npotential to push the research in interesting directions. In particular, we state\nproblems that do not require specific knowledge outside the standard circle of ideas\nin discrete geometry. Despite the relatively simple statements, these problems are\nrelated to current research and their solutions are likely to require new ideas and\napproaches. We have chosen problems from different fields to make this short paper\nattractive to a wide range of specialists."}],"month":"01","quality_controlled":0,"publisher":"Springer","day":"01","publication":"Automatic Control and Computer Sciences","year":"2012","publication_status":"published","volume":"in print","date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T12:00:18Z","_id":"2911","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T07:00:38Z","citation":{"chicago":"Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems in Discrete and Computational Geometry.” Automatic Control and Computer Sciences. Springer, 2012.","ista":"Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. in print.","mla":"Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational Geometry.” Automatic Control and Computer Sciences, vol. in print, Springer, 2012.","short":"H. Edelsbrunner, A. Ivanov, R. Karasev, Automatic Control and Computer Sciences in print (2012).","ieee":"H. Edelsbrunner, A. Ivanov, and R. Karasev, “Open problems in discrete and computational geometry,” Automatic Control and Computer Sciences, vol. in print. Springer, 2012.","ama":"Edelsbrunner H, Ivanov A, Karasev R. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. 2012;in print.","apa":"Edelsbrunner, H., Ivanov, A., & Karasev, R. (2012). Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. Springer."},"title":"Open problems in discrete and computational geometry","author":[{"last_name":"Edelsbrunner","full_name":"Herbert Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Ivanov","full_name":"Ivanov, Alexander","first_name":"Alexander"},{"first_name":"Roman","full_name":"Karasev, Roman","last_name":"Karasev"}],"publist_id":"3832"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. https://doi.org/10.1007/978-3-642-32147-4_40.","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.","mla":"Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions. Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","ieee":"A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.","ama":"Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol 7422. Springer; 2012:451-462. doi:10.1007/978-3-642-32147-4_40","apa":"Huber, A., & Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer. https://doi.org/10.1007/978-3-642-32147-4_40"},"title":"Towards minimizing k-submodular functions","author":[{"first_name":"Anna","last_name":"Huber","full_name":"Huber, Anna"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"publist_id":"3806","acknowledgement":"We would like to thank Andrei Krokhin for encourag- ing our cooperation, for helpful discussions, and for his critical reading of the manuscript.\r\n","publisher":"Springer","quality_controlled":"1","oa":1,"day":"01","year":"2012","doi":"10.1007/978-3-642-32147-4_40","date_published":"2012-04-01T00:00:00Z","date_created":"2018-12-11T12:00:24Z","page":"451 - 462","_id":"2930","status":"public","type":"conference","conference":{"start_date":"2012-04-19","location":"Athens, Greece","end_date":"2012-04-21","name":"ISCO: International Symposium on Combinatorial Optimization"},"date_updated":"2021-01-12T07:00:46Z","department":[{"_id":"VlKo"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.\r\n"}],"month":"04","intvolume":" 7422","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5469"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":7422},{"page":"16","date_created":"2018-12-11T12:00:23Z","date_published":"2012-05-29T00:00:00Z","publication_status":"published","year":"2012","publication":"arXiv","language":[{"iso":"eng"}],"day":"29","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1205.6352","open_access":"1"}],"publisher":"ArXiv","month":"05","abstract":[{"text":" This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. ","lang":"eng"}],"oa_version":"Preprint","article_processing_charge":"No","external_id":{"arxiv":["1205.6352"]},"publist_id":"3809","author":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"full_name":"Schoenemann, Thomas","last_name":"Schoenemann","first_name":"Thomas"}],"title":"Generalized sequential tree-reweighted message passing","department":[{"_id":"VlKo"}],"citation":{"mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, ArXiv, 2012.","ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.","short":"V. Kolmogorov, T. Schoenemann, ArXiv (2012).","ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. arXiv. 2012.","apa":"Kolmogorov, V., & Schoenemann, T. (2012). Generalized sequential tree-reweighted message passing. arXiv. ArXiv.","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv. ArXiv, 2012.","ista":"Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv, ."},"date_updated":"2021-01-12T07:00:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","status":"public","_id":"2928"},{"month":"01","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1207.7213","open_access":"1"}],"publisher":"Unknown","quality_controlled":0,"date_created":"2018-12-11T12:00:24Z","date_published":"2012-01-01T00:00:00Z","day":"01","year":"2012","publication_status":"published","status":"public","type":"report","_id":"2929","title":"The power of linear programming for valued CSPs: a constructive characterization","publist_id":"3807","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov"}],"extern":1,"date_updated":"2019-04-26T07:22:21Z","citation":{"mla":"Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown, 2012.","short":"V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.","ieee":"V. Kolmogorov, The power of linear programming for valued CSPs: a constructive characterization. Unknown, 2012.","ama":"Kolmogorov V. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown; 2012.","apa":"Kolmogorov, V. (2012). The power of linear programming for valued CSPs: a constructive characterization. Unknown.","chicago":"Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown, 2012.","ista":"Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive characterization, Unknown,p."}},{"date_updated":"2021-01-12T07:39:53Z","citation":{"ista":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Computer and Communications Security, 488–500.","chicago":"Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.","ieee":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in Proceedings of the 2012 ACM conference on Computer and communications security, Raleigh, NC, USA, 2012, pp. 488–500.","short":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.","apa":"Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., & Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In Proceedings of the 2012 ACM conference on Computer and communications security (pp. 488–500). Raleigh, NC, USA: ACM. https://doi.org/10.1145/2382196.2382249","ama":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security. ACM; 2012:488-500. doi:10.1145/2382196.2382249","mla":"Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"José","last_name":"Almeida","full_name":"Almeida, José"},{"first_name":"Manuel","full_name":"Barbosa, Manuel","last_name":"Barbosa"},{"full_name":"Bangerter, Endre","last_name":"Bangerter","first_name":"Endre"},{"first_name":"Gilles","last_name":"Barthe","full_name":"Barthe, Gilles"},{"id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","last_name":"Krenn","orcid":"0000-0003-2835-9093","full_name":"Krenn, Stephan"},{"first_name":"Santiago","last_name":"Béguelin","full_name":"Béguelin, Santiago"}],"publist_id":"3798","department":[{"_id":"KrPi"}],"title":"Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols","_id":"2937","type":"conference","conference":{"location":"Raleigh, NC, USA","end_date":"2012-10-18","start_date":"2012-10-16","name":"CCS: Computer and Communications Security"},"status":"public","publication_status":"published","year":"2012","day":"01","publication":"Proceedings of the 2012 ACM conference on Computer and communications security","language":[{"iso":"eng"}],"page":"488 - 500","doi":"10.1145/2382196.2382249","date_published":"2012-10-01T00:00:00Z","date_created":"2018-12-11T12:00:26Z","abstract":[{"text":"Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system.","lang":"eng"}],"oa_version":"Submitted Version","acknowledgement":"This work was partially funded by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT, Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project S2009TIC-1465 PROMETIDOS.","scopus_import":1,"publisher":"ACM","quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2012/258","open_access":"1"}],"oa":1,"month":"10"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: Roceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:43-52. doi:10.1145/2380356.2380370","apa":"Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370."},"title":"Finite automata with time delay blocks","publist_id":"3799","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"publication":"roceedings of the tenth ACM international conference on Embedded software","day":"01","year":"2012","date_created":"2018-12-11T12:00:26Z","doi":"10.1145/2380356.2380370","date_published":"2012-10-01T00:00:00Z","page":"43 - 52","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","oa":1,"publisher":"ACM","quality_controlled":"1","date_updated":"2021-01-12T07:39:53Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"2936","status":"public","conference":{"location":"Tampere, Finland","end_date":"2012-10-12","start_date":"2012-10-07","name":"EMSOFT: Embedded Software "},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"month":"10","main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"scopus_import":1},{"title":"Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies","department":[{"_id":"SyCr"}],"publist_id":"3797","author":[{"orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:39:54Z","citation":{"ista":"Ugelvig LV, Cremer S. 2012. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 26(6), 1300–1312.","chicago":"Ugelvig, Line V, and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” Functional Ecology. Wiley-Blackwell, 2012. https://doi.org/10.1111/1365-2435.12013.","short":"L.V. Ugelvig, S. Cremer, Functional Ecology 26 (2012) 1300–1312.","ieee":"L. V. Ugelvig and S. Cremer, “Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies,” Functional Ecology, vol. 26, no. 6. Wiley-Blackwell, pp. 1300–1312, 2012.","ama":"Ugelvig LV, Cremer S. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 2012;26(6):1300-1312. doi:10.1111/1365-2435.12013","apa":"Ugelvig, L. V., & Cremer, S. (2012). Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. Wiley-Blackwell. https://doi.org/10.1111/1365-2435.12013","mla":"Ugelvig, Line V., and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” Functional Ecology, vol. 26, no. 6, Wiley-Blackwell, 2012, pp. 1300–12, doi:10.1111/1365-2435.12013."},"status":"public","type":"journal_article","_id":"2938","issue":"6","volume":26,"date_published":"2012-01-01T00:00:00Z","doi":"10.1111/1365-2435.12013","date_created":"2018-12-11T12:00:27Z","page":"1300 - 1312","day":"01","publication":"Functional Ecology","language":[{"iso":"eng"}],"year":"2012","publication_status":"published","month":"01","intvolume":" 26","scopus_import":1,"quality_controlled":"1","publisher":"Wiley-Blackwell","oa_version":"None","acknowledgement":"We thank Mark Brown, Christopher Pull, Meghan L. Vyleta, Miriam Stock, Barbara Casillas-Perez and three anonymous reviewers for valuable comments on the manuscript and Eva Sixt for ant drawings. Funding was obtained from the German Science Foundation (DFG, by an Individual Research Grant to S.C.) and the European Research Council (ERC, by an ERC-Starting Grant to SC and an Individual Marie Curie EIF fellowship to L.desU.). The authors declare no conflict of interests.","abstract":[{"text":"Social insects have a very high potential to become invasive pest species. Here, we explore how their social lifestyle and their interaction with parasites may contribute to this invasive success. Similar to solitary species, parasite release followed by the evolution of increased competitive ability can promote establishment of introduced social insect hosts in their introduced range. Genetic bottlenecks during introduction of low numbers of founder individuals decrease the genetic diversity at three levels: the population, the colony and the individual, with the colony level being specific to social insects. Reduced genetic diversity can affect both the individual immune system and the collective colony-level disease defences (social immunity). Still, the dual immune system is likely to make social insects more robust to parasite attack. Changes in social structure from small, family-based, territorially aggressive societies in native populations towards huge networks of cooperating nests (unicoloniality) occur in some invasive social insects, for example, most invasive ants and some termites. Unicoloniality is likely to affect disease dynamics in multiple ways. The free exchange of individuals within the population leads to an increased genetic heterogeneity among individuals of a single nest, thereby decreasing disease transmission. However, the multitude of reproductively active queens per colony buffers the effect of individual diseased queens and their offspring, which may result in a higher level of vertical disease transmission in unicolonial societies. Lastly, unicoloniality provides a competitive advantage over native species, allowing them to quickly become the dominant species in the habitat, which in turn selects for parasite adaptation to this common host genotype and thus eventually a high parasite pressure. Overall, invasions by insect societies are characterized by general features applying to all introduced species, as well as idiosyncrasies that emerge from their social lifestyle. It is important to study these effects in concert to be able to develop efficient management and biocontrol strategies. © 2012 British Ecological Society.","lang":"eng"}]},{"abstract":[{"text":"In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.\r\n","lang":"eng"}],"oa_version":"None","acknowledgement":"This research was funded in part by Microsoft Research.","scopus_import":1,"quality_controlled":"1","publisher":"IEEE","month":"05","intvolume":" 35","publication_status":"published","year":"2012","day":"08","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","page":"259 - 271","date_published":"2012-05-08T00:00:00Z","doi":"10.1109/TPAMI.2012.105","volume":35,"issue":"2","date_created":"2018-12-11T12:00:24Z","_id":"2931","type":"journal_article","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","citation":{"ista":"Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271.","chicago":"Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2012. https://doi.org/10.1109/TPAMI.2012.105.","ama":"Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2012;35(2):259-271. doi:10.1109/TPAMI.2012.105","apa":"Torresani, L., Kolmogorov, V., & Rother, C. (2012). A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2012.105","short":"L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.","ieee":"L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2. IEEE, pp. 259–271, 2012.","mla":"Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105."},"date_updated":"2021-01-12T07:00:46Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3805","author":[{"last_name":"Torresani","full_name":"Torresani, Lorenzo","first_name":"Lorenzo"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"department":[{"_id":"VlKo"}],"title":"A dual decomposition approach to feature correspondence"},{"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3791","title":"Independent implementability of viewpoints","citation":{"chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In Conference Proceedings Monterey Workshop 2012, 7539:380–95. Springer, 2012. https://doi.org/10.1007/978-3-642-34059-8_20.","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” Conference Proceedings Monterey Workshop 2012, vol. 7539, Springer, 2012, pp. 380–95, doi:10.1007/978-3-642-34059-8_20.","ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: Conference Proceedings Monterey Workshop 2012. Vol 7539. Springer; 2012:380-395. doi:10.1007/978-3-642-34059-8_20","apa":"Henzinger, T. A., & Nickovic, D. (2012). Independent implementability of viewpoints. In Conference proceedings Monterey Workshop 2012 (Vol. 7539, pp. 380–395). Oxford, UK: Springer. https://doi.org/10.1007/978-3-642-34059-8_20","short":"T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.","ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in Conference proceedings Monterey Workshop 2012, Oxford, UK, 2012, vol. 7539, pp. 380–395."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","quality_controlled":"1","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","page":"380 - 395","date_created":"2018-12-11T12:00:28Z","date_published":"2012-09-16T00:00:00Z","doi":"10.1007/978-3-642-34059-8_20","year":"2012","publication":" Conference proceedings Monterey Workshop 2012","day":"16","conference":{"name":"Monterey Workshop 2012","location":"Oxford, UK","end_date":"2012-03-21","start_date":"2012-03-19"},"type":"conference","status":"public","_id":"2942","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:39:56Z","alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 7539","month":"09","abstract":[{"lang":"eng","text":"Interface theories provide a formal framework for component-based development of software and hardware which supports the incremental design of systems and the independent implementability of components. These capabilities are ensured through mathematical properties of the parallel composition operator and the refinement relation for components. More recently, a conjunction operation was added to interface theories in order to provide support for handling multiple viewpoints, requirements engineering, and component reuse. Unfortunately, the conjunction operator does not allow independent implementability in general. In this paper, we study conditions that need to be imposed on interface models in order to enforce independent implementability with respect to conjunction. We focus on multiple viewpoint specifications and propose a new compatibility criterion between two interfaces, which we call orthogonality. We show that orthogonal interfaces can be refined separately, while preserving both orthogonality and composability with other interfaces. We illustrate the independent implementability of different viewpoints with a FIFO buffer example."}],"oa_version":"None","ec_funded":1,"volume":7539,"publication_status":"published","language":[{"iso":"eng"}]},{"acknowledgement":"We thank Professor Philippe Cluzel and Mr Lance Min for providing advice and materials. Jeannette Chau provided technical support. Work at NU was supported by NSF Grants DMR-0715099, MCB-1022117, DMR-1206868, DMR-0520513 and DMR-1121262 (NU-MRSEC), by NIH-NCI Grant U54CA143869-01 (NU-PS-OC) and by the Chicago Biomedical Consortium with support from the Searle Funds at the Chicago Community Trust. Work at UCLA was supported by NIH Grant GM038509.","publisher":"Wiley-Blackwell","quality_controlled":"1","oa":1,"day":"09","publication":"Molecular Microbiology","year":"2012","doi":"10.1111/mmi.12071","date_published":"2012-11-09T00:00:00Z","date_created":"2018-12-11T12:00:28Z","page":"1318 - 1333","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Hadizadeh Yazdi, Nastaran, Calin C Guet, Reid Johnson, and John Marko. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” Molecular Microbiology. Wiley-Blackwell, 2012. https://doi.org/10.1111/mmi.12071.","ista":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. 2012. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. Molecular Microbiology. 86(6), 1318–1333.","mla":"Hadizadeh Yazdi, Nastaran, et al. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” Molecular Microbiology, vol. 86, no. 6, Wiley-Blackwell, 2012, pp. 1318–33, doi:10.1111/mmi.12071.","short":"N. Hadizadeh Yazdi, C.C. Guet, R. Johnson, J. Marko, Molecular Microbiology 86 (2012) 1318–1333.","ieee":"N. Hadizadeh Yazdi, C. C. Guet, R. Johnson, and J. Marko, “Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions,” Molecular Microbiology, vol. 86, no. 6. Wiley-Blackwell, pp. 1318–1333, 2012.","apa":"Hadizadeh Yazdi, N., Guet, C. C., Johnson, R., & Marko, J. (2012). Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. Molecular Microbiology. Wiley-Blackwell. https://doi.org/10.1111/mmi.12071","ama":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. Molecular Microbiology. 2012;86(6):1318-1333. doi:10.1111/mmi.12071"},"title":"Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions","author":[{"last_name":"Hadizadeh Yazdi","full_name":"Hadizadeh Yazdi, Nastaran","first_name":"Nastaran"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet"},{"first_name":"Reid","full_name":"Johnson, Reid","last_name":"Johnson"},{"first_name":"John","last_name":"Marko","full_name":"Marko, John"}],"publist_id":"3790","oa_version":"Submitted Version","abstract":[{"text":"We examine whether the Escherichia coli chromosome is folded into a self-adherent nucleoprotein complex, or alternately is a confined but otherwise unconstrained self-avoiding polymer. We address this through in vivo visualization, using an inducible GFP fusion to the nucleoid-associated protein Fis to non-specifically decorate the entire chromosome. For a range of different growth conditions, the chromosome is a compact structure that does not fill the volume of the cell, and which moves from the new pole to the cell centre. During rapid growth, chromosome segregation occurs well before cell division, with daughter chromosomes coupled by a thin inter-daughter filament before complete segregation, whereas during slow growth chromosomes stay adjacent until cell division occurs. Image correlation analysis indicates that sub-nucleoid structure is stable on a 1min timescale, comparable to the timescale for redistribution time measured for GFP-Fis after photobleaching. Optical deconvolution and writhe calculation analysis indicate that the nucleoid has a large-scale coiled organization rather than being an amorphous mass. Our observations are consistent with the chromosome having a self-adherent filament organization.","lang":"eng"}],"month":"11","intvolume":" 86","scopus_import":1,"main_file_link":[{"url":"http://europepmc.org/articles/pmc3524407","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"6","volume":86,"_id":"2943","status":"public","type":"journal_article","date_updated":"2021-01-12T07:39:56Z","department":[{"_id":"CaGu"}]},{"type":"journal_article","status":"public","pubrep_id":"132","_id":"2941","file_date_updated":"2020-07-14T12:45:55Z","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:39:55Z","ddc":["510"],"scopus_import":1,"month":"11","intvolume":" 67","oa_version":"Submitted Version","volume":67,"issue":"4","publication_status":"published","file":[{"creator":"system","file_size":253816,"date_updated":"2020-07-14T12:45:55Z","file_name":"IST-2013-132-v1+1_2012-J-04-Functional-E.pdf","date_created":"2018-12-12T10:16:49Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"389a5ae53d6347de36c3468034f2821d","file_id":"5239"}],"language":[{"iso":"eng"}],"author":[{"first_name":"Nikolai","full_name":"Dolbilin, Nikolai","last_name":"Dolbilin"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Musin, Oleg","last_name":"Musin","first_name":"Oleg"}],"publist_id":"3792","title":"On the optimality of functionals over triangulations of Delaunay sets","citation":{"mla":"Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical Surveys, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:10.1070/RM2012v067n04ABEH004807.","ieee":"N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” Russian Mathematical Surveys, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.","short":"N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.","ama":"Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 2012;67(4):781-783. doi:10.1070/RM2012v067n04ABEH004807","apa":"Dolbilin, N., Edelsbrunner, H., & Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM2012v067n04ABEH004807","chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical Surveys. IOP Publishing, 2012. https://doi.org/10.1070/RM2012v067n04ABEH004807.","ista":"Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IOP Publishing","quality_controlled":"1","oa":1,"page":"781 - 783","doi":"10.1070/RM2012v067n04ABEH004807","date_published":"2012-11-01T00:00:00Z","date_created":"2018-12-11T12:00:28Z","has_accepted_license":"1","year":"2012","day":"01","publication":"Russian Mathematical Surveys"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, G. Meister, Nucleic Acids Research 40 (2012) 9850–9862.","ieee":"A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, and G. Meister, “MicroRNAs associated with the different human Argonaute proteins,” Nucleic Acids Research, vol. 40, no. 19. Oxford University Press, pp. 9850–9862, 2012.","apa":"Dueck, A., Ziegler, C., Eichner, A., Berezikov, E., & Meister, G. (2012). MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gks705","ama":"Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids Research. 2012;40(19):9850-9862. doi:10.1093/nar/gks705","mla":"Dueck, Anne, et al. “MicroRNAs Associated with the Different Human Argonaute Proteins.” Nucleic Acids Research, vol. 40, no. 19, Oxford University Press, 2012, pp. 9850–62, doi:10.1093/nar/gks705.","ista":"Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. 2012. MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids Research. 40(19), 9850–9862.","chicago":"Dueck, Anne, Christian Ziegler, Alexander Eichner, Eugène Berezikov, and Gunter Meister. “MicroRNAs Associated with the Different Human Argonaute Proteins.” Nucleic Acids Research. Oxford University Press, 2012. https://doi.org/10.1093/nar/gks705."},"title":"MicroRNAs associated with the different human Argonaute proteins","author":[{"last_name":"Dueck","full_name":"Dueck, Anne","first_name":"Anne"},{"last_name":"Ziegler","full_name":"Ziegler, Christian","first_name":"Christian"},{"first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander","last_name":"Eichner"},{"first_name":"Eugène","last_name":"Berezikov","full_name":"Berezikov, Eugène"},{"first_name":"Gunter","full_name":"Meister, Gunter","last_name":"Meister"}],"publist_id":"3786","day":"01","publication":"Nucleic Acids Research","has_accepted_license":"1","year":"2012","doi":"10.1093/nar/gks705","date_published":"2012-10-01T00:00:00Z","date_created":"2018-12-11T12:00:29Z","page":"9850 - 9862","acknowledgement":"Deutsche Forschungsgemeinschaft (DFG) (SFB 960 and FOR855); European Research Council (ERC grant ‘sRNAs’); European Union (FP7 project ‘ONCOMIRs’); German Bundesministerium für Bildung und Forschung (BMBF, NGFN+, FKZ PIM-01GS0804-5); Bavarian Genome Research Network (BayGene to G.M.); The Netherlands Organization for Scientific Research (NWO, VIDI grant to E.B.). Funding for open access charge: DFG via the open access publishing program. \r\n\r\nWe thank Sigrun Ammon and Corinna Friederich for technical assistance and Sebastian Petri and Daniel Schraivogel for helpful discussions.","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"ddc":["570"],"date_updated":"2021-01-12T07:39:57Z","department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:45:55Z","_id":"2946","status":"public","pubrep_id":"383","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"file":[{"checksum":"1bb8d1ff894014b481657a21083c941c","file_id":"4993","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:13:12Z","file_name":"IST-2015-383-v1+1_Nucl._Acids_Res.-2012-Dueck-9850-62.pdf","creator":"system","date_updated":"2020-07-14T12:45:55Z","file_size":8126936}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"19","volume":40,"license":"https://creativecommons.org/licenses/by-nc/4.0/","oa_version":"Published Version","abstract":[{"lang":"eng","text":"MicroRNAs (miRNAs) are small noncoding RNAs that function in literally all cellular processes. miRNAs interact with Argonaute (Ago) proteins and guide them to specific target sites located in the 3′-untranslated region (3′-UTR) of target mRNAs leading to translational repression and deadenylation-induced mRNA degradation. Most miRNAs are processed from hairpin-structured precursors by the consecutive action of the RNase III enzymes Drosha and Dicer. However, processing of miR-451 is Dicer independent and cleavage is mediated by the endonuclease Ago2. Here we have characterized miR-451 sequence and structure requirements for processing as well as sorting of miRNAs into different Ago proteins. Pre-miR-451 appears to be optimized for Ago2 cleavage and changes result in reduced processing. In addition, we show that the mature miR-451 only associates with Ago2 suggesting that mature miRNAs are not exchanged between different members of the Ago protein family. Based on cloning and deep sequencing of endogenous miRNAs associated with Ago1-3, we do not find evidence for miRNA sorting in human cells. However, Ago identity appears to influence the length of some miRNAs, while others remain unaffected."}],"month":"10","intvolume":" 40","scopus_import":1},{"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.","short":"K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.","apa":"Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30","ama":"Chatterjee K, Chmelik M, Majumdar R. Equivalence of games with probabilistic uncertainty and partial observation games. In: Vol 7561. Springer; 2012:385-399. doi:10.1007/978-3-642-33386-6_30","mla":"Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.","ista":"Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 385–399.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30."},"title":"Equivalence of games with probabilistic uncertainty and partial observation games","publist_id":"3785","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","year":"2012","date_published":"2012-06-01T00:00:00Z","doi":"10.1007/978-3-642-33386-6_30","date_created":"2018-12-11T12:00:29Z","page":"385 - 399","_id":"2947","status":"public","type":"conference","conference":{"name":" ATVA: Automated Technology for Verification and Analysis","location":"Thiruvananthapuram, India","end_date":"2012-10-06","start_date":"2012-10-03"},"date_updated":"2021-01-12T07:39:58Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","abstract":[{"text":"We introduce games with probabilistic uncertainty, a model for controller synthesis in which the controller observes the state through imprecise sensors that provide correct information about the current state with a fixed probability. That is, in each step, the sensors return an observed state, and given the observed state, there is a probability distribution (due to the estimation error) over the actual current state. The controller must base its decision on the observed state (rather than the actual current state, which it does not know). On the other hand, we assume that the environment can perfectly observe the current state. We show that controller synthesis for qualitative ω-regular objectives in our model can be reduced in polynomial time to standard partial-observation stochastic games, and vice-versa. As a consequence we establish the precise decidability frontier for the new class of games, and establish optimal complexity results for all the decidable problems.","lang":"eng"}],"month":"06","intvolume":" 7561","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1202.4140","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":7561,"ec_funded":1},{"_id":"2945","status":"public","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:39:57Z","citation":{"ista":"Girard J, Moussion C, Förster R. 2012. HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes. Nature Reviews Immunology. 12(11), 762–773.","chicago":"Girard, Jean, Christine Moussion, and Reinhold Förster. “HEVs, Lymphatics and Homeostatic Immune Cell Trafficking in Lymph Nodes.” Nature Reviews Immunology. Nature Publishing Group, 2012. https://doi.org/10.1038/nri3298.","ama":"Girard J, Moussion C, Förster R. HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes. Nature Reviews Immunology. 2012;12(11):762-773. doi:10.1038/nri3298","apa":"Girard, J., Moussion, C., & Förster, R. (2012). HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes. Nature Reviews Immunology. Nature Publishing Group. https://doi.org/10.1038/nri3298","short":"J. Girard, C. Moussion, R. Förster, Nature Reviews Immunology 12 (2012) 762–773.","ieee":"J. Girard, C. Moussion, and R. Förster, “HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes,” Nature Reviews Immunology, vol. 12, no. 11. Nature Publishing Group, pp. 762–773, 2012.","mla":"Girard, Jean, et al. “HEVs, Lymphatics and Homeostatic Immune Cell Trafficking in Lymph Nodes.” Nature Reviews Immunology, vol. 12, no. 11, Nature Publishing Group, 2012, pp. 762–73, doi:10.1038/nri3298."},"department":[{"_id":"MiSi"}],"title":"HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes","author":[{"last_name":"Girard","full_name":"Girard, Jean","first_name":"Jean"},{"first_name":"Christine","id":"3356F664-F248-11E8-B48F-1D18A9856A87","last_name":"Moussion","full_name":"Moussion, Christine"},{"last_name":"Förster","full_name":"Förster, Reinhold","first_name":"Reinhold"}],"publist_id":"3787","acknowledgement":"We thank M. Sixt and A. Peixoto for helpful comments on the manuscript. Work in the laboratory of J.-P.G. is supported by grants from Fondation ARC pour la Recherche sur le Cancer, Agence Nationale de la Recherche (ANR), Institut National du Cancer (INCA), Fondation RITC and Région Midi-Pyrénées. Research by R.F. is supported by Deutsche Forschungsgemeinschaft (DFG) grants SFB621-A1, SFB738-B5, SFB587-B3, SFB900-B1 and KFO 250-FO 334/2-1. We regret that, owing to space limitations, we could not always quote the work of colleagues who have contributed to the field.","oa_version":"None","abstract":[{"lang":"eng","text":"In search of foreign antigens, lymphocytes recirculate from the blood, through lymph nodes, into lymphatics and back to the blood. Dendritic cells also migrate to lymph nodes for optimal interaction with lymphocytes. This continuous trafficking of immune cells into and out of lymph nodes is essential for immune surveillance of foreign invaders. In this article, we review our current understanding of the functions of high endothelial venules (HEVs), stroma and lymphatics in the entry, positioning and exit of immune cells in lymph nodes during homeostasis, and we highlight the unexpected role of dendritic cells in the control of lymphocyte homing through HEVs."}],"intvolume":" 12","month":"11","scopus_import":1,"publisher":"Nature Publishing Group","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Nature Reviews Immunology","day":"01","publication_status":"published","year":"2012","date_created":"2018-12-11T12:00:29Z","issue":"11","date_published":"2012-11-01T00:00:00Z","doi":"10.1038/nri3298","volume":12,"page":"762 - 773"},{"status":"public","type":"journal_article","_id":"2949","department":[{"_id":"JoCs"}],"title":"The medial entorhinal cortex keeps Up","author":[{"first_name":"David","full_name":"Dupret, David","last_name":"Dupret"},{"last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3782","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"D. Dupret, J.L. Csicsvari, Nature Neuroscience 15 (2012) 1471–1472.","ieee":"D. Dupret and J. L. Csicsvari, “The medial entorhinal cortex keeps Up,” Nature Neuroscience, vol. 15, no. 11. Nature Publishing Group, pp. 1471–1472, 2012.","apa":"Dupret, D., & Csicsvari, J. L. (2012). The medial entorhinal cortex keeps Up. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3245","ama":"Dupret D, Csicsvari JL. The medial entorhinal cortex keeps Up. Nature Neuroscience. 2012;15(11):1471-1472. doi:10.1038/nn.3245","mla":"Dupret, David, and Jozsef L. Csicsvari. “The Medial Entorhinal Cortex Keeps Up.” Nature Neuroscience, vol. 15, no. 11, Nature Publishing Group, 2012, pp. 1471–72, doi:10.1038/nn.3245.","ista":"Dupret D, Csicsvari JL. 2012. The medial entorhinal cortex keeps Up. Nature Neuroscience. 15(11), 1471–1472.","chicago":"Dupret, David, and Jozsef L Csicsvari. “The Medial Entorhinal Cortex Keeps Up.” Nature Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nn.3245."},"date_updated":"2021-01-12T07:39:59Z","month":"11","intvolume":" 15","scopus_import":1,"publisher":"Nature Publishing Group","quality_controlled":"1","main_file_link":[{"url":"http://www.mrcbndu.ox.ac.uk/publications/medial-entorhinal-cortex-keeps"}],"oa_version":"None","issue":"11","doi":"10.1038/nn.3245","date_published":"2012-11-01T00:00:00Z","volume":15,"date_created":"2018-12-11T12:00:30Z","page":"1471 - 1472","day":"01","language":[{"iso":"eng"}],"publication":"Nature Neuroscience","year":"2012","publication_status":"published"},{"year":"2012","day":"03","publication":"Biophysical Journal","page":"1429 - 1439","doi":"10.1016/j.bpj.2012.08.039","date_published":"2012-10-03T00:00:00Z","date_created":"2018-12-11T12:00:32Z","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10) and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J. Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n","quality_controlled":"1","publisher":"Biophysical","oa":1,"citation":{"ieee":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M. Jonas, “A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo,” Biophysical Journal, vol. 103, no. 7. Biophysical, pp. 1429–1439, 2012.","short":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas, Biophysical Journal 103 (2012) 1429–1439.","apa":"Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., & Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. Biophysical. https://doi.org/10.1016/j.bpj.2012.08.039","ama":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 2012;103(7):1429-1439. doi:10.1016/j.bpj.2012.08.039","mla":"Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” Biophysical Journal, vol. 103, no. 7, Biophysical, 2012, pp. 1429–39, doi:10.1016/j.bpj.2012.08.039.","ista":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 103(7), 1429–1439.","chicago":"Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe, Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” Biophysical Journal. Biophysical, 2012. https://doi.org/10.1016/j.bpj.2012.08.039."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"36963E98-F248-11E8-B48F-1D18A9856A87","first_name":"Alejandro","full_name":"Pernia-Andrade, Alejandro","last_name":"Pernia-Andrade"},{"first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","full_name":"Goswami, Sarit","last_name":"Goswami"},{"first_name":"Yvonne","id":"63B76600-E9CC-11E9-9B5F-82450873F7A1","last_name":"Stickler","full_name":"Stickler, Yvonne"},{"first_name":"Ulrich","last_name":"Fröbe","full_name":"Fröbe, Ulrich"},{"last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3774","external_id":{"pmid":["23062335"]},"title":"A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","language":[{"iso":"eng"}],"issue":"7","volume":103,"abstract":[{"lang":"eng","text":"Spontaneous postsynaptic currents (PSCs) provide key information about the mechanisms of synaptic transmission and the activity modes of neuronal networks. However, detecting spontaneous PSCs in vitro and in vivo has been challenging, because of the small amplitude, the variable kinetics, and the undefined time of generation of these events. Here, we describe a, to our knowledge, new method for detecting spontaneous synaptic events by deconvolution, using a template that approximates the average time course of spontaneous PSCs. A recorded PSC trace is deconvolved from the template, resulting in a series of delta-like functions. The maxima of these delta-like events are reliably detected, revealing the precise onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based method has a unique temporal resolution, allowing the detection of individual events in high-frequency bursts. Furthermore, the deconvolution-based method has a high amplitude resolution, because deconvolution can substantially increase the signal/noise ratio. When tested against previously published methods using experimental data, the deconvolution-based method was superior for spontaneous PSCs recorded in vivo. Using the high-resolution deconvolution-based detection algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro."}],"oa_version":"Submitted Version","pmid":1,"scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/","open_access":"1"}],"month":"10","intvolume":" 103","date_updated":"2021-01-12T07:40:01Z","department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"_id":"2954","type":"journal_article","status":"public"},{"date_updated":"2023-02-21T17:02:44Z","department":[{"_id":"CaHe"},{"_id":"Bio"}],"_id":"2950","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","issue":"6104","related_material":{"record":[{"status":"public","id":"1403","relation":"dissertation_contains"}]},"volume":338,"oa_version":"None","acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"text":"Contractile actomyosin rings drive various fundamental morphogenetic processes ranging from cytokinesis to wound healing. Actomyosin rings are generally thought to function by circumferential contraction. Here, we show that the spreading of the enveloping cell layer (EVL) over the yolk cell during zebrafish gastrulation is driven by a contractile actomyosin ring. In contrast to previous suggestions, we find that this ring functions not only by circumferential contraction but also by a flow-friction mechanism. This generates a pulling force through resistance against retrograde actomyosin flow. EVL spreading proceeds normally in situations where circumferential contraction is unproductive, indicating that the flow-friction mechanism is sufficient. Thus, actomyosin rings can function in epithelial morphogenesis through a combination of cable-constriction and flow-friction mechanisms.","lang":"eng"}],"month":"10","intvolume":" 338","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Behrndt M, Salbreux G, Campinho P, Hauschild R, Oswald F, Roensch J, Grill S, Heisenberg C-PJ. 2012. Forces driving epithelial spreading in zebrafish gastrulation. Science. 338(6104), 257–260.","chicago":"Behrndt, Martin, Guillaume Salbreux, Pedro Campinho, Robert Hauschild, Felix Oswald, Julia Roensch, Stephan Grill, and Carl-Philipp J Heisenberg. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.” Science. American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1224143.","ieee":"M. Behrndt et al., “Forces driving epithelial spreading in zebrafish gastrulation,” Science, vol. 338, no. 6104. American Association for the Advancement of Science, pp. 257–260, 2012.","short":"M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch, S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.","apa":"Behrndt, M., Salbreux, G., Campinho, P., Hauschild, R., Oswald, F., Roensch, J., … Heisenberg, C.-P. J. (2012). Forces driving epithelial spreading in zebrafish gastrulation. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1224143","ama":"Behrndt M, Salbreux G, Campinho P, et al. Forces driving epithelial spreading in zebrafish gastrulation. Science. 2012;338(6104):257-260. doi:10.1126/science.1224143","mla":"Behrndt, Martin, et al. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.” Science, vol. 338, no. 6104, American Association for the Advancement of Science, 2012, pp. 257–60, doi:10.1126/science.1224143."},"title":"Forces driving epithelial spreading in zebrafish gastrulation","publist_id":"3778","author":[{"full_name":"Behrndt, Martin","last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Salbreux","full_name":"Salbreux, Guillaume","first_name":"Guillaume"},{"id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","first_name":"Pedro","last_name":"Campinho","full_name":"Campinho, Pedro","orcid":"0000-0002-8526-5416"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"last_name":"Oswald","full_name":"Oswald, Felix","first_name":"Felix"},{"last_name":"Roensch","full_name":"Roensch, Julia","first_name":"Julia","id":"4220E59C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Grill","full_name":"Grill, Stephan","first_name":"Stephan"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"}],"project":[{"_id":"252ABD0A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I 930-B20","name":"Control of Epithelial Cell Layer Spreading in Zebrafish"}],"day":"12","publication":"Science","year":"2012","date_published":"2012-10-12T00:00:00Z","doi":"10.1126/science.1224143","date_created":"2018-12-11T12:00:30Z","page":"257 - 260","quality_controlled":"1","publisher":"American Association for the Advancement of Science"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:40:00Z","citation":{"ista":"Maître J-L, Berthoumieux H, Krens G, Salbreux G, Julicher F, Paluch E, Heisenberg C-PJ. 2012. Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. Science. 338(6104), 253–256.","chicago":"Maître, Jean-Léon, Hélène Berthoumieux, Gabriel Krens, Guillaume Salbreux, Frank Julicher, Ewa Paluch, and Carl-Philipp J Heisenberg. “Adhesion Functions in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” Science. American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1225399.","ama":"Maître J-L, Berthoumieux H, Krens G, et al. Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. Science. 2012;338(6104):253-256. doi:10.1126/science.1225399","apa":"Maître, J.-L., Berthoumieux, H., Krens, G., Salbreux, G., Julicher, F., Paluch, E., & Heisenberg, C.-P. J. (2012). Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1225399","ieee":"J.-L. Maître et al., “Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells,” Science, vol. 338, no. 6104. American Association for the Advancement of Science, pp. 253–256, 2012.","short":"J.-L. Maître, H. Berthoumieux, G. Krens, G. Salbreux, F. Julicher, E. Paluch, C.-P.J. Heisenberg, Science 338 (2012) 253–256.","mla":"Maître, Jean-Léon, et al. “Adhesion Functions in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” Science, vol. 338, no. 6104, American Association for the Advancement of Science, 2012, pp. 253–56, doi:10.1126/science.1225399."},"title":"Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells","department":[{"_id":"CaHe"}],"publist_id":"3777","author":[{"first_name":"Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","full_name":"Maître, Jean-Léon","orcid":"0000-0002-3688-1474","last_name":"Maître"},{"full_name":"Berthoumieux, Hélène","last_name":"Berthoumieux","first_name":"Hélène"},{"orcid":"0000-0003-4761-5996","full_name":"Krens, Gabriel","last_name":"Krens","first_name":"Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Salbreux","full_name":"Salbreux, Guillaume","first_name":"Guillaume"},{"first_name":"Frank","last_name":"Julicher","full_name":"Julicher, Frank"},{"full_name":"Paluch, Ewa","last_name":"Paluch","first_name":"Ewa"},{"last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"_id":"2951","status":"public","type":"journal_article","publication":"Science","language":[{"iso":"eng"}],"day":"12","publication_status":"published","year":"2012","date_created":"2018-12-11T12:00:31Z","doi":"10.1126/science.1225399","issue":"6104","date_published":"2012-10-12T00:00:00Z","volume":338,"page":"253 - 256","oa_version":"None","abstract":[{"text":"Differential cell adhesion and cortex tension are thought to drive cell sorting by controlling cell-cell contact formation. Here, we show that cell adhesion and cortex tension have different mechanical functions in controlling progenitor cell-cell contact formation and sorting during zebrafish gastrulation. Cortex tension controls cell-cell contact expansion by modulating interfacial tension at the contact. By contrast, adhesion has little direct function in contact expansion, but instead is needed to mechanically couple the cortices of adhering cells at their contacts, allowing cortex tension to control contact expansion. The coupling function of adhesion is mediated by E-cadherin and limited by the mechanical anchoring of E-cadherin to the cortex. Thus, cell adhesion provides the mechanical scaffold for cell cortex tension to drive cell sorting during gastrulation.","lang":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"intvolume":" 338","month":"10","scopus_import":1,"publisher":"American Association for the Advancement of Science","quality_controlled":"1"},{"_id":"2952","status":"public","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:40:00Z","citation":{"ieee":"M. Tada and C.-P. J. Heisenberg, “Convergent extension Using collective cell migration and cell intercalation to shape embryos,” Development, vol. 139, no. 21. Company of Biologists, pp. 3897–3904, 2012.","short":"M. Tada, C.-P.J. Heisenberg, Development 139 (2012) 3897–3904.","ama":"Tada M, Heisenberg C-PJ. Convergent extension Using collective cell migration and cell intercalation to shape embryos. Development. 2012;139(21):3897-3904. doi:10.1242/dev.073007","apa":"Tada, M., & Heisenberg, C.-P. J. (2012). Convergent extension Using collective cell migration and cell intercalation to shape embryos. Development. Company of Biologists. https://doi.org/10.1242/dev.073007","mla":"Tada, Masazumi, and Carl-Philipp J. Heisenberg. “Convergent Extension Using Collective Cell Migration and Cell Intercalation to Shape Embryos.” Development, vol. 139, no. 21, Company of Biologists, 2012, pp. 3897–904, doi:10.1242/dev.073007.","ista":"Tada M, Heisenberg C-PJ. 2012. Convergent extension Using collective cell migration and cell intercalation to shape embryos. Development. 139(21), 3897–3904.","chicago":"Tada, Masazumi, and Carl-Philipp J Heisenberg. “Convergent Extension Using Collective Cell Migration and Cell Intercalation to Shape Embryos.” Development. Company of Biologists, 2012. https://doi.org/10.1242/dev.073007."},"title":"Convergent extension Using collective cell migration and cell intercalation to shape embryos","department":[{"_id":"CaHe"}],"publist_id":"3776","author":[{"first_name":"Masazumi","full_name":"Tada, Masazumi","last_name":"Tada"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"oa_version":"None","acknowledgement":"M.T. is supported by the UK Medical Research Council (MRC) and Royal Society and C.-P.H. by the Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Deutsche Forschungsgemeinschaft (DFG) and Institute of Science and Technology Austria. ","abstract":[{"lang":"eng","text":"Body axis elongation represents a common and fundamental morphogenetic process in development. A key mechanism triggering body axis elongation without additional growth is convergent extension (CE), whereby a tissue undergoes simultaneous narrowing and extension. Both collective cell migration and cell intercalation are thought to drive CE and are used to different degrees in various species as they elongate their body axis. Here, we provide an overview of CE as a general strategy for body axis elongation and discuss conserved and divergent mechanisms underlying CE among different species."}],"month":"11","intvolume":" 139","scopus_import":1,"publisher":"Company of Biologists","quality_controlled":"1","day":"01","language":[{"iso":"eng"}],"publication":"Development","year":"2012","publication_status":"published","volume":139,"date_published":"2012-11-01T00:00:00Z","doi":"10.1242/dev.073007","issue":"21","date_created":"2018-12-11T12:00:31Z","page":"3897 - 3904"},{"_id":"2953","type":"journal_article","status":"public","citation":{"ista":"Heisenberg C-PJ, Fässler R. 2012. Cell-cell adhesion and extracellular matrix diversity counts. Current Opinion in Cell Biology. 24(5), 559–561.","chicago":"Heisenberg, Carl-Philipp J, and Reinhard Fässler. “Cell-Cell Adhesion and Extracellular Matrix Diversity Counts.” Current Opinion in Cell Biology. Elsevier, 2012. https://doi.org/10.1016/j.ceb.2012.09.002.","apa":"Heisenberg, C.-P. J., & Fässler, R. (2012). Cell-cell adhesion and extracellular matrix diversity counts. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2012.09.002","ama":"Heisenberg C-PJ, Fässler R. Cell-cell adhesion and extracellular matrix diversity counts. Current Opinion in Cell Biology. 2012;24(5):559-561. doi:10.1016/j.ceb.2012.09.002","ieee":"C.-P. J. Heisenberg and R. Fässler, “Cell-cell adhesion and extracellular matrix diversity counts,” Current Opinion in Cell Biology, vol. 24, no. 5. Elsevier, pp. 559–561, 2012.","short":"C.-P.J. Heisenberg, R. Fässler, Current Opinion in Cell Biology 24 (2012) 559–561.","mla":"Heisenberg, Carl-Philipp J., and Reinhard Fässler. “Cell-Cell Adhesion and Extracellular Matrix Diversity Counts.” Current Opinion in Cell Biology, vol. 24, no. 5, Elsevier, 2012, pp. 559–61, doi:10.1016/j.ceb.2012.09.002."},"date_updated":"2021-01-12T07:40:01Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fässler","full_name":"Fässler, Reinhard","first_name":"Reinhard"}],"publist_id":"3773","department":[{"_id":"CaHe"}],"title":"Cell-cell adhesion and extracellular matrix diversity counts","oa_version":"None","publisher":"Elsevier","scopus_import":1,"quality_controlled":"1","intvolume":" 24","month":"10","year":"2012","publication_status":"published","publication":"Current Opinion in Cell Biology","language":[{"iso":"eng"}],"day":"01","page":"559 - 561","date_created":"2018-12-11T12:00:31Z","date_published":"2012-10-01T00:00:00Z","doi":"10.1016/j.ceb.2012.09.002","issue":"5","volume":24},{"project":[{"grant_number":"281511","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","_id":"257A4776-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publist_id":"3768","author":[{"full_name":"Allen, Kevin","last_name":"Allen","first_name":"Kevin"},{"first_name":"J Nick","full_name":"Rawlins, J Nick","last_name":"Rawlins"},{"first_name":"David","last_name":"Bannerman","full_name":"Bannerman, David"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L"}],"external_id":{"pmid":["23077060"]},"title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","citation":{"short":"K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience 32 (2012) 14752–14766.","ieee":"K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place cells can encode multiple trial-dependent features through rate remapping,” Journal of Neuroscience, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766, 2012.","apa":"Allen, K., Rawlins, J. N., Bannerman, D., & Csicsvari, J. L. (2012). Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.6175-11.2012","ama":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 2012;32(42):14752-14766. doi:10.1523/JNEUROSCI.6175-11.2012","mla":"Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” Journal of Neuroscience, vol. 32, no. 42, Society for Neuroscience, 2012, pp. 14752–66, doi:10.1523/JNEUROSCI.6175-11.2012.","ista":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. 2012. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 32(42), 14752–14766.","chicago":"Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” Journal of Neuroscience. Society for Neuroscience, 2012. https://doi.org/10.1523/JNEUROSCI.6175-11.2012."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Neuroscience","quality_controlled":"1","oa":1,"acknowledgement":"J.C. was supported by a MRC Intramural Programme Grant (U138197111) and a European Research Council Starter Grant (281511). K.A. held a Wellcome Trust PhD studentship and a Humboldt Research Fellowship for Postdoctoral Researchers. D.M.B. was supported by Wellcome Trust Senior Fellowships (074385 and 087736).","page":"14752 - 14766","date_published":"2012-10-17T00:00:00Z","doi":"10.1523/JNEUROSCI.6175-11.2012","date_created":"2018-12-11T12:00:33Z","year":"2012","day":"17","publication":"Journal of Neuroscience","type":"journal_article","status":"public","_id":"2958","department":[{"_id":"JoCs"}],"date_updated":"2021-01-12T07:40:03Z","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/","open_access":"1"}],"month":"10","intvolume":" 32","abstract":[{"lang":"eng","text":"The activity of hippocampal pyramidal cells reflects both the current position of the animal and information related to its current behavior. Here we investigated whether single hippocampal neurons can encode several independent features defining trials during a memory task. We also tested whether task-related information is represented by partial remapping of the place cell population or, instead, via firing rate modulation of spatially stable place cells. To address these two questions, the activity of hippocampal neurons was recorded in rats performing a conditional discrimination task on a modified T-maze in which the identity of a food reward guided behavior. When the rat was on the central arm of the maze, the firing rate of pyramidal cells changed depending on two independent factors: (1) the identity of the food reward given to the animal and (2) the previous location of the animal on the maze. Importantly, some pyramidal cells encoded information relative to both factors. This trial-type specific and retrospective coding did not interfere with the spatial representation of the maze: hippocampal cells had stable place fields and their theta-phase precession profiles were unaltered during the task, indicating that trial-related information was encoded via rate remapping. During error trials, encoding of both trial-related information and spatial location was impaired. Finally, we found that pyramidal cells also encode trial-related information via rate remapping during the continuous version of the rewarded alternation task without delays. These results suggest that hippocampal neurons can encode several task-related cognitive aspects via rate remapping."}],"oa_version":"Submitted Version","pmid":1,"volume":32,"issue":"42","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}]},{"department":[{"_id":"CaUh"}],"date_updated":"2021-01-12T07:40:04Z","status":"public","type":"journal_article","_id":"2959","issue":"1","volume":40,"language":[{"iso":"eng"}],"publication_status":"published","month":"02","intvolume":" 40","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1012.2643","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We study maximum likelihood estimation in Gaussian graphical models from a geometric point of view. An algebraic elimination criterion allows us to find exact lower bounds on the number of observations needed to ensure that the maximum likelihood estimator (MLE) exists with probability one. This is applied to bipartite graphs, grids and colored graphs. We also study the ML degree, and we present the first instance of a graph for which the MLE exists with probability one, even when the number of observations equals the treewidth.","lang":"eng"}],"title":"Geometry of maximum likelihood estimation in Gaussian graphical models","author":[{"first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline"}],"publist_id":"3767","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” Annals of Statistics. Institute of Mathematical Statistics, 2012. https://doi.org/10.1214/11-AOS957.","ista":"Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 40(1), 238–261.","mla":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” Annals of Statistics, vol. 40, no. 1, Institute of Mathematical Statistics, 2012, pp. 238–61, doi:10.1214/11-AOS957.","ama":"Uhler C. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 2012;40(1):238-261. doi:10.1214/11-AOS957","apa":"Uhler, C. (2012). Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/11-AOS957","ieee":"C. Uhler, “Geometry of maximum likelihood estimation in Gaussian graphical models,” Annals of Statistics, vol. 40, no. 1. Institute of Mathematical Statistics, pp. 238–261, 2012.","short":"C. Uhler, Annals of Statistics 40 (2012) 238–261."},"date_published":"2012-02-01T00:00:00Z","doi":"10.1214/11-AOS957","date_created":"2018-12-11T12:00:33Z","page":"238 - 261","day":"01","publication":"Annals of Statistics","year":"2012","quality_controlled":"1","publisher":"Institute of Mathematical Statistics","oa":1,"acknowledgement":"I wish to thank Bernd Sturmfels for many helpful discus- sions and Steffen Lauritzen for introducing me to the problem of the existence of the MLE in Gaussian graphical models. I would also like to thank two referees who provided helpful comments on the original version of this paper.\r\n"},{"volume":12,"license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","file":[{"date_created":"2018-12-12T10:08:44Z","file_name":"IST-2012-94-v1+1_1472-6785-12-7.pdf","creator":"system","date_updated":"2020-07-14T12:45:57Z","file_size":489994,"file_id":"4706","checksum":"03d004bdff3724fb1627e3f5004bad80","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"06","intvolume":" 12","abstract":[{"text":"Background: The outcome of male-male competition can be predicted from the relative fighting qualities of the opponents, which often depend on their age. In insects, freshly emerged and still sexually inactive males are morphologically indistinct from older, sexually active males. These young inactive males may thus be easy targets for older males if they cannot conceal themselves from their attacks. The ant Cardiocondyla obscurior is characterised by lethal fighting between wingless (" ergatoid" ) males. Here, we analyse for how long young males are defenceless after eclosion, and how early adult males can detect the presence of rival males.Results: We found that old ergatoid males consistently won fights against ergatoid males younger than two days. Old males did not differentiate between different types of unpigmented pupae several days before emergence, but had more frequent contact to ready-to-eclose pupae of female sexuals and winged males than of workers and ergatoid males. In rare cases, old ergatoid males displayed alleviated biting of pigmented ergatoid male pupae shortly before adult eclosion, as well as copulation attempts to dark pupae of female sexuals and winged males. Ergatoid male behaviour may be promoted by a closer similarity of the chemical profile of ready-to-eclose pupae to the profile of adults than that of young pupae several days prior to emergence.Conclusion: Young ergatoid males of C. obscurior would benefit greatly by hiding their identity from older, resident males, as they are highly vulnerable during the first two days of their adult lives. In contrast to the winged males of the same species, which are able to prevent ergatoid male attacks by chemical female mimicry, young ergatoids do not seem to be able to produce a protective chemical profile. Conflicts in male-male competition between ergatoid males of different age thus seem to be resolved in favour of the older males. This might represent selection at the colony level rather than the individual level. © 2012 Cremer et al.; licensee BioMed Central Ltd.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:57Z","department":[{"_id":"SyCr"}],"date_updated":"2021-01-12T07:40:07Z","ddc":["570"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"94","_id":"2966","date_published":"2012-06-15T00:00:00Z","doi":"10.1186/1472-6785-12-7","date_created":"2018-12-11T12:00:35Z","has_accepted_license":"1","year":"2012","day":"15","publication":"BMC Ecology","publisher":"BioMed Central","quality_controlled":"1","oa":1,"publist_id":"3753","author":[{"last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Suefuji, Masaki","last_name":"Suefuji","first_name":"Masaki"},{"last_name":"Schrempf","full_name":"Schrempf, Alexandra","first_name":"Alexandra"},{"first_name":"Jürgen","full_name":"Heinze, Jürgen","last_name":"Heinze"}],"title":"The dynamics of male-male competition in Cardiocondyla obscurior ants","citation":{"mla":"Cremer, Sylvia, et al. “The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” BMC Ecology, vol. 12, 7, BioMed Central, 2012, doi:10.1186/1472-6785-12-7.","short":"S. Cremer, M. Suefuji, A. Schrempf, J. Heinze, BMC Ecology 12 (2012).","ieee":"S. Cremer, M. Suefuji, A. Schrempf, and J. Heinze, “The dynamics of male-male competition in Cardiocondyla obscurior ants,” BMC Ecology, vol. 12. BioMed Central, 2012.","ama":"Cremer S, Suefuji M, Schrempf A, Heinze J. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 2012;12. doi:10.1186/1472-6785-12-7","apa":"Cremer, S., Suefuji, M., Schrempf, A., & Heinze, J. (2012). The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. BioMed Central. https://doi.org/10.1186/1472-6785-12-7","chicago":"Cremer, Sylvia, Masaki Suefuji, Alexandra Schrempf, and Jürgen Heinze. “The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” BMC Ecology. BioMed Central, 2012. https://doi.org/10.1186/1472-6785-12-7.","ista":"Cremer S, Suefuji M, Schrempf A, Heinze J. 2012. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 12, 7."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"7"},{"year":"2012","day":"01","publication":"Genetics","page":"1027 - 1047","date_published":"2012-11-01T00:00:00Z","doi":"10.1534/genetics.112.143164","date_created":"2018-12-11T12:00:34Z","publisher":"Genetics Society of America","quality_controlled":"1","oa":1,"citation":{"mla":"Aeschbacher, Simon, et al. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” Genetics, vol. 192, no. 3, Genetics Society of America, 2012, pp. 1027–47, doi:10.1534/genetics.112.143164.","ieee":"S. Aeschbacher, M. Beaumont, and A. Futschik, “A novel approach for choosing summary statistics in approximate Bayesian computation,” Genetics, vol. 192, no. 3. Genetics Society of America, pp. 1027–1047, 2012.","short":"S. Aeschbacher, M. Beaumont, A. Futschik, Genetics 192 (2012) 1027–1047.","apa":"Aeschbacher, S., Beaumont, M., & Futschik, A. (2012). A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.112.143164","ama":"Aeschbacher S, Beaumont M, Futschik A. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 2012;192(3):1027-1047. doi:10.1534/genetics.112.143164","chicago":"Aeschbacher, Simon, Mark Beaumont, and Andreas Futschik. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” Genetics. Genetics Society of America, 2012. https://doi.org/10.1534/genetics.112.143164.","ista":"Aeschbacher S, Beaumont M, Futschik A. 2012. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 192(3), 1027–1047."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Aeschbacher, Simon","last_name":"Aeschbacher","first_name":"Simon","id":"2D35326E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Beaumont","full_name":"Beaumont, Mark","first_name":"Mark"},{"first_name":"Andreas","last_name":"Futschik","full_name":"Futschik, Andreas"}],"publist_id":"3763","external_id":{"pmid":["22960215"]},"title":"A novel approach for choosing summary statistics in approximate Bayesian computation","publication_status":"published","language":[{"iso":"eng"}],"issue":"3","volume":192,"abstract":[{"text":"The choice of summary statistics is a crucial step in approximate Bayesian computation (ABC). Since statistics are often not sufficient, this choice involves a trade-off between loss of information and reduction of dimensionality. The latter may increase the efficiency of ABC. Here, we propose an approach for choosing summary statistics based on boosting, a technique from the machine learning literature. We consider different types of boosting and compare them to partial least squares regression as an alternative. To mitigate the lack of sufficiency, we also propose an approach for choosing summary statistics locally, in the putative neighborhood of the true parameter value. We study a demographic model motivated by the re-introduction of Alpine ibex (Capra ibex) into the Swiss Alps. The parameters of interest are the mean and standard deviation across microsatellites of the scaled ancestral mutation rate (θanc = 4 Ne u), and the proportion of males obtaining access to matings per breeding season (ω). By simulation, we assess the properties of the posterior distribution obtained with the various methods. According to our criteria, ABC with summary statistics chosen locally via boosting with the L2-loss performs best. Applying that method to the ibex data, we estimate θanc ≈ 1.288, and find that most of the variation across loci of the ancestral mutation rate u is between 7.7×10−4 and 3.5×10−3 per locus per generation. The proportion of males with access to matings is estimated to ω ≈ 0.21, which is in good agreement with recent independent estimates.","lang":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"pmid":1,"oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/","open_access":"1"}],"month":"11","intvolume":" 192","date_updated":"2021-01-12T07:40:05Z","department":[{"_id":"NiBa"}],"_id":"2962","type":"journal_article","status":"public"},{"author":[{"orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick"}],"publist_id":"3754","title":"Kontext Open Access: Creative Commons","citation":{"ama":"Danowski P. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 2012;65(2):200-212.","apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB.","ieee":"P. Danowski, “Kontext Open Access: Creative Commons,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 65, no. 2. VÖB, pp. 200–212, 2012.","short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare 65 (2012) 200–212.","mla":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 65, no. 2, VÖB, 2012, pp. 200–12.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 65(2), 200–212.","chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB, 2012."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"200 - 212","date_created":"2018-12-11T12:00:35Z","date_published":"2012-09-01T00:00:00Z","year":"2012","has_accepted_license":"1","popular_science":"1","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare","day":"01","oa":1,"publisher":"VÖB","department":[{"_id":"E-Lib"}],"file_date_updated":"2020-07-14T12:45:57Z","date_updated":"2021-01-12T07:40:07Z","ddc":["020"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"95","status":"public","_id":"2965","volume":65,"issue":"2","publication_status":"published","language":[{"iso":"ger"}],"file":[{"file_size":503345,"date_updated":"2020-07-14T12:45:57Z","creator":"system","file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","date_created":"2018-12-12T10:08:42Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"162eea47d9d840c26b496ba6ae4d1c09","file_id":"4703"}],"main_file_link":[{"url":" http://hdl.handle.net/10760/17625","open_access":"1"}],"scopus_import":1,"intvolume":" 65","month":"09","abstract":[{"text":"Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND).","lang":"eng"}],"oa_version":"Published Version"},{"oa_version":"None","abstract":[{"lang":"eng","text":"Zebra finches are an ubiquitous model system for the study of vocal learning in animal communication. Their song has been well described, but its possible function(s) in social communication are only partly understood. The so-called ‘directed song’ is a high-intensity, high-performance song given during courtship in close proximity to the female, which is known to mediate mate choice and mating. However, this singing mode constitutes only a fraction of zebra finch males’ prolific song output. Potential communicative functions of their second, ‘undirected’ singing mode remain unresolved in the face of contradicting reports of both facilitating and inhibiting effects of social company on singing. We addressed this issue by experimentally manipulating social contexts in a within-subject design, comparing a solo versus male or female only company condition, each lasting for 24 hours. Males’ total song output was significantly higher when a conspecific was in audible and visible distance than when they were alone. Male and female company had an equally facilitating effect on song output. Our findings thus indicate that singing motivation is facilitated rather than inhibited by social company, suggesting that singing in zebra finches might function both in inter- and intrasexual communication. "}],"month":"11","intvolume":" 91","publisher":"Elsevier","quality_controlled":"1","day":"01","publication":"Behavioural Processes","language":[{"iso":"eng"}],"publication_status":"published","year":"2012","doi":"10.1016/j.beproc.2012.09.006","volume":91,"issue":"3","date_published":"2012-11-01T00:00:00Z","date_created":"2018-12-11T12:00:35Z","page":"262 - 266","_id":"2963","status":"public","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:40:06Z","citation":{"ista":"Jesse F, Riebel K. 2012. Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. 91(3), 262–266.","chicago":"Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” Behavioural Processes. Elsevier, 2012. https://doi.org/10.1016/j.beproc.2012.09.006.","ama":"Jesse F, Riebel K. Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. 2012;91(3):262-266. doi:10.1016/j.beproc.2012.09.006","apa":"Jesse, F., & Riebel, K. (2012). Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. Elsevier. https://doi.org/10.1016/j.beproc.2012.09.006","ieee":"F. Jesse and K. Riebel, “Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata,” Behavioural Processes, vol. 91, no. 3. Elsevier, pp. 262–266, 2012.","short":"F. Jesse, K. Riebel, Behavioural Processes 91 (2012) 262–266.","mla":"Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” Behavioural Processes, vol. 91, no. 3, Elsevier, 2012, pp. 262–66, doi:10.1016/j.beproc.2012.09.006."},"department":[{"_id":"JoBo"}],"title":"Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata","author":[{"id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87","first_name":"Fabienne","last_name":"Jesse","full_name":"Jesse, Fabienne"},{"last_name":"Riebel","full_name":"Riebel, Katharina","first_name":"Katharina"}],"publist_id":"3756"},{"department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:45:58Z","ddc":["004","005"],"date_updated":"2021-01-12T07:40:11Z","status":"public","pubrep_id":"721","type":"conference","conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","location":"Beijing, China","end_date":"2012-12-06","start_date":"2012-12-02"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"2974","volume":7658,"ec_funded":1,"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"ab879537385efc4cb4203e7ef0fea17b","file_id":"5048","file_size":482570,"date_updated":"2020-07-14T12:45:58Z","creator":"system","file_name":"IST-2016-721-v1+1_513.pdf","date_created":"2018-12-12T10:14:00Z"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"12","intvolume":" 7658","scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"text":"We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN) assumption, or equivalently, the hardness of decoding random linear codes. Our scheme not only allows for a simple and efficient zero-knowledge proof of knowledge for committed values (essentially a Σ-protocol), but also for such proofs showing any kind of relation amongst committed values, i.e. proving that messages m_0,...,m_u, are such that m_0=C(m_1,...,m_u) for any circuit C.\r\n\r\nTo get soundness which is exponentially small in a security parameter t, and when the zero-knowledge property relies on the LPN problem with secrets of length l, our 3 round protocol has communication complexity O(t|C|l log(l)) and computational complexity of O(t|C|l) bit operations. The hidden constants are small, and the computation consists mostly of computing inner products of bit-vectors.","lang":"eng"}],"editor":[{"last_name":"Wang","full_name":"Wang, Xiaoyun","first_name":"Xiaoyun"},{"last_name":"Sako","full_name":"Sako, Kazue","first_name":"Kazue"}],"title":"Commitments and efficient zero knowledge proofs from learning parity with noise","publist_id":"3730","author":[{"last_name":"Jain","full_name":"Jain, Abhishek","first_name":"Abhishek"},{"last_name":"Krenn","orcid":"0000-0003-2835-9093","full_name":"Krenn, Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"last_name":"Tentes","full_name":"Tentes, Aris","first_name":"Aris"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Jain A, Krenn S, Pietrzak KZ, Tentes A. Commitments and efficient zero knowledge proofs from learning parity with noise. In: Wang X, Sako K, eds. Vol 7658. Springer; 2012:663-680. doi:10.1007/978-3-642-34961-4_40","apa":"Jain, A., Krenn, S., Pietrzak, K. Z., & Tentes, A. (2012). Commitments and efficient zero knowledge proofs from learning parity with noise. In X. Wang & K. Sako (Eds.) (Vol. 7658, pp. 663–680). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China: Springer. https://doi.org/10.1007/978-3-642-34961-4_40","ieee":"A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680.","short":"A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.","mla":"Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.","ista":"Jain A, Krenn S, Pietrzak KZ, Tentes A. 2012. Commitments and efficient zero knowledge proofs from learning parity with noise. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7658, 663–680.","chicago":"Jain, Abhishek, Stephan Krenn, Krzysztof Z Pietrzak, and Aris Tentes. “Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise.” edited by Xiaoyun Wang and Kazue Sako, 7658:663–80. Springer, 2012. https://doi.org/10.1007/978-3-642-34961-4_40."},"project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"doi":"10.1007/978-3-642-34961-4_40","date_published":"2012-12-01T00:00:00Z","date_created":"2018-12-11T12:00:38Z","page":"663 - 680","day":"01","has_accepted_license":"1","year":"2012","publisher":"Springer","oa":1,"acknowledgement":"We are grateful to Petros Mol for helpful discussions on the reduction for the hardness of the xLPN problem.\r\n"},{"acknowledgement":"This work was supported by grants from the Deutsche Forschungsgemeinschaft (TR 3/B10, Leibniz program, GSC-4 Spemann Graduate School) and the European Union (European Research Council Advanced Grant).","oa":1,"quality_controlled":"1","publisher":"Society for Neuroscience","publication":"Journal of Neuroscience","day":"10","year":"2012","date_created":"2018-12-11T12:00:36Z","date_published":"2012-10-10T00:00:00Z","doi":"10.1523/JNEUROSCI.6104-11.2012","page":"14294 - 14304","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Goswami, Sarit, et al. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” Journal of Neuroscience, vol. 32, no. 41, Society for Neuroscience, 2012, pp. 14294–304, doi:10.1523/JNEUROSCI.6104-11.2012.","ieee":"S. Goswami, I. Bucurenciu, and P. M. Jonas, “Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling,” Journal of Neuroscience, vol. 32, no. 41. Society for Neuroscience, pp. 14294–14304, 2012.","short":"S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012) 14294–14304.","apa":"Goswami, S., Bucurenciu, I., & Jonas, P. M. (2012). Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.6104-11.2012","ama":"Goswami S, Bucurenciu I, Jonas PM. Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal of Neuroscience. 2012;32(41):14294-14304. doi:10.1523/JNEUROSCI.6104-11.2012","chicago":"Goswami, Sarit, Iancu Bucurenciu, and Peter M Jonas. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” Journal of Neuroscience. Society for Neuroscience, 2012. https://doi.org/10.1523/JNEUROSCI.6104-11.2012.","ista":"Goswami S, Bucurenciu I, Jonas PM. 2012. Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal of Neuroscience. 32(41), 14294–14304."},"title":"Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling","external_id":{"pmid":["23055500"]},"author":[{"last_name":"Goswami","full_name":"Goswami, Sarit","first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Iancu","last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"}],"publist_id":"3744","oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"The coupling between presynaptic Ca^(2+) channels and Ca^(2+) sensors of exocytosis is a key determinant of synaptic transmission. Evoked release from parvalbumin (PV)-expressing interneurons is triggered by nanodomain coupling of P/Q-type Ca^(2+) channels, whereas release from cholecystokinin (CCK)-containing interneurons is generated by microdomain coupling of N-type channels. Nanodomain coupling has several functional advantages, including speed and efficacy of transmission. One potential disadvantage is that stochastic\r\nopening of presynaptic Ca^(2+) channels may trigger spontaneous transmitter release. We addressed this possibility in rat hippocampal\r\ngranule cells, which receive converging inputs from different inhibitory sources. Both reduction of extracellular Ca^(2+) concentration and the unselective Ca^(2+) channel blocker Cd^(2+) reduced the frequency of miniature IPSCs (mIPSCs) in granule cells by ~50%, suggesting that the opening of presynaptic Ca^(2+) channels contributes to spontaneous release. Application of the selective P/Q-type Ca^(2+) channel blocker\r\nω-agatoxin IVa had no detectable effects, whereas both the N-type blocker ω-conotoxin GVIa and the L-type blocker nimodipine reduced\r\nmIPSC frequency. Furthermore, both the fast Ca^(2+) chelator BAPTA-AM and the slow chelator EGTA-AM reduced the mIPSC frequency,\r\nsuggesting that Ca^(2+)-dependent spontaneous release is triggered by microdomain rather than nanodomain coupling. The CB_(1) receptor\r\nagonist WIN 55212-2 also decreased spontaneous release; this effect was occluded by prior application of ω-conotoxin GVIa, suggesting that a major fraction of Ca^(2+)-dependent spontaneous release was generated at the terminals of CCK-expressing interneurons. Tonic inhibition generated by spontaneous opening of presynaptic N- and L-type Ca^(2+) channels may be important for hippocampal information processing.\r\n"}],"intvolume":" 32","month":"10","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","issue":"41","volume":32,"_id":"2969","status":"public","type":"journal_article","date_updated":"2021-01-12T07:40:08Z","department":[{"_id":"PeJo"}]}]