[{"extern":"1","date_updated":"2023-02-21T10:46:37Z","keyword":["General Earth and Planetary Sciences"],"status":"public","type":"journal_article","article_type":"letter_note","_id":"12640","volume":6,"issue":"9","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1752-0908"],"issn":["1752-0894"]},"intvolume":" 6","month":"09","scopus_import":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Greater Himalayan glaciers are retreating and losing mass at rates comparable to glaciers in other regions of the world1,2,3,4,5. Assessments of future changes and their associated hydrological impacts are scarce, oversimplify glacier dynamics or include a limited number of climate models6,7,8,9. Here, we use results from the latest ensemble of climate models in combination with a high-resolution glacio-hydrological model to assess the hydrological impact of climate change on two climatically contrasting watersheds in the Greater Himalaya, the Baltoro and Langtang watersheds that drain into the Indus and Ganges rivers, respectively. We show that the largest uncertainty in future runoff is a result of variations in projected precipitation between climate models. In both watersheds, strong, but highly variable, increases in future runoff are projected and, despite the different characteristics of the watersheds, their responses are surprisingly similar. In both cases, glaciers will recede but net glacier melt runoff is on a rising limb at least until 2050. In combination with a positive change in precipitation, water availability during this century is not likely to decline. We conclude that river basins that depend on monsoon rains and glacier melt will continue to sustain the increasing water demands expected in these areas10."}],"title":"Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds","article_processing_charge":"No","author":[{"full_name":"Immerzeel, W. W.","last_name":"Immerzeel","first_name":"W. W."},{"last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"first_name":"M. F. P.","full_name":"Bierkens, M. F. P.","last_name":"Bierkens"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Immerzeel, W. W., et al. “Rising River Flows throughout the Twenty-First Century in Two Himalayan Glacierized Watersheds.” Nature Geoscience, vol. 6, no. 9, Springer Nature, 2013, pp. 742–45, doi:10.1038/ngeo1896.","short":"W.W. Immerzeel, F. Pellicciotti, M.F.P. Bierkens, Nature Geoscience 6 (2013) 742–745.","ieee":"W. W. Immerzeel, F. Pellicciotti, and M. F. P. Bierkens, “Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds,” Nature Geoscience, vol. 6, no. 9. Springer Nature, pp. 742–745, 2013.","apa":"Immerzeel, W. W., Pellicciotti, F., & Bierkens, M. F. P. (2013). Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds. Nature Geoscience. Springer Nature. https://doi.org/10.1038/ngeo1896","ama":"Immerzeel WW, Pellicciotti F, Bierkens MFP. Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds. Nature Geoscience. 2013;6(9):742-745. doi:10.1038/ngeo1896","chicago":"Immerzeel, W. W., Francesca Pellicciotti, and M. F. P. Bierkens. “Rising River Flows throughout the Twenty-First Century in Two Himalayan Glacierized Watersheds.” Nature Geoscience. Springer Nature, 2013. https://doi.org/10.1038/ngeo1896.","ista":"Immerzeel WW, Pellicciotti F, Bierkens MFP. 2013. Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds. Nature Geoscience. 6(9), 742–745."},"date_created":"2023-02-20T08:17:17Z","date_published":"2013-09-13T00:00:00Z","doi":"10.1038/ngeo1896","page":"742-745","publication":"Nature Geoscience","day":"13","year":"2013","publisher":"Springer Nature","quality_controlled":"1"},{"citation":{"short":"M. Heynen, F. Pellicciotti, M. Carenzo, Annals of Glaciology 54 (2013) 311–321.","ieee":"M. Heynen, F. Pellicciotti, and M. Carenzo, “Parameter sensitivity of a distributed enhanced temperature-index melt model,” Annals of Glaciology, vol. 54, no. 63. International Glaciological Society, pp. 311–321, 2013.","ama":"Heynen M, Pellicciotti F, Carenzo M. Parameter sensitivity of a distributed enhanced temperature-index melt model. Annals of Glaciology. 2013;54(63):311-321. doi:10.3189/2013aog63a537","apa":"Heynen, M., Pellicciotti, F., & Carenzo, M. (2013). Parameter sensitivity of a distributed enhanced temperature-index melt model. Annals of Glaciology. International Glaciological Society. https://doi.org/10.3189/2013aog63a537","mla":"Heynen, Martin, et al. “Parameter Sensitivity of a Distributed Enhanced Temperature-Index Melt Model.” Annals of Glaciology, vol. 54, no. 63, International Glaciological Society, 2013, pp. 311–21, doi:10.3189/2013aog63a537.","ista":"Heynen M, Pellicciotti F, Carenzo M. 2013. Parameter sensitivity of a distributed enhanced temperature-index melt model. Annals of Glaciology. 54(63), 311–321.","chicago":"Heynen, Martin, Francesca Pellicciotti, and Marco Carenzo. “Parameter Sensitivity of a Distributed Enhanced Temperature-Index Melt Model.” Annals of Glaciology. International Glaciological Society, 2013. https://doi.org/10.3189/2013aog63a537."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Heynen, Martin","last_name":"Heynen","first_name":"Martin"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca"},{"first_name":"Marco","full_name":"Carenzo, Marco","last_name":"Carenzo"}],"article_processing_charge":"No","title":"Parameter sensitivity of a distributed enhanced temperature-index melt model","publisher":"International Glaciological Society","quality_controlled":"1","oa":1,"year":"2013","day":"01","publication":"Annals of Glaciology","page":"311-321","date_published":"2013-08-01T00:00:00Z","doi":"10.3189/2013aog63a537","date_created":"2023-02-20T08:17:21Z","_id":"12641","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-02-21T10:43:42Z","extern":"1","abstract":[{"text":"We investigate the sensitivity of a distributed enhanced temperature-index (ETI) melt model, in order to understand which parameters have the largest influence on model outputs and thus need to be accurately known. We use melt and meteorological data from two Alpine glaciers and one glacier in the Andes of Chile. Sensitivity analysis is conducted in a systematic way in terms of parameters and the different conditions (day, night, clear-sky, overcast), melt seasons and glaciers examined. The sensitivity of total melt to changes in individual parameters is calculated using a local method around the optimal value of the parameters. We verify that the parameters are optimal at the distributed scale and assess the model uncertainty induced by uncertainty in the parameters using a Monte Carlo technique. Model sensitivity to parameters is consistent across melt seasons, glaciers, different conditions and the daily statistics examined. The parameters to which the model is most sensitive are the shortwave-radiation factor, the temperature lapse rate for extrapolation of air temperature, the albedo parameters, the temperature threshold and the cloud transmittance factor parameters. A parameter uncertainty of 5% results in a model uncertainty of 5.6% of mean melt on Haut Glacier d’Arolla, Switzerland.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3189/2013aog63a537"}],"month":"08","intvolume":" 54","publication_identifier":{"issn":["0260-3055"],"eissn":["1727-5644"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":54,"issue":"63"},{"_id":"1304","type":"journal_article","status":"public","date_updated":"2021-01-12T06:49:45Z","citation":{"chicago":"Haikala, Väinö, Maximilian A Jösch, Alexander Borst, and Alex Mauss. “Optogenetic Control of Fly Optomotor Responses.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.0340-13.2013.","ista":"Haikala V, Jösch MA, Borst A, Mauss A. 2013. Optogenetic control of fly optomotor responses. Journal of Neuroscience. 33(34), 13927–13934.","mla":"Haikala, Väinö, et al. “Optogenetic Control of Fly Optomotor Responses.” Journal of Neuroscience, vol. 33, no. 34, Society for Neuroscience, 2013, pp. 13927–34, doi:10.1523/JNEUROSCI.0340-13.2013.","ieee":"V. Haikala, M. A. Jösch, A. Borst, and A. Mauss, “Optogenetic control of fly optomotor responses,” Journal of Neuroscience, vol. 33, no. 34. Society for Neuroscience, pp. 13927–13934, 2013.","short":"V. Haikala, M.A. Jösch, A. Borst, A. Mauss, Journal of Neuroscience 33 (2013) 13927–13934.","ama":"Haikala V, Jösch MA, Borst A, Mauss A. Optogenetic control of fly optomotor responses. Journal of Neuroscience. 2013;33(34):13927-13934. doi:10.1523/JNEUROSCI.0340-13.2013","apa":"Haikala, V., Jösch, M. A., Borst, A., & Mauss, A. (2013). Optogenetic control of fly optomotor responses. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0340-13.2013"},"extern":1,"publist_id":"5967","author":[{"first_name":"Väinö","last_name":"Haikala","full_name":"Haikala, Väinö"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","full_name":"Maximilian Jösch","last_name":"Jösch"},{"full_name":"Borst, Alexander","last_name":"Borst","first_name":"Alexander"},{"last_name":"Mauss","full_name":"Mauss, Alex S","first_name":"Alex"}],"title":"Optogenetic control of fly optomotor responses","abstract":[{"lang":"eng","text":"When confronted with a large-field stimulus rotating around the vertical body axis, flies display a following behavior called "optomotor response." As neural control elements, the large tangential horizontal system (HS) cells of the lobula plate have been prime candidates for long. Here, we applied optogenetic stimulation of HS cells to evaluate their behavioral role in Drosophila. To minimize interference of the optical activation of channelrhodopsin-2 with the visual perception of the flies, we used a bistable variant called ChR2-C128S. By applying pulses of blue and yellow light, we first demonstrate electrophysiologically that lobula plate tangential cells can be activated and deactivated repeatedly with no evident change in depolarization strength over trials. We next show that selective optogenetic activation of HS cells elicits robust yaw head movements and yaw turning responses in fixed and tethered flying flies, respectively."}],"acknowledgement":"This work was supported by the Max Planck Society. ","publisher":"Society for Neuroscience","quality_controlled":0,"month":"01","intvolume":" 33","year":"2013","publication_status":"published","day":"01","publication":"Journal of Neuroscience","page":"13927 - 13934","date_published":"2013-01-01T00:00:00Z","volume":33,"issue":"34","doi":"10.1523/JNEUROSCI.0340-13.2013","date_created":"2018-12-11T11:51:16Z"},{"acknowledgement":"This work was supported by the Max-Planck-Society and the SFB 870 of the Deutsche Forschungsgemeinschaft.","abstract":[{"text":"In the fly Drosophila melanogaster, photoreceptor input to motion vision is split into two parallel pathways as represented by first-order interneurons L1 and L2 (Rister et al., 2007; Joesch et al., 2010). However, how these pathways are functionally specialized remains controversial. One study (Eichner et al., 2011) proposed that the L1-pathway evaluates only sequences of brightness increments (ON-ON), while the L2-pathway processes exclusively brightness decrements (OFF-OFF). Another study (Clark et al., 2011) proposed that each of the two pathways evaluates both ON-ON and OFF-OFF sequences. To decide between these alternatives, we recorded from motionsensitive neurons in flies in which the output from either L1 or L2 was genetically blocked. We found that blocking L1 abolishes ON-ON responses but leaves OFF-OFF responses intact. The opposite was true, when the output from L2 was blocked. We conclude that the L1 and L2 pathways are functionally specialized to detect ON-ON and OFF-OFF sequences, respectively.","lang":"eng"}],"month":"01","intvolume":" 33","publisher":"Society for Neuroscience","quality_controlled":0,"day":"16","publication":"Journal of Neuroscience","publication_status":"published","year":"2013","date_published":"2013-01-16T00:00:00Z","issue":"3","volume":33,"doi":"10.1523/JNEUROSCI.3374-12.2013","date_created":"2018-12-11T11:51:16Z","page":"902 - 905","_id":"1305","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:49:45Z","citation":{"mla":"Jösch, Maximilian A., et al. “Functional Specialization of Parallel Motion Detection Circuits in the Fly.” Journal of Neuroscience, vol. 33, no. 3, Society for Neuroscience, 2013, pp. 902–05, doi:10.1523/JNEUROSCI.3374-12.2013.","ama":"Jösch MA, Weber F, Eichner H, Borst A. Functional specialization of parallel motion detection circuits in the fly. Journal of Neuroscience. 2013;33(3):902-905. doi:10.1523/JNEUROSCI.3374-12.2013","apa":"Jösch, M. A., Weber, F., Eichner, H., & Borst, A. (2013). Functional specialization of parallel motion detection circuits in the fly. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.3374-12.2013","ieee":"M. A. Jösch, F. Weber, H. Eichner, and A. Borst, “Functional specialization of parallel motion detection circuits in the fly,” Journal of Neuroscience, vol. 33, no. 3. Society for Neuroscience, pp. 902–905, 2013.","short":"M.A. Jösch, F. Weber, H. Eichner, A. Borst, Journal of Neuroscience 33 (2013) 902–905.","chicago":"Jösch, Maximilian A, Franz Weber, Hubert Eichner, and Alexander Borst. “Functional Specialization of Parallel Motion Detection Circuits in the Fly.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.3374-12.2013.","ista":"Jösch MA, Weber F, Eichner H, Borst A. 2013. Functional specialization of parallel motion detection circuits in the fly. Journal of Neuroscience. 33(3), 902–905."},"title":"Functional specialization of parallel motion detection circuits in the fly","author":[{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","last_name":"Jösch","orcid":"0000-0002-3937-1330","full_name":"Maximilian Jösch"},{"first_name":"Franz","full_name":"Weber, Franz","last_name":"Weber"},{"last_name":"Eichner","full_name":"Eichner, Hubert","first_name":"Hubert"},{"full_name":"Borst, Alexander","last_name":"Borst","first_name":"Alexander"}],"publist_id":"5968"},{"month":"01","intvolume":" 45","publisher":"Society for Industrial and Applied Mathematics ","quality_controlled":0,"abstract":[{"lang":"eng","text":"We derive sufficient conditions for advection-driven backward motion of the free boundary in a chemotaxis model with degenerate mobility. In this model, a porous-medium-type diffusive term and an advection term are in competition. The former induces forward motion, the latter may induce backward motion of the free boundary depending on the direction of advection. We deduce conditions on the growth of the initial data at the free boundary which ensure that at least initially the advection term is dominant. This implies local backward motion of the free boundary provided the advection is (locally) directed appropriately. Our result is based on a new class of moving test functions and Stampacchia's lemma. As a by-product of our estimates, we obtain quantitative bounds on the spreading of the support of solutions for the chemotaxis model and provide a proof for the finite speed of the support propagation property of solutions."}],"date_published":"2013-01-01T00:00:00Z","issue":"3","doi":"10.1137/120874291","volume":45,"date_created":"2018-12-11T11:51:17Z","page":"1585 - 1615","day":"01","publication":"SIAM Journal on Mathematical Analysis","year":"2013","publication_status":"published","status":"public","type":"journal_article","_id":"1308","title":"Advection-driven support shrinking in a chemotaxis model with degenerate mobility","author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","orcid":"0000-0002-0479-558X","full_name":"Julian Fischer","last_name":"Fischer"}],"publist_id":"5963","extern":1,"citation":{"ista":"Fischer JL. 2013. Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. 45(3), 1585–1615.","chicago":"Fischer, Julian L. “Advection-Driven Support Shrinking in a Chemotaxis Model with Degenerate Mobility.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120874291.","ieee":"J. L. Fischer, “Advection-driven support shrinking in a chemotaxis model with degenerate mobility,” SIAM Journal on Mathematical Analysis, vol. 45, no. 3. Society for Industrial and Applied Mathematics , pp. 1585–1615, 2013.","short":"J.L. Fischer, SIAM Journal on Mathematical Analysis 45 (2013) 1585–1615.","ama":"Fischer JL. Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. 2013;45(3):1585-1615. doi:10.1137/120874291","apa":"Fischer, J. L. (2013). Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120874291","mla":"Fischer, Julian L. “Advection-Driven Support Shrinking in a Chemotaxis Model with Degenerate Mobility.” SIAM Journal on Mathematical Analysis, vol. 45, no. 3, Society for Industrial and Applied Mathematics , 2013, pp. 1585–615, doi:10.1137/120874291."},"date_updated":"2021-01-12T06:49:46Z"},{"title":"Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models","publist_id":"5962","author":[{"first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","full_name":"Julian Fischer","orcid":"0000-0002-0479-558X"}],"extern":1,"date_updated":"2021-01-12T06:49:46Z","citation":{"mla":"Fischer, Julian L. “Uniqueness of Solutions of the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift Diffusion Models.” Communications in Partial Differential Equations, vol. 38, no. 11, Taylor & Francis, 2013, pp. 2004–47, doi:10.1080/03605302.2013.823548.","ama":"Fischer JL. Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. Communications in Partial Differential Equations. 2013;38(11):2004-2047. doi:10.1080/03605302.2013.823548","apa":"Fischer, J. L. (2013). Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. Communications in Partial Differential Equations. Taylor & Francis. https://doi.org/10.1080/03605302.2013.823548","ieee":"J. L. Fischer, “Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models,” Communications in Partial Differential Equations, vol. 38, no. 11. Taylor & Francis, pp. 2004–2047, 2013.","short":"J.L. Fischer, Communications in Partial Differential Equations 38 (2013) 2004–2047.","chicago":"Fischer, Julian L. “Uniqueness of Solutions of the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift Diffusion Models.” Communications in Partial Differential Equations. Taylor & Francis, 2013. https://doi.org/10.1080/03605302.2013.823548.","ista":"Fischer JL. 2013. Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. Communications in Partial Differential Equations. 38(11), 2004–2047."},"status":"public","type":"journal_article","_id":"1307","date_created":"2018-12-11T11:51:17Z","issue":"11","volume":38,"date_published":"2013-11-01T00:00:00Z","doi":"10.1080/03605302.2013.823548","page":"2004 - 2047","publication":"Communications in Partial Differential Equations","day":"01","publication_status":"published","year":"2013","intvolume":" 38","month":"11","quality_controlled":0,"publisher":"Taylor & Francis","abstract":[{"text":"We prove uniqueness of solutions of the DLSS equation in a class of sufficiently regular functions. The global weak solutions of the DLSS equation constructed by Jüngel and Matthes belong to this class of uniqueness. We also show uniqueness of solutions for the quantum drift-diffusion equation, which contains additional drift and second-order diffusion terms. The results hold in case of periodic or Dirichlet-Neumann boundary conditions. Our proof is based on a monotonicity property of the DLSS operator and sophisticated approximation arguments; we derive a PDE satisfied by the pointwise square root of the solution, which enables us to exploit the monotonicity property of the operator.","lang":"eng"}]},{"title":"Optimal lower bounds on asymptotic support propagation rates for the thin-film equation","publist_id":"5961","author":[{"last_name":"Fischer","full_name":"Julian Fischer","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L"}],"extern":1,"date_updated":"2021-01-12T06:49:47Z","citation":{"chicago":"Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” Journal of Differential Equations. Academic Press, 2013. https://doi.org/10.1016/j.jde.2013.07.028.","ista":"Fischer JL. 2013. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. 255(10), 3127–3149.","mla":"Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” Journal of Differential Equations, vol. 255, no. 10, Academic Press, 2013, pp. 3127–49, doi:10.1016/j.jde.2013.07.028.","short":"J.L. Fischer, Journal of Differential Equations 255 (2013) 3127–3149.","ieee":"J. L. Fischer, “Optimal lower bounds on asymptotic support propagation rates for the thin-film equation,” Journal of Differential Equations, vol. 255, no. 10. Academic Press, pp. 3127–3149, 2013.","ama":"Fischer JL. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. 2013;255(10):3127-3149. doi:10.1016/j.jde.2013.07.028","apa":"Fischer, J. L. (2013). Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. Academic Press. https://doi.org/10.1016/j.jde.2013.07.028"},"status":"public","type":"journal_article","_id":"1310","date_created":"2018-12-11T11:51:18Z","volume":255,"issue":"10","date_published":"2013-11-15T00:00:00Z","doi":"10.1016/j.jde.2013.07.028","page":"3127 - 3149","publication":"Journal of Differential Equations","day":"15","publication_status":"published","year":"2013","intvolume":" 255","month":"11","publisher":"Academic Press","quality_controlled":0,"abstract":[{"lang":"eng","text":"We derive lower bounds on asymptotic support propagation rates for strong solutions of the Cauchy problem for the thin-film equation. The bounds coincide up to a constant factor with the previously known upper bounds and thus are sharp. Our results hold in case of at most three spatial dimensions and n∈. (1, 2.92). The result is established using weighted backward entropy inequalities with singular weight functions to yield a differential inequality; combined with some entropy production estimates, the optimal rate of propagation is obtained. To the best of our knowledge, these are the first lower bounds on asymptotic support propagation rates for higher-order nonnegativity-preserving parabolic equations."}]},{"year":"2013","has_accepted_license":"1","publication":"22nd EACSL Annual Conference on Computer Science Logic","day":"01","page":"181 - 196","date_created":"2018-12-11T11:51:39Z","date_published":"2013-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2013.181","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.","ista":"Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:10.4230/LIPIcs.CSL.2013.181.","short":"K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: 22nd EACSL Annual Conference on Computer Science Logic. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:10.4230/LIPIcs.CSL.2013.181","apa":"Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Nathanaël","full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow"}],"publist_id":"5837","title":"Infinite-state games with finitary conditions","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"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"}],"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:13:38Z","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","creator":"system","date_updated":"2020-07-14T12:44:47Z","file_size":547296,"checksum":"b7091a3866db573c0db5ec486952255e","file_id":"5023","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"ec_funded":1,"volume":23,"abstract":[{"lang":"eng","text":"We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"intvolume":" 23","month":"09","date_updated":"2021-01-12T06:50:14Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:47Z","series_title":"Leibniz International Proceedings in Informatics","_id":"1374","conference":{"name":"CSL: Computer Science Logic","location":"Torino, Italy","end_date":"2013-09-05","start_date":"203-09-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)"},"type":"conference","pubrep_id":"624","status":"public"},{"date_updated":"2021-01-12T06:50:19Z","department":[{"_id":"ToHe"}],"_id":"1385","status":"public","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","location":"Portland, OR, United States","end_date":"2013-10-23"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results."}],"month":"12","main_file_link":[{"url":"http://arxiv.org/abs/1308.4767","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394.","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in 2013 Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 77–84.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: 2013 Formal Methods in Computer-Aided Design. IEEE; 2013:77-84. doi:10.1109/FMCAD.2013.6679394","apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679394.","ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84."},"title":"Synthesizing multiple boolean functions using interpolation on a single proof","external_id":{"arxiv":["1308.4767"]},"publist_id":"5825","author":[{"last_name":"Hofferek","full_name":"Hofferek, Georg","first_name":"Georg"},{"full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Könighofer","full_name":"Könighofer, Bettina","first_name":"Bettina"},{"first_name":"Jie","last_name":"Jiang","full_name":"Jiang, Jie"},{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"}],"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication":"2013 Formal Methods in Computer-Aided Design","day":"11","year":"2013","date_created":"2018-12-11T11:51:43Z","doi":"10.1109/FMCAD.2013.6679394","date_published":"2013-12-11T00:00:00Z","page":"77 - 84","acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND (FP7-2009-IST-4-248613), and QUAINT (I774-N23), ","oa":1,"quality_controlled":"1","publisher":"IEEE"},{"acknowledgement":"and ERC Grant QUALITY.","publisher":"Springer","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2013","day":"01","page":"89 - 100","date_published":"2013-07-01T00:00:00Z","doi":"10.1007/978-3-642-39212-2_11","date_created":"2018-12-11T11:51:44Z","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"citation":{"apa":"Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","mla":"Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi"},{"full_name":"Kuperberg, Denis","last_name":"Kuperberg","first_name":"Denis"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"last_name":"Skrzypczak","full_name":"Skrzypczak, Michał","first_name":"Michał"}],"publist_id":"5823","article_processing_charge":"No","title":"Nondeterminism in the presence of a diverse or unknown future","abstract":[{"text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"month":"07","intvolume":" 7966","publication_status":"published","file":[{"checksum":"98bc02e3793072e279ec8d364b381ff3","file_id":"7857","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2013_ICALP_Boker.pdf","date_created":"2020-05-15T11:05:50Z","creator":"dernst","file_size":276982,"date_updated":"2020-07-14T12:44:48Z"}],"language":[{"iso":"eng"}],"issue":"PART 2","volume":7966,"ec_funded":1,"_id":"1387","series_title":"Lecture Notes in Computer Science","type":"conference","conference":{"name":"ICALP: Automata, Languages and Programming","location":"Riga, Latvia","end_date":"2013-07-12","start_date":"2013-07-08"},"status":"public","date_updated":"2020-08-11T10:09:09Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:44:48Z"},{"date_created":"2018-12-11T11:52:02Z","doi":"10.4007/annals.2013.177.3.8","issue":"3","volume":177,"date_published":"2013-01-01T00:00:00Z","page":"1147 - 1168","publication":"Annals of Mathematics","day":"01","publication_status":"published","year":"2013","intvolume":" 177","month":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.2375"}],"oa":1,"publisher":"Princeton University Press","quality_controlled":0,"acknowledgement":"The first author thanks the Royal Society for funding his research 2005-2012 in the form of a Royal Society University Research Fellowship as well as the Mathematical Institute and Wadham College in Oxford for a very productive environment. The second author is supported by Agence Nationale de la Recherche grant\nANR-09-JCJC-0102-01. The third author is supported by the NSF grant DMS-1101484 and a Research Scholarship from the Clay Mathematical Institute.","abstract":[{"text":"We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier transform, the dimensions of the isotypical components of the cohomology of associated Nakajima quiver varieties under the action of a Weyl group. The generating function of the corresponding Poincare polynomials is an extension of Hua's formula for Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The resulting formulae contain a wide range of information on the geometry of the quiver varieties.","lang":"eng"}],"title":"Positivity for Kac polynomials and DT-invariants of quivers","author":[{"first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel","last_name":"Hausel"},{"last_name":"Letellier","full_name":"Letellier, Emmanuel","first_name":"Emmanuel"},{"first_name":"Fernando","last_name":"Rodríguez Villegas","full_name":"Rodríguez Villegas, Fernando"}],"publist_id":"5754","extern":1,"date_updated":"2021-01-12T06:50:47Z","citation":{"mla":"Hausel, Tamás, et al. “Positivity for Kac Polynomials and DT-Invariants of Quivers.” Annals of Mathematics, vol. 177, no. 3, Princeton University Press, 2013, pp. 1147–68, doi:10.4007/annals.2013.177.3.8.","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Positivity for Kac polynomials and DT-invariants of quivers,” Annals of Mathematics, vol. 177, no. 3. Princeton University Press, pp. 1147–1168, 2013.","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177 (2013) 1147–1168.","apa":"Hausel, T., Letellier, E., & Rodríguez Villegas, F. (2013). Positivity for Kac polynomials and DT-invariants of quivers. Annals of Mathematics. Princeton University Press. https://doi.org/10.4007/annals.2013.177.3.8","ama":"Hausel T, Letellier E, Rodríguez Villegas F. Positivity for Kac polynomials and DT-invariants of quivers. Annals of Mathematics. 2013;177(3):1147-1168. doi:10.4007/annals.2013.177.3.8","chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Positivity for Kac Polynomials and DT-Invariants of Quivers.” Annals of Mathematics. Princeton University Press, 2013. https://doi.org/10.4007/annals.2013.177.3.8.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2013. Positivity for Kac polynomials and DT-invariants of quivers. Annals of Mathematics. 177(3), 1147–1168."},"status":"public","type":"journal_article","_id":"1442"},{"abstract":[{"text":"Here we survey several results and conjectures on the cohomology of the total space of the Hitchin system: the moduli space of semi-stable rank n and degree d Higgs bundles on a complex algebraic curve C. The picture emerging is a dynamic mixture of ideas originating in theoretical physics such as gauge theory and mirror symmetry, Weil conjectures in arithmetic algebraic geometry, representation theory of finite groups of Lie type and Langlands duality in number theory.","lang":"eng"}],"intvolume":" 25","month":"03","main_file_link":[{"url":"http://arxiv.org/abs/1102.1717","open_access":"1"}],"oa":1,"alternative_title":["Advanced Lectures in Mathematics"],"publisher":"International Press","quality_controlled":0,"publication":"Handbook of Moduli: Volume II","day":"15","year":"2013","publication_status":"published","date_created":"2018-12-11T11:52:03Z","date_published":"2013-03-15T00:00:00Z","volume":25,"page":"29 - 70","_id":"1443","status":"public","type":"book_chapter","extern":1,"date_updated":"2021-01-12T06:50:47Z","citation":{"chicago":"Hausel, Tamás. “Global Topology of the Hitchin System.” In Handbook of Moduli: Volume II, 25:29–70. International Press, 2013.","ista":"Hausel T. 2013.Global topology of the Hitchin system. In: Handbook of Moduli: Volume II. Advanced Lectures in Mathematics, vol. 25, 29–70.","mla":"Hausel, Tamás. “Global Topology of the Hitchin System.” Handbook of Moduli: Volume II, vol. 25, International Press, 2013, pp. 29–70.","ama":"Hausel T. Global topology of the Hitchin system. In: Handbook of Moduli: Volume II. Vol 25. International Press; 2013:29-70.","apa":"Hausel, T. (2013). Global topology of the Hitchin system. In Handbook of Moduli: Volume II (Vol. 25, pp. 29–70). International Press.","short":"T. Hausel, in:, Handbook of Moduli: Volume II, International Press, 2013, pp. 29–70.","ieee":"T. Hausel, “Global topology of the Hitchin system,” in Handbook of Moduli: Volume II, vol. 25, International Press, 2013, pp. 29–70."},"title":"Global topology of the Hitchin system","publist_id":"5753","author":[{"first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel","full_name":"Tamas Hausel"}]},{"publist_id":"5724","author":[{"last_name":"Hausel","full_name":"Tamas Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Letellier, Emmanuel","last_name":"Letellier","first_name":"Emmanuel"},{"first_name":"Fernando","last_name":"Rodríguez Villegas","full_name":"Rodríguez Villegas, Fernando"}],"title":"Arithmetic harmonic analysis on character and quiver varieties II","date_updated":"2021-01-12T06:50:57Z","citation":{"short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Advances in Mathematics 234 (2013) 85–128.","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Arithmetic harmonic analysis on character and quiver varieties II,” Advances in Mathematics, vol. 234. Academic Press, pp. 85–128, 2013.","ama":"Hausel T, Letellier E, Rodríguez Villegas F. Arithmetic harmonic analysis on character and quiver varieties II. Advances in Mathematics. 2013;234:85-128. doi:10.1016/j.aim.2012.10.009","apa":"Hausel, T., Letellier, E., & Rodríguez Villegas, F. (2013). Arithmetic harmonic analysis on character and quiver varieties II. Advances in Mathematics. Academic Press. https://doi.org/10.1016/j.aim.2012.10.009","mla":"Hausel, Tamás, et al. “Arithmetic Harmonic Analysis on Character and Quiver Varieties II.” Advances in Mathematics, vol. 234, Academic Press, 2013, pp. 85–128, doi:10.1016/j.aim.2012.10.009.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2013. Arithmetic harmonic analysis on character and quiver varieties II. Advances in Mathematics. 234, 85–128.","chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Arithmetic Harmonic Analysis on Character and Quiver Varieties II.” Advances in Mathematics. Academic Press, 2013. https://doi.org/10.1016/j.aim.2012.10.009."},"extern":1,"type":"journal_article","status":"public","_id":"1469","page":"85 - 128","date_created":"2018-12-11T11:52:12Z","date_published":"2013-02-15T00:00:00Z","doi":"10.1016/j.aim.2012.10.009","volume":234,"year":"2013","publication_status":"published","publication":"Advances in Mathematics","day":"15","quality_controlled":0,"publisher":"Academic Press","intvolume":" 234","month":"02","abstract":[{"text":"We study connections between the topology of generic character varieties of fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver representations, Hilbert schemes on Cx × Cx, modular forms and multiplicities in tensor products of irreducible characters of finite general linear groups.","lang":"eng"}],"acknowledgement":"During the preparation of this paper TH was supported by a Royal Society University Research Fellowship at the University of Oxford. EL was supported by ANR-09-JCJC-0102-01. FRV was supported by NSF grant DMS-0200605, an FRA from the University of Texas at Austin, EPSRC grant EP/G027110/1, Visiting Fellowships at All Souls and Wadham Colleges in Oxford and a Research Scholarship from the Clay Mathematical Institute."},{"status":"public","type":"journal_article","_id":"1470","title":"Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces","author":[{"full_name":"De Cataldo, Mark A","last_name":"De Cataldo","first_name":"Mark"},{"full_name":"Tamas Hausel","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas"},{"full_name":"Migliorini, Luca","last_name":"Migliorini","first_name":"Luca"}],"publist_id":"5725","extern":1,"date_updated":"2021-01-12T06:50:58Z","citation":{"mla":"De Cataldo, Mark, et al. “Exchange between Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.” Journal of Singularities, vol. 7, Worldwide Center of Mathematics, 2013, pp. 23–38, doi:10.5427/jsing.2013.7c.","short":"M. De Cataldo, T. Hausel, L. Migliorini, Journal of Singularities 7 (2013) 23–38.","ieee":"M. De Cataldo, T. Hausel, and L. Migliorini, “Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces,” Journal of Singularities, vol. 7. Worldwide Center of Mathematics, pp. 23–38, 2013.","apa":"De Cataldo, M., Hausel, T., & Migliorini, L. (2013). Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. Journal of Singularities. Worldwide Center of Mathematics. https://doi.org/10.5427/jsing.2013.7c","ama":"De Cataldo M, Hausel T, Migliorini L. Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. Journal of Singularities. 2013;7:23-38. doi:10.5427/jsing.2013.7c","chicago":"De Cataldo, Mark, Tamás Hausel, and Luca Migliorini. “Exchange between Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.” Journal of Singularities. Worldwide Center of Mathematics, 2013. https://doi.org/10.5427/jsing.2013.7c.","ista":"De Cataldo M, Hausel T, Migliorini L. 2013. Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. Journal of Singularities. 7, 23–38."},"month":"01","intvolume":" 7","quality_controlled":0,"publisher":"Worldwide Center of Mathematics","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1012.2583"}],"oa":1,"acknowledgement":"Mark Andrea A. de Cataldo was partially supported by N.S.A. and N.S.F. Tamás Hausel was supported by a Royal Society University Research Fellowship. Luca Migliorini was partially supported by PRIN 2007 project \"Spazi di moduli e teoria di Lie\"","abstract":[{"lang":"eng","text":"We show that a natural isomorphism between the rational cohomology groups of the two zero-dimensional Hilbert schemes of n-points of two surfaces, the affine plane minus the axes and the cotangent bundle of an elliptic curve, exchanges the weight filtration on the first set of cohomology groups with the perverse Leray filtration associated with a natural fibration on the second set of cohomology groups. We discuss some associated hard Lefschetz phenomena."}],"date_published":"2013-01-01T00:00:00Z","doi":"10.5427/jsing.2013.7c","volume":7,"date_created":"2018-12-11T11:52:12Z","page":"23 - 38","day":"01","publication":"Journal of Singularities","publication_status":"published","year":"2013"},{"article_type":"letter_note","type":"journal_article","status":"public","_id":"11758","author":[{"first_name":"Luca","last_name":"Aceto","full_name":"Aceto, Luca"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Sgall, Jiří","last_name":"Sgall","first_name":"Jiří"}],"article_processing_charge":"No","title":"38th International Colloquium on Automata, Languages and Programming","citation":{"ista":"Aceto L, Henzinger MH, Sgall J. 2013. 38th International Colloquium on Automata, Languages and Programming. Information and Computation. 222(1), 1.","chicago":"Aceto, Luca, Monika H Henzinger, and Jiří Sgall. “38th International Colloquium on Automata, Languages and Programming.” Information and Computation. Elsevier, 2013. https://doi.org/10.1016/j.ic.2012.11.002.","ieee":"L. Aceto, M. H. Henzinger, and J. Sgall, “38th International Colloquium on Automata, Languages and Programming,” Information and Computation, vol. 222, no. 1. Elsevier, p. 1, 2013.","short":"L. Aceto, M.H. Henzinger, J. Sgall, Information and Computation 222 (2013) 1.","ama":"Aceto L, Henzinger MH, Sgall J. 38th International Colloquium on Automata, Languages and Programming. Information and Computation. 2013;222(1):1. doi:10.1016/j.ic.2012.11.002","apa":"Aceto, L., Henzinger, M. H., & Sgall, J. (2013). 38th International Colloquium on Automata, Languages and Programming. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2012.11.002","mla":"Aceto, Luca, et al. “38th International Colloquium on Automata, Languages and Programming.” Information and Computation, vol. 222, no. 1, Elsevier, 2013, p. 1, doi:10.1016/j.ic.2012.11.002."},"date_updated":"2023-02-23T10:09:19Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","scopus_import":"1","quality_controlled":"1","month":"01","intvolume":" 222","oa_version":"None","page":"1","issue":"1","volume":222,"date_published":"2013-01-01T00:00:00Z","doi":"10.1016/j.ic.2012.11.002","date_created":"2022-08-08T11:25:34Z","publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","year":"2013","day":"01","language":[{"iso":"eng"}],"publication":"Information and Computation"},{"page":"1740 - 1750","date_published":"2013-04-18T00:00:00Z","volume":140,"doi":"10.1242/dev.092726","issue":"8","date_created":"2018-12-11T11:53:41Z","publication_status":"published","year":"2013","day":"18","publication":"Development","publisher":"Company of Biologists","quality_controlled":0,"month":"04","intvolume":" 140","abstract":[{"lang":"eng","text":"The development of a functional tissue requires coordination of the amplification of progenitors and their differentiation into specific cell types. The molecular basis for this coordination during myotome ontogeny is not well understood. Dermomytome progenitors that colonize the myotome first acquire myocyte identity and subsequently proliferate as Pax7-expressing progenitors before undergoing terminal differentiation. We show that the dynamics of sonic hedgehog (Shh) signaling is crucial for this transition in both avian and mouse embryos. Initially, Shh ligand emanating from notochord/floor plate reaches the dermomyotome, where it both maintains the proliferation of dermomyotome cells and promotes myogenic differentiation of progenitors that colonized the myotome. Interfering with Shh signaling at this stage produces small myotomes and accumulation of Pax7-expressing progenitors. An in vivo reporter of Shh activity combined with mouse genetics revealed the existence of both activator and repressor Shh activities operating on distinct subsets of cells during the epaxial myotomal maturation. In contrast to observations in mice, in avians Shh promotes the differentiation of both epaxial and hypaxial myotome domains. Subsequently, myogenic progenitors become refractory to Shh; this is likely to occur at the level of, or upstream of, smoothened signaling. The end of responsiveness to Shh coincides with, and is thus likely to enable, the transition into the growth phase of the myotome."}],"acknowledgement":"This study was supported by grants from the Israel Science Foundation (ISF) [11/09 to C.K.]; the Association Francaise contre les Myopathies (AFM) [15642 to C.K.]; the German Research Foundation (DFG) [UN 34/27-1 to C.K.]; the UK Medical Research Council (MRC) [U117560541 to J.B. and A.K.]; Fondation Pour la Recherche Médicale (FRM) (post-doctoral fellowship to V.R.). Deposited in PMC for release after 6 months","author":[{"first_name":"Nitza","full_name":"Kahane, Nitza","last_name":"Kahane"},{"last_name":"Ribes","full_name":"Ribes, Vanessa","first_name":"Vanessa"},{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","full_name":"Anna Kicheva","last_name":"Kicheva"},{"last_name":"Briscoe","full_name":"Briscoe, James","first_name":"James"},{"first_name":"Chaya","last_name":"Kalcheim","full_name":"Kalcheim, Chaya"}],"publist_id":"5402","title":"The transition from differentiation to growth during dermomyotome-derived myogenesis depends on temporally restricted hedgehog signaling","date_updated":"2021-01-12T06:52:47Z","citation":{"mla":"Kahane, Nitza, et al. “The Transition from Differentiation to Growth during Dermomyotome-Derived Myogenesis Depends on Temporally Restricted Hedgehog Signaling.” Development, vol. 140, no. 8, Company of Biologists, 2013, pp. 1740–50, doi:10.1242/dev.092726.","apa":"Kahane, N., Ribes, V., Kicheva, A., Briscoe, J., & Kalcheim, C. (2013). The transition from differentiation to growth during dermomyotome-derived myogenesis depends on temporally restricted hedgehog signaling. Development. Company of Biologists. https://doi.org/10.1242/dev.092726","ama":"Kahane N, Ribes V, Kicheva A, Briscoe J, Kalcheim C. The transition from differentiation to growth during dermomyotome-derived myogenesis depends on temporally restricted hedgehog signaling. Development. 2013;140(8):1740-1750. doi:10.1242/dev.092726","short":"N. Kahane, V. Ribes, A. Kicheva, J. Briscoe, C. Kalcheim, Development 140 (2013) 1740–1750.","ieee":"N. Kahane, V. Ribes, A. Kicheva, J. Briscoe, and C. Kalcheim, “The transition from differentiation to growth during dermomyotome-derived myogenesis depends on temporally restricted hedgehog signaling,” Development, vol. 140, no. 8. Company of Biologists, pp. 1740–1750, 2013.","chicago":"Kahane, Nitza, Vanessa Ribes, Anna Kicheva, James Briscoe, and Chaya Kalcheim. “The Transition from Differentiation to Growth during Dermomyotome-Derived Myogenesis Depends on Temporally Restricted Hedgehog Signaling.” Development. Company of Biologists, 2013. https://doi.org/10.1242/dev.092726.","ista":"Kahane N, Ribes V, Kicheva A, Briscoe J, Kalcheim C. 2013. The transition from differentiation to growth during dermomyotome-derived myogenesis depends on temporally restricted hedgehog signaling. Development. 140(8), 1740–1750."},"extern":1,"type":"journal_article","status":"public","_id":"1726"},{"type":"journal_article","status":"public","_id":"1727","author":[{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","full_name":"Anna Kicheva","last_name":"Kicheva"},{"last_name":"Holtzer","full_name":"Holtzer, Laurent","first_name":"Laurent"},{"first_name":"Ortrud","full_name":"Wartlick, Ortrud","last_name":"Wartlick"},{"full_name":"Schmidt, Thomas S","last_name":"Schmidt","first_name":"Thomas"},{"first_name":"Marcos","full_name":"González-Gaitán, Marcos A","last_name":"González Gaitán"}],"publist_id":"5401","title":"Quantitative imaging of morphogen gradients in drosophila imaginal discs","date_updated":"2021-01-12T06:52:47Z","citation":{"ama":"Kicheva A, Holtzer L, Wartlick O, Schmidt T, González Gaitán M. Quantitative imaging of morphogen gradients in drosophila imaginal discs. Cold Spring Harbor Protocols. 2013;8(5):387-403. doi:10.1101/pdb.top074237","apa":"Kicheva, A., Holtzer, L., Wartlick, O., Schmidt, T., & González Gaitán, M. (2013). Quantitative imaging of morphogen gradients in drosophila imaginal discs. Cold Spring Harbor Protocols. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/pdb.top074237","ieee":"A. Kicheva, L. Holtzer, O. Wartlick, T. Schmidt, and M. González Gaitán, “Quantitative imaging of morphogen gradients in drosophila imaginal discs,” Cold Spring Harbor Protocols, vol. 8, no. 5. Cold Spring Harbor Laboratory Press, pp. 387–403, 2013.","short":"A. Kicheva, L. Holtzer, O. Wartlick, T. Schmidt, M. González Gaitán, Cold Spring Harbor Protocols 8 (2013) 387–403.","mla":"Kicheva, Anna, et al. “Quantitative Imaging of Morphogen Gradients in Drosophila Imaginal Discs.” Cold Spring Harbor Protocols, vol. 8, no. 5, Cold Spring Harbor Laboratory Press, 2013, pp. 387–403, doi:10.1101/pdb.top074237.","ista":"Kicheva A, Holtzer L, Wartlick O, Schmidt T, González Gaitán M. 2013. Quantitative imaging of morphogen gradients in drosophila imaginal discs. Cold Spring Harbor Protocols. 8(5), 387–403.","chicago":"Kicheva, Anna, Laurent Holtzer, Ortrud Wartlick, Thomas Schmidt, and Marcos González Gaitán. “Quantitative Imaging of Morphogen Gradients in Drosophila Imaginal Discs.” Cold Spring Harbor Protocols. Cold Spring Harbor Laboratory Press, 2013. https://doi.org/10.1101/pdb.top074237."},"extern":1,"publisher":"Cold Spring Harbor Laboratory Press","quality_controlled":0,"month":"05","intvolume":" 8","abstract":[{"lang":"eng","text":"Cells at different positions in a developing tissue receive different concentrations of signaling molecules, called morphogens, and this influences their cell fate. Morphogen concentration gradients have been proposed to control patterning as well as growth in many developing tissues. Some outstanding questions about tissue patterning by morphogen gradients are the following: What are the mechanisms that regulate gradient formation and shape? Is the positional information encoded in the gradient sufficiently precise to determine the positions of target gene domain boundaries? What are the temporal dynamics of gradients and how do they relate to patterning and growth? These questions are inherently quantitative in nature and addressing them requires measuring morphogen concentrations in cells, levels of downstream signaling activity, and kinetics of morphogen transport. Here we first present methods for quantifying morphogen gradient shape in which the measurements can be calibrated to reflect actual morphogen concentrations. We then discuss using fluorescence recovery after photobleaching to study the kinetics of morphogen transport at the tissue level. Finally, we present particle tracking as a method to study morphogen intracellular trafficking."}],"page":"387 - 403","issue":"5","volume":8,"doi":"10.1101/pdb.top074237","date_published":"2013-05-01T00:00:00Z","date_created":"2018-12-11T11:53:41Z","year":"2013","publication_status":"published","day":"01","publication":"Cold Spring Harbor Protocols"},{"title":"SiGe quantum dots for fast hole spin Rabi oscillations","publist_id":"5364","author":[{"first_name":"Natalia","full_name":"Ares, Natalia","last_name":"Ares"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros","full_name":"Georgios Katsaros"},{"first_name":"Vitaly","full_name":"Golovach, Vitaly N","last_name":"Golovach"},{"first_name":"Jianjun","full_name":"Zhang, Jianjun","last_name":"Zhang"},{"first_name":"Aaron","last_name":"Prager","full_name":"Prager, Aaron A"},{"first_name":"Leonid","full_name":"Glazman, Leonid I","last_name":"Glazman"},{"first_name":"Oliver","last_name":"Schmidt","full_name":"Schmidt, Oliver G"},{"last_name":"De Franceschi","full_name":"De Franceschi, Silvano","first_name":"Silvano"}],"extern":1,"citation":{"chicago":"Ares, Natalia, Georgios Katsaros, Vitaly Golovach, Jianjun Zhang, Aaron Prager, Leonid Glazman, Oliver Schmidt, and Silvano De Franceschi. “SiGe Quantum Dots for Fast Hole Spin Rabi Oscillations.” Applied Physics Letters. American Institute of Physics, 2013. https://doi.org/10.1063/1.4858959.","ista":"Ares N, Katsaros G, Golovach V, Zhang J, Prager A, Glazman L, Schmidt O, De Franceschi S. 2013. SiGe quantum dots for fast hole spin Rabi oscillations. Applied Physics Letters. 103(26).","mla":"Ares, Natalia, et al. “SiGe Quantum Dots for Fast Hole Spin Rabi Oscillations.” Applied Physics Letters, vol. 103, no. 26, American Institute of Physics, 2013, doi:10.1063/1.4858959.","short":"N. Ares, G. Katsaros, V. Golovach, J. Zhang, A. Prager, L. Glazman, O. Schmidt, S. De Franceschi, Applied Physics Letters 103 (2013).","ieee":"N. Ares et al., “SiGe quantum dots for fast hole spin Rabi oscillations,” Applied Physics Letters, vol. 103, no. 26. American Institute of Physics, 2013.","apa":"Ares, N., Katsaros, G., Golovach, V., Zhang, J., Prager, A., Glazman, L., … De Franceschi, S. (2013). SiGe quantum dots for fast hole spin Rabi oscillations. Applied Physics Letters. American Institute of Physics. https://doi.org/10.1063/1.4858959","ama":"Ares N, Katsaros G, Golovach V, et al. SiGe quantum dots for fast hole spin Rabi oscillations. Applied Physics Letters. 2013;103(26). doi:10.1063/1.4858959"},"date_updated":"2021-01-12T06:53:02Z","status":"public","type":"journal_article","_id":"1760","date_created":"2018-12-11T11:53:52Z","volume":103,"issue":"26","date_published":"2013-01-23T00:00:00Z","doi":"10.1063/1.4858959","publication":"Applied Physics Letters","day":"23","year":"2013","publication_status":"published","intvolume":" 103","month":"01","main_file_link":[{"url":"http://arxiv.org/abs/1307.7196","open_access":"1"}],"oa":1,"quality_controlled":0,"publisher":"American Institute of Physics","acknowledgement":"We acknowledge the financial support from the Nanosciences Foundation (Grenoble, France), the Commission for a Marie Curie Carrer Integration Grant, the Austrian Science Fund (FWF) for a Lise-Meitner Fellowship (M1435-N30), the DOE under Contract No. DE-FG02-08ER46482 (Yale), the European Starting Grant program, and the Agence Nationale de la Recherche","abstract":[{"text":"We report on hole g-factor measurements in three terminal SiGe self-assembled quantum dot devices with a top gate electrode positioned very close to the nanostructure. Measurements of both the perpendicular as well as the parallel g-factor reveal significant changes for a small modulation of the top gate voltage. From the observed modulations, we estimate that, for realistic experimental conditions, hole spins can be electrically manipulated with Rabi frequencies in the order of 100 MHz. This work emphasises the potential of hole-based nano-devices for efficient spin manipulation by means of the g-tensor modulation technique.","lang":"eng"}]},{"status":"public","type":"journal_article","_id":"1759","title":"Nature of tunable hole g factors in quantum dots","author":[{"first_name":"Natalia","full_name":"Ares, Natalia","last_name":"Ares"},{"last_name":"Golovach","full_name":"Golovach, Vitaly N","first_name":"Vitaly"},{"last_name":"Katsaros","full_name":"Georgios Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"},{"full_name":"Stoffel, Mathieu","last_name":"Stoffel","first_name":"Mathieu"},{"first_name":"Frank","last_name":"Fournel","full_name":"Fournel, Frank"},{"first_name":"Leonid","last_name":"Glazman","full_name":"Glazman, Leonid I"},{"first_name":"Oliver","last_name":"Schmidt","full_name":"Schmidt, Oliver G"},{"first_name":"Silvano","last_name":"De Franceschi","full_name":"De Franceschi, Silvano"}],"publist_id":"5365","extern":1,"date_updated":"2021-01-12T06:53:01Z","citation":{"mla":"Ares, Natalia, et al. “Nature of Tunable Hole g Factors in Quantum Dots.” Physical Review Letters, vol. 110, no. 4, American Physical Society, 2013, doi:10.1103/PhysRevLett.110.046602.","ama":"Ares N, Golovach V, Katsaros G, et al. Nature of tunable hole g factors in quantum dots. Physical Review Letters. 2013;110(4). doi:10.1103/PhysRevLett.110.046602","apa":"Ares, N., Golovach, V., Katsaros, G., Stoffel, M., Fournel, F., Glazman, L., … De Franceschi, S. (2013). Nature of tunable hole g factors in quantum dots. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.110.046602","ieee":"N. Ares et al., “Nature of tunable hole g factors in quantum dots,” Physical Review Letters, vol. 110, no. 4. American Physical Society, 2013.","short":"N. Ares, V. Golovach, G. Katsaros, M. Stoffel, F. Fournel, L. Glazman, O. Schmidt, S. De Franceschi, Physical Review Letters 110 (2013).","chicago":"Ares, Natalia, Vitaly Golovach, Georgios Katsaros, Mathieu Stoffel, Frank Fournel, Leonid Glazman, Oliver Schmidt, and Silvano De Franceschi. “Nature of Tunable Hole g Factors in Quantum Dots.” Physical Review Letters. American Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.046602.","ista":"Ares N, Golovach V, Katsaros G, Stoffel M, Fournel F, Glazman L, Schmidt O, De Franceschi S. 2013. Nature of tunable hole g factors in quantum dots. Physical Review Letters. 110(4)."},"month":"01","intvolume":" 110","quality_controlled":0,"publisher":"American Physical Society","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1208.0476","open_access":"1"}],"acknowledgement":"We acknowledge financial support from the Nanosciences Foundation (Grenoble, France), DOE under Contract No. DEFG02-08ER46482 (Yale), the Agence Nationale de la Recherche, and the European Starting Grant. G. K. acknowledges support from the European Commission via a Marie Curie Carrer Integration Grant and the FWF for a Lise-Meitner Fellowship","abstract":[{"text":"We report an electric-field-induced giant modulation of the hole g factor in SiGe nanocrystals. The observed effect is ascribed to a so-far overlooked contribution to the g factor that stems from the mixing between heavy- and light-hole wave functions. We show that the relative displacement between the confined heavy- and light-hole states, occurring upon application of the electric field, alters their mixing strength leading to a strong nonmonotonic modulation of the g factor.","lang":"eng"}],"volume":110,"issue":"4","date_published":"2013-01-23T00:00:00Z","doi":"10.1103/PhysRevLett.110.046602","date_created":"2018-12-11T11:53:51Z","day":"23","publication":"Physical Review Letters","year":"2013","publication_status":"published"},{"_id":"1785","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:53:11Z","citation":{"apa":"Abdumalikov, A., Fink, J. M., Juliusson, K., Pechal, M., Berger, S., Wallraff, A., & Filipp, S. (2013). Experimental realization of non-Abelian non-adiabatic geometric gates. Nature. Nature Publishing Group. https://doi.org/10.1038/nature12010","ama":"Abdumalikov A, Fink JM, Juliusson K, et al. Experimental realization of non-Abelian non-adiabatic geometric gates. Nature. 2013;496(7446):482-485. doi:10.1038/nature12010","ieee":"A. Abdumalikov et al., “Experimental realization of non-Abelian non-adiabatic geometric gates,” Nature, vol. 496, no. 7446. Nature Publishing Group, pp. 482–485, 2013.","short":"A. Abdumalikov, J.M. Fink, K. Juliusson, M. Pechal, S. Berger, A. Wallraff, S. Filipp, Nature 496 (2013) 482–485.","mla":"Abdumalikov, Abdufarrukh, et al. “Experimental Realization of Non-Abelian Non-Adiabatic Geometric Gates.” Nature, vol. 496, no. 7446, Nature Publishing Group, 2013, pp. 482–85, doi:10.1038/nature12010.","ista":"Abdumalikov A, Fink JM, Juliusson K, Pechal M, Berger S, Wallraff A, Filipp S. 2013. Experimental realization of non-Abelian non-adiabatic geometric gates. Nature. 496(7446), 482–485.","chicago":"Abdumalikov, Abdufarrukh, Johannes M Fink, K Juliusson, M Pechal, Stefan Berger, Andreas Wallraff, and Stefan Filipp. “Experimental Realization of Non-Abelian Non-Adiabatic Geometric Gates.” Nature. Nature Publishing Group, 2013. https://doi.org/10.1038/nature12010."},"title":"Experimental realization of non-Abelian non-adiabatic geometric gates","publist_id":"5329","author":[{"last_name":"Abdumalikov","full_name":"Abdumalikov, Abdufarrukh A","first_name":"Abdufarrukh"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","full_name":"Johannes Fink","orcid":"0000-0001-8112-028X","last_name":"Fink"},{"full_name":"Juliusson, K","last_name":"Juliusson","first_name":"K"},{"full_name":"Pechal, M","last_name":"Pechal","first_name":"M"},{"first_name":"Stefan","full_name":"Berger, Stefan T","last_name":"Berger"},{"full_name":"Wallraff, Andreas","last_name":"Wallraff","first_name":"Andreas"},{"first_name":"Stefan","full_name":"Filipp, Stefan","last_name":"Filipp"}],"acknowledgement":"This work is supported financially by GEOMDISS, the Swiss National Science Foundation and ETH Zurich","abstract":[{"lang":"eng","text":"The geometric aspects of quantum mechanics are emphasized most prominently by the concept of geometric phases, which are acquired whenever a quantum system evolves along a path in Hilbert space, that is, the space of quantum states of the system. The geometric phase is determined only by the shape of this path and is, in its simplest form, a real number. However, if the system has degenerate energy levels, then matrix-valued geometric state transformations, known as non-Abelian holonomies-the effect of which depends on the order of two consecutive paths-can be obtained. They are important, for example, for the creation of synthetic gauge fields in cold atomic gases or the description of non-Abelian anyon statistics. Moreover, there are proposals to exploit non-Abelian holonomic gates for the purposes of noise-resilient quantum computation. In contrast to Abelian geometric operations, non-Abelian ones have been observed only in nuclear quadrupole resonance experiments with a large number of spins, and without full characterization of the geometric process and its non-commutative nature. Here we realize non-Abelian non-adiabatic holonomic quantum operations on a single, superconducting, artificial three-level atom by applying a well-controlled, two-tone microwave drive. Using quantum process tomography, we determine fidelities of the resulting non-commuting gates that exceed 95 per cent. We show that two different quantum gates, originating from two distinct paths in Hilbert space, yield non-equivalent transformations when applied in different orders. This provides evidence for the non-Abelian character of the implemented holonomic quantum operations. In combination with a non-trivial two-quantum-bit gate, our method suggests a way to universal holonomic quantum computing."}],"month":"04","intvolume":" 496","publisher":"Nature Publishing Group","quality_controlled":0,"day":"25","publication":"Nature","year":"2013","publication_status":"published","date_published":"2013-04-25T00:00:00Z","volume":496,"issue":"7446","doi":"10.1038/nature12010","date_created":"2018-12-11T11:54:00Z","page":"482 - 485"},{"citation":{"ama":"Lang C, Eichler C, Steffen L, et al. Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies. Nature Physics. 2013;9(6):345-348. doi:10.1038/nphys2612","apa":"Lang, C., Eichler, C., Steffen, L., Fink, J. M., Woolley, M., Blais, A., & Wallraff, A. (2013). Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys2612","short":"C. Lang, C. Eichler, L. Steffen, J.M. Fink, M. Woolley, A. Blais, A. Wallraff, Nature Physics 9 (2013) 345–348.","ieee":"C. Lang et al., “Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies,” Nature Physics, vol. 9, no. 6. Nature Publishing Group, pp. 345–348, 2013.","mla":"Lang, C., et al. “Correlations, Indistinguishability and Entanglement in Hong-Ou-Mandel Experiments at Microwave Frequencies.” Nature Physics, vol. 9, no. 6, Nature Publishing Group, 2013, pp. 345–48, doi:10.1038/nphys2612.","ista":"Lang C, Eichler C, Steffen L, Fink JM, Woolley M, Blais A, Wallraff A. 2013. Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies. Nature Physics. 9(6), 345–348.","chicago":"Lang, C, Christopher Eichler, L. Steffen, Johannes M Fink, Matthew Woolley, Alexandre Blais, and Andreas Wallraff. “Correlations, Indistinguishability and Entanglement in Hong-Ou-Mandel Experiments at Microwave Frequencies.” Nature Physics. Nature Publishing Group, 2013. https://doi.org/10.1038/nphys2612."},"date_updated":"2021-01-12T06:53:11Z","extern":1,"author":[{"full_name":"Lang, C","last_name":"Lang","first_name":"C"},{"first_name":"Christopher","full_name":"Eichler, Christopher","last_name":"Eichler"},{"first_name":"L.","full_name":"Steffen, L. Kraig","last_name":"Steffen"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Johannes Fink"},{"full_name":"Woolley, Matthew J","last_name":"Woolley","first_name":"Matthew"},{"first_name":"Alexandre","last_name":"Blais","full_name":"Blais, Alexandre"},{"first_name":"Andreas","full_name":"Wallraff, Andreas","last_name":"Wallraff"}],"publist_id":"5327","title":"Correlations, indistinguishability and entanglement in Hong-Ou-Mandel experiments at microwave frequencies","_id":"1787","type":"journal_article","status":"public","year":"2013","publication_status":"published","publication":"Nature Physics","day":"01","page":"345 - 348","date_created":"2018-12-11T11:54:00Z","issue":"6","date_published":"2013-06-01T00:00:00Z","doi":"10.1038/nphys2612","volume":9,"abstract":[{"lang":"eng","text":"When two indistinguishable single photons impinge at the two inputs of a beam splitter they coalesce into a pair of photons appearing in either one of its two outputs. This effect is due to the bosonic nature of photons and was first experimentally observed by Hong, Ou and Mandel. Here, we present the observation of the Hong-Ou-Mandel effect with two independent single-photon sources in the microwave frequency domain. We probe the indistinguishability of single photons, created with a controllable delay, in time-resolved second-order cross- and auto-correlation function measurements. Using quadrature amplitude detection we are able to resolve different photon numbers and detect coherence in and between the output arms. This scheme allows us to fully characterize the two-mode entanglement of the spatially separated beam-splitter output modes. Our experiments constitute a first step towards using two-photon interference at microwave frequencies for quantum communication and information processing."}],"acknowledgement":"This work was supported by the European Research Council (ERC) through a Starting Grant and by ETHZ. L.S. was supported by EU IP SOLID. A.B. and M.J.W. were supported by NSERC, CIFAR and the Alfred P. Sloan Foundation","publisher":"Nature Publishing Group","quality_controlled":0,"intvolume":" 9","month":"06"},{"publication_status":"published","year":"2013","publication":"Physical Review Letters","day":"15","date_created":"2018-12-11T11:54:00Z","date_published":"2013-05-15T00:00:00Z","volume":110,"doi":"10.1103/PhysRevLett.110.203602","issue":"20","abstract":[{"text":"We report the experimental observation and a theoretical explanation of collective suppression of linewidths for multiple superconducting qubits coupled to a good cavity. This demonstrates how strong qubit-cavity coupling can significantly modify the dephasing and dissipation processes that might be expected for individual qubits, and can potentially improve coherence times in many-body circuit QED.","lang":"eng"}],"acknowledgement":"J. K. acknowledges financial support from EPSRC program “TOPNES” (EP/I031014/1) and EPSRC (EP/G004714/2)","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.0665"}],"oa":1,"publisher":"American Physical Society","quality_controlled":0,"intvolume":" 110","month":"05","citation":{"ista":"Nissen F, Fink JM, Mlynek J, Wallraff A, Keeling J. 2013. Collective suppression of linewidths in circuit QED. Physical Review Letters. 110(20).","chicago":"Nissen, Felix, Johannes M Fink, Jonas Mlynek, Andreas Wallraff, and Jonathan Keeling. “Collective Suppression of Linewidths in Circuit QED.” Physical Review Letters. American Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.203602.","short":"F. Nissen, J.M. Fink, J. Mlynek, A. Wallraff, J. Keeling, Physical Review Letters 110 (2013).","ieee":"F. Nissen, J. M. Fink, J. Mlynek, A. Wallraff, and J. Keeling, “Collective suppression of linewidths in circuit QED,” Physical Review Letters, vol. 110, no. 20. American Physical Society, 2013.","apa":"Nissen, F., Fink, J. M., Mlynek, J., Wallraff, A., & Keeling, J. (2013). Collective suppression of linewidths in circuit QED. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.110.203602","ama":"Nissen F, Fink JM, Mlynek J, Wallraff A, Keeling J. Collective suppression of linewidths in circuit QED. Physical Review Letters. 2013;110(20). doi:10.1103/PhysRevLett.110.203602","mla":"Nissen, Felix, et al. “Collective Suppression of Linewidths in Circuit QED.” Physical Review Letters, vol. 110, no. 20, American Physical Society, 2013, doi:10.1103/PhysRevLett.110.203602."},"date_updated":"2021-01-12T06:53:11Z","extern":1,"publist_id":"5328","author":[{"full_name":"Nissen, Felix","last_name":"Nissen","first_name":"Felix"},{"first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","full_name":"Johannes Fink","orcid":"0000-0001-8112-028X"},{"last_name":"Mlynek","full_name":"Mlynek, Jonas A","first_name":"Jonas"},{"full_name":"Wallraff, Andreas","last_name":"Wallraff","first_name":"Andreas"},{"full_name":"Keeling, Jonathan M","last_name":"Keeling","first_name":"Jonathan"}],"title":"Collective suppression of linewidths in circuit QED","_id":"1786","type":"journal_article","status":"public"},{"month":"10","intvolume":" 80","quality_controlled":0,"publisher":"Elsevier","abstract":[{"lang":"eng","text":"In the September 12, 2013 issue of Nature, the Epi4K Consortium (. Allen etal., 2013) reported sequencing 264patient trios with epileptic encephalopathies. The Consortium focused on genes exceptionally intolerant to sequence variations and found substantial interconnections with autism and intellectual disability gene networks."}],"volume":80,"issue":"1","date_published":"2013-10-02T00:00:00Z","doi":"10.1016/j.neuron.2013.09.019","date_created":"2018-12-11T11:54:01Z","page":"9 - 11","day":"02","publication":"Neuron","year":"2013","publication_status":"published","status":"public","type":"journal_article","_id":"1790","title":"The sacred disease: The puzzling genetics of epileptic disorders","publist_id":"5323","author":[{"full_name":"Gaia Novarino","orcid":"0000-0002-7673-7178","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Baek, SeungTae","last_name":"Baek","first_name":"Seungtae"},{"full_name":"Gleeson, Joseph G","last_name":"Gleeson","first_name":"Joseph"}],"extern":1,"citation":{"mla":"Novarino, Gaia, et al. “The Sacred Disease: The Puzzling Genetics of Epileptic Disorders.” Neuron, vol. 80, no. 1, Elsevier, 2013, pp. 9–11, doi:10.1016/j.neuron.2013.09.019.","ama":"Novarino G, Baek S, Gleeson J. The sacred disease: The puzzling genetics of epileptic disorders. Neuron. 2013;80(1):9-11. doi:10.1016/j.neuron.2013.09.019","apa":"Novarino, G., Baek, S., & Gleeson, J. (2013). The sacred disease: The puzzling genetics of epileptic disorders. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2013.09.019","ieee":"G. Novarino, S. Baek, and J. Gleeson, “The sacred disease: The puzzling genetics of epileptic disorders,” Neuron, vol. 80, no. 1. Elsevier, pp. 9–11, 2013.","short":"G. Novarino, S. Baek, J. Gleeson, Neuron 80 (2013) 9–11.","chicago":"Novarino, Gaia, Seungtae Baek, and Joseph Gleeson. “The Sacred Disease: The Puzzling Genetics of Epileptic Disorders.” Neuron. Elsevier, 2013. https://doi.org/10.1016/j.neuron.2013.09.019.","ista":"Novarino G, Baek S, Gleeson J. 2013. The sacred disease: The puzzling genetics of epileptic disorders. Neuron. 80(1), 9–11."},"date_updated":"2021-01-12T06:53:13Z"},{"type":"journal_article","status":"public","_id":"1977","author":[{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","orcid":"0000-0002-0977-7989","full_name":"Leonid Sazanov"},{"last_name":"Baradaran","full_name":"Baradaran, Rozbeh ","first_name":"Rozbeh"},{"full_name":"Efremov, Rouslan G","last_name":"Efremov","first_name":"Rouslan"},{"last_name":"Berrisford","full_name":"Berrisford, John M","first_name":"John"},{"first_name":"Gurdeep","full_name":"Minhas, Gurdeep S","last_name":"Minhas"}],"publist_id":"5106","title":"A long road towards the structure of respiratory complex I, a giant molecular proton pump","citation":{"chicago":"Sazanov, Leonid A, Rozbeh Baradaran, Rouslan Efremov, John Berrisford, and Gurdeep Minhas. “A Long Road towards the Structure of Respiratory Complex I, a Giant Molecular Proton Pump.” Biochemical Society Transactions. Portland Press, 2013. https://doi.org/10.1042/BST20130193.","ista":"Sazanov LA, Baradaran R, Efremov R, Berrisford J, Minhas G. 2013. A long road towards the structure of respiratory complex I, a giant molecular proton pump. Biochemical Society Transactions. 41(5), 1265–1271.","mla":"Sazanov, Leonid A., et al. “A Long Road towards the Structure of Respiratory Complex I, a Giant Molecular Proton Pump.” Biochemical Society Transactions, vol. 41, no. 5, Portland Press, 2013, pp. 1265–71, doi:10.1042/BST20130193.","ieee":"L. A. Sazanov, R. Baradaran, R. Efremov, J. Berrisford, and G. Minhas, “A long road towards the structure of respiratory complex I, a giant molecular proton pump,” Biochemical Society Transactions, vol. 41, no. 5. Portland Press, pp. 1265–1271, 2013.","short":"L.A. Sazanov, R. Baradaran, R. Efremov, J. Berrisford, G. Minhas, Biochemical Society Transactions 41 (2013) 1265–1271.","apa":"Sazanov, L. A., Baradaran, R., Efremov, R., Berrisford, J., & Minhas, G. (2013). A long road towards the structure of respiratory complex I, a giant molecular proton pump. Biochemical Society Transactions. Portland Press. https://doi.org/10.1042/BST20130193","ama":"Sazanov LA, Baradaran R, Efremov R, Berrisford J, Minhas G. A long road towards the structure of respiratory complex I, a giant molecular proton pump. Biochemical Society Transactions. 2013;41(5):1265-1271. doi:10.1042/BST20130193"},"date_updated":"2021-01-12T06:54:28Z","extern":1,"quality_controlled":0,"publisher":"Portland Press","month":"10","intvolume":" 41","abstract":[{"text":"Complex I (NADH:ubiquinone oxidoreductase) is central to cellular energy production, being the first and largest enzyme of the respiratory chain in mitochondria. It couples electron transfer from NADH to ubiquinone with proton translocation across the inner mitochondrial membrane and is involved in a wide range of human neurodegenerative disorders. Mammalian complex I is composed of 44 different subunits, whereas the 'minimal' bacterial version contains 14 highly conserved 'core' subunits. The L-shaped assembly consists of hydrophilic and membrane domains. We have determined all known atomic structures of complex I, starting from the hydrophilic domain of Thermus thermophilus enzyme (eight subunits, nine Fe-S clusters), followed by the membrane domains of the Escherichia coli (six subunits, 55 transmembrane helices) and T. thermophilus (seven subunits, 64 transmembrane helices) enzymes, and finally culminating in a recent crystal structure of the entire intact complex I from T. thermophilus (536 kDa, 16 subunits, nine Fe-S clusters, 64 transmembrane helices). The structure suggests an unusual and unique coupling mechanism via longrange conformational changes. Determination of the structure of the entire complex was possible only through this step-by-step approach, building on from smaller subcomplexes towards the entire assembly. Large membrane proteins are notoriously difficult to crystallize, and so various non-standard and sometimes counterintuitive approaches were employed in order to achieve crystal diffraction to high resolution and solve the structures. These steps, as well as the implications from the final structure, are discussed in the present review.","lang":"eng"}],"acknowledgement":"This work was funded by the Medical Research Council.","page":"1265 - 1271","doi":"10.1042/BST20130193","volume":41,"date_published":"2013-10-01T00:00:00Z","issue":"5","date_created":"2018-12-11T11:55:00Z","publication_status":"published","year":"2013","day":"01","publication":"Biochemical Society Transactions"},{"type":"journal_article","status":"public","_id":"1978","publist_id":"5107","author":[{"full_name":"Baradaran, Rozbeh ","last_name":"Baradaran","first_name":"Rozbeh"},{"last_name":"Berrisford","full_name":"Berrisford, John M","first_name":"John"},{"last_name":"Minhas","full_name":"Minhas, Gurdeep S","first_name":"Gurdeep"},{"orcid":"0000-0002-0977-7989","full_name":"Leonid Sazanov","last_name":"Sazanov","first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"title":"Crystal structure of the entire respiratory complex i","citation":{"mla":"Baradaran, Rozbeh, et al. “Crystal Structure of the Entire Respiratory Complex I.” Nature, vol. 494, no. 7438, Nature Publishing Group, 2013, pp. 443–48, doi:10.1038/nature11871.","apa":"Baradaran, R., Berrisford, J., Minhas, G., & Sazanov, L. A. (2013). Crystal structure of the entire respiratory complex i. Nature. Nature Publishing Group. https://doi.org/10.1038/nature11871","ama":"Baradaran R, Berrisford J, Minhas G, Sazanov LA. Crystal structure of the entire respiratory complex i. Nature. 2013;494(7438):443-448. doi:10.1038/nature11871","ieee":"R. Baradaran, J. Berrisford, G. Minhas, and L. A. Sazanov, “Crystal structure of the entire respiratory complex i,” Nature, vol. 494, no. 7438. Nature Publishing Group, pp. 443–448, 2013.","short":"R. Baradaran, J. Berrisford, G. Minhas, L.A. Sazanov, Nature 494 (2013) 443–448.","chicago":"Baradaran, Rozbeh, John Berrisford, Gurdeep Minhas, and Leonid A Sazanov. “Crystal Structure of the Entire Respiratory Complex I.” Nature. Nature Publishing Group, 2013. https://doi.org/10.1038/nature11871.","ista":"Baradaran R, Berrisford J, Minhas G, Sazanov LA. 2013. Crystal structure of the entire respiratory complex i. Nature. 494(7438), 443–448."},"date_updated":"2021-01-12T06:54:28Z","extern":1,"quality_controlled":0,"publisher":"Nature Publishing Group","month":"02","intvolume":" 494","abstract":[{"lang":"eng","text":"Complex I is the first and largest enzyme of the respiratory chain and has a central role in cellular energy production through the coupling of NADH:ubiquinone electron transfer to proton translocation. It is also implicated in many common human neurodegenerative diseases. Here, we report the first crystal structure of the entire, intact complex I (from Thermus thermophilus) at 3.3 Å resolution. The structure of the 536-kDa complex comprises 16 different subunits, with a total of 64 transmembrane helices and 9 iron-sulphur clusters. The core fold of subunit Nqo8 (ND1 in humans) is, unexpectedly, similar to a half-channel of the antiporter-like subunits. Small subunits nearby form a linked second half-channel, which completes the fourth proton-translocation pathway (present in addition to the channels in three antiporter-like subunits). The quinone-binding site is unusually long, narrow and enclosed. The quinone headgroup binds at the deep end of this chamber, near iron-sulphur cluster N2. Notably, the chamber is linked to the fourth channel by a 'funnel' of charged residues. The link continues over the entire membrane domain as a flexible central axis of charged and polar residues, and probably has a leading role in the propagation of conformational changes, aided by coupling elements. The structure suggests that a unique, out-of-the-membrane quinone-reaction chamber enables the redox energy to drive concerted long-range conformational changes in the four antiporter-like domains, resulting in translocation of four protons per cycle."}],"acknowledgement":"This work was funded by the Medical Research Council.","page":"443 - 448","doi":"10.1038/nature11871","issue":"7438","date_published":"2013-02-28T00:00:00Z","volume":494,"date_created":"2018-12-11T11:55:01Z","publication_status":"published","year":"2013","day":"28","publication":"Nature"},{"_id":"1991","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:54:33Z","citation":{"ista":"Vicoso B, Bachtrog D. 2013. Reversal of an ancient sex chromosome to an autosome in Drosophila. Nature. 499(7458), 332–335.","chicago":"Vicoso, Beatriz, and Doris Bachtrog. “Reversal of an Ancient Sex Chromosome to an Autosome in Drosophila.” Nature. Nature Publishing Group, 2013. https://doi.org/10.1038/nature12235.","short":"B. Vicoso, D. Bachtrog, Nature 499 (2013) 332–335.","ieee":"B. Vicoso and D. Bachtrog, “Reversal of an ancient sex chromosome to an autosome in Drosophila,” Nature, vol. 499, no. 7458. Nature Publishing Group, pp. 332–335, 2013.","apa":"Vicoso, B., & Bachtrog, D. (2013). Reversal of an ancient sex chromosome to an autosome in Drosophila. Nature. Nature Publishing Group. https://doi.org/10.1038/nature12235","ama":"Vicoso B, Bachtrog D. Reversal of an ancient sex chromosome to an autosome in Drosophila. Nature. 2013;499(7458):332-335. doi:10.1038/nature12235","mla":"Vicoso, Beatriz, and Doris Bachtrog. “Reversal of an Ancient Sex Chromosome to an Autosome in Drosophila.” Nature, vol. 499, no. 7458, Nature Publishing Group, 2013, pp. 332–35, doi:10.1038/nature12235."},"title":"Reversal of an ancient sex chromosome to an autosome in Drosophila","author":[{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Beatriz Vicoso"},{"last_name":"Bachtrog","full_name":"Bachtrog, Doris","first_name":"Doris"}],"publist_id":"5092","acknowledgement":"Funded by National Institutes of Health grants (R01GM076007 and R01GM093182) and a Packard Fellowship to D.B.","abstract":[{"text":"Although transitions of sex-determination mechanisms are frequent in species with homomorphic sex chromosomes, heteromorphic sex chromosomes are thought to represent a terminal evolutionary stage owing to chromosome-specific adaptations such as dosage compensation or an accumulation of sex-specific mutations. Here we show that an autosome of Drosophila, the dot chromosome, was ancestrally a differentiated X chromosome. We analyse the whole genome of true fruitflies (Tephritidae), flesh flies (Sarcophagidae) and soldier flies (Stratiomyidae) to show that genes located on the dot chromosome of Drosophila are X-linked in outgroup species, whereas Drosophila X-linked genes are autosomal. We date this chromosomal transition to early drosophilid evolution by sequencing the genome of other Drosophilidae. Our results reveal several puzzling aspects of Drosophila dot chromosome biology to be possible remnants of its former life as a sex chromosome, such as its minor feminizing role in sex determination or its targeting by a chromosome-specific regulatory mechanism. We also show that patterns of biased gene expression of the dot chromosome during early embryogenesis, oogenesis and spermatogenesis resemble that of the current X chromosome. Thus, although sex chromosomes are not necessarily evolutionary end points and can revert back to an autosomal inheritance, the highly specialized genome architecture of this former X chromosome suggests that severe fitness costs must be overcome for such a turnover to occur.","lang":"eng"}],"month":"07","intvolume":" 499","quality_controlled":0,"publisher":"Nature Publishing Group","day":"18","publication":"Nature","year":"2013","publication_status":"published","date_published":"2013-07-18T00:00:00Z","volume":499,"doi":"10.1038/nature12235","issue":"7458","date_created":"2018-12-11T11:55:05Z","page":"332 - 335"},{"_id":"1988","type":"journal_article","status":"public","date_updated":"2021-01-12T06:54:32Z","citation":{"chicago":"Bonny, Mike, Elisabeth Fischer Friedrich, Martin Loose, Petra Schwille, and Karsten Kruse. “Membrane Binding of MinE Allows for a Comprehensive Description of Min-Protein Pattern Formation.” PLoS Computational Biology. Public Library of Science, 2013. https://doi.org/10.1371/journal.pcbi.1003347.","ista":"Bonny M, Fischer Friedrich E, Loose M, Schwille P, Kruse K. 2013. Membrane binding of MinE allows for a comprehensive description of Min-protein pattern formation. PLoS Computational Biology. 9(12).","mla":"Bonny, Mike, et al. “Membrane Binding of MinE Allows for a Comprehensive Description of Min-Protein Pattern Formation.” PLoS Computational Biology, vol. 9, no. 12, Public Library of Science, 2013, doi:10.1371/journal.pcbi.1003347.","ieee":"M. Bonny, E. Fischer Friedrich, M. Loose, P. Schwille, and K. Kruse, “Membrane binding of MinE allows for a comprehensive description of Min-protein pattern formation,” PLoS Computational Biology, vol. 9, no. 12. Public Library of Science, 2013.","short":"M. Bonny, E. Fischer Friedrich, M. Loose, P. Schwille, K. Kruse, PLoS Computational Biology 9 (2013).","ama":"Bonny M, Fischer Friedrich E, Loose M, Schwille P, Kruse K. Membrane binding of MinE allows for a comprehensive description of Min-protein pattern formation. PLoS Computational Biology. 2013;9(12). doi:10.1371/journal.pcbi.1003347","apa":"Bonny, M., Fischer Friedrich, E., Loose, M., Schwille, P., & Kruse, K. (2013). Membrane binding of MinE allows for a comprehensive description of Min-protein pattern formation. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003347"},"extern":1,"publist_id":"5095","author":[{"first_name":"Mike","last_name":"Bonny","full_name":"Bonny, Mike "},{"last_name":"Fischer Friedrich","full_name":"Fischer-Friedrich, Elisabeth","first_name":"Elisabeth"},{"last_name":"Loose","orcid":"0000-0001-7309-9724","full_name":"Martin Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Schwille","full_name":"Schwille, Petra ","first_name":"Petra"},{"first_name":"Karsten","last_name":"Kruse","full_name":"Kruse, Karsten"}],"title":"Membrane binding of MinE allows for a comprehensive description of Min-protein pattern formation","abstract":[{"lang":"eng","text":"The rod-shaped bacterium Escherichia coli selects the cell center as site of division with the help of the proteins MinC, MinD, and MinE. This protein system collectively oscillates between the two cell poles by alternately binding to the membrane in one of the two cell halves. This dynamic behavior, which emerges from the interaction of the ATPase MinD and its activator MinE on the cell membrane, has become a paradigm for protein self-organization. Recently, it has been found that not only the binding of MinD to the membrane, but also interactions of MinE with the membrane contribute to Min-protein self-organization. Here, we show that by accounting for this finding in a computational model, we can comprehensively describe all observed Min-protein patterns in vivo and in vitro. Furthermore, by varying the system's geometry, our computations predict patterns that have not yet been reported. We confirm these predictions experimentally."}],"quality_controlled":0,"publisher":"Public Library of Science","intvolume":" 9","month":"12","publication_status":"published","year":"2013","publication":"PLoS Computational Biology","day":"01","date_created":"2018-12-11T11:55:04Z","date_published":"2013-12-01T00:00:00Z","volume":9,"issue":"12","doi":"10.1371/journal.pcbi.1003347"},{"quality_controlled":"1","publisher":"Institute of Mathematical Statistics","oa":1,"doi":"10.1214/12-AOS1080","date_published":"2013-04-01T00:00:00Z","date_created":"2018-12-11T11:55:11Z","page":"436 - 463","day":"01","publication":"The Annals of Statistics","year":"2013","title":"Geometry of the faithfulness assumption in causal inference","publist_id":"5066","author":[{"last_name":"Uhler","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"},{"last_name":"Raskutti","full_name":"Raskutti, Garvesh","first_name":"Garvesh"},{"full_name":"Bühlmann, Peter","last_name":"Bühlmann","first_name":"Peter"},{"first_name":"Bin","last_name":"Yu","full_name":"Yu, Bin"}],"external_id":{"arxiv":["1207.0547"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics. Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/12-AOS1080.","ista":"Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 41(2), 436–463.","mla":"Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics, vol. 41, no. 2, Institute of Mathematical Statistics, 2013, pp. 436–63, doi:10.1214/12-AOS1080.","apa":"Uhler, C., Raskutti, G., Bühlmann, P., & Yu, B. (2013). Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/12-AOS1080","ama":"Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 2013;41(2):436-463. doi:10.1214/12-AOS1080","short":"C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013) 436–463.","ieee":"C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness assumption in causal inference,” The Annals of Statistics, vol. 41, no. 2. Institute of Mathematical Statistics, pp. 436–463, 2013."},"month":"04","intvolume":" 41","scopus_import":1,"main_file_link":[{"url":"www.doi.org/10.1214/12-AOS1080","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case."}],"issue":"2","volume":41,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"2010","department":[{"_id":"CaUh"}],"date_updated":"2021-01-12T06:54:42Z"},{"abstract":[{"text":"Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression.","lang":"eng"}],"oa_version":"Published Version","oa":1,"main_file_link":[{"open_access":"1","url":"http://repository.cmu.edu/jpc/vol5/iss1/6"}],"publisher":"Carnegie Mellon University","quality_controlled":"1","intvolume":" 5","month":"08","publication_status":"published","year":"2013","publication":"Journal of Privacy and Confidentiality ","language":[{"iso":"eng"}],"day":"01","page":"137 - 166","date_created":"2018-12-11T11:55:11Z","issue":"1","volume":5,"date_published":"2013-08-01T00:00:00Z","doi":"10.29012/jpc.v5i1.629","_id":"2009","type":"journal_article","status":"public","citation":{"chicago":"Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” Journal of Privacy and Confidentiality . Carnegie Mellon University, 2013. https://doi.org/10.29012/jpc.v5i1.629.","ista":"Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 5(1), 137–166.","mla":"Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” Journal of Privacy and Confidentiality , vol. 5, no. 1, Carnegie Mellon University, 2013, pp. 137–66, doi:10.29012/jpc.v5i1.629.","ieee":"C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing for genome-wide association studies,” Journal of Privacy and Confidentiality , vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013.","short":"C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality 5 (2013) 137–166.","apa":"Uhler, C., Slavkovic, A., & Fienberg, S. (2013). Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . Carnegie Mellon University. https://doi.org/10.29012/jpc.v5i1.629","ama":"Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 2013;5(1):137-166. doi:10.29012/jpc.v5i1.629"},"date_updated":"2021-01-12T06:54:41Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline"},{"first_name":"Aleksandra","last_name":"Slavkovic","full_name":"Slavkovic, Aleksandra"},{"full_name":"Fienberg, Stephen","last_name":"Fienberg","first_name":"Stephen"}],"publist_id":"5067","title":"Privacy-preserving data sharing for genome-wide association studies","department":[{"_id":"CaUh"}]},{"title":"Sex biased gene expression at homomorphic sex chromosomes in emus and its implication for sex chromosome evolution","publist_id":"4964","author":[{"first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Beatriz Vicoso","orcid":"0000-0002-4579-8306","last_name":"Vicoso"},{"last_name":"Kaiser","full_name":"Kaiser, Vera B","first_name":"Vera"},{"last_name":"Bachtrog","full_name":"Bachtrog, Doris","first_name":"Doris"}],"extern":1,"citation":{"chicago":"Vicoso, Beatriz, Vera Kaiser, and Doris Bachtrog. “Sex Biased Gene Expression at Homomorphic Sex Chromosomes in Emus and Its Implication for Sex Chromosome Evolution.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1217027110.","ista":"Vicoso B, Kaiser V, Bachtrog D. 2013. Sex biased gene expression at homomorphic sex chromosomes in emus and its implication for sex chromosome evolution. PNAS. 110(16), 6453–6458.","mla":"Vicoso, Beatriz, et al. “Sex Biased Gene Expression at Homomorphic Sex Chromosomes in Emus and Its Implication for Sex Chromosome Evolution.” PNAS, vol. 110, no. 16, National Academy of Sciences, 2013, pp. 6453–58, doi:10.1073/pnas.1217027110.","short":"B. Vicoso, V. Kaiser, D. Bachtrog, PNAS 110 (2013) 6453–6458.","ieee":"B. Vicoso, V. Kaiser, and D. Bachtrog, “Sex biased gene expression at homomorphic sex chromosomes in emus and its implication for sex chromosome evolution,” PNAS, vol. 110, no. 16. National Academy of Sciences, pp. 6453–6458, 2013.","ama":"Vicoso B, Kaiser V, Bachtrog D. Sex biased gene expression at homomorphic sex chromosomes in emus and its implication for sex chromosome evolution. PNAS. 2013;110(16):6453-6458. doi:10.1073/pnas.1217027110","apa":"Vicoso, B., Kaiser, V., & Bachtrog, D. (2013). Sex biased gene expression at homomorphic sex chromosomes in emus and its implication for sex chromosome evolution. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1217027110"},"date_updated":"2021-01-12T06:55:08Z","status":"public","type":"journal_article","_id":"2074","volume":110,"date_published":"2013-04-16T00:00:00Z","issue":"16","doi":"10.1073/pnas.1217027110","date_created":"2018-12-11T11:55:33Z","page":"6453 - 6458","day":"16","publication":"PNAS","publication_status":"published","year":"2013","month":"04","intvolume":" 110","quality_controlled":0,"publisher":"National Academy of Sciences","abstract":[{"lang":"eng","text":"Sex chromosomes originate from autosomes. The accumulation of sexually antagonistic mutations on protosex chromosomes selects for a loss of recombination and sets in motion the evolutionary processes generating heteromorphic sex chromosomes. Recombination suppression and differentiation are generally viewed as the default path of sex chromosome evolution, and the occurrence of old, homomorphic sex chromosomes, such as those of ratite birds, has remained a mystery. Here, we analyze the genome and transcriptome of emu (Dromaius novaehollandiae) and confirm that most genes on the sex chromosome are shared between the Z and W. Surprisingly, however, levels of gene expression are generally sex-biased for all sex-linked genes relative to autosomes, including those in the pseudoautosomal region, and the male-bias increases after gonad formation. This expression bias suggests that the emu sex chromosomes have become masculinized, even in the absence of ZW differentiation. Thus, birds may have taken different evolutionary solutions to minimize the deleterious effects imposed by sexually antagonistic mutations: some lineages eliminate recombination along the protosex chromosomes to physically restrict sexually antagonistic alleles to one sex, whereas ratites evolved sex-biased expression to confine the product of a sexually antagonistic allele to the sex it benefits. This difference in conflict resolution may explain the preservation of recombining, homomorphic sex chromosomes in other lineages and illustrates the importance of sexually antagonistic mutations driving the evolution of sex chromosomes. "}]},{"extern":1,"citation":{"chicago":"Vicoso, Beatriz, Jr Emerson, Yulia Zektser, Shivani Mahajan, and Doris Bachtrog. “Comparative Sex Chromosome Genomics in Snakes: Differentiation Evolutionary Strata and Lack of Global Dosage Compensation.” PLoS Biology. Public Library of Science, 2013. https://doi.org/10.1371/journal.pbio.1001643.","ista":"Vicoso B, Emerson J, Zektser Y, Mahajan S, Bachtrog D. 2013. Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation. PLoS Biology. 11(8).","mla":"Vicoso, Beatriz, et al. “Comparative Sex Chromosome Genomics in Snakes: Differentiation Evolutionary Strata and Lack of Global Dosage Compensation.” PLoS Biology, vol. 11, no. 8, Public Library of Science, 2013, doi:10.1371/journal.pbio.1001643.","ieee":"B. Vicoso, J. Emerson, Y. Zektser, S. Mahajan, and D. Bachtrog, “Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation,” PLoS Biology, vol. 11, no. 8. Public Library of Science, 2013.","short":"B. Vicoso, J. Emerson, Y. Zektser, S. Mahajan, D. Bachtrog, PLoS Biology 11 (2013).","apa":"Vicoso, B., Emerson, J., Zektser, Y., Mahajan, S., & Bachtrog, D. (2013). Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1001643","ama":"Vicoso B, Emerson J, Zektser Y, Mahajan S, Bachtrog D. Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation. PLoS Biology. 2013;11(8). doi:10.1371/journal.pbio.1001643"},"date_updated":"2021-01-12T06:55:09Z","title":"Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation","publist_id":"4962","author":[{"first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Beatriz Vicoso"},{"first_name":"Jr","full_name":"Emerson, Jr J.","last_name":"Emerson"},{"last_name":"Zektser","full_name":"Zektser, Yulia","first_name":"Yulia"},{"first_name":"Shivani","full_name":"Mahajan, Shivani","last_name":"Mahajan"},{"first_name":"Doris","last_name":"Bachtrog","full_name":"Bachtrog, Doris"}],"_id":"2076","status":"public","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)"},"day":"27","publication":"PLoS Biology","year":"2013","publication_status":"published","date_published":"2013-08-27T00:00:00Z","volume":11,"doi":"10.1371/journal.pbio.1001643","issue":"8","date_created":"2018-12-11T11:55:34Z","acknowledgement":"Funded by NIH grants (R01GM076007 and R01GM093182) and a Packard Fellowship to DB.","abstract":[{"text":"Snakes exhibit genetic sex determination, with female heterogametic sex chromosomes (ZZ males, ZW females). Extensive cytogenetic work has suggested that the level of sex chromosome heteromorphism varies among species, with Boidae having entirely homomorphic sex chromosomes, Viperidae having completely heteromorphic sex chromosomes, and Colubridae showing partial differentiation. Here, we take a genomic approach to compare sex chromosome differentiation in these three snake families. We identify homomorphic sex chromosomes in boas (Boidae), but completely heteromorphic sex chromosomes in both garter snakes (Colubridae) and pygmy rattlesnake (Viperidae). Detection of W-linked gametologs enables us to establish the presence of evolutionary strata on garter and pygmy rattlesnake sex chromosomes where recombination was abolished at different time points. Sequence analysis shows that all strata are shared between pygmy rattlesnake and garter snake, i.e., recombination was abolished between the sex chromosomes before the two lineages diverged. The sex-biased transmission of the Z and its hemizygosity in females can impact patterns of molecular evolution, and we show that rates of evolution for Z-linked genes are increased relative to their pseudoautosomal homologs, both at synonymous and amino acid sites (even after controlling for mutational biases). This demonstrates that mutation rates are male-biased in snakes (male-driven evolution), but also supports faster-Z evolution due to differential selective effects on the Z. Finally, we perform a transcriptome analysis in boa and pygmy rattlesnake to establish baseline levels of sex-biased expression in homomorphic sex chromosomes, and show that heteromorphic ZW chromosomes in rattlesnakes lack chromosome-wide dosage compensation. Our study provides the first full scale overview of the evolution of snake sex chromosomes at the genomic level, thus greatly expanding our knowledge of reptilian and vertebrate sex chromosomes evolution.\n","lang":"eng"}],"month":"08","intvolume":" 11","quality_controlled":0,"publisher":"Public Library of Science"},{"issue":"4","doi":"10.1145/2461912.2461953","volume":32,"date_published":"2013-07-01T00:00:00Z","date_created":"2018-12-11T11:55:46Z","day":"01","publication":"ACM Transactions on Graphics","publication_status":"published","year":"2013","month":"07","intvolume":" 32","publisher":"ACM","quality_controlled":0,"abstract":[{"lang":"eng","text":"We present an interactive design system that allows non-expert users to create animated mechanical characters. Given an articulated character as input, the user iteratively creates an animation by sketching motion curves indicating how different parts of the character should move. For each motion curve, our framework creates an optimized mechanism that reproduces it as closely as possible. The resulting mechanisms are attached to the character and then connected to each other using gear trains, which are created in a semi-automated fashion. The mechanical assemblies generated with our system can be driven with a single input driver, such as a hand-operated crank or an electric motor, and they can be fabricated using rapid prototyping devices. We demonstrate the versatility of our approach by designing a wide range of mechanical characters, several of which we manufactured using 3D printing. While our pipeline is designed for characters driven by planar mechanisms, significant parts of it extend directly to non-planar mechanisms, allowing us to create characters with compelling 3D motions. "}],"title":"Computational design of mechanical characters","publist_id":"4927","author":[{"full_name":"Coros, Stelian","last_name":"Coros","first_name":"Stelian"},{"first_name":"Bernhard","full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski"},{"full_name":"Noris, Gioacchino","last_name":"Noris","first_name":"Gioacchino"},{"full_name":"Sueda, Shinjiro","last_name":"Sueda","first_name":"Shinjiro"},{"full_name":"Forberg, Moira","last_name":"Forberg","first_name":"Moira"},{"first_name":"Robert","last_name":"Sumner","full_name":"Sumner, Robert W"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"},{"full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"extern":1,"date_updated":"2021-01-12T06:55:21Z","citation":{"ista":"Coros S, Thomaszewski B, Noris G, Sueda S, Forberg M, Sumner R, Matusik W, Bickel B. 2013. Computational design of mechanical characters. ACM Transactions on Graphics. 32(4).","chicago":"Coros, Stelian, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg, Robert Sumner, Wojciech Matusik, and Bernd Bickel. “Computational Design of Mechanical Characters.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461953.","ama":"Coros S, Thomaszewski B, Noris G, et al. Computational design of mechanical characters. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461953","apa":"Coros, S., Thomaszewski, B., Noris, G., Sueda, S., Forberg, M., Sumner, R., … Bickel, B. (2013). Computational design of mechanical characters. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461953","short":"S. Coros, B. Thomaszewski, G. Noris, S. Sueda, M. Forberg, R. Sumner, W. Matusik, B. Bickel, ACM Transactions on Graphics 32 (2013).","ieee":"S. Coros et al., “Computational design of mechanical characters,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","mla":"Coros, Stelian, et al. “Computational Design of Mechanical Characters.” ACM Transactions on Graphics, vol. 32, no. 4, ACM, 2013, doi:10.1145/2461912.2461953."},"status":"public","type":"journal_article","_id":"2108"},{"extern":1,"date_updated":"2021-01-12T06:55:22Z","citation":{"chicago":"Papas, Marios, Christian Regg, Wojciech Jarosz, Bernd Bickel, Philip Jackson, Wojciech Matusik, Steve Marschner, and Markus Groß. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461974.","ista":"Papas M, Regg C, Jarosz W, Bickel B, Jackson P, Matusik W, Marschner S, Groß M. 2013. Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. 32(4).","mla":"Papas, Marios, et al. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” ACM Transactions on Graphics, vol. 32, no. 4, ACM, 2013, doi:10.1145/2461912.2461974.","ama":"Papas M, Regg C, Jarosz W, et al. Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461974","apa":"Papas, M., Regg, C., Jarosz, W., Bickel, B., Jackson, P., Matusik, W., … Groß, M. (2013). Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461974","short":"M. Papas, C. Regg, W. Jarosz, B. Bickel, P. Jackson, W. Matusik, S. Marschner, M. Groß, ACM Transactions on Graphics 32 (2013).","ieee":"M. Papas et al., “Fabricating translucent materials using continuous pigment mixtures,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013."},"title":"Fabricating translucent materials using continuous pigment mixtures","author":[{"last_name":"Papas","full_name":"Papas, Marios","first_name":"Marios"},{"first_name":"Christian","last_name":"Regg","full_name":"Regg, Christian"},{"last_name":"Jarosz","full_name":"Jarosz, Wojciech","first_name":"Wojciech"},{"orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel","last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jackson, Philip V","last_name":"Jackson","first_name":"Philip"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"full_name":"Marschner, Steve","last_name":"Marschner","first_name":"Steve"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus S"}],"publist_id":"4925","_id":"2110","status":"public","type":"journal_article","publication":"ACM Transactions on Graphics","day":"01","publication_status":"published","year":"2013","date_created":"2018-12-11T11:55:46Z","date_published":"2013-07-01T00:00:00Z","doi":"10.1145/2461912.2461974","issue":"4","volume":32,"abstract":[{"lang":"eng","text":"We present a method for practical physical reproduction and design of homogeneous materials with desired subsurface scattering. Our process uses a collection of different pigments that can be suspended in a clear base material. Our goal is to determine pigment concentrations that best reproduce the appearance and subsurface scattering of a given target material. In order to achieve this task we first fabricate a collection of material samples composed of known mixtures of the available pigments with the base material. We then acquire their reflectance profiles using a custom-built measurement device. We use the same device to measure the reflectance profile of a target material. Based on the database of mappings from pigment concentrations to reflectance profiles, we use an optimization process to compute the concentration of pigments to best replicate the target material appearance. We demonstrate the practicality of our method by reproducing a variety of different translucent materials. We also present a tool that allows the user to explore the range of achievable appearances for a given set of pigments. "}],"intvolume":" 32","month":"07","quality_controlled":0,"publisher":"ACM"},{"quality_controlled":0,"publisher":"ACM","month":"11","intvolume":" 32","abstract":[{"lang":"eng","text":"Animated animatronic figures are a unique way to give physical presence to a character. However, their movement and expressions are often limited due to mechanical constraints. In this paper, we propose a complete process for augmenting physical avatars using projector-based illumination, significantly increasing their expressiveness. Given an input animation, the system decomposes the motion into low-frequency motion that can be physically reproduced by the animatronic head and high-frequency details that are added using projected shading. At the core is a spatio-temporal optimization process that compresses the motion in gradient space, ensuring faithful motion replay while respecting the physical limitations of the system. We also propose a complete multi-camera and projection system, including a novel defocused projection and subsurface scattering compensation scheme. The result of our system is a highly expressive physical avatar that features facial details and motion otherwise unattainable due to physical constraints."}],"date_published":"2013-11-01T00:00:00Z","volume":32,"doi":"10.1145/2508363.2508416","issue":"6","date_created":"2018-12-11T11:55:47Z","publication_status":"published","year":"2013","day":"01","publication":"ACM Transactions on Graphics","type":"journal_article","status":"public","_id":"2111","author":[{"first_name":"Amit","full_name":"Bermano, Amit H","last_name":"Bermano"},{"last_name":"Bruschweiler","full_name":"Bruschweiler, Philipp","first_name":"Philipp"},{"full_name":"Grundhöfer, Anselm","last_name":"Grundhöfer","first_name":"Anselm"},{"first_name":"Daisuke","last_name":"Iwai","full_name":"Iwai, Daisuke"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"first_name":"Markus","full_name":"Groß, Markus S","last_name":"Groß"}],"publist_id":"4922","title":"Augmenting physical avatars using projector-based illumination","citation":{"chicago":"Bermano, Amit, Philipp Bruschweiler, Anselm Grundhöfer, Daisuke Iwai, Bernd Bickel, and Markus Groß. “Augmenting Physical Avatars Using Projector-Based Illumination.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2508363.2508416.","ista":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. 2013. Augmenting physical avatars using projector-based illumination. ACM Transactions on Graphics. 32(6).","mla":"Bermano, Amit, et al. “Augmenting Physical Avatars Using Projector-Based Illumination.” ACM Transactions on Graphics, vol. 32, no. 6, ACM, 2013, doi:10.1145/2508363.2508416.","ama":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. Augmenting physical avatars using projector-based illumination. ACM Transactions on Graphics. 2013;32(6). doi:10.1145/2508363.2508416","apa":"Bermano, A., Bruschweiler, P., Grundhöfer, A., Iwai, D., Bickel, B., & Groß, M. (2013). Augmenting physical avatars using projector-based illumination. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2508363.2508416","ieee":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, and M. Groß, “Augmenting physical avatars using projector-based illumination,” ACM Transactions on Graphics, vol. 32, no. 6. ACM, 2013.","short":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013)."},"date_updated":"2021-01-12T06:55:23Z","extern":1},{"page":"669 - 675","date_created":"2018-12-11T11:55:46Z","volume":37,"date_published":"2013-10-01T00:00:00Z","issue":"6","doi":"10.1016/j.cag.2013.05.011","publication_status":"published","year":"2013","publication":"Computers and Graphics (Pergamon)","day":"01","publisher":"Elsevier","quality_controlled":0,"intvolume":" 37","month":"10","abstract":[{"lang":"eng","text":"Most additive manufacturing technologies work by layering, i.e. slicing the shape and then generating each slice independently. This introduces an anisotropy into the process, often as different accuracies in the tangential and normal directions, but also in terms of other parameters such as build speed or tensile strength and strain. We model this as an anisotropic cubic element. Our approach then finds a compromise between modeling each part of the shape individually in the best possible direction and using one direction for the whole shape part. In particular, we compute an orthogonal basis and consider only the three basis vectors as slice normals (i.e. fabrication directions). Then we optimize a decomposition of the shape along this basis so that each part can be consistently sliced along one of the basis vectors. In simulation, we show that this approach is superior to slicing the whole shape in one direction, only. It also has clear benefits if the shape is larger than the build volume of the available equipment."}],"publist_id":"4924","author":[{"last_name":"Hildebrand","full_name":"Hildebrand, Kristian","first_name":"Kristian"},{"last_name":"Bickel","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}],"title":"Orthogonal slicing for additive manufacturing","date_updated":"2021-01-12T06:55:22Z","citation":{"mla":"Hildebrand, Kristian, et al. “Orthogonal Slicing for Additive Manufacturing.” Computers and Graphics (Pergamon), vol. 37, no. 6, Elsevier, 2013, pp. 669–75, doi:10.1016/j.cag.2013.05.011.","apa":"Hildebrand, K., Bickel, B., & Alexa, M. (2013). Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). Elsevier. https://doi.org/10.1016/j.cag.2013.05.011","ama":"Hildebrand K, Bickel B, Alexa M. Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). 2013;37(6):669-675. doi:10.1016/j.cag.2013.05.011","short":"K. Hildebrand, B. Bickel, M. Alexa, Computers and Graphics (Pergamon) 37 (2013) 669–675.","ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “Orthogonal slicing for additive manufacturing,” Computers and Graphics (Pergamon), vol. 37, no. 6. Elsevier, pp. 669–675, 2013.","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Orthogonal Slicing for Additive Manufacturing.” Computers and Graphics (Pergamon). Elsevier, 2013. https://doi.org/10.1016/j.cag.2013.05.011.","ista":"Hildebrand K, Bickel B, Alexa M. 2013. Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). 37(6), 669–675."},"extern":1,"type":"journal_article","status":"public","_id":"2109"},{"publist_id":"4926","author":[{"first_name":"Mélina","last_name":"Skouras","full_name":"Skouras, Mélina"},{"first_name":"Bernhard","full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski"},{"full_name":"Coros, Stelian","last_name":"Coros","first_name":"Stelian"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus S"}],"title":"Computational design of actuated deformable characters","date_updated":"2021-01-12T06:55:21Z","citation":{"mla":"Skouras, Mélina, et al. “Computational Design of Actuated Deformable Characters.” ACM Transactions on Graphics, vol. 32, no. 4, ACM, 2013, doi:10.1145/2461912.2461979.","ieee":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, and M. Groß, “Computational design of actuated deformable characters,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","short":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013).","ama":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. Computational design of actuated deformable characters. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461979","apa":"Skouras, M., Thomaszewski, B., Coros, S., Bickel, B., & Groß, M. (2013). Computational design of actuated deformable characters. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461979","chicago":"Skouras, Mélina, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, and Markus Groß. “Computational Design of Actuated Deformable Characters.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461979.","ista":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. 2013. Computational design of actuated deformable characters. ACM Transactions on Graphics. 32(4)."},"extern":1,"type":"journal_article","status":"public","_id":"2107","date_published":"2013-07-01T00:00:00Z","volume":32,"doi":"10.1145/2461912.2461979","issue":"4","date_created":"2018-12-11T11:55:45Z","publication_status":"published","year":"2013","day":"01","publication":"ACM Transactions on Graphics","quality_controlled":0,"publisher":"ACM","month":"07","intvolume":" 32","abstract":[{"lang":"eng","text":"We present a method for fabrication-oriented design of actuated deformable characters that allows a user to automatically create physical replicas of digitally designed characters using rapid manufacturing technologies. Given a deformable character and a set of target poses as input, our method computes a small set of actuators along with their locations on the surface and optimizes the internal material distribution such that the resulting character exhibits the desired deformation behavior. We approach this problem with a dedicated algorithm that combines finite-element analysis, sparse regularization, and constrained optimization. We validate our pipeline on a set of two- and three-dimensional example characters and present results in simulation and physically-fabricated prototypes."}],"acknowledgement":"This work was partly funded by the NCCR Co-Me of the Swiss NSF"},{"date_created":"2018-12-11T11:55:47Z","volume":32,"doi":"10.1145/2508363.2508389 ","date_published":"2013-11-01T00:00:00Z","issue":"6","publication":"ACM Transactions on Graphics","day":"01","year":"2013","publication_status":"published","intvolume":" 32","month":"11","quality_controlled":0,"publisher":"ACM","acknowledgement":"This work was supported in part by the European Research Council (ERC-2011-StG-280135 Animetrics) and the Spanish Ministry of Economy (TIN2012-35840).","abstract":[{"lang":"eng","text":"Force-deformation measurements of cloth exhibit significant hysteresis, and many researchers have identified internal friction as the source of this effect. However, it has not been incorporated into computer animation models of cloth. In this paper, we propose a model of internal friction based on an augmented reparameterization of Dahl's model, and we show that this model provides a good match to several important features of cloth hysteresis even with a minimal set of parameters. We also propose novel parameter estimation procedures that are based on simple and inexpensive setups and need only sparse data, as opposed to the complex hardware and dense data acquisition of previous methods. Finally, we provide an algorithm for the efficient simulation of internal friction, and we demonstrate it on simulation examples that show disparate behavior with and without internal friction."}],"title":"Modeling and estimation of internal friction in cloth","author":[{"first_name":"Eder","full_name":"Miguel, Eder","last_name":"Miguel"},{"last_name":"Tamstorf","full_name":"Tamstorf, Rasmus","first_name":"Rasmus"},{"first_name":"Derek","full_name":"Bradley, Derek J","last_name":"Bradley"},{"last_name":"Schvartzman","full_name":"Schvartzman, Sara C","first_name":"Sara"},{"first_name":"Bernhard","last_name":"Thomaszewski","full_name":"Thomaszewski, Bernhard"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"first_name":"Wojciech","full_name":"Matusik, Wojciech","last_name":"Matusik"},{"last_name":"Marschner","full_name":"Marschner, Steve","first_name":"Steve"},{"first_name":"Miguel","last_name":"Otaduy","full_name":"Otaduy, Miguel A"}],"publist_id":"4923","extern":1,"citation":{"ieee":"E. Miguel et al., “Modeling and estimation of internal friction in cloth,” ACM Transactions on Graphics, vol. 32, no. 6. ACM, 2013.","short":"E. Miguel, R. Tamstorf, D. Bradley, S. Schvartzman, B. Thomaszewski, B. Bickel, W. Matusik, S. Marschner, M. Otaduy, ACM Transactions on Graphics 32 (2013).","ama":"Miguel E, Tamstorf R, Bradley D, et al. Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. 2013;32(6). doi:10.1145/2508363.2508389 ","apa":"Miguel, E., Tamstorf, R., Bradley, D., Schvartzman, S., Thomaszewski, B., Bickel, B., … Otaduy, M. (2013). Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2508363.2508389 ","mla":"Miguel, Eder, et al. “Modeling and Estimation of Internal Friction in Cloth.” ACM Transactions on Graphics, vol. 32, no. 6, ACM, 2013, doi:10.1145/2508363.2508389 .","ista":"Miguel E, Tamstorf R, Bradley D, Schvartzman S, Thomaszewski B, Bickel B, Matusik W, Marschner S, Otaduy M. 2013. Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. 32(6).","chicago":"Miguel, Eder, Rasmus Tamstorf, Derek Bradley, Sara Schvartzman, Bernhard Thomaszewski, Bernd Bickel, Wojciech Matusik, Steve Marschner, and Miguel Otaduy. “Modeling and Estimation of Internal Friction in Cloth.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2508363.2508389 ."},"date_updated":"2021-01-12T06:55:23Z","status":"public","type":"journal_article","_id":"2112"},{"intvolume":" 18","month":"11","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.7901 "}],"oa":1,"quality_controlled":0,"publisher":"Institute of Mathematical Statistics","acknowledgement":"The first and third named authors were supported by VICI subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO). The first and second named authors were supported by the German Research Foundation in the Collaborative Research C","abstract":[{"text":"We prove new upper and lower bounds for Banach space-valued stochastic integrals with respect to a compensated Poisson random measure. Our estimates apply to Banach spaces with non-trivial martingale (co)type and extend various results in the literature. We also develop a Malliavin framework to interpret Poisson stochastic integrals as vector-valued Skorohod integrals, and prove a Clark-Ocone representation formula.","lang":"eng"}],"date_created":"2018-12-11T11:55:49Z","volume":18,"doi":"10.1214/EJP.v18-2945 ","date_published":"2013-11-18T00:00:00Z","publication":"Electronic Journal of Probability","day":"18","year":"2013","publication_status":"published","status":"public","type":"journal_article","_id":"2117","title":"Poisson stochastic integration in Banach spaces","publist_id":"4917","author":[{"full_name":"Dirksen, Sjoerd","last_name":"Dirksen","first_name":"Sjoerd"},{"last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Jan Maas","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Van Neerven","full_name":"van Neerven, Jan M","first_name":"Jan"}],"extern":1,"citation":{"chicago":"Dirksen, Sjoerd, Jan Maas, and Jan Van Neerven. “Poisson Stochastic Integration in Banach Spaces.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/EJP.v18-2945 .","ista":"Dirksen S, Maas J, Van Neerven J. 2013. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 18.","mla":"Dirksen, Sjoerd, et al. “Poisson Stochastic Integration in Banach Spaces.” Electronic Journal of Probability, vol. 18, Institute of Mathematical Statistics, 2013, doi:10.1214/EJP.v18-2945 .","apa":"Dirksen, S., Maas, J., & Van Neerven, J. (2013). Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/EJP.v18-2945 ","ama":"Dirksen S, Maas J, Van Neerven J. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 2013;18. doi:10.1214/EJP.v18-2945 ","ieee":"S. Dirksen, J. Maas, and J. Van Neerven, “Poisson stochastic integration in Banach spaces,” Electronic Journal of Probability, vol. 18. Institute of Mathematical Statistics, 2013.","short":"S. Dirksen, J. Maas, J. Van Neerven, Electronic Journal of Probability 18 (2013)."},"date_updated":"2021-01-12T06:55:24Z"},{"intvolume":" 33","month":"09","publisher":"IEEE","quality_controlled":0,"abstract":[{"text":"A new method fabricates custom surface reflectance and spatially varying bidirectional reflectance distribution functions (svBRDFs). Researchers optimize a microgeometry for a range of normal distribution functions and simulate the resulting surface's effective reflectance. Using the simulation's results, they reproduce an input svBRDF's appearance by distributing the microgeometry on the printed material's surface. This method lets people print svBRDFs on planar samples with current 3D printing technology, even with a limited set of printing materials. It extends naturally to printing svBRDFs on arbitrary shapes.","lang":"eng"}],"date_created":"2018-12-11T11:55:47Z","issue":"6","date_published":"2013-09-23T00:00:00Z","volume":33,"doi":"10.1109/MCG.2013.82 ","page":"48 - 57","publication":"IEEE Computer Graphics and Applications","day":"23","publication_status":"published","year":"2013","status":"public","type":"journal_article","_id":"2113","title":"3D printing spatially varying BRDFs","author":[{"first_name":"Olivier","last_name":"Rouiller","full_name":"Rouiller, Olivier"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel","last_name":"Bickel"},{"last_name":"Kautz","full_name":"Kautz, Jan","first_name":"Jan"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"full_name":"Alexa, Marc","last_name":"Alexa","first_name":"Marc"}],"publist_id":"4920","extern":1,"citation":{"mla":"Rouiller, Olivier, et al. “3D Printing Spatially Varying BRDFs.” IEEE Computer Graphics and Applications, vol. 33, no. 6, IEEE, 2013, pp. 48–57, doi:10.1109/MCG.2013.82 .","ama":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. 2013;33(6):48-57. doi:10.1109/MCG.2013.82 ","apa":"Rouiller, O., Bickel, B., Kautz, J., Matusik, W., & Alexa, M. (2013). 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. IEEE. https://doi.org/10.1109/MCG.2013.82 ","short":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 48–57.","ieee":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, and M. Alexa, “3D printing spatially varying BRDFs,” IEEE Computer Graphics and Applications, vol. 33, no. 6. IEEE, pp. 48–57, 2013.","chicago":"Rouiller, Olivier, Bernd Bickel, Jan Kautz, Wojciech Matusik, and Marc Alexa. “3D Printing Spatially Varying BRDFs.” IEEE Computer Graphics and Applications. IEEE, 2013. https://doi.org/10.1109/MCG.2013.82 .","ista":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 2013. 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. 33(6), 48–57."},"date_updated":"2021-01-12T06:55:23Z"},{"page":"24 - 25","date_created":"2018-12-11T11:55:48Z","doi":"10.1109/MCG.2013.89","date_published":"2013-12-01T00:00:00Z","issue":"6","volume":33,"publication_status":"published","year":"2013","publication":"IEEE Computer Graphics and Applications","day":"01","publisher":"IEEE","quality_controlled":0,"intvolume":" 33","month":"12","abstract":[{"lang":"eng","text":"3D printing is considered a disruptive technology with a potentially tremendous socioeconomic impact. The three articles in this special issue illustrate how novel computer graphics approaches are advancing such digital fabrication."}],"author":[{"last_name":"Bickel","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}],"publist_id":"4921","title":"Computational aspects of fabrication: Modeling, design and 3d printing","date_updated":"2021-01-12T06:55:24Z","citation":{"ista":"Bickel B, Alexa M. 2013. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 33(6), 24–25.","chicago":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” IEEE Computer Graphics and Applications. IEEE, 2013. https://doi.org/10.1109/MCG.2013.89.","ieee":"B. Bickel and M. Alexa, “Computational aspects of fabrication: Modeling, design and 3d printing,” IEEE Computer Graphics and Applications, vol. 33, no. 6. IEEE, pp. 24–25, 2013.","short":"B. Bickel, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 24–25.","ama":"Bickel B, Alexa M. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 2013;33(6):24-25. doi:10.1109/MCG.2013.89","apa":"Bickel, B., & Alexa, M. (2013). Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. IEEE. https://doi.org/10.1109/MCG.2013.89","mla":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” IEEE Computer Graphics and Applications, vol. 33, no. 6, IEEE, 2013, pp. 24–25, doi:10.1109/MCG.2013.89."},"extern":1,"type":"journal_article","status":"public","_id":"2114"},{"date_created":"2018-12-11T11:55:53Z","date_published":"2013-01-01T00:00:00Z","volume":45,"issue":"2","doi":"10.1137/120886315 ","page":"879 - 899","publication":"SIAM Journal on Mathematical Analysis","day":"01","publication_status":"published","year":"2013","intvolume":" 45","month":"01","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1207.6501","open_access":"1"}],"publisher":"Society for Industrial and Applied Mathematics ","quality_controlled":0,"acknowledgement":"JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","abstract":[{"lang":"eng","text":"This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when N→∞, to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric. \n\n\n"}],"title":"Gromov-Hausdorff convergence of discrete transportation metrics","publist_id":"4904","author":[{"first_name":"Nicola","last_name":"Gigli","full_name":"Gigli, Nicola"},{"orcid":"0000-0002-0845-1338","full_name":"Jan Maas","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"extern":1,"citation":{"chicago":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120886315 .","ista":"Gigli N, Maas J. 2013. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 45(2), 879–899.","mla":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” SIAM Journal on Mathematical Analysis, vol. 45, no. 2, Society for Industrial and Applied Mathematics , 2013, pp. 879–99, doi:10.1137/120886315 .","short":"N. Gigli, J. Maas, SIAM Journal on Mathematical Analysis 45 (2013) 879–899.","ieee":"N. Gigli and J. Maas, “Gromov-Hausdorff convergence of discrete transportation metrics,” SIAM Journal on Mathematical Analysis, vol. 45, no. 2. Society for Industrial and Applied Mathematics , pp. 879–899, 2013.","apa":"Gigli, N., & Maas, J. (2013). Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120886315 ","ama":"Gigli N, Maas J. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 2013;45(2):879-899. doi:10.1137/120886315 "},"date_updated":"2021-01-12T06:55:29Z","status":"public","type":"journal_article","_id":"2129"},{"status":"public","type":"journal_article","_id":"2139","title":"Manipulating scattering of ultracold atoms with light-induced dissipation","author":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko"}],"publist_id":"4885","extern":1,"citation":{"short":"M. Lemeshko, Frontiers Physics 1 (2013).","ieee":"M. Lemeshko, “Manipulating scattering of ultracold atoms with light-induced dissipation,” Frontiers Physics, vol. 1, no. 17. Frontiers Media, 2013.","ama":"Lemeshko M. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 2013;1(17). doi:10.3389/fphy.2013.00017","apa":"Lemeshko, M. (2013). Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. Frontiers Media. https://doi.org/10.3389/fphy.2013.00017","mla":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” Frontiers Physics, vol. 1, no. 17, Frontiers Media, 2013, doi:10.3389/fphy.2013.00017.","ista":"Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17).","chicago":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” Frontiers Physics. Frontiers Media, 2013. https://doi.org/10.3389/fphy.2013.00017."},"date_updated":"2021-01-12T06:55:32Z","month":"10","intvolume":" 1","publisher":"Frontiers Media","quality_controlled":0,"main_file_link":[{"url":"http://arxiv.org/abs/1307.8129","open_access":"1"}],"oa":1,"acknowledgement":"The work was supported by the NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory","abstract":[{"lang":"eng","text":"Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&Weimer, Nature Comm. 4, 2230 (2013)]. Here we study the dynamics of interaction-induced coherent population trapping - the process responsible for the formation of dissipatively bound molecules. We derive the effective dissipative potentials induced between ultracold atoms by laser light, and study the time evolution of the scattering states. We demonstrate that binding occurs on short timescales of ~10 microseconds, even if the initial kinetic energy of the atoms significantly exceeds the depth of the dissipative potential. Dissipatively-bound molecules with preordained bond lengths and vibrational wavefunctions can be created and detected in current experiments with ultracold atoms."}],"volume":1,"issue":"17","doi":"10.3389/fphy.2013.00017","date_published":"2013-10-07T00:00:00Z","date_created":"2018-12-11T11:55:56Z","day":"07","publication":"Frontiers Physics","year":"2013","publication_status":"published"},{"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328."},"title":"Quantitative relaxation of concurrent data structures","publist_id":"4801","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"first_name":"Hannes","full_name":"Payer, Hannes","last_name":"Payer"},{"full_name":"Sezgin, Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","oa":1,"quality_controlled":"1","publisher":"ACM","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","day":"01","year":"2013","has_accepted_license":"1","date_created":"2018-12-11T11:56:11Z","doi":"10.1145/2429069.2429109","date_published":"2013-01-01T00:00:00Z","page":"317 - 328","_id":"2181","pubrep_id":"198","status":"public","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","location":"Rome, Italy","start_date":"2013-01-23"},"type":"conference","ddc":["000","004"],"date_updated":"2023-02-21T16:06:49Z","file_date_updated":"2020-07-14T12:45:31Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","abstract":[{"text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all "legal" sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.","lang":"eng"}],"month":"01","scopus_import":1,"language":[{"iso":"eng"}],"file":[{"file_id":"5086","checksum":"adf465e70948f4e80e48057524516456","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:33Z","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","date_updated":"2020-07-14T12:45:31Z","file_size":294689,"creator":"system"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-1832-7"]},"ec_funded":1,"related_material":{"record":[{"relation":"later_version","status":"deleted","id":"10901"}]}},{"title":"Quantitative abstraction refinement","department":[{"_id":"ToHe"}],"publist_id":"4800","author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128.","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085."},"date_updated":"2021-01-12T06:55:50Z","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"status":"public","type":"conference","conference":{"name":"POPL: Principles of Programming Languages","location":"Rome, Italy","end_date":"2013-01-25","start_date":"2013-07-23"},"_id":"2182","date_published":"2013-01-01T00:00:00Z","doi":"10.1145/2429069.2429085","ec_funded":1,"date_created":"2018-12-11T11:56:11Z","page":"115 - 128","day":"01","language":[{"iso":"eng"}],"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","year":"2013","publication_status":"published","month":"01","publisher":"ACM","quality_controlled":"1","scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed."}]},{"oa_version":"None","abstract":[{"lang":"eng","text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n"}],"month":"12","publisher":"IEEE","alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"quality_controlled":"1","scopus_import":1,"language":[{"iso":"eng"}],"day":"01","year":"2013","publication_status":"published","publication_identifier":{"eisbn":["978-0-7695-5037-4 "]},"date_created":"2018-12-11T11:56:20Z","doi":"10.1109/ISVD.2013.11","date_published":"2013-12-01T00:00:00Z","page":"37 - 46","_id":"2209","status":"public","conference":{"start_date":"2013-07-08","end_date":"2013-07-10","location":"St. Petersburg, Russia","name":"ISVD: Voronoi Diagrams in Science and Engineering"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:00Z","citation":{"ista":"Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11.","short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.","ieee":"T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.","apa":"Biedl, T., Held, M., & Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE. https://doi.org/10.1109/ISVD.2013.11","ama":"Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:10.1109/ISVD.2013.11","mla":"Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11."},"department":[{"_id":"HeEd"}],"title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","publist_id":"4763","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"}]},{"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1103/PhysRevLett.111.239901"}]},"issue":"15","date_published":"2013-04-08T00:00:00Z","volume":110,"doi":"10.1103/PhysRevLett.110.155301","date_created":"2018-12-11T11:56:18Z","day":"08","publication":"Physical Review Letters","language":[{"iso":"eng"}],"publication_status":"published","year":"2013","month":"04","intvolume":" 110","publisher":"American Physical Society","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.3317"}],"oa_version":"None","abstract":[{"lang":"eng","text":"We introduce a new platform for quantum simulation of many-body systems based on nonspherical atoms or molecules with zero dipole moments but possessing a significant value of electric quadrupole moments. We consider a quadrupolar Fermi gas trapped in a 2D square optical lattice, and show that the peculiar symmetry and broad tunability of the quadrupole-quadrupole interaction results in a rich phase diagram encompassing unconventional BCS and charge density wave phases, and opens up a perspective to create a topological superfluid. Quadrupolar species, such as metastable alkaline-earth atoms and homonuclear molecules, are stable against chemical reactions and collapse and are readily available in experiment at high densities."}],"title":"Quantum phases of quadrupolar fermi gases in optical lattices","publist_id":"4769","author":[{"last_name":"Bhongale","full_name":"Bhongale, Satyan","first_name":"Satyan"},{"first_name":"Ludwig","last_name":"Mathey","full_name":"Mathey, Ludwig"},{"full_name":"Zhao, Erhai","last_name":"Zhao","first_name":"Erhai"},{"last_name":"Yelin","full_name":"Yelin, Susanne","first_name":"Susanne"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"}],"article_processing_charge":"No","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-11-16T08:04:06Z","citation":{"ama":"Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. 2013;110(15). doi:10.1103/PhysRevLett.110.155301","apa":"Bhongale, S., Mathey, L., Zhao, E., Yelin, S., & Lemeshko, M. (2013). Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.110.155301","ieee":"S. Bhongale, L. Mathey, E. Zhao, S. Yelin, and M. Lemeshko, “Quantum phases of quadrupolar fermi gases in optical lattices,” Physical Review Letters, vol. 110, no. 15. American Physical Society, 2013.","short":"S. Bhongale, L. Mathey, E. Zhao, S. Yelin, M. Lemeshko, Physical Review Letters 110 (2013).","mla":"Bhongale, Satyan, et al. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” Physical Review Letters, vol. 110, no. 15, American Physical Society, 2013, doi:10.1103/PhysRevLett.110.155301.","ista":"Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. 2013. Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. 110(15).","chicago":"Bhongale, Satyan, Ludwig Mathey, Erhai Zhao, Susanne Yelin, and Mikhail Lemeshko. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” Physical Review Letters. American Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.155301."},"status":"public","type":"journal_article","_id":"2204"},{"type":"journal_article","status":"public","_id":"2206","publist_id":"4767","author":[{"full_name":"Mikhail Lemeshko","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"},{"first_name":"Norman","full_name":"Yao, Norman Y","last_name":"Yao"},{"last_name":"Gorshkov","full_name":"Gorshkov, Alexey V","first_name":"Alexey"},{"first_name":"Hendrik","full_name":"Weimer, Hendrik","last_name":"Weimer"},{"last_name":"Bennett","full_name":"Bennett, Steven D","first_name":"Steven"},{"last_name":"Momose","full_name":"Momose, Takamasa","first_name":"Takamasa"},{"full_name":"Gopalakrishnan, Sarang","last_name":"Gopalakrishnan","first_name":"Sarang"}],"title":"Controllable quantum spin glasses with magnetic impurities embedded in quantum solids","citation":{"mla":"Lemeshko, Mikhail, et al. “Controllable Quantum Spin Glasses with Magnetic Impurities Embedded in Quantum Solids.” Physical Review B - Condensed Matter and Materials Physics, vol. 88, no. 1, American Physical Society, 2013, doi:10.1103/PhysRevB.88.014426.","apa":"Lemeshko, M., Yao, N., Gorshkov, A., Weimer, H., Bennett, S., Momose, T., & Gopalakrishnan, S. (2013). Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.88.014426","ama":"Lemeshko M, Yao N, Gorshkov A, et al. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. 2013;88(1). doi:10.1103/PhysRevB.88.014426","ieee":"M. Lemeshko et al., “Controllable quantum spin glasses with magnetic impurities embedded in quantum solids,” Physical Review B - Condensed Matter and Materials Physics, vol. 88, no. 1. American Physical Society, 2013.","short":"M. Lemeshko, N. Yao, A. Gorshkov, H. Weimer, S. Bennett, T. Momose, S. Gopalakrishnan, Physical Review B - Condensed Matter and Materials Physics 88 (2013).","chicago":"Lemeshko, Mikhail, Norman Yao, Alexey Gorshkov, Hendrik Weimer, Steven Bennett, Takamasa Momose, and Sarang Gopalakrishnan. “Controllable Quantum Spin Glasses with Magnetic Impurities Embedded in Quantum Solids.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.014426.","ista":"Lemeshko M, Yao N, Gorshkov A, Weimer H, Bennett S, Momose T, Gopalakrishnan S. 2013. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. 88(1)."},"date_updated":"2021-01-12T06:55:59Z","extern":1,"publisher":"American Physical Society","quality_controlled":0,"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.1130"}],"month":"07","intvolume":" 88","abstract":[{"text":"Magnetic impurities embedded in inert solids can exhibit long coherence times and interact with one another via their intrinsic anisotropic dipolar interaction. We argue that, as a consequence of these properties, disordered ensembles of magnetic impurities provide an effective platform for realizing a controllable, tunable version of the dipolar quantum spin glass seen in LiHoxY1-xF4. Specifically, we propose and analyze a system composed of dysprosium atoms embedded in solid helium. We describe the phase diagram of the system and discuss the realizability and detectability of the quantum spin glass and antiglass phases.","lang":"eng"}],"date_published":"2013-07-24T00:00:00Z","issue":"1","volume":88,"doi":"10.1103/PhysRevB.88.014426","date_created":"2018-12-11T11:56:19Z","year":"2013","publication_status":"published","day":"24","publication":"Physical Review B - Condensed Matter and Materials Physics"},{"day":"01","publication":"Molecular Physics","year":"2013","publication_status":"published","date_published":"2013-07-01T00:00:00Z","doi":"10.1080/00268976.2013.813595","volume":111,"issue":"12-13","date_created":"2018-12-11T11:56:19Z","page":"1648 - 1682","acknowledgement":"National Science Foundation; Natural Sciences and Engineering Research Council of Canada","abstract":[{"text":"The goal of the present article is to review the major developments that have led to the current understanding of molecule-field interactions and experimental methods for manipulating molecules with electromagnetic fields. Molecule-field interactions are at the core of several, seemingly distinct areas of molecular physics. This is reflected in the organisation of this article, which includes sections on field control of molecular beams, external field traps for cold molecules, control of molecular orientation and molecular alignment, manipulation of molecules by non-conservative forces, ultracold molecules and ultracold chemistry, controlled many-body phenomena, entanglement of molecules and dipole arrays, and stability of molecular systems in high-frequency super-intense laser fields. The article contains 852 references.","lang":"eng"}],"month":"07","intvolume":" 111","quality_controlled":0,"publisher":"Taylor & Francis","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1306.0912","open_access":"1"}],"extern":1,"date_updated":"2020-07-14T12:45:32Z","citation":{"ista":"Lemeshko M, Krems R, Doyle J, Kais S. 2013. Manipulation of molecules with electromagnetic fields. Molecular Physics. 111(12–13), 1648–1682.","chicago":"Lemeshko, Mikhail, Roman Krems, John Doyle, and Sabre Kais. “Manipulation of Molecules with Electromagnetic Fields.” Molecular Physics. Taylor & Francis, 2013. https://doi.org/10.1080/00268976.2013.813595.","ama":"Lemeshko M, Krems R, Doyle J, Kais S. Manipulation of molecules with electromagnetic fields. Molecular Physics. 2013;111(12-13):1648-1682. doi:10.1080/00268976.2013.813595","apa":"Lemeshko, M., Krems, R., Doyle, J., & Kais, S. (2013). Manipulation of molecules with electromagnetic fields. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2013.813595","short":"M. Lemeshko, R. Krems, J. Doyle, S. Kais, Molecular Physics 111 (2013) 1648–1682.","ieee":"M. Lemeshko, R. Krems, J. Doyle, and S. Kais, “Manipulation of molecules with electromagnetic fields,” Molecular Physics, vol. 111, no. 12–13. Taylor & Francis, pp. 1648–1682, 2013.","mla":"Lemeshko, Mikhail, et al. “Manipulation of Molecules with Electromagnetic Fields.” Molecular Physics, vol. 111, no. 12–13, Taylor & Francis, 2013, pp. 1648–82, doi:10.1080/00268976.2013.813595."},"title":"Manipulation of molecules with electromagnetic fields","publist_id":"4768","author":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko"},{"last_name":"Krems","full_name":"Krems, Roman V","first_name":"Roman"},{"last_name":"Doyle","full_name":"Doyle, John M","first_name":"John"},{"first_name":"Sabre","last_name":"Kais","full_name":"Kais, Sabre"}],"_id":"2205","status":"public","type":"review"},{"status":"public","type":"journal_article","_id":"2207","title":"Dissipative binding of atoms by non-conservative forces","publist_id":"4766","author":[{"orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"},{"first_name":"Hendrik","last_name":"Weimer","full_name":"Weimer, Hendrik"}],"extern":1,"date_updated":"2021-01-12T06:55:59Z","citation":{"ama":"Lemeshko M, Weimer H. Dissipative binding of atoms by non-conservative forces. Nature Communications. 2013;4. doi:10.1038/ncomms3230","apa":"Lemeshko, M., & Weimer, H. (2013). Dissipative binding of atoms by non-conservative forces. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms3230","ieee":"M. Lemeshko and H. Weimer, “Dissipative binding of atoms by non-conservative forces,” Nature Communications, vol. 4. Nature Publishing Group, 2013.","short":"M. Lemeshko, H. Weimer, Nature Communications 4 (2013).","mla":"Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” Nature Communications, vol. 4, Nature Publishing Group, 2013, doi:10.1038/ncomms3230.","ista":"Lemeshko M, Weimer H. 2013. Dissipative binding of atoms by non-conservative forces. Nature Communications. 4.","chicago":"Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” Nature Communications. Nature Publishing Group, 2013. https://doi.org/10.1038/ncomms3230."},"intvolume":" 4","month":"07","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.4035"}],"oa":1,"quality_controlled":0,"publisher":"Nature Publishing Group","abstract":[{"lang":"eng","text":"The formation of molecules and supramolecular structures results from bonding by conservative forces acting among electrons and nuclei and giving rise to equilibrium configurations defined by minima of the interaction potential. Here we show that bonding can also occur by the non-conservative forces responsible for interaction-induced coherent population trapping. The bound state arises in a dissipative process and manifests itself as a stationary state at a preordained interatomic distance. Remarkably, such a dissipative bonding is present even when the interactions among the atoms are purely repulsive. The dissipative bound states can be created and studied spectroscopically in present-day experiments with ultracold atoms or molecules and can potentially serve for cooling strongly interacting quantum gases."}],"date_created":"2018-12-11T11:56:20Z","volume":4,"date_published":"2013-07-30T00:00:00Z","doi":"10.1038/ncomms3230","publication":"Nature Communications","day":"30","publication_status":"published","year":"2013"},{"date_published":"2013-03-01T00:00:00Z","date_created":"2018-12-11T11:56:21Z","page":"95 - 98","day":"01","publication":"29th European Workshop on Computational Geometry","language":[{"iso":"eng"}],"publication_status":"published","year":"2013","month":"03","publisher":"TU Braunschweig","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model."}],"title":"Reconstructing polygons from embedded straight skeletons","department":[{"_id":"HeEd"}],"author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"first_name":"Martin","full_name":"Held, Martin","last_name":"Held"},{"first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan"}],"publist_id":"4762","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:00Z","citation":{"ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In 29th European Workshop on Computational Geometry, 95–98. TU Braunschweig, 2013.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig, Germany, 2013, pp. 95–98.","short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","apa":"Biedl, T., Held, M., & Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In 29th European Workshop on Computational Geometry (pp. 95–98). Braunschweig, Germany: TU Braunschweig.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: 29th European Workshop on Computational Geometry. TU Braunschweig; 2013:95-98.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98."},"status":"public","type":"conference","conference":{"location":"Braunschweig, Germany","end_date":"2013-03-20","start_date":"2013-03-17","name":"EuroCG: European Workshop on Computational Geometry"},"_id":"2210"},{"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation."}],"month":"01","intvolume":" 8312","alternative_title":["LNCS"],"scopus_import":1,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"7858","checksum":"9cebaafca032e6769d273f393305c705","date_updated":"2020-07-14T12:45:34Z","file_size":279206,"creator":"dernst","date_created":"2020-05-15T11:10:40Z","file_name":"2013_LPAR_Blanc.pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":8312,"_id":"2237","series_title":"Lecture Notes in Computer Science","status":"public","type":"conference","conference":{"location":"Stellenbosch, South Africa","end_date":"2013-12-19","start_date":"2013-12-14","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"ddc":["000"],"date_updated":"2020-08-11T10:09:42Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:34Z","publisher":"Springer","quality_controlled":"1","oa":1,"day":"14","has_accepted_license":"1","year":"2013","doi":"10.1007/978-3-642-45221-5_13","date_published":"2013-01-14T00:00:00Z","date_created":"2018-12-11T11:56:29Z","page":"173 - 181","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","apa":"Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:10.1007/978-3-642-45221-5_13","mla":"Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.","ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13."},"title":"Tree interpolation in Vampire","author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4724","article_processing_charge":"No"},{"series_title":"Lecture Notes in Computer Science","_id":"2238","type":"conference","conference":{"location":"Stellenbosch, South Africa","end_date":"2013-12-19","start_date":"2013-12-14","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"status":"public","date_updated":"2020-08-11T10:09:42Z","department":[{"_id":"KrCh"}],"abstract":[{"text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n","lang":"eng"}],"oa_version":"None","scopus_import":1,"alternative_title":["LNCS"],"month":"12","intvolume":" 8312","publication_status":"published","language":[{"iso":"eng"}],"volume":8312,"ec_funded":1,"project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"citation":{"chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","mla":"Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17","apa":"Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4723","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"full_name":"Wojtczak, Dominik","last_name":"Wojtczak","first_name":"Dominik"}],"title":"Multi-objective discounted reward verification in graphs and MDPs","publisher":"Springer","quality_controlled":"1","year":"2013","day":"01","page":"228 - 242","date_published":"2013-12-01T00:00:00Z","doi":"10.1007/978-3-642-45221-5_17","date_created":"2018-12-11T11:56:30Z"},{"status":"public","pubrep_id":"136","type":"conference","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)"},"conference":{"name":"CSL: Computer Science Logic","location":"Torino, Italy","end_date":"2013-09-05","start_date":"2013-09-02"},"series_title":"Leibniz International Proceedings in Informatics","_id":"2243","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:34Z","ddc":["000","004"],"date_updated":"2020-08-11T10:09:42Z","month":"09","intvolume":" 23","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME."}],"volume":23,"ec_funded":1,"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"e0732e73a8b1e39483df7717d53e3e35","file_id":"4929","creator":"system","file_size":454915,"date_updated":"2020-07-14T12:45:34Z","file_name":"IST-2016-136-v1+2_39.pdf","date_created":"2018-12-12T10:12:11Z"}],"language":[{"iso":"eng"}],"publication_status":"published","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"title":"Elementary modal logics over transitive structures","publist_id":"4708","author":[{"first_name":"Jakub","full_name":"Michaliszyn, Jakub","last_name":"Michaliszyn"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563","apa":"Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","mla":"Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563."},"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_published":"2013-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2013.563","date_created":"2018-12-11T11:56:32Z","page":"563 - 577","day":"01","has_accepted_license":"1","year":"2013"},{"date_updated":"2023-02-21T17:03:07Z","department":[{"_id":"UlWa"}],"_id":"2244","series_title":"Lecture Notes in Computer Science","type":"conference","conference":{"start_date":"2013-09-23","end_date":"2013-09-25","location":"Bordeaux, France","name":"GD: Graph Drawing and Network Visualization"},"status":"public","publication_status":"published","language":[{"iso":"eng"}],"volume":8242,"related_material":{"record":[{"id":"1411","status":"public","relation":"later_version"}]},"abstract":[{"lang":"eng","text":"We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. "}],"oa_version":"Preprint","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.6475"}],"month":"09","intvolume":" 8242","citation":{"mla":"Matoušek, Jiří, et al. Untangling Two Systems of Noncrossing Curves. Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-03841-4_41.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4707","author":[{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"full_name":"Sedgwick, Eric","last_name":"Sedgwick","first_name":"Eric"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1302.6475"]},"title":"Untangling two systems of noncrossing curves","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948"}],"year":"2013","day":"01","page":"472 - 483","date_published":"2013-09-01T00:00:00Z","doi":"10.1007/978-3-319-03841-4_41","date_created":"2018-12-11T11:56:32Z","acknowledgement":"We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.","publisher":"Springer","quality_controlled":"1","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.","short":"J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.","ieee":"J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.","ama":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4","apa":"Alwen, J. F., Krenn, S., Pietrzak, K. Z., & Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_4","chicago":"Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.","ista":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74."},"title":"Learning with rounding, revisited: New reduction properties and applications","publist_id":"4687","author":[{"last_name":"Alwen","full_name":"Alwen, Joel F","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","last_name":"Krenn","full_name":"Krenn, Stephan","orcid":"0000-0003-2835-9093"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Daniel","last_name":"Wichs","full_name":"Wichs, Daniel"}],"project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"day":"01","has_accepted_license":"1","year":"2013","date_published":"2013-01-01T00:00:00Z","doi":"10.1007/978-3-642-40041-4_4","date_created":"2018-12-11T11:56:37Z","page":"57 - 74","publisher":"Springer","quality_controlled":"1","oa":1,"ddc":["000","004"],"date_updated":"2021-01-12T06:56:21Z","department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:45:35Z","_id":"2259","series_title":"Lecture Notes in Computer Science","status":"public","pubrep_id":"684","type":"conference","conference":{"start_date":"2013-08-18","end_date":"2013-08-22","location":"Santa Barbara, CA, United States","name":"CRYPTO: International Cryptology Conference"},"file":[{"creator":"system","date_updated":"2020-07-14T12:45:35Z","file_size":587898,"date_created":"2018-12-12T10:11:55Z","file_name":"IST-2016-684-v1+1_098.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"16d428408a806b8e49eecc607deab115","file_id":"4912"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":8042,"issue":"1","ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.\r\n"}],"month":"01","intvolume":" 8042","scopus_import":1,"alternative_title":["LNCS"]},{"has_accepted_license":"1","year":"2013","day":"01","page":"571 - 588","date_published":"2013-01-01T00:00:00Z","doi":"10.1007/978-3-642-40041-4_31","date_created":"2018-12-11T11:56:37Z","quality_controlled":"1","publisher":"Springer","oa":1,"citation":{"ista":"Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_31.","apa":"Kiltz, E., Pietrzak, K. Z., & Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_31","ama":"Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:10.1007/978-3-642-40041-4_31","short":"E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.","ieee":"E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.","mla":"Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4688","author":[{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Szegedy, Mario","last_name":"Szegedy","first_name":"Mario"}],"title":"Digital signatures with minimal overhead from indifferentiable random invertible functions","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","file":[{"creator":"system","file_size":493175,"date_updated":"2020-07-14T12:45:35Z","file_name":"IST-2016-685-v1+1_658.pdf","date_created":"2018-12-12T10:09:20Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4744","checksum":"18a3f602cb41de184dc0e16a0e907633"}],"language":[{"iso":"eng"}],"volume":8042,"ec_funded":1,"abstract":[{"lang":"eng","text":"In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n"}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"scopus_import":1,"month":"01","intvolume":" 8042","date_updated":"2021-01-12T06:56:21Z","ddc":["000","004"],"department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:45:35Z","_id":"2258","series_title":"Lecture Notes in Computer Science","type":"conference","conference":{"start_date":"2013-08-18","location":"Santa Barbara, CA, United States","end_date":"2013-08-22","name":"CRYPTO: International Cryptology Conference"},"status":"public","pubrep_id":"685"},{"_id":"2256","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":"719","status":"public","date_updated":"2021-01-12T06:56:20Z","ddc":["020"],"file_date_updated":"2020-07-14T12:45:35Z","department":[{"_id":"E-Lib"}],"abstract":[{"text":"Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license.","lang":"eng"},{"text":"Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte.","lang":"ger"}],"oa_version":"Published Version","intvolume":" 66","month":"12","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:08:09Z","file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","creator":"system","date_updated":"2020-07-14T12:45:35Z","file_size":881545,"checksum":"ae57ffcee3720adcc27b0f2767a1e04b","file_id":"4669","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"volume":66,"issue":"3/4","citation":{"chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","ista":"Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.","mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587.","short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no. 3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Danowski","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Doron","full_name":"Goldfarb, Doron","last_name":"Goldfarb"},{"first_name":"Verena","full_name":"Schaffner, Verena","last_name":"Schaffner"},{"first_name":"Wolfram","full_name":"Seidler, Wolfram","last_name":"Seidler"}],"publist_id":"4690","title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","oa":1,"publisher":"Verein Österreichischer Bibliothekarinnen und Bibliothekare","year":"2013","popular_science":"1","has_accepted_license":"1","publication":"VÖB Mitteilungen","day":"01","page":"559 - 587","date_created":"2018-12-11T11:56:36Z","date_published":"2013-12-01T00:00:00Z"},{"status":"public","conference":{"name":"ACNS: Applied Cryptography and Network Security","end_date":"2013-06-28","location":"Banff, AB, Canada","start_date":"2013-06-25"},"type":"conference","series_title":"Lecture Notes in Computer Science","_id":"2260","department":[{"_id":"KrPi"}],"date_updated":"2020-08-11T10:09:44Z","intvolume":" 7954","month":"06","main_file_link":[{"url":"http://eprint.iacr.org/2012/475","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.\r\n\r\nThe security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.\r\n"}],"volume":7954,"language":[{"iso":"eng"}],"publication_status":"published","title":"Efficient signatures of knowledge and DAA in the standard model","author":[{"full_name":"Bernhard, David","last_name":"Bernhard","first_name":"David"},{"full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Essam","full_name":"Ghadafi, Essam","last_name":"Ghadafi"}],"publist_id":"4686","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33.","ieee":"D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013.","short":"D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533.","apa":"Bernhard, D., Fuchsbauer, G., & Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-642-38980-1_33","ama":"Bernhard D, Fuchsbauer G, Ghadafi E. Efficient signatures of knowledge and DAA in the standard model. 2013;7954:518-533. doi:10.1007/978-3-642-38980-1_33","chicago":"Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures of Knowledge and DAA in the Standard Model.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-38980-1_33.","ista":"Bernhard D, Fuchsbauer G, Ghadafi E. 2013. Efficient signatures of knowledge and DAA in the standard model. 7954, 518–533."},"oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T11:56:37Z","date_published":"2013-06-01T00:00:00Z","doi":"10.1007/978-3-642-38980-1_33","page":"518 - 533","day":"01","year":"2013"},{"date_updated":"2021-01-12T06:56:23Z","department":[{"_id":"SiHi"}],"_id":"2264","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","volume":140,"issue":"3","oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"Faithful progression through the cell cycle is crucial to the maintenance and developmental potential of stem cells. Here, we demonstrate that neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in two temporally and spatially distinct progenitor domains. Differential conditional deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal olfactory bulb progenitors disrupted transitions through G1, G2 and M phases, whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified by deletion of Sp2 using mosaic analysis with double markers, which clearly established that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly, conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis in the embryonic and postnatal brain."}],"month":"02","intvolume":" 140","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/","open_access":"1"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 140(3), 552–561.","chicago":"Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz, and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development. Company of Biologists, 2013. https://doi.org/10.1242/dev.085621.","ama":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 2013;140(3):552-561. doi:10.1242/dev.085621","apa":"Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., & Ghashghaei, T. (2013). Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. Company of Biologists. https://doi.org/10.1242/dev.085621","short":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development 140 (2013) 552–561.","ieee":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei, “Neural development is dependent on the function of specificity protein 2 in cell cycle progression,” Development, vol. 140, no. 3. Company of Biologists, pp. 552–561, 2013.","mla":"Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development, vol. 140, no. 3, Company of Biologists, 2013, pp. 552–61, doi:10.1242/dev.085621."},"title":"Neural development is dependent on the function of specificity protein 2 in cell cycle progression","publist_id":"4681","author":[{"full_name":"Liang, Huixuan","last_name":"Liang","first_name":"Huixuan"},{"first_name":"Guanxi","full_name":"Xiao, Guanxi","last_name":"Xiao"},{"first_name":"Haifeng","last_name":"Yin","full_name":"Yin, Haifeng"},{"last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jonathan","last_name":"Horowitz","full_name":"Horowitz, Jonathan"},{"first_name":"Troy","last_name":"Ghashghaei","full_name":"Ghashghaei, Troy"}],"article_processing_charge":"No","external_id":{"pmid":["23293287"]},"day":"01","publication":"Development","year":"2013","doi":"10.1242/dev.085621","date_published":"2013-02-01T00:00:00Z","date_created":"2018-12-11T11:56:39Z","page":"552 - 561","publisher":"Company of Biologists","quality_controlled":"1","oa":1},{"extern":1,"date_updated":"2021-01-12T06:56:25Z","citation":{"chicago":"Auzinger, Thomas, Michael Wimmer, and Stefan Jeschke. “Analytic Visibility on the GPU.” Computer Graphics Forum. Wiley-Blackwell, 2013. https://doi.org/DOI: 10.1111/cgf.12061.","ista":"Auzinger T, Wimmer M, Jeschke S. 2013. Analytic Visibility on the GPU. Computer Graphics Forum. 32(124), 409–418.","mla":"Auzinger, Thomas, et al. “Analytic Visibility on the GPU.” Computer Graphics Forum, vol. 32, no. 124, Wiley-Blackwell, 2013, pp. 409–18, doi:DOI: 10.1111/cgf.12061.","apa":"Auzinger, T., Wimmer, M., & Jeschke, S. (2013). Analytic Visibility on the GPU. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/DOI: 10.1111/cgf.12061","ama":"Auzinger T, Wimmer M, Jeschke S. Analytic Visibility on the GPU. Computer Graphics Forum. 2013;32(124):409-418. doi:DOI: 10.1111/cgf.12061","short":"T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 32 (2013) 409–418.","ieee":"T. Auzinger, M. Wimmer, and S. Jeschke, “Analytic Visibility on the GPU,” Computer Graphics Forum, vol. 32, no. 124. Wiley-Blackwell, pp. 409–418, 2013."},"title":"Analytic Visibility on the GPU","author":[{"full_name":"Thomas Auzinger","orcid":"0000-0002-1546-3265","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"first_name":"Michael","last_name":"Wimmer","full_name":"Wimmer, Michael"},{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Stefan Jeschke","last_name":"Jeschke"}],"publist_id":"4675","_id":"2269","status":"public","type":"journal_article","day":"06","publication":"Computer Graphics Forum","year":"2013","publication_status":"published","issue":124,"volume":32,"date_published":"2013-05-06T00:00:00Z","doi":"DOI: 10.1111/cgf.12061","date_created":"2018-12-11T11:56:40Z","page":"409 - 418","acknowledgement":"Funding was provided by the FWF grant P20768-N13.\nWe want to thank the reviewers for their insightful and helpful remarks and Gernot Ziegler for providing help with CUDA. ","abstract":[{"text":"This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods.","lang":"eng"}],"month":"05","intvolume":" 32","publisher":"Wiley-Blackwell","quality_controlled":0},{"_id":"2270","conference":{"start_date":"2013-07-14","end_date":"2013-07-18","location":"Bellevue, WA, United States","name":"AAAI: Conference on Artificial Intelligence"},"type":"conference","status":"public","citation":{"ista":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.","chicago":"Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.","ama":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures in Cooperative Graph Games. In: AAAI Press; 2013:81-87.","apa":"Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.","ieee":"Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.","short":"Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87.","mla":"Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87."},"date_updated":"2021-01-12T06:56:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1108.5248"]},"author":[{"first_name":"Yoram","last_name":"Bachrach","full_name":"Bachrach, Yoram"},{"first_name":"Pushmeet","last_name":"Kohli","full_name":"Kohli, Pushmeet"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"first_name":"Morteza","last_name":"Zadimoghaddam","full_name":"Zadimoghaddam, Morteza"}],"publist_id":"4674","title":"Optimal Coalition Structures in Cooperative Graph Games","department":[{"_id":"VlKo"}],"abstract":[{"text":"Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inher-\r\nent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is computationally to optimize and solve such games. One prominent such language is the simple yet expressive\r\nWeighted Graph Games (WGGs) representation (Deng and Papadimitriou 1994), which maintains knowledge about synergies between agents in the form of an edge weighted graph. We consider the problem of finding the optimal coalition structure in WGGs. The agents in such games are vertices in a graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We show that finding the optimal coalition structure is not only hard for general graphs, but is also intractable for restricted families such as planar graphs which are amenable for many other combinatorial problems. We then provide algorithms with constant factor approximations for planar, minorfree and bounded degree graphs.","lang":"eng"}],"oa_version":"None","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1108.5248"}],"oa":1,"quality_controlled":"1","publisher":"AAAI Press","month":"12","year":"2013","publication_status":"published","language":[{"iso":"eng"}],"day":"31","page":"81-87","date_created":"2018-12-11T11:56:41Z","date_published":"2013-12-31T00:00:00Z"},{"_id":"2273","status":"public","type":"report","extern":0,"citation":{"mla":"Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.","short":"V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.","ieee":"V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.","ama":"Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013.","apa":"Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.","chicago":"Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.","ista":"Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p."},"date_updated":"2019-01-24T13:07:32Z","title":"Reweighted message passing revisited","department":[{"_id":"VlKo"}],"publist_id":"4671","author":[{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"abstract":[{"text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results.","lang":"eng"}],"month":"09","main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"oa":1,"quality_controlled":0,"publisher":"IST Austria","day":"22","publication_status":"published","year":"2013","date_created":"2018-12-11T11:56:42Z","date_published":"2013-09-22T00:00:00Z"},{"status":"public","type":"journal_article","_id":"2278","title":"A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development","department":[{"_id":"CaHe"}],"author":[{"first_name":"Raquel","last_name":"Pérez Gómez","full_name":"Pérez Gómez, Raquel"},{"id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87","first_name":"Jana","last_name":"Slovakova","full_name":"Slovakova, Jana"},{"full_name":"Rives Quinto, Noemí","last_name":"Rives Quinto","first_name":"Noemí"},{"first_name":"Alena","full_name":"Krejčí, Alena","last_name":"Krejčí"},{"last_name":"Carmena","full_name":"Carmena, Ana","first_name":"Ana"}],"publist_id":"4658","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Pérez Gómez, Raquel, et al. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science, vol. 126, no. 21, Company of Biologists, 2013, pp. 4873–84, doi:10.1242/jcs.125617.","ama":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 2013;126(21):4873-4884. doi:10.1242/jcs.125617","apa":"Pérez Gómez, R., Slovakova, J., Rives Quinto, N., Krejčí, A., & Carmena, A. (2013). A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.125617","short":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, A. Carmena, Journal of Cell Science 126 (2013) 4873–4884.","ieee":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, and A. Carmena, “A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development,” Journal of Cell Science, vol. 126, no. 21. Company of Biologists, pp. 4873–4884, 2013.","chicago":"Pérez Gómez, Raquel, Jana Slovakova, Noemí Rives Quinto, Alena Krejčí, and Ana Carmena. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science. Company of Biologists, 2013. https://doi.org/10.1242/jcs.125617.","ista":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. 2013. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 126(21), 4873–4884."},"date_updated":"2021-01-12T06:56:29Z","month":"11","intvolume":" 126","quality_controlled":"1","scopus_import":1,"publisher":"Company of Biologists","oa_version":"None","abstract":[{"lang":"eng","text":"It is firmly established that interactions between neurons and glia are fundamental across species for the correct establishment of a functional brain. Here, we found that the glia of the Drosophila larval brain display an essential non-autonomous role during the development of the optic lobe. The optic lobe develops from neuroepithelial cells that proliferate by dividing symmetrically until they switch to asymmetric/differentiative divisions that generate neuroblasts. The proneural gene lethal of scute (l9sc) is transiently activated by the epidermal growth factor receptor (EGFR)-Ras signal transduction pathway at the leading edge of a proneural wave that sweeps from medial to lateral neuroepithelium, promoting this switch. This process is tightly regulated by the tissue-autonomous function within the neuroepithelium of multiple signaling pathways, including EGFR-Ras and Notch. This study shows that the Notch ligand Serrate (Ser) is expressed in the glia and it forms a complex in vivo with Notch and Canoe, which colocalize at the adherens junctions of neuroepithelial cells. This complex is crucial for interactions between glia and neuroepithelial cells during optic lobe development. Ser is tissue-autonomously required in the glia where it activates Notch to regulate its proliferation, and non-autonomously in the neuroepithelium where Ser induces Notch signaling to avoid the premature activation of the EGFR-Ras pathway and hence of L9sc. Interestingly, different Notch activity reporters showed very different expression patterns in the glia and in the neuroepithelium, suggesting the existence of tissue-specific factors that promote the expression of particular Notch target genes or/and a reporter response dependent on different thresholds of Notch signaling."}],"doi":"10.1242/jcs.125617","issue":"21","volume":126,"date_published":"2013-11-01T00:00:00Z","date_created":"2018-12-11T11:56:43Z","page":"4873 - 4884","day":"01","publication":"Journal of Cell Science","language":[{"iso":"eng"}],"year":"2013","publication_status":"published"},{"citation":{"ista":"Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327.","chicago":"Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288.","ieee":"I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.","short":"I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.","ama":"Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular functions. In: IEEE; 2013:2320-2327. doi:10.1109/ICCV.2013.288","apa":"Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288","mla":"Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288."},"date_updated":"2021-01-12T06:56:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1310.1771"]},"publist_id":"4668","author":[{"first_name":"Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","last_name":"Gridchyn","full_name":"Gridchyn, Igor"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"title":"Potts model, parametric maxflow and k-submodular functions","department":[{"_id":"JoCs"},{"_id":"VlKo"}],"_id":"2276","conference":{"end_date":"2013-12-08","location":"Sydney, Australia","start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision"},"type":"conference","status":"public","publication_status":"published","year":"2013","language":[{"iso":"eng"}],"day":"01","page":"2320 - 2327","date_created":"2018-12-11T11:56:43Z","doi":"10.1109/ICCV.2013.288","date_published":"2013-12-01T00:00:00Z","abstract":[{"text":"The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19, 20]. It identifies a part of an optimal solution by running k maxflow computations, where k is the number of labels. The number of “labeled” pixels can be significant in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce the runtime to O (log k) maxflow computations (or one parametric maxflow computation). Furthermore, the output of our algorithm allows to speed-up the subsequent alpha expansion for the unlabeled part, or can be used as it is for time-critical applications. To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7] for Tree Metrics . We also show a connection to k-submodular functions from combinatorial optimization, and discuss k-submodular relaxations for general energy functions.","lang":"eng"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.1771"}],"quality_controlled":"1","publisher":"IEEE","month":"12"},{"citation":{"chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120872309.","ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706.","mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:10.1137/120872309.","ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” SIAM Review, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.","ama":"Uhler C, Wright S. Packing ellipsoids with overlap. SIAM Review. 2013;55(4):671-706. doi:10.1137/120872309","apa":"Uhler, C., & Wright, S. (2013). Packing ellipsoids with overlap. SIAM Review. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120872309"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4655","author":[{"orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"},{"last_name":"Wright","full_name":"Wright, Stephen","first_name":"Stephen"}],"external_id":{"arxiv":["1204.0235"]},"title":"Packing ellipsoids with overlap","year":"2013","day":"07","publication":"SIAM Review","page":"671 - 706","doi":"10.1137/120872309","date_published":"2013-11-07T00:00:00Z","date_created":"2018-12-11T11:56:44Z","publisher":"Society for Industrial and Applied Mathematics ","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T06:56:30Z","department":[{"_id":"CaUh"}],"_id":"2280","type":"journal_article","status":"public","publication_status":"published","language":[{"iso":"eng"}],"volume":55,"issue":"4","abstract":[{"lang":"eng","text":"The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented."}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.0235"}],"month":"11","intvolume":" 55"},{"quality_controlled":"1","publisher":"Wiley-Blackwell","oa":1,"has_accepted_license":"1","year":"2013","day":"01","publication":"Ecology and Evolution","page":"629 - 639","doi":"10.1002/ece3.465","date_published":"2013-03-01T00:00:00Z","date_created":"2018-12-11T11:56:47Z","citation":{"mla":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution, vol. 3, no. 3, Wiley-Blackwell, 2013, pp. 629–39, doi:10.1002/ece3.465.","ama":"Pickup M, Barrett S. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 2013;3(3):629-639. doi:10.1002/ece3.465","apa":"Pickup, M., & Barrett, S. (2013). The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.465","ieee":"M. Pickup and S. Barrett, “The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant,” Ecology and Evolution, vol. 3, no. 3. Wiley-Blackwell, pp. 629–639, 2013.","short":"M. Pickup, S. Barrett, Ecology and Evolution 3 (2013) 629–639.","chicago":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution. Wiley-Blackwell, 2013. https://doi.org/10.1002/ece3.465.","ista":"Pickup M, Barrett S. 2013. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 3(3), 629–639."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","last_name":"Pickup","orcid":"0000-0001-6118-0541","full_name":"Pickup, Melinda"},{"first_name":"Spencer","last_name":"Barrett","full_name":"Barrett, Spencer"}],"publist_id":"4644","title":"The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant","abstract":[{"lang":"eng","text":"Negative frequency-dependent selection should result in equal sex ratios in large populations of dioecious flowering plants, but deviations from equality are commonly reported. A variety of ecological and genetic factors can explain biased sex ratios, although the mechanisms involved are not well understood. Most dioecious species are long-lived and/or clonal complicating efforts to identify stages during the life cycle when biases develop. We investigated the demographic correlates of sex-ratio variation in two chromosome races of Rumex hastatulus, an annual, wind-pollinated colonizer of open habitats from the southern USA. We examined sex ratios in 46 populations and evaluated the hypothesis that the proximity of males in the local mating environment, through its influence on gametophytic selection, is the primary cause of female-biased sex ratios. Female-biased sex ratios characterized most populations of R. hastatulus (mean sex ratio = 0.62), with significant female bias in 89% of populations. Large, high-density populations had the highest proportion of females, whereas smaller, low-density populations had sex ratios closer to equality. Progeny sex ratios were more female biased when males were in closer proximity to females, a result consistent with the gametophytic selection hypothesis. Our results suggest that interactions between demographic and genetic factors are probably the main cause of female-biased sex ratios in R. hastatulus. The annual life cycle of this species may limit the scope for selection against males and may account for the weaker degree of bias in comparison with perennial Rumex species."}],"oa_version":"Published Version","scopus_import":1,"month":"03","intvolume":" 3","publication_status":"published","file":[{"file_id":"5290","checksum":"b5531bab4c0dec396bf5c8497fe178bf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2016-416-v1+1_Pickup_et_al-2013-Ecology_and_Evolution.pdf","date_created":"2018-12-12T10:17:35Z","file_size":626949,"date_updated":"2020-07-14T12:45:37Z","creator":"system"}],"language":[{"iso":"eng"}],"issue":"3","volume":3,"_id":"2287","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":"416","date_updated":"2021-01-12T06:56:32Z","ddc":["576"],"file_date_updated":"2020-07-14T12:45:37Z","department":[{"_id":"NiBa"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg, “Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly,” Nature Cell Biology, vol. 15. Nature Publishing Group, pp. 1405–1414, 2013.","short":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg, Nature Cell Biology 15 (2013) 1405–1414.","apa":"Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., & Heisenberg, C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb2869","ama":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 2013;15:1405-1414. doi:10.1038/ncb2869","mla":"Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:10.1038/ncb2869.","ista":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 15, 1405–1414.","chicago":"Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc, and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/ncb2869."},"title":"Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly","publist_id":"4652","author":[{"last_name":"Campinho","full_name":"Campinho, Pedro","orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","first_name":"Pedro"},{"last_name":"Behrndt","full_name":"Behrndt, Martin","first_name":"Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ranft","full_name":"Ranft, Jonas","first_name":"Jonas"},{"first_name":"Thomas","full_name":"Risler, Thomas","last_name":"Risler"},{"full_name":"Minc, Nicolas","last_name":"Minc","first_name":"Nicolas"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, 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":"10","publication":"Nature Cell Biology","year":"2013","date_published":"2013-11-10T00:00:00Z","doi":"10.1038/ncb2869","date_created":"2018-12-11T11:56:45Z","page":"1405 - 1414","acknowledgement":"This work was supported by the IST Austria and MPI-CBG ","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"date_updated":"2023-02-21T17:02:44Z","department":[{"_id":"CaHe"}],"_id":"2282","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","volume":15,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1403"}]},"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Epithelial spreading is a common and fundamental aspect of various developmental and disease-related processes such as epithelial closure and wound healing. A key challenge for epithelial tissues undergoing spreading is to increase their surface area without disrupting epithelial integrity. Here we show that orienting cell divisions by tension constitutes an efficient mechanism by which the enveloping cell layer (EVL) releases anisotropic tension while undergoing spreading during zebrafish epiboly. The control of EVL cell-division orientation by tension involves cell elongation and requires myosin II activity to align the mitotic spindle with the main tension axis. We also found that in the absence of tension-oriented cell divisions and in the presence of increased tissue tension, EVL cells undergo ectopic fusions, suggesting that the reduction of tension anisotropy by oriented cell divisions is required to prevent EVL cells from fusing. We conclude that cell-division orientation by tension constitutes a key mechanism for limiting tension anisotropy and thus promoting tissue spreading during EVL epiboly."}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"month":"11","intvolume":" 15","scopus_import":1,"main_file_link":[{"url":"http://hal.upmc.fr/hal-00983313/","open_access":"1"}]},{"publication_status":"published","year":"2013","publication":"Naturwissenschaften","language":[{"iso":"eng"}],"day":"14","page":"1125 - 1136","date_created":"2018-12-11T11:56:45Z","issue":"12","date_published":"2013-11-14T00:00:00Z","doi":"10.1007/s00114-013-1115-5","volume":100,"abstract":[{"lang":"eng","text":"Pathogens exert a strong selection pressure on organisms to evolve effective immune defences. In addition to individual immunity, social organisms can act cooperatively to produce collective defences. In many ant species, queens have the option to found a colony alone or in groups with other, often unrelated, conspecifics. These associations are transient, usually lasting only as long as each queen benefits from the presence of others. In fact, once the first workers emerge, queens fight to the death for dominance. One potential advantage of co-founding may be that queens benefit from collective disease defences, such as mutual grooming, that act against common soil pathogens. We test this hypothesis by exposing single and co-founding queens to a fungal parasite, in order to assess whether queens in co-founding associations have improved survival. Surprisingly, co-foundresses exposed to the entomopathogenic fungus Metarhizium did not engage in cooperative disease defences, and consequently, we find no direct benefit of multiple queens on survival. However, an indirect benefit was observed, with parasite-exposed queens producing more brood when they co-founded, than when they were alone. We suggest this is due to a trade-off between reproduction and immunity. Additionally, we report an extraordinary ability of the queens to tolerate an infection for long periods after parasite exposure. Our study suggests that there are no social immunity benefits for co-founding ant queens, but that in parasite-rich environments, the presence of additional queens may nevertheless improve the chances of colony founding success."}],"oa_version":"None","quality_controlled":"1","publisher":"Springer","scopus_import":1,"intvolume":" 100","month":"11","citation":{"chicago":"Pull, Christopher, William Hughes, and Markus Brown. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften. Springer, 2013. https://doi.org/10.1007/s00114-013-1115-5.","ista":"Pull C, Hughes W, Brown M. 2013. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 100(12), 1125–1136.","mla":"Pull, Christopher, et al. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften, vol. 100, no. 12, Springer, 2013, pp. 1125–36, doi:10.1007/s00114-013-1115-5.","apa":"Pull, C., Hughes, W., & Brown, M. (2013). Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-013-1115-5","ama":"Pull C, Hughes W, Brown M. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 2013;100(12):1125-1136. doi:10.1007/s00114-013-1115-5","short":"C. Pull, W. Hughes, M. Brown, Naturwissenschaften 100 (2013) 1125–1136.","ieee":"C. Pull, W. Hughes, and M. Brown, “Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ,” Naturwissenschaften, vol. 100, no. 12. Springer, pp. 1125–1136, 2013."},"date_updated":"2021-01-12T06:56:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4649","author":[{"first_name":"Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982","last_name":"Pull"},{"first_name":"William","last_name":"Hughes","full_name":"Hughes, William"},{"first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","full_name":"Brown, Markus"}],"department":[{"_id":"SyCr"}],"title":"Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ","_id":"2283","type":"journal_article","status":"public"},{"day":"04","publication":"EMBO Journal","year":"2013","doi":"10.1038/emboj.2013.225","date_published":"2013-10-04T00:00:00Z","date_created":"2018-12-11T11:56:46Z","page":"2783 - 2784","publisher":"Wiley-Blackwell","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Campinho P, Heisenberg C-PJ. 2013. The force and effect of cell proliferation. EMBO Journal. 32(21), 2783–2784.","chicago":"Campinho, Pedro, and Carl-Philipp J Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal. Wiley-Blackwell, 2013. https://doi.org/10.1038/emboj.2013.225.","ieee":"P. Campinho and C.-P. J. Heisenberg, “The force and effect of cell proliferation,” EMBO Journal, vol. 32, no. 21. Wiley-Blackwell, pp. 2783–2784, 2013.","short":"P. Campinho, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 2783–2784.","apa":"Campinho, P., & Heisenberg, C.-P. J. (2013). The force and effect of cell proliferation. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2013.225","ama":"Campinho P, Heisenberg C-PJ. The force and effect of cell proliferation. EMBO Journal. 2013;32(21):2783-2784. doi:10.1038/emboj.2013.225","mla":"Campinho, Pedro, and Carl-Philipp J. Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal, vol. 32, no. 21, Wiley-Blackwell, 2013, pp. 2783–84, doi:10.1038/emboj.2013.225."},"title":"The force and effect of cell proliferation","publist_id":"4645","author":[{"last_name":"Campinho","full_name":"Campinho, Pedro","orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","first_name":"Pedro"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"external_id":{"pmid":["24097062"]},"language":[{"iso":"eng"}],"publication_status":"published","volume":32,"issue":"21","oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"The spatiotemporal control of cell divisions is a key factor in epithelial morphogenesis and patterning. Mao et al (2013) now describe how differential rates of proliferation within the Drosophila wing disc epithelium give rise to anisotropic tissue tension in peripheral/proximal regions of the disc. Such global tissue tension anisotropy in turn determines the orientation of cell divisions by controlling epithelial cell elongation."}],"month":"10","intvolume":" 32","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3817470/","open_access":"1"}],"date_updated":"2021-01-12T06:56:32Z","department":[{"_id":"CaHe"}],"_id":"2286","status":"public","type":"journal_article"},{"quality_controlled":"1","publisher":"Springer","oa":1,"page":"331 - 344","doi":"10.1007/s00450-013-0251-7","date_published":"2013-10-05T00:00:00Z","date_created":"2018-12-11T11:56:47Z","has_accepted_license":"1","year":"2013","day":"05","publication":"Computer Science Research and Development","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"publist_id":"4642","title":"Quantitative reactive modeling and verification","citation":{"chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.","mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.","ama":"Henzinger TA. Quantitative reactive modeling and verification. Computer Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7","apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7","short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"10","intvolume":" 28","abstract":[{"text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments.","lang":"eng"}],"oa_version":"Published Version","volume":28,"issue":"4","ec_funded":1,"publication_status":"published","file":[{"date_created":"2018-12-12T10:17:51Z","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf","date_updated":"2020-07-14T12:45:37Z","file_size":570361,"creator":"system","checksum":"f117a00f9f046165bfa95595681e08a0","file_id":"5308","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"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":"626","_id":"2289","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:37Z","date_updated":"2021-01-12T06:56:33Z","ddc":["000"]},{"citation":{"ista":"Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.","chicago":"Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1309057110.","ama":"Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 2013;110(40):16259-16264. doi:10.1073/pnas.1309057110","apa":"Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1309057110","ieee":"Y. Boutté et al., “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” PNAS, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013.","short":"Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.","mla":"Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:10.1073/pnas.1309057110."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["24043780"]},"author":[{"last_name":"Boutté","full_name":"Boutté, Yohann","first_name":"Yohann"},{"first_name":"Kristoffer","last_name":"Jonsson","full_name":"Jonsson, Kristoffer"},{"first_name":"Heather","full_name":"Mcfarlane, Heather","last_name":"Mcfarlane"},{"full_name":"Johnson, Errin","last_name":"Johnson","first_name":"Errin"},{"full_name":"Gendre, Delphine","last_name":"Gendre","first_name":"Delphine"},{"last_name":"Swarup","full_name":"Swarup, Ranjan","first_name":"Ranjan"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"first_name":"Lacey","last_name":"Samuels","full_name":"Samuels, Lacey"},{"last_name":"Robert","full_name":"Robert, Stéphanie","first_name":"Stéphanie"},{"full_name":"Bhalerao, Rishikesh","last_name":"Bhalerao","first_name":"Rishikesh"}],"publist_id":"4639","title":"ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation","year":"2013","publication":"PNAS","day":"01","page":"16259 - 16264","date_created":"2018-12-11T11:56:48Z","doi":"10.1073/pnas.1309057110","date_published":"2013-10-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"National Academy of Sciences","date_updated":"2021-01-12T06:56:33Z","department":[{"_id":"JiFr"}],"_id":"2290","type":"journal_article","status":"public","publication_status":"published","language":[{"iso":"eng"}],"volume":110,"issue":"40","abstract":[{"lang":"eng","text":"The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development."}],"pmid":1,"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/"}],"scopus_import":1,"intvolume":" 110","month":"10"},{"date_updated":"2021-01-12T06:56:35Z","citation":{"ista":"Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.","chicago":"Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. https://doi.org/10.1109/ICCV.2013.139.","apa":"Kazmar, T., Kvon, E., Stark, A., & Lampert, C. (2013). Drosophila Embryo Stage Annotation using Label Propagation. Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.139","ama":"Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using Label Propagation. In: IEEE; 2013. doi:10.1109/ICCV.2013.139","short":"T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.","ieee":"T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013.","mla":"Kazmar, Tomas, et al. Drosophila Embryo Stage Annotation Using Label Propagation. IEEE, 2013, doi:10.1109/ICCV.2013.139."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4634","author":[{"last_name":"Kazmar","full_name":"Kazmar, Tomas","first_name":"Tomas"},{"full_name":"Kvon, Evgeny","last_name":"Kvon","first_name":"Evgeny"},{"full_name":"Stark, Alexander","last_name":"Stark","first_name":"Alexander"},{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"department":[{"_id":"ChLa"}],"title":"Drosophila Embryo Stage Annotation using Label Propagation","_id":"2294","conference":{"end_date":"2013-12-08","location":"Sydney, Australia","start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision"},"type":"conference","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"status":"public","year":"2013","publication_status":"published","language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T11:56:49Z","ec_funded":1,"doi":"10.1109/ICCV.2013.139","date_published":"2013-12-01T00:00:00Z","abstract":[{"text":"In this work we propose a system for automatic classification of Drosophila embryos into developmental stages.\r\nWhile the system is designed to solve an actual problem in biological research, we believe that the principle underly-\r\ning it is interesting not only for biologists, but also for researchers in computer vision. The main idea is to combine two orthogonal sources of information: one is a classifier trained on strongly invariant features, which makes it applicable to images of very different conditions, but also leads to rather noisy predictions. The other is a label propagation step based on a more powerful similarity measure that however is only consistent within specific subsets of the data at a time.\r\nIn our biological setup, the information sources are the shape and the staining patterns of embryo images. We show\r\nexperimentally that while neither of the methods can be used by itself to achieve satisfactory results, their combina-\r\ntion achieves prediction quality comparable to human performance.","lang":"eng"}],"oa_version":"Submitted Version","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/ICCV2013.py"}],"scopus_import":1,"publisher":"IEEE","quality_controlled":"1","month":"12"},{"page":"VI - 854","date_published":"2013-08-08T00:00:00Z","volume":8087,"doi":"10.1007/978-3-642-40313-2","date_created":"2018-12-11T11:56:48Z","publication_identifier":{"isbn":["978-3-642-40312-5"]},"year":"2013","publication_status":"published","day":"08","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"quality_controlled":"1","scopus_import":1,"publisher":"Springer","month":"08","intvolume":" 8087","abstract":[{"lang":"eng","text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence."}],"oa_version":"None","publist_id":"4636","editor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Sgall","full_name":"Sgall, Jiri","first_name":"Jiri"}],"title":"Mathematical Foundations of Computer Science 2013","department":[{"_id":"KrCh"}],"date_updated":"2020-08-11T10:09:45Z","citation":{"ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2.","ieee":"K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","apa":"Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2","ama":"Chatterjee K, Sgall J, eds. Mathematical Foundations of Computer Science 2013. Vol 8087. Springer; 2013:VI-854. doi:10.1007/978-3-642-40313-2","mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference_editor","conference":{"end_date":"2013-08-30","location":"Klosterneuburg, Austria","start_date":"2013-08-26","name":"MFCS: Mathematical Foundations of Computer Science"},"status":"public","series_title":"Lecture Notes in Computer Science","_id":"2292"},{"_id":"2293","conference":{"start_date":"2013-12-01","location":"Sydney, Australia","end_date":"2013-12-08","name":"ICCV: International Conference on Computer Vision"},"type":"conference","status":"public","project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding"}],"date_updated":"2023-02-23T10:36:41Z","citation":{"mla":"Sharmanska, Viktoriia, et al. Learning to Rank Using Privileged Information. IEEE, 2013, pp. 825–32, doi:10.1109/ICCV.2013.107.","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged information,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 825–832.","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.","apa":"Sharmanska, V., Quadrianto, N., & Lampert, C. (2013). Learning to rank using privileged information (pp. 825–832). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.107","ama":"Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information. In: IEEE; 2013:825-832. doi:10.1109/ICCV.2013.107","chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning to Rank Using Privileged Information,” 825–32. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.107.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4635","author":[{"last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","first_name":"Viktoriia"},{"last_name":"Quadrianto","full_name":"Quadrianto, Novi","first_name":"Novi"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"title":"Learning to rank using privileged information","department":[{"_id":"ChLa"}],"abstract":[{"text":"Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf"}],"oa":1,"publisher":"IEEE","scopus_import":1,"quality_controlled":"1","month":"12","publication_status":"published","year":"2013","language":[{"iso":"eng"}],"day":"01","page":"825 - 832","date_created":"2018-12-11T11:56:49Z","ec_funded":1,"doi":"10.1109/ICCV.2013.107","date_published":"2013-12-01T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Ferrara, A., Fuchsbauer, G., & Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. https://doi.org/10.1109/CSF.2013.15","ama":"Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:10.1109/CSF.2013.15","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.","ieee":"A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.","mla":"Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp. 115–29, doi:10.1109/CSF.2013.15.","ista":"Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.","chicago":"Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. https://doi.org/10.1109/CSF.2013.15."},"date_updated":"2021-01-12T06:56:34Z","title":"Cryptographically enforced RBAC","department":[{"_id":"KrPi"}],"publist_id":"4637","author":[{"last_name":"Ferrara","full_name":"Ferrara, Anna","first_name":"Anna"},{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"},{"first_name":"Bogdan","full_name":"Warinschi, Bogdan","last_name":"Warinschi"}],"_id":"2291","status":"public","type":"conference","conference":{"start_date":"2013-09-26","end_date":"2013-09-28","location":"New Orleans, LA, United States","name":"CSF: Computer Security Foundations"},"day":"01","language":[{"iso":"eng"}],"year":"2013","publication_status":"published","doi":"10.1109/CSF.2013.15","date_published":"2013-09-01T00:00:00Z","date_created":"2018-12-11T11:56:48Z","page":"115 - 129","oa_version":"Submitted Version","abstract":[{"text":"Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n","lang":"eng"}],"month":"09","quality_controlled":"1","publisher":"IEEE","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2013/492"}],"oa":1},{"publist_id":"4643","title":"Computational Methods in Systems Biology","editor":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ToHe"}],"date_updated":"2019-08-02T12:37:44Z","citation":{"ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013. https://doi.org/10.1007/978-3-642-40708-6.","apa":"Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6","ama":"Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6","ieee":"A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013.","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"CMSB: Computational Methods in Systems Biology","location":"Klosterneuburg, Austria","end_date":"2013-09-24","start_date":"2013-09-22"},"type":"conference_editor","status":"public","_id":"2288","date_created":"2018-12-11T11:56:47Z","doi":"10.1007/978-3-642-40708-6","date_published":"2013-07-01T00:00:00Z","volume":8130,"year":"2013","publication_status":"published","publication_identifier":{"isbn":["978-3-642-40707-9"]},"language":[{"iso":"eng"}],"day":"01","publisher":"Springer","quality_controlled":"1","alternative_title":["LNCS"],"intvolume":" 8130","month":"07","abstract":[{"text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms.","lang":"eng"}],"oa_version":"None"},{"volume":7935,"ec_funded":1,"publication_status":"published","file":[{"creator":"system","date_updated":"2020-07-14T12:45:37Z","file_size":299004,"date_created":"2018-12-12T10:10:36Z","file_name":"IST-2014-196-v1+1_sas13.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4824","checksum":"907edd33a5892e3af093365f1fd57ed7"}],"language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"month":"01","intvolume":" 7935","abstract":[{"text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:37Z","date_updated":"2021-01-12T06:56:36Z","ddc":["000","004"],"type":"conference","conference":{"name":"SAS: Static Analysis Symposium","end_date":"2013-06-22","location":"Seattle, WA, United States","start_date":"2013-06-20"},"status":"public","pubrep_id":"196","_id":"2298","page":"150 - 171","date_published":"2013-01-01T00:00:00Z","doi":"10.1007/978-3-642-38856-9_10","date_created":"2018-12-11T11:56:50Z","has_accepted_license":"1","year":"2013","day":"01","publisher":"Springer","quality_controlled":"1","oa":1,"author":[{"last_name":"Dragoi","full_name":"Dragoi, Cezara","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Enea","full_name":"Enea, Constantin","first_name":"Constantin"},{"last_name":"Sighireanu","full_name":"Sighireanu, Mihaela","first_name":"Mihaela"}],"publist_id":"4630","title":"Local shape analysis for overlaid data structures","citation":{"mla":"Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.","short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.","apa":"Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10","ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. https://doi.org/10.1007/978-3-642-38856-9_10.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"title":"Synthesis of AMBA AHB from formal specification: A case study","author":[{"first_name":"Yashdeep","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","full_name":"Godhal, Yashdeep","last_name":"Godhal"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"publist_id":"4629","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9","apa":"Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s10009-011-0207-9","date_published":"2013-10-01T00:00:00Z","date_created":"2018-12-11T11:56:51Z","page":"585 - 601","day":"01","publication":"International Journal on Software Tools for Technology Transfer","has_accepted_license":"1","year":"2013","publisher":"Springer","quality_controlled":"1","oa":1,"file_date_updated":"2020-07-14T12:45:37Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T06:56:37Z","status":"public","pubrep_id":"87","type":"journal_article","_id":"2299","volume":15,"issue":"5-6","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4910","checksum":"57b06a732dd8d6349190dba6b5b0d33b","file_size":277372,"date_updated":"2020-07-14T12:45:37Z","creator":"system","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","date_created":"2018-12-12T10:11:53Z"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"10","intvolume":" 15","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol."}]},{"department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T06:56:36Z","status":"public","type":"journal_article","_id":"2297","volume":8,"issue":"2","language":[{"iso":"eng"}],"publication_status":"published","month":"09","intvolume":" 8","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0908.3686"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The presentation includes a discussion of Bose-Einstein condensation, the excitation spectrum for trapped gases and its relation to superfluidity, as well as the appearance of quantized vortices in rotating systems. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schrödinger equation."}],"title":"Hot topics in cold gases: A mathematical physics perspective","publist_id":"4631","author":[{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"external_id":{"arxiv":["0908.3686"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:10.1007/s11537-013-1264-5.","apa":"Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5","ama":"Seiringer R. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5","short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.","ieee":"R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232, 2013.","chicago":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.","ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232."},"doi":"10.1007/s11537-013-1264-5","date_published":"2013-09-24T00:00:00Z","date_created":"2018-12-11T11:56:50Z","page":"185 - 232","day":"24","publication":"Japanese Journal of Mathematics","year":"2013","publisher":"Springer","quality_controlled":"1","oa":1},{"year":"2013","has_accepted_license":"1","day":"13","date_created":"2018-12-11T11:56:53Z","doi":"10.1515/9783110278736","date_published":"2013-09-13T00:00:00Z","oa":1,"publisher":"De Gruyter","quality_controlled":"1","citation":{"chicago":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50. De Gruyter, 2013. https://doi.org/10.1515/9783110278736.","ista":"Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p.","mla":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50, De Gruyter, 2013, doi:10.1515/9783110278736.","ama":"Danowski P, Pohl A. (Open) Linked Data in Bibliotheken. Vol 50. De Gruyter; 2013. doi:10.1515/9783110278736","apa":"Danowski, P., & Pohl, A. (2013). (Open) Linked Data in Bibliotheken (Vol. 50). De Gruyter. https://doi.org/10.1515/9783110278736","ieee":"P. Danowski and A. Pohl, (Open) Linked Data in Bibliotheken, vol. 50. De Gruyter, 2013.","short":"P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","author":[{"last_name":"Danowski","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick"},{"full_name":"Pohl, Adrian","last_name":"Pohl","first_name":"Adrian"}],"publist_id":"4621","title":"(Open) Linked Data in Bibliotheken","publication_status":"published","publication_identifier":{"eisbn":["9-783-1102-7873-6"],"isbn":[" 978-3-11-027634-3"],"issn":["2191-3587"]},"language":[{"iso":"ger"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4774","checksum":"807a408bbee519d792702828a32c6e85","date_updated":"2020-07-14T12:45:38Z","file_size":67731,"creator":"system","date_created":"2018-12-12T10:09:49Z","file_name":"IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf"},{"checksum":"587e95c2ba24307a5a5d5bd1579429d9","file_id":"4775","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:09:50Z","file_name":"IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":43563},{"file_id":"4776","checksum":"dbcada36bb32d725d9838615706e700f","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf","date_created":"2018-12-12T10:09:51Z","creator":"system","file_size":11318599,"date_updated":"2020-07-14T12:45:38Z"},{"creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":330210,"date_created":"2018-12-12T10:09:52Z","file_name":"IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"5235712bf0a49ccc8c2cb4f6c2560d43","file_id":"4777"},{"file_id":"4778","checksum":"d851cc91f705da80617ac7df33c1c0e1","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:09:53Z","file_name":"IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf","date_updated":"2020-07-14T12:45:38Z","file_size":10652088,"creator":"system"},{"checksum":"4e77b182692c58e50fc5251bf23cc584","file_id":"4779","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:09:54Z","file_name":"IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf","date_updated":"2020-07-14T12:45:38Z","file_size":6125273,"creator":"system"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"3debae38064d5099d22f855c353a57ec","file_id":"4780","file_size":1893872,"date_updated":"2020-07-14T12:45:38Z","creator":"system","file_name":"IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf","date_created":"2018-12-12T10:09:55Z"},{"file_name":"IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf","date_created":"2018-12-12T10:09:56Z","creator":"system","file_size":1095929,"date_updated":"2020-07-14T12:45:38Z","file_id":"4781","checksum":"e630b330dc0b7522d2cf204587030252","relation":"main_file","access_level":"open_access","content_type":"application/pdf"},{"file_id":"4782","checksum":"17edda91271bfcce8e1b6e77ca1c9d11","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf","date_created":"2018-12-12T10:09:57Z","file_size":149699,"date_updated":"2020-07-14T12:45:38Z","creator":"system"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4783","checksum":"aacef6734b1de58aeb58024fc47c2373","file_size":8828405,"date_updated":"2020-07-14T12:45:38Z","creator":"system","file_name":"IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf","date_created":"2018-12-12T10:09:58Z"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"0619451f7ff3ea641ce0b10c97831f47","file_id":"4784","file_size":3191208,"date_updated":"2020-07-14T12:45:38Z","creator":"system","file_name":"IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf","date_created":"2018-12-12T10:09:59Z"},{"date_updated":"2020-07-14T12:45:38Z","file_size":78315,"creator":"system","date_created":"2018-12-12T10:10:00Z","file_name":"IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4785","checksum":"44dc8a9fc003f0edd912968958715a23"},{"date_created":"2018-12-12T10:10:01Z","file_name":"IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":90532,"checksum":"48133cecebfd839b77f84f557d530c00","file_id":"4786","access_level":"open_access","relation":"main_file","content_type":"application/pdf"},{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4787","checksum":"a359224ddfdb178fed72b228dcfb699a","creator":"system","file_size":90771,"date_updated":"2020-07-14T12:45:38Z","file_name":"IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf","date_created":"2018-12-12T10:10:02Z"},{"file_size":1830232,"date_updated":"2020-07-14T12:45:38Z","creator":"system","file_name":"IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf","date_created":"2018-12-12T10:10:03Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4788","checksum":"0d2dd31d537c7a495999149d00eaffbf"}],"volume":50,"abstract":[{"text":"Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind.","lang":"ger"}],"oa_version":"Published Version","alternative_title":["Bibliotheks- und Informationspraxis"],"intvolume":" 50","month":"09","date_updated":"2021-12-21T12:17:19Z","ddc":["020"],"file_date_updated":"2020-07-14T12:45:38Z","department":[{"_id":"E-Lib"}],"_id":"2306","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":"book","pubrep_id":"725","status":"public"},{"publication_status":"published","year":"2013","publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","language":[{"iso":"eng"}],"day":"01","page":"321 - 331","date_created":"2018-12-11T11:56:52Z","ec_funded":1,"date_published":"2013-06-01T00:00:00Z","doi":"10.1145/2491956.2462184","abstract":[{"lang":"eng","text":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P."}],"oa_version":"None","main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"quality_controlled":"1","scopus_import":1,"publisher":"ACM","month":"06","date_updated":"2021-01-12T06:56:38Z","citation":{"mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, Seattle, WA, United States, 2013, pp. 321–331.","short":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331.","chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184.","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ankush","full_name":"Desai, Ankush","last_name":"Desai"},{"full_name":"Gupta, Vivek","last_name":"Gupta","first_name":"Vivek"},{"last_name":"Jackson","full_name":"Jackson, Ethan","first_name":"Ethan"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"first_name":"Sriram","last_name":"Rajamani","full_name":"Rajamani, Sriram"},{"last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4626","title":"P: Safe asynchronous event-driven programming","department":[{"_id":"ToHe"}],"_id":"2301","conference":{"start_date":"2013-06-16","end_date":"2013-06-19","location":"Seattle, WA, United States","name":"PLDI: Programming Languages Design and Implementation"},"type":"conference","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"status":"public"},{"department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T06:56:38Z","type":"journal_article","status":"public","_id":"2300","issue":"6","volume":88,"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1305.5323"}],"scopus_import":1,"intvolume":" 88","month":"08","abstract":[{"text":"We consider Ising models in two and three dimensions with nearest neighbor ferromagnetic interactions and long-range, power law decaying, antiferromagnetic interactions. If the strength of the ferromagnetic coupling J is larger than a critical value Jc, then the ground state is homogeneous and ferromagnetic. As the critical value is approached from smaller values of J, it is believed that the ground state consists of a periodic array of stripes (d=2) or slabs (d=3), all of the same size and alternating magnetization. Here we prove rigorously that the ground state energy per site converges to that of the optimal periodic striped or slabbed state, in the limit that J tends to the ferromagnetic transition point. While this theorem does not prove rigorously that the ground state is precisely striped or slabbed, it does prove that in any suitably large box the ground state is striped or slabbed with high probability.","lang":"eng"}],"oa_version":"Preprint","external_id":{"arxiv":["1305.5323"]},"author":[{"full_name":"Giuliani, Alessandro","last_name":"Giuliani","first_name":"Alessandro"},{"first_name":"Élliott","full_name":"Lieb, Élliott","last_name":"Lieb"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"publist_id":"4627","title":"Realization of stripes and slabs in two and three dimensions","citation":{"ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401.","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.064401.","short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” Physical Review B, vol. 88, no. 6. American Physical Society, 2013.","apa":"Giuliani, A., Lieb, É., & Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.88.064401","ama":"Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. Physical Review B. 2013;88(6). doi:10.1103/PhysRevB.88.064401","mla":"Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:10.1103/PhysRevB.88.064401."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"064401","date_created":"2018-12-11T11:56:51Z","date_published":"2013-08-01T00:00:00Z","doi":"10.1103/PhysRevB.88.064401","year":"2013","publication":"Physical Review B","day":"01","oa":1,"publisher":"American Physical Society","quality_controlled":"1"},{"date_created":"2018-12-11T11:56:52Z","volume":8,"doi":"10.1007/s11515-013-1279-6","date_published":"2013-09-03T00:00:00Z","issue":"6","page":"557 - 568","language":[{"iso":"eng"}],"publication":"Frontiers in Biology","day":"03","publication_status":"published","year":"2013","intvolume":" 8","month":"09","scopus_import":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"This work was supported by IST Austria institutional funds.","oa_version":"None","abstract":[{"text":"MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools.","lang":"eng"}],"title":"Dissection of gene function at clonal level using mosaic analysis with double markers","department":[{"_id":"SiHi"}],"author":[{"last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"}],"publist_id":"4624","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” Frontiers in Biology, vol. 8, no. 6. Springer, pp. 557–568, 2013.","short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568.","ama":"Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 2013;8(6):557-568. doi:10.1007/s11515-013-1279-6","apa":"Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. Springer. https://doi.org/10.1007/s11515-013-1279-6","mla":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:10.1007/s11515-013-1279-6.","ista":"Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568.","chicago":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology. Springer, 2013. https://doi.org/10.1007/s11515-013-1279-6."},"date_updated":"2021-01-12T06:56:39Z","status":"public","type":"journal_article","article_type":"review","_id":"2303"},{"author":[{"first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","last_name":"Pausinger","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian"}],"publist_id":"4623","title":"Van der Corput sequences and linear permutations","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:56:39Z","citation":{"apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2013.07.008","ama":"Pausinger F. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"2304","page":"43 - 50","date_created":"2018-12-11T11:56:53Z","date_published":"2013-09-05T00:00:00Z","volume":43,"doi":"10.1016/j.endm.2013.07.008","year":"2013","publication_status":"published","publication":"Electronic Notes in Discrete Mathematics","language":[{"iso":"eng"}],"day":"05","quality_controlled":"1","publisher":"Elsevier","scopus_import":1,"intvolume":" 43","month":"09","abstract":[{"lang":"eng","text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter."}],"acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","oa_version":"None"},{"publisher":"World Scientific Publishing","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4046"}],"oa":1,"abstract":[{"text":" We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the interval. ","lang":"eng"}],"oa_version":"None","page":"610-619","doi":"10.1142/9789814449243_0063","date_published":"2013-01-01T00:00:00Z","date_created":"2018-12-11T11:56:57Z","publication_status":"published","year":"2013","language":[{"iso":"eng"}],"type":"conference","conference":{"name":"ICMP: International Congress on Mathematical Physics"},"status":"public","_id":"2315","author":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"},{"full_name":"Yngvason, Jakob","last_name":"Yngvason","first_name":"Jakob"},{"first_name":"Valentin","last_name":"Zagrebnov","full_name":"Zagrebnov, Valentin"}],"publist_id":"4612","article_processing_charge":"No","external_id":{"arxiv":["1209.4046"]},"title":"Disordered Bose-Einstein condensates with interaction","citation":{"mla":"Seiringer, Robert, et al. Disordered Bose-Einstein Condensates with Interaction. World Scientific Publishing, 2013, pp. 610–19, doi:10.1142/9789814449243_0063.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing, 2013, pp. 610–619.","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates with interaction,” presented at the ICMP: International Congress on Mathematical Physics, 2013, pp. 610–619.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates with interaction. In: World Scientific Publishing; 2013:610-619. doi:10.1142/9789814449243_0063","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Disordered Bose-Einstein condensates with interaction (pp. 610–619). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814449243_0063","chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing, 2013. https://doi.org/10.1142/9789814449243_0063.","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates with interaction. ICMP: International Congress on Mathematical Physics, 610–619."},"date_updated":"2021-01-12T06:56:43Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"text":"In a recent paper [7] we give the first rigorous derivation of the celebrated Ginzburg-Landau (GL)theory, starting from the microscopic Bardeen- Cooper-Schrieffer (BCS)model. Here we present our results in the simplified case of a one-dimensional system of particles interacting via a δ-potential.","lang":"eng"}],"month":"01","quality_controlled":0,"publisher":"Springer","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1103.1866","open_access":"1"}],"day":"01","year":"2013","publication_status":"published","date_published":"2013-01-01T00:00:00Z","doi":"10.1007/978-3-0348-0531-5_3","date_created":"2018-12-11T11:56:58Z","page":"57 - 88","_id":"2319","status":"public","type":"conference","conference":{"name":"OTAMP: Operator Theory, Analysis and Mathematical Physics"},"extern":1,"date_updated":"2021-01-12T06:56:45Z","citation":{"ieee":"R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.","short":"R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, Springer, 2013, pp. 57–88.","apa":"Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2013). Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction (pp. 57–88). Presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, Springer. https://doi.org/10.1007/978-3-0348-0531-5_3","ama":"Frank R, Hainzl C, Seiringer R, Solovej J. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. In: Springer; 2013:57-88. doi:10.1007/978-3-0348-0531-5_3","mla":"Frank, Rupert, et al. Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction. Springer, 2013, pp. 57–88, doi:10.1007/978-3-0348-0531-5_3.","ista":"Frank R, Hainzl C, Seiringer R, Solovej J. 2013. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. OTAMP: Operator Theory, Analysis and Mathematical Physics, 57–88.","chicago":"Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “ Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction,” 57–88. Springer, 2013. https://doi.org/10.1007/978-3-0348-0531-5_3."},"title":" Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction","author":[{"full_name":"Frank, Rupert L","last_name":"Frank","first_name":"Rupert"},{"first_name":"Christian","full_name":"Hainzl, Christian","last_name":"Hainzl"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"first_name":"Jan","full_name":"Solovej, Jan P","last_name":"Solovej"}],"publist_id":"4608"},{"file_date_updated":"2020-07-14T12:45:39Z","department":[{"_id":"ToHe"}],"date_updated":"2023-02-23T10:16:27Z","ddc":["000","004"],"type":"conference","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","location":"Buenos Aires, Argentina","end_date":"2013-08-30"},"status":"public","pubrep_id":"197","series_title":"Lecture Notes in Computer Science","_id":"2328","volume":8052,"related_material":{"record":[{"relation":"later_version","id":"1832","status":"public"}]},"ec_funded":1,"publication_status":"published","file":[{"checksum":"bdbb520de91751fe0136309ad4ef67e4","file_id":"4721","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","date_created":"2018-12-12T10:08:58Z","creator":"system","file_size":337059,"date_updated":"2020-07-14T12:45:39Z"}],"language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"month":"08","intvolume":" 8052","abstract":[{"text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof.","lang":"eng"}],"oa_version":"Submitted Version","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor","first_name":"Viktor"}],"publist_id":"4598","title":"Aspect-oriented linearizability proofs","citation":{"short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","apa":"Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18","ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18","mla":"Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:10.1007/978-3-642-40184-8_18.","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.1007/978-3-642-40184-8_18."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"page":"242 - 256","doi":"10.1007/978-3-642-40184-8_18","date_published":"2013-08-01T00:00:00Z","date_created":"2018-12-11T11:57:01Z","has_accepted_license":"1","year":"2013","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1},{"author":[{"last_name":"Frank","full_name":"Frank, Rupert L","first_name":"Rupert"},{"first_name":"Mathieu","full_name":"Lewin, Mathieu","last_name":"Lewin"},{"last_name":"Lieb","full_name":"Lieb, Élliott H","first_name":"Élliott"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521"}],"publist_id":"4521","title":"A positive density analogue of the Lieb-Thirring inequality","date_updated":"2021-01-12T06:57:17Z","citation":{"mla":"Frank, Rupert, et al. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal, vol. 162, no. 3, Duke University Press, 2013, pp. 435–95, doi:10.1215/00127094-2019477.","ama":"Frank R, Lewin M, Lieb É, Seiringer R. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 2013;162(3):435-495. doi:10.1215/00127094-2019477","apa":"Frank, R., Lewin, M., Lieb, É., & Seiringer, R. (2013). A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2019477","short":"R. Frank, M. Lewin, É. Lieb, R. Seiringer, Duke Mathematical Journal 162 (2013) 435–495.","ieee":"R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “A positive density analogue of the Lieb-Thirring inequality,” Duke Mathematical Journal, vol. 162, no. 3. Duke University Press, pp. 435–495, 2013.","chicago":"Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal. Duke University Press, 2013. https://doi.org/10.1215/00127094-2019477.","ista":"Frank R, Lewin M, Lieb É, Seiringer R. 2013. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 162(3), 435–495."},"extern":1,"type":"journal_article","status":"public","_id":"2404","page":"435 - 495","date_created":"2018-12-11T11:57:28Z","issue":"3","date_published":"2013-02-01T00:00:00Z","doi":"10.1215/00127094-2019477","volume":162,"year":"2013","publication_status":"published","publication":"Duke Mathematical Journal","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1108.4246","open_access":"1"}],"oa":1,"quality_controlled":0,"publisher":"Duke University Press","intvolume":" 162","month":"02","abstract":[{"lang":"eng","text":"The Lieb-Thirring inequalities give a bound on the negative eigenvalues of a Schrödinger operator in terms of an Lp-norm of the potential. These are dual to bounds on the H1-norms of a system of orthonormal functions. Here we extend these bounds to analogous inequalities for perturbations of the Fermi sea of noninteracting particles (i.e., for perturbations of the continuous spectrum of the Laplacian by local potentials)."}]},{"citation":{"chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics. Springer, 2013. https://doi.org/10.1140/epjst/e2013-01759-5.","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 217(1), 103–107.","mla":"Seiringer, Robert, et al. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics, vol. 217, no. 1, Springer, 2013, pp. 103–07, doi:10.1140/epjst/e2013-01759-5.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, European Physical Journal: Special Topics 217 (2013) 103–107.","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Condensation of interacting bosons in a random potential,” European Physical Journal: Special Topics, vol. 217, no. 1. Springer, pp. 103–107, 2013.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 2013;217(1):103-107. doi:10.1140/epjst/e2013-01759-5","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. Springer. https://doi.org/10.1140/epjst/e2013-01759-5"},"date_updated":"2021-01-12T06:57:17Z","extern":1,"publist_id":"4520","author":[{"full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yngvason, Jakob","last_name":"Yngvason","first_name":"Jakob"},{"first_name":"Valentin","last_name":"Zagrebnov","full_name":"Zagrebnov, Valentin A"}],"title":"Condensation of interacting bosons in a random potential","_id":"2406","type":"journal_article","status":"public","publication_status":"published","year":"2013","day":"01","publication":"European Physical Journal: Special Topics","page":"103 - 107","doi":"10.1140/epjst/e2013-01759-5","issue":"1","date_published":"2013-02-01T00:00:00Z","volume":217,"date_created":"2018-12-11T11:57:29Z","abstract":[{"text":"We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval. We prove that, in the Gross-Pitaevskii limit, Bose Einstein condensation takes place in the whole parameter range considered. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the unit interval.","lang":"eng"}],"publisher":"Springer","quality_controlled":0,"month":"02","intvolume":" 217"},{"date_created":"2018-12-11T11:57:28Z","issue":"2","volume":319,"doi":"10.1007/s00220-012-1604-y","date_published":"2013-04-01T00:00:00Z","page":"557 - 573","publication":"Communications in Mathematical Physics","day":"01","publication_status":"published","year":"2013","intvolume":" 319","month":"04","main_file_link":[{"url":"http://arxiv.org/abs/1201.3954","open_access":"1"}],"oa":1,"publisher":"Springer","quality_controlled":0,"abstract":[{"lang":"eng","text":"We consider the bipolaron in the Pekar-Tomasevich approximation and address the question whether the ground state is spherically symmetric or not. Numerical analysis has, so far, not completely settled the question. Our contribution is to prove rigorously that the ground state remains spherical for small values of the electron-electron Coulomb repulsion."}],"title":"Symmetry of bipolaron bound states for small Coulomb repulsion","publist_id":"4522","author":[{"first_name":"Rupert","full_name":"Frank, Rupert L","last_name":"Frank"},{"full_name":"Lieb, Élliott H","last_name":"Lieb","first_name":"Élliott"},{"full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"extern":1,"date_updated":"2021-01-12T06:57:17Z","citation":{"mla":"Frank, Rupert, et al. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics, vol. 319, no. 2, Springer, 2013, pp. 557–73, doi:10.1007/s00220-012-1604-y.","ama":"Frank R, Lieb É, Seiringer R. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 2013;319(2):557-573. doi:10.1007/s00220-012-1604-y","apa":"Frank, R., Lieb, É., & Seiringer, R. (2013). Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1604-y","short":"R. Frank, É. Lieb, R. Seiringer, Communications in Mathematical Physics 319 (2013) 557–573.","ieee":"R. Frank, É. Lieb, and R. Seiringer, “Symmetry of bipolaron bound states for small Coulomb repulsion,” Communications in Mathematical Physics, vol. 319, no. 2. Springer, pp. 557–573, 2013.","chicago":"Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-012-1604-y.","ista":"Frank R, Lieb É, Seiringer R. 2013. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 319(2), 557–573."},"status":"public","type":"journal_article","_id":"2405"},{"month":"09","intvolume":" 322","publisher":"Springer","quality_controlled":0,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.5259"}],"oa":1,"abstract":[{"text":"We investigate the low-energy excitation spectrum of a Bose gas confined in a trap, with weak long-range repulsive interactions. In particular, we prove that the spectrum can be described in terms of the eigenvalues of an effective one-particle operator, as predicted by the Bogoliubov approximation.","lang":"eng"}],"issue":"2","volume":322,"doi":"10.1007/s00220-013-1736-8","date_published":"2013-09-01T00:00:00Z","date_created":"2018-12-11T11:57:29Z","page":"559 - 591","day":"01","publication":"Communications in Mathematical Physics","year":"2013","publication_status":"published","status":"public","type":"journal_article","_id":"2408","title":"The excitation spectrum for weakly interacting Bosons in a trap","publist_id":"4518","author":[{"first_name":"Philip","full_name":"Grech, Philip","last_name":"Grech"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer"}],"extern":1,"date_updated":"2021-01-12T06:57:18Z","citation":{"apa":"Grech, P., & Seiringer, R. (2013). The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-013-1736-8","ama":"Grech P, Seiringer R. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 2013;322(2):559-591. doi:10.1007/s00220-013-1736-8","ieee":"P. Grech and R. Seiringer, “The excitation spectrum for weakly interacting Bosons in a trap,” Communications in Mathematical Physics, vol. 322, no. 2. Springer, pp. 559–591, 2013.","short":"P. Grech, R. Seiringer, Communications in Mathematical Physics 322 (2013) 559–591.","mla":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics, vol. 322, no. 2, Springer, 2013, pp. 559–91, doi:10.1007/s00220-013-1736-8.","ista":"Grech P, Seiringer R. 2013. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 322(2), 559–591.","chicago":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1736-8."}},{"_id":"2412","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":"397","date_updated":"2021-01-12T06:57:20Z","ddc":["576"],"department":[{"_id":"JoBo"}],"file_date_updated":"2020-07-14T12:45:40Z","abstract":[{"text":"Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"month":"02","intvolume":" 13","publication_status":"published","file":[{"file_name":"IST-2015-397-v1+1_1471-2148-13-54.pdf","date_created":"2018-12-12T10:17:15Z","file_size":518729,"date_updated":"2020-07-14T12:45:40Z","creator":"system","checksum":"029c7e0b198c19312b66ecce3cabb22f","file_id":"5268","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"issue":"1","volume":13,"citation":{"chicago":"Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2148-13-54.","ista":"Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54.","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:10.1186/1471-2148-13-54.","short":"A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54.","ieee":"A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” BMC Evolutionary Biology, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013.","ama":"Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 2013;13(1):54-54. doi:10.1186/1471-2148-13-54","apa":"Kupczok, A., & Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/1471-2148-13-54"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4514","author":[{"first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne","last_name":"Kupczok"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612","last_name":"Bollback"}],"title":"Probabilistic models for CRISPR spacer content evolution ","quality_controlled":"1","publisher":"BioMed Central","oa":1,"has_accepted_license":"1","year":"2013","day":"26","publication":"BMC Evolutionary Biology","page":"54 - 54","date_published":"2013-02-26T00:00:00Z","doi":"10.1186/1471-2148-13-54","date_created":"2018-12-11T11:57:31Z"},{"_id":"2413","status":"public","type":"book_chapter","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Valderrama M, Botella Soler V, Le Van Quyen M. Neuronal oscillations scale up and scale down the brain dynamics . In: Meyer M, Pesenson Z, eds. Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH; 2013. doi:10.1002/9783527671632.ch08","apa":"Valderrama, M., Botella Soler, V., & Le Van Quyen, M. (2013). Neuronal oscillations scale up and scale down the brain dynamics . In M. Meyer & Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH. https://doi.org/10.1002/9783527671632.ch08","short":"M. Valderrama, V. Botella Soler, M. Le Van Quyen, in:, M. Meyer, Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, Wiley-VCH, 2013.","ieee":"M. Valderrama, V. Botella Soler, and M. Le Van Quyen, “Neuronal oscillations scale up and scale down the brain dynamics ,” in Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, M. Meyer and Z. Pesenson, Eds. Wiley-VCH, 2013.","mla":"Valderrama, Mario, et al. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson, Wiley-VCH, 2013, doi:10.1002/9783527671632.ch08.","ista":"Valderrama M, Botella Soler V, Le Van Quyen M. 2013.Neuronal oscillations scale up and scale down the brain dynamics . In: Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Reviews of Nonlinear Dynamics and Complexity, .","chicago":"Valderrama, Mario, Vicente Botella Soler, and Michel Le Van Quyen. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” In Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson. Wiley-VCH, 2013. https://doi.org/10.1002/9783527671632.ch08."},"date_updated":"2021-01-12T06:57:20Z","editor":[{"first_name":"Misha","last_name":"Meyer","full_name":"Meyer, Misha"},{"last_name":"Pesenson","full_name":"Pesenson, Z.","first_name":"Z."}],"title":"Neuronal oscillations scale up and scale down the brain dynamics ","department":[{"_id":"GaTk"}],"publist_id":"4513","author":[{"first_name":"Mario","last_name":"Valderrama","full_name":"Valderrama, Mario"},{"first_name":"Vicente","id":"421234E8-F248-11E8-B48F-1D18A9856A87","last_name":"Botella Soler","orcid":"0000-0002-8790-1914","full_name":"Botella Soler, Vicente"},{"last_name":"Le Van Quyen","full_name":"Le Van Quyen, Michel","first_name":"Michel"}],"oa_version":"None","abstract":[{"text":"Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness.","lang":"eng"}],"month":"08","alternative_title":["Reviews of Nonlinear Dynamics and Complexity"],"scopus_import":1,"publisher":"Wiley-VCH","quality_controlled":"1","day":"01","publication":"Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783527411986 "],"eisbn":["9783527671632"]},"publication_status":"published","year":"2013","date_published":"2013-08-01T00:00:00Z","doi":"10.1002/9783527671632.ch08","date_created":"2018-12-11T11:57:31Z"},{"_id":"2410","pubrep_id":"398","status":"public","type":"journal_article","ddc":["576"],"date_updated":"2021-01-12T06:57:19Z","department":[{"_id":"JoBo"},{"_id":"LifeSc"}],"file_date_updated":"2020-07-14T12:45:40Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. "}],"intvolume":" 1","month":"06","scopus_import":1,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5291","checksum":"0751ec74b695567e0cdf02aaf9c26829","file_size":130026,"date_updated":"2020-07-14T12:45:40Z","creator":"system","file_name":"IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf","date_created":"2018-12-12T10:17:36Z"}],"publication_status":"published","issue":"3","volume":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” Genome Announcements, vol. 1, no. 3. American Society for Microbiology, 2013.","short":"R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013).","apa":"Fernandes Redondo, R. A., Kupczok, A., Stift, G., & Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. American Society for Microbiology. https://doi.org/10.1128/genomeA.00216-13","ama":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 2013;1(3). doi:10.1128/genomeA.00216-13","mla":"Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements, vol. 1, no. 3, American Society for Microbiology, 2013, doi:10.1128/genomeA.00216-13.","ista":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3).","chicago":"Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements. American Society for Microbiology, 2013. https://doi.org/10.1128/genomeA.00216-13."},"title":"Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis","publist_id":"4516","author":[{"id":"409D5C96-F248-11E8-B48F-1D18A9856A87","first_name":"Rodrigo A","full_name":"Fernandes Redondo, Rodrigo A","orcid":"0000-0002-5837-2793","last_name":"Fernandes Redondo"},{"id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Anne","last_name":"Kupczok","full_name":"Kupczok, Anne"},{"id":"2DB195CA-F248-11E8-B48F-1D18A9856A87","first_name":"Gertraud","last_name":"Stift","full_name":"Stift, Gertraud"},{"orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P"}],"oa":1,"quality_controlled":"1","publisher":"American Society for Microbiology","publication":"Genome Announcements","day":"13","year":"2013","has_accepted_license":"1","date_created":"2018-12-11T11:57:30Z","doi":"10.1128/genomeA.00216-13","date_published":"2013-06-13T00:00:00Z"},{"oa":1,"publisher":"Springer","quality_controlled":"1","year":"2013","has_accepted_license":"1","day":"01","page":"773 - 789","date_created":"2018-12-11T11:57:43Z","date_published":"2013-07-01T00:00:00Z","doi":"10.1007/978-3-642-39799-8_54","citation":{"ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.","chicago":"Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_54.","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:10.1007/978-3-642-39799-8_54","apa":"Piskac, R., Wies, T., & Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_54","mla":"Piskac, Ruzica, et al. Automating Separation Logic Using SMT. Vol. 8044, Springer, 2013, pp. 773–89, doi:10.1007/978-3-642-39799-8_54."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publist_id":"4456","author":[{"last_name":"Piskac","full_name":"Piskac, Ruzica","first_name":"Ruzica"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"}],"title":"Automating separation logic using SMT","abstract":[{"lang":"eng","text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n"}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 8044","month":"07","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2020-05-15T11:13:01Z","file_name":"2013_CAV_Piskac.pdf","date_updated":"2020-07-14T12:45:41Z","file_size":309182,"creator":"dernst","checksum":"2e866932ab688f47ecd504acb4d5c7d4","file_id":"7859","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"volume":8044,"_id":"2447","series_title":"Lecture Notes in Computer Science","conference":{"name":"CAV: Computer Aided Verification","end_date":"2013-07-19","location":"St. Petersburg, Russia","start_date":"2013-07-13"},"type":"conference","status":"public","date_updated":"2020-08-11T10:09:47Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:41Z"},{"volume":200,"issue":"4","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1111/nph.12437","open_access":"1"}],"month":"12","intvolume":" 200","abstract":[{"text":"The mode of action of auxin is based on its non-uniform distribution within tissues and organs. Despite the wide use of several auxin analogues in research and agriculture, little is known about the specificity of different auxin-related transport and signalling processes towards these compounds. Using seedlings of Arabidopsis thaliana and suspension-cultured cells of Nicotiana tabacum (BY-2), the physiological activity of several auxin analogues was investigated, together with their capacity to induce auxin-dependent gene expression, to inhibit endocytosis and to be transported across the plasma membrane. This study shows that the specificity criteria for different auxin-related processes vary widely. Notably, the special behaviour of some synthetic auxin analogues suggests that they might be useful tools in investigations of the molecular mechanism of auxin action. Thus, due to their differential stimulatory effects on DR5 expression, indole-3-propionic (IPA) and 2,4,5-trichlorophenoxy acetic (2,4,5-T) acids can serve in studies of TRANSPORT INHIBITOR RESPONSE 1/AUXIN SIGNALLING F-BOX (TIR1/AFB)-mediated auxin signalling, and 5-fluoroindole-3-acetic acid (5-F-IAA) can help to discriminate between transcriptional and non-transcriptional pathways of auxin signalling. The results demonstrate that the major determinants for the auxin-like physiological potential of a particular compound are very complex and involve its chemical and metabolic stability, its ability to distribute in tissues in a polar manner and its activity towards auxin signalling machinery.","lang":"eng"}],"oa_version":"Published Version","department":[{"_id":"JiFr"}],"date_updated":"2022-06-07T08:57:52Z","article_type":"original","type":"journal_article","status":"public","_id":"2443","page":"1034 - 1048","doi":"10.1111/nph.12437","date_published":"2013-12-01T00:00:00Z","date_created":"2018-12-11T11:57:41Z","year":"2013","day":"01","publication":"New Phytologist","publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"The authors thank Dr Christian Luschnig (University of Natural Resources and Life Sciences (BOKU), Vienna, Austria) for the anti-PIN2 antibody, Professor Mark Estelle (University of California, San Diego, CA, USA) for tir1-1 mutant seeds and, last but not least, to Dr David Morris for critical reading of the manuscript. We also thank Markéta Pařezová and Jana Stýblová for excellent technical assistance. This work was supported by the Grant Agency of the Czech Republic (P305/11/0797 to E.Z. and 13-40637S to J.F.), the Central European Institute of Technology project CZ.1.05/1.1.00/02.0068 from the European Regional Development Fund and by a European Research Council starting independent research grant ERC-2011-StG-20101109-PSDP (to J.F.).","author":[{"first_name":"Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","full_name":"Simon, Sibu","orcid":"0000-0002-1998-6741","last_name":"Simon"},{"first_name":"Martin","full_name":"Kubeš, Martin","last_name":"Kubeš"},{"id":"3028BD74-F248-11E8-B48F-1D18A9856A87","first_name":"Pawel","last_name":"Baster","full_name":"Baster, Pawel"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"full_name":"Dobrev, Petre","last_name":"Dobrev","first_name":"Petre"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"last_name":"Zažímalová","full_name":"Zažímalová, Eva","first_name":"Eva"}],"publist_id":"4460","article_processing_charge":"No","title":"Defining the selectivity of processes along the auxin response chain: A study using auxin analogues","citation":{"apa":"Simon, S., Kubeš, M., Baster, P., Robert, S., Dobrev, P., Friml, J., … Zažímalová, E. (2013). Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. Wiley. https://doi.org/10.1111/nph.12437","ama":"Simon S, Kubeš M, Baster P, et al. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 2013;200(4):1034-1048. doi:10.1111/nph.12437","ieee":"S. Simon et al., “Defining the selectivity of processes along the auxin response chain: A study using auxin analogues,” New Phytologist, vol. 200, no. 4. Wiley, pp. 1034–1048, 2013.","short":"S. Simon, M. Kubeš, P. Baster, S. Robert, P. Dobrev, J. Friml, J. Petrášek, E. Zažímalová, New Phytologist 200 (2013) 1034–1048.","mla":"Simon, Sibu, et al. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist, vol. 200, no. 4, Wiley, 2013, pp. 1034–48, doi:10.1111/nph.12437.","ista":"Simon S, Kubeš M, Baster P, Robert S, Dobrev P, Friml J, Petrášek J, Zažímalová E. 2013. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 200(4), 1034–1048.","chicago":"Simon, Sibu, Martin Kubeš, Pawel Baster, Stéphanie Robert, Petre Dobrev, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist. Wiley, 2013. https://doi.org/10.1111/nph.12437."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"year":"2013","day":"01","page":"559 - 575","doi":"10.1007/978-3-642-39799-8_37","date_published":"2013-07-01T00:00:00Z","date_created":"2018-12-11T11:57:42Z","quality_controlled":"1","publisher":"Springer","oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37.","ista":"Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.","mla":"Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37.","ieee":"K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.","short":"K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.","ama":"Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:10.1007/978-3-642-39799-8_37","apa":"Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4457","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","last_name":"Gaiser","full_name":"Gaiser, Andreas"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"external_id":{"arxiv":["1304.5281"]},"title":"Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","language":[{"iso":"eng"}],"volume":8044,"ec_funded":1,"abstract":[{"text":"The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.","lang":"eng"}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1304.5281","open_access":"1"}],"month":"07","intvolume":" 8044","date_updated":"2020-08-11T10:09:47Z","department":[{"_id":"KrCh"}],"series_title":"Lecture Notes in Computer Science","_id":"2446","type":"conference","conference":{"end_date":"2013-07-19","location":"St. Petersburg, Russia","start_date":"2013-07-13","name":"CAV: Computer Aided Verification"},"status":"public"},{"_id":"2444","series_title":"Lecture Notes in Computer Science","type":"conference","conference":{"start_date":"2013-07-13","end_date":"2013-07-19","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification"},"status":"public","date_updated":"2020-08-11T10:09:47Z","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time."}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1304.0084","open_access":"1"}],"month":"07","intvolume":" 8044","publication_status":"published","language":[{"iso":"eng"}],"volume":8044,"ec_funded":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"ieee":"K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.","short":"K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558.","ama":"Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:10.1007/978-3-642-39799-8_36","apa":"Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_36","mla":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Vol. 8044, Springer, 2013, pp. 543–58, doi:10.1007/978-3-642-39799-8_36.","ista":"Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.","chicago":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4459","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Ła̧Cki","full_name":"Ła̧Cki, Jakub","first_name":"Jakub"}],"external_id":{"arxiv":["1304.0084"]},"title":"Faster algorithms for Markov decision processes with low treewidth","publisher":"Springer","quality_controlled":"1","oa":1,"year":"2013","day":"01","page":"543 - 558","doi":"10.1007/978-3-642-39799-8_36","date_published":"2013-07-01T00:00:00Z","date_created":"2018-12-11T11:57:42Z"},{"page":"1849 - 1862","issue":"6","date_published":"2013-11-01T00:00:00Z","doi":"10.1093/mp/sst044","volume":6,"date_created":"2018-12-11T11:57:44Z","publication_status":"published","year":"2013","day":"01","language":[{"iso":"eng"}],"publication":"Molecular Plant","publisher":"Cell Press","scopus_import":1,"quality_controlled":"1","month":"11","intvolume":" 6","abstract":[{"lang":"eng","text":"Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. "}],"oa_version":"None","author":[{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"last_name":"Feraru","full_name":"Feraru, Murguel","first_name":"Murguel"},{"full_name":"Hirsch, Sibylle","last_name":"Hirsch","first_name":"Sibylle"},{"first_name":"Riet","last_name":"De Rycke","full_name":"De Rycke, Riet"},{"last_name":"Nicuales","full_name":"Nicuales, Claudiu","first_name":"Claudiu"},{"first_name":"Jelle","full_name":"Van Leene, Jelle","last_name":"Van Leene"},{"full_name":"De Jaeger, Geert","last_name":"De Jaeger","first_name":"Geert"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4454","title":"Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis","department":[{"_id":"JiFr"}],"citation":{"mla":"Nodzyński, Tomasz, et al. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant, vol. 6, no. 6, Cell Press, 2013, pp. 1849–62, doi:10.1093/mp/sst044.","ama":"Nodzyński T, Feraru M, Hirsch S, et al. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 2013;6(6):1849-1862. doi:10.1093/mp/sst044","apa":"Nodzyński, T., Feraru, M., Hirsch, S., De Rycke, R., Nicuales, C., Van Leene, J., … Friml, J. (2013). Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. Cell Press. https://doi.org/10.1093/mp/sst044","ieee":"T. Nodzyński et al., “Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis,” Molecular Plant, vol. 6, no. 6. Cell Press, pp. 1849–1862, 2013.","short":"T. Nodzyński, M. Feraru, S. Hirsch, R. De Rycke, C. Nicuales, J. Van Leene, G. De Jaeger, S. Vanneste, J. Friml, Molecular Plant 6 (2013) 1849–1862.","chicago":"Nodzyński, Tomasz, Murguel Feraru, Sibylle Hirsch, Riet De Rycke, Claudiu Nicuales, Jelle Van Leene, Geert De Jaeger, Steffen Vanneste, and Jiří Friml. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant. Cell Press, 2013. https://doi.org/10.1093/mp/sst044.","ista":"Nodzyński T, Feraru M, Hirsch S, De Rycke R, Nicuales C, Van Leene J, De Jaeger G, Vanneste S, Friml J. 2013. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 6(6), 1849–1862."},"date_updated":"2021-01-12T06:57:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"2449"},{"intvolume":" 13","month":"02","quality_controlled":0,"publisher":"BioMed Central","abstract":[{"lang":"eng","text":"Background: Abundance and distribution of the plant hormone auxin play important roles in plant development. Besides other metabolic processes, various auxin carriers control the cellular level of active auxin and, hence, are major regulators of cellular auxin homeostasis. Despite the developmental importance of auxin transporters, a simple medium-to-high throughput approach to assess carrier activities is still missing. Here we show that carrier driven depletion of cellular auxin correlates with reduced nuclear auxin signaling in tobacco Bright Yellow-2 (BY-2) cell cultures.Results: We developed an easy to use transient single-cell-based system to detect carrier activity. We use the relative changes in signaling output of the auxin responsive promoter element DR5 to indirectly visualize auxin carrier activity. The feasibility of the transient approach was demonstrated by pharmacological and genetic interference with auxin signaling and transport. As a proof of concept, we provide visual evidence that the prominent auxin transport proteins PIN-FORMED (PIN)2 and PIN5 regulate cellular auxin homeostasis at the plasma membrane and endoplasmic reticulum (ER), respectively. Our data suggest that PIN2 and PIN5 have different sensitivities to the auxin transport inhibitor 1-naphthylphthalamic acid (NPA). Also the putative PIN-LIKES (PILS) auxin carrier activity at the ER is insensitive to NPA in our system, indicating that NPA blocks intercellular, but not intracellular auxin transport.Conclusions: This single-cell-based system is a useful tool by which the activity of putative auxin carriers, such as PINs, PILS and WALLS ARE THIN1 (WAT1), can be indirectly visualized in a medium-to-high throughput manner. Moreover, our single cell system might be useful to investigate also other hormonal signaling pathways, such as cytokinin."}],"date_created":"2018-12-11T11:57:45Z","volume":13,"issue":"1","date_published":"2013-02-01T00:00:00Z","doi":"10.1186/1471-2229-13-20","publication":"BMC Plant Biology","day":"01","publication_status":"published","year":"2013","status":"public","type":"journal_article","_id":"2452","title":"Single-cell-based system to monitor carrier driven cellular auxin homeostasis","publist_id":"4451","author":[{"first_name":"Elke","last_name":"Barbez","full_name":"Barbez, Elke"},{"first_name":"Martina","full_name":"Laňková, Martina","last_name":"Laňková"},{"first_name":"Markéta","full_name":"Pařezová, Markéta","last_name":"Pařezová"},{"full_name":"Maizel, Alexis","last_name":"Maizel","first_name":"Alexis"},{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"first_name":"Jürgen","last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen"}],"extern":1,"date_updated":"2021-01-12T06:57:34Z","citation":{"short":"E. Barbez, M. Laňková, M. Pařezová, A. Maizel, E. Zažímalová, J. Petrášek, J. Friml, J. Kleine Vehn, BMC Plant Biology 13 (2013).","ieee":"E. Barbez et al., “Single-cell-based system to monitor carrier driven cellular auxin homeostasis,” BMC Plant Biology, vol. 13, no. 1. BioMed Central, 2013.","apa":"Barbez, E., Laňková, M., Pařezová, M., Maizel, A., Zažímalová, E., Petrášek, J., … Kleine Vehn, J. (2013). Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-13-20","ama":"Barbez E, Laňková M, Pařezová M, et al. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 2013;13(1). doi:10.1186/1471-2229-13-20","mla":"Barbez, Elke, et al. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology, vol. 13, no. 1, BioMed Central, 2013, doi:10.1186/1471-2229-13-20.","ista":"Barbez E, Laňková M, Pařezová M, Maizel A, Zažímalová E, Petrášek J, Friml J, Kleine Vehn J. 2013. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 13(1).","chicago":"Barbez, Elke, Martina Laňková, Markéta Pařezová, Alexis Maizel, Eva Zažímalová, Jan Petrášek, Jiří Friml, and Jürgen Kleine Vehn. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2229-13-20."}}]