[{"publist_id":"3818","oa_version":"Submitted Version","date_created":"2018-12-11T12:00:20Z","publisher":"Wiley-Blackwell","title":"SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism","department":[{"_id":"JiFr"}],"publication":"EMBO Journal","abstract":[{"text":"The distribution of the phytohormone auxin regulates many aspects of plant development including growth response to gravity. Gravitropic root curvature involves coordinated and asymmetric cell elongation between the lower and upper side of the root, mediated by differential cellular auxin levels. The asymmetry in the auxin distribution is established and maintained by a spatio-temporal regulation of the PIN-FORMED (PIN) auxin transporter activity. We provide novel insights into the complex regulation of PIN abundance and activity during root gravitropism. We show that PIN2 turnover is differentially regulated on the upper and lower side of gravistimulated roots by distinct but partially overlapping auxin feedback mechanisms. In addition to regulating transcription and clathrin-mediated internalization, auxin also controls PIN abundance at the plasma membrane by promoting their vacuolar targeting and degradation. This effect of elevated auxin levels requires the activity of SKP-Cullin-F-box TIR1/AFB (SCF TIR1/AFB)-dependent pathway. Importantly, also suboptimal auxin levels mediate PIN degradation utilizing the same signalling pathway. These feedback mechanisms are functionally important during gravitropic response and ensure fine-tuning of auxin fluxes for maintaining as well as terminating asymmetric growth.","lang":"eng"}],"year":"2013","_id":"2919","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"260 - 274","volume":32,"citation":{"short":"P. Baster, S. Robert, J. Kleine Vehn, S. Vanneste, U. Kania, W. Grunewald, B. De Rybel, T. Beeckman, J. Friml, EMBO Journal 32 (2013) 260–274.","ista":"Baster P, Robert S, Kleine Vehn J, Vanneste S, Kania U, Grunewald W, De Rybel B, Beeckman T, Friml J. 2013. SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism. EMBO Journal. 32(2), 260–274.","mla":"Baster, Pawel, et al. “SCF^TIR1 AFB-Auxin Signalling Regulates PIN Vacuolar Trafficking and Auxin Fluxes during Root Gravitropism.” <i>EMBO Journal</i>, vol. 32, no. 2, Wiley-Blackwell, 2013, pp. 260–74, doi:<a href=\"https://doi.org/10.1038/emboj.2012.310\">10.1038/emboj.2012.310</a>.","ama":"Baster P, Robert S, Kleine Vehn J, et al. SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism. <i>EMBO Journal</i>. 2013;32(2):260-274. doi:<a href=\"https://doi.org/10.1038/emboj.2012.310\">10.1038/emboj.2012.310</a>","apa":"Baster, P., Robert, S., Kleine Vehn, J., Vanneste, S., Kania, U., Grunewald, W., … Friml, J. (2013). SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2012.310\">https://doi.org/10.1038/emboj.2012.310</a>","chicago":"Baster, Pawel, Stéphanie Robert, Jürgen Kleine Vehn, Steffen Vanneste, Urszula Kania, Wim Grunewald, Bert De Rybel, Tom Beeckman, and Jiří Friml. “SCF^TIR1 AFB-Auxin Signalling Regulates PIN Vacuolar Trafficking and Auxin Fluxes during Root Gravitropism.” <i>EMBO Journal</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1038/emboj.2012.310\">https://doi.org/10.1038/emboj.2012.310</a>.","ieee":"P. Baster <i>et al.</i>, “SCF^TIR1 AFB-auxin signalling regulates PIN vacuolar trafficking and auxin fluxes during root gravitropism,” <i>EMBO Journal</i>, vol. 32, no. 2. Wiley-Blackwell, pp. 260–274, 2013."},"external_id":{"pmid":["23211744"]},"issue":"2","oa":1,"status":"public","quality_controlled":"1","scopus_import":1,"date_updated":"2021-01-12T07:00:41Z","doi":"10.1038/emboj.2012.310","author":[{"last_name":"Baster","first_name":"Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","full_name":"Baster, Pawel"},{"full_name":"Robert, Stéphanie","last_name":"Robert","first_name":"Stéphanie"},{"last_name":"Kleine Vehn","first_name":"Jürgen","full_name":"Kleine Vehn, Jürgen"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"last_name":"Kania","first_name":"Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","full_name":"Kania, Urszula"},{"last_name":"Grunewald","first_name":"Wim","full_name":"Grunewald, Wim"},{"full_name":"De Rybel, Bert","last_name":"De Rybel","first_name":"Bert"},{"full_name":"Beeckman, Tom","first_name":"Tom","last_name":"Beeckman"},{"first_name":"Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2013-01-23T00:00:00Z","publication_status":"published","intvolume":"        32","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3553380/"}],"language":[{"iso":"eng"}],"month":"01","day":"23","pmid":1},{"citation":{"apa":"Compagnon, J., &#38; Heisenberg, C.-P. J. (2013). Neurulation coordinating cell polarisation and lumen formation. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2012.325\">https://doi.org/10.1038/emboj.2012.325</a>","chicago":"Compagnon, Julien, and Carl-Philipp J Heisenberg. “Neurulation Coordinating Cell Polarisation and Lumen Formation.” <i>EMBO Journal</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1038/emboj.2012.325\">https://doi.org/10.1038/emboj.2012.325</a>.","ieee":"J. Compagnon and C.-P. J. Heisenberg, “Neurulation coordinating cell polarisation and lumen formation,” <i>EMBO Journal</i>, vol. 32, no. 1. Wiley-Blackwell, pp. 1–3, 2013.","mla":"Compagnon, Julien, and Carl-Philipp J. Heisenberg. “Neurulation Coordinating Cell Polarisation and Lumen Formation.” <i>EMBO Journal</i>, vol. 32, no. 1, Wiley-Blackwell, 2013, pp. 1–3, doi:<a href=\"https://doi.org/10.1038/emboj.2012.325\">10.1038/emboj.2012.325</a>.","ista":"Compagnon J, Heisenberg C-PJ. 2013. Neurulation coordinating cell polarisation and lumen formation. EMBO Journal. 32(1), 1–3.","short":"J. Compagnon, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 1–3.","ama":"Compagnon J, Heisenberg C-PJ. Neurulation coordinating cell polarisation and lumen formation. <i>EMBO Journal</i>. 2013;32(1):1-3. doi:<a href=\"https://doi.org/10.1038/emboj.2012.325\">10.1038/emboj.2012.325</a>"},"status":"public","oa":1,"external_id":{"pmid":["23211745"]},"issue":"1","_id":"2920","year":"2013","page":"1 - 3","volume":32,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Cell polarisation in development is a common and fundamental process underlying embryo patterning and morphogenesis, and has been extensively studied over the past years. Our current knowledge of cell polarisation in development is predominantly based on studies that have analysed polarisation of single cells, such as eggs, or cellular aggregates with a stable polarising interface, such as cultured epithelial cells (St Johnston and Ahringer, 2010). However, in embryonic development, particularly of vertebrates, cell polarisation processes often encompass large numbers of cells that are placed within moving and proliferating tissues, and undergo mesenchymal-to-epithelial transitions with a highly complex spatiotemporal choreography. How such intricate cell polarisation processes in embryonic development are achieved has only started to be analysed. By using live imaging of neurulation in the transparent zebrafish embryo, Buckley et al (2012) now describe a novel polarisation strategy by which cells assemble an apical domain in the part of their cell body that intersects with the midline of the forming neural rod. This mechanism, along with the previously described mirror-symmetric divisions (Tawk et al, 2007), is thought to trigger formation of both neural rod midline and lumen."}],"oa_version":"Submitted Version","date_created":"2018-12-11T12:00:20Z","publist_id":"3817","department":[{"_id":"CaHe"}],"title":"Neurulation coordinating cell polarisation and lumen formation","publication":"EMBO Journal","publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"month":"01","pmid":1,"day":"09","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3545307/"}],"intvolume":"        32","publication_status":"published","scopus_import":1,"quality_controlled":"1","date_published":"2013-01-09T00:00:00Z","author":[{"first_name":"Julien","last_name":"Compagnon","full_name":"Compagnon, Julien","id":"2E3E0988-F248-11E8-B48F-1D18A9856A87"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J"}],"date_updated":"2021-01-12T07:00:42Z","doi":"10.1038/emboj.2012.325"},{"related_material":{"record":[{"id":"9757","status":"public","relation":"research_data"},{"status":"public","relation":"dissertation_contains","id":"961"}]},"doi":"10.1016/j.cub.2012.11.034","date_updated":"2023-09-07T12:05:08Z","date_published":"2013-01-07T00:00:00Z","author":[{"id":"35A7A418-F248-11E8-B48F-1D18A9856A87","full_name":"Tragust, Simon","last_name":"Tragust","first_name":"Simon"},{"id":"479DDAAC-E9CD-11E9-9B5F-82450873F7A1","full_name":"Mitteregger, Barbara","last_name":"Mitteregger","first_name":"Barbara"},{"first_name":"Vanessa","orcid":"0000-0003-2676-3367","last_name":"Barone","full_name":"Barone, Vanessa","id":"419EECCC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Konrad, Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","last_name":"Konrad"},{"first_name":"Line V","orcid":"0000-0003-1832-8883","last_name":"Ugelvig","full_name":"Ugelvig, Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"}],"quality_controlled":"1","scopus_import":1,"day":"07","project":[{"grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution","_id":"25DAF0B2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071","_id":"25DC711C-B435-11E9-9278-68D0E5697425"},{"_id":"25DDF0F0-B435-11E9-9278-68D0E5697425","grant_number":"302004","name":"Pathogen Detectors Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"month":"01","publication_status":"published","intvolume":"        23","abstract":[{"lang":"eng","text":"To fight infectious diseases, host immune defenses are employed at multiple levels. Sanitary behavior, such as pathogen avoidance and removal, acts as a first line of defense to prevent infection [1] before activation of the physiological immune system. Insect societies have evolved a wide range of collective hygiene measures and intensive health care toward pathogen-exposed group members [2]. One of the most common behaviors is allogrooming, in which nestmates remove infectious particles from the body surfaces of exposed individuals [3]. Here we show that, in invasive garden ants, grooming of fungus-exposed brood is effective beyond the sheer mechanical removal of fungal conidiospores; it also includes chemical disinfection through the application of poison produced by the ants themselves. Formic acid is the main active component of the poison. It inhibits fungal growth of conidiospores remaining on the brood surface after grooming and also those collected in the mouth of the grooming ant. This dual function is achieved by uptake of the poison droplet into the mouth through acidopore self-grooming and subsequent application onto the infectious brood via brood grooming. This extraordinary behavior extends the current understanding of grooming and the establishment of social immunity in insect societies."}],"publisher":"Cell Press","title":"Ants disinfect fungus-exposed brood by oral uptake and spread of their poison","department":[{"_id":"SyCr"},{"_id":"CaHe"}],"publication":"Current Biology","publist_id":"3811","oa_version":"None","ec_funded":1,"date_created":"2018-12-11T12:00:23Z","issue":"1","acknowledgement":"Funding for this project was obtained by the German Research Foundation (DFG, to S.C.) and the European Research Council (ERC, through an ERC-Starting Grant to S.C. and an Individual Marie Curie IEF fellowship to L.V.U.).\r\nWe thank Jørgen Eilenberg, Bernhardt Steinwender, Miriam Stock, and Meghan L. Vyleta for the fungal strain and its characterization; Volker Witte for chemical information; Eva Sixt for ant drawings; and Robert Hauschild for help with image analysis. We further thank Martin Kaltenpoth, Michael Sixt, Jürgen Heinze, and Joachim Ruther for discussion and Daria Siekhaus, Sophie A.O. Armitage, and Leila Masri for comments on the manuscript. \r\n","status":"public","citation":{"ieee":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer, “Ants disinfect fungus-exposed brood by oral uptake and spread of their poison,” <i>Current Biology</i>, vol. 23, no. 1. Cell Press, pp. 76–82, 2013.","chicago":"Tragust, Simon, Barbara Mitteregger, Vanessa Barone, Matthias Konrad, Line V Ugelvig, and Sylvia Cremer. “Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">https://doi.org/10.1016/j.cub.2012.11.034</a>.","apa":"Tragust, S., Mitteregger, B., Barone, V., Konrad, M., Ugelvig, L. V., &#38; Cremer, S. (2013). Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">https://doi.org/10.1016/j.cub.2012.11.034</a>","ama":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. <i>Current Biology</i>. 2013;23(1):76-82. doi:<a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">10.1016/j.cub.2012.11.034</a>","short":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L.V. Ugelvig, S. Cremer, Current Biology 23 (2013) 76–82.","mla":"Tragust, Simon, et al. “Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison.” <i>Current Biology</i>, vol. 23, no. 1, Cell Press, 2013, pp. 76–82, doi:<a href=\"https://doi.org/10.1016/j.cub.2012.11.034\">10.1016/j.cub.2012.11.034</a>.","ista":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2013. Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. Current Biology. 23(1), 76–82."},"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"76 - 82","volume":23,"year":"2013","_id":"2926"},{"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"435 - 447","volume":46,"publication_status":"published","year":"2013","_id":"2939","intvolume":"        46","day":"01","issue":"4","status":"public","acknowledgement":"The authors thank Herbert Edelsbrunner for many helpful discussions and suggestions. Moreover, they are grateful for the careful reviews that helped to improve the quality of the paper.","language":[{"iso":"eng"}],"month":"05","citation":{"apa":"Chen, C., &#38; Kerber, M. (2013). An output sensitive algorithm for persistent homology. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">https://doi.org/10.1016/j.comgeo.2012.02.010</a>","chicago":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">https://doi.org/10.1016/j.comgeo.2012.02.010</a>.","ieee":"C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” <i>Computational Geometry: Theory and Applications</i>, vol. 46, no. 4. Elsevier, pp. 435–447, 2013.","ista":"Chen C, Kerber M. 2013. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 46(4), 435–447.","mla":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” <i>Computational Geometry: Theory and Applications</i>, vol. 46, no. 4, Elsevier, 2013, pp. 435–47, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">10.1016/j.comgeo.2012.02.010</a>.","short":"C. Chen, M. Kerber, Computational Geometry: Theory and Applications 46 (2013) 435–447.","ama":"Chen C, Kerber M. An output sensitive algorithm for persistent homology. <i>Computational Geometry: Theory and Applications</i>. 2013;46(4):435-447. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2012.02.010\">10.1016/j.comgeo.2012.02.010</a>"},"publisher":"Elsevier","title":"An output sensitive algorithm for persistent homology","department":[{"_id":"HeEd"}],"publication":"Computational Geometry: Theory and Applications","publist_id":"3796","oa_version":"None","date_created":"2018-12-11T12:00:27Z","doi":"10.1016/j.comgeo.2012.02.010","date_updated":"2023-02-23T11:24:10Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3367"}]},"author":[{"last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael"}],"date_published":"2013-05-01T00:00:00Z","quality_controlled":"1","scopus_import":1,"abstract":[{"lang":"eng","text":"In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ &gt; 0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via column operations, our algorithm performs rank computations on submatrices of the boundary matrix. For an arbitrary constant δ ∈ (0, 1), the running time is O (C (1 - δ) Γ R d (n) log n), where C (1 - δ) Γ is the number of homology classes with persistence at least (1 - δ) Γ, n is the total number of simplices in the complex, d its dimension, and R d (n) is the complexity of computing the rank of an n × n matrix with O (d n) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O (C (1 - δ) Γ n 2.376) algorithm, an O (C (1 - δ) Γ n 2.28) Las-Vegas algorithm, or an O (C (1 - δ) Γ n 2 + ε{lunate}) Monte-Carlo algorithm for an arbitrary ε{lunate} &gt; 0. The space complexity of the Monte-Carlo version is bounded by O (d n) = O (n log n)."}]},{"title":"A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it","department":[{"_id":"KrPi"}],"publisher":"Springer","oa_version":"Submitted Version","ec_funded":1,"date_created":"2018-12-11T12:00:27Z","publist_id":"3795","abstract":[{"text":"A chain rule for an entropy notion H(.) states that the entropy H(X) of a variable X decreases by at most l if conditioned on an l-bit string A, i.e., H(X|A)&gt;= H(X)-l. More generally, it satisfies a chain rule for conditional entropy if H(X|Y,A)&gt;= H(X|Y)-l.\r\n\r\nAll natural information theoretic entropy notions we are aware of (like Shannon or min-entropy) satisfy some kind of chain rule for conditional entropy. Moreover, many computational entropy notions (like Yao entropy, unpredictability entropy and several variants of HILL entropy) satisfy the chain rule for conditional entropy, though here not only the quantity decreases by l, but also the quality of the entropy decreases exponentially in l. However, for \r\nthe standard notion of conditional HILL entropy (the computational equivalent of min-entropy) the existence of such a rule was unknown so far.\r\n\r\nIn this paper, we prove that for conditional HILL entropy no meaningful chain rule exists, assuming the existence of one-way permutations: there exist distributions X,Y,A, where A is a distribution over a single bit, but  $H(X|Y)&gt;&gt;H(X|Y,A)$, even if we simultaneously allow for a massive degradation in the quality of the entropy.\r\n\r\nThe idea underlying our construction is based on a surprising connection between the chain rule for HILL entropy and deniable encryption. ","lang":"eng"}],"page":"23 - 39","volume":7785,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2940","has_accepted_license":"1","year":"2013","oa":1,"status":"public","citation":{"ama":"Krenn S, Pietrzak KZ, Wadia A. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. In: Sahai A, ed. Vol 7785. Springer; 2013:23-39. doi:<a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">10.1007/978-3-642-36594-2_2</a>","ista":"Krenn S, Pietrzak KZ, Wadia A. 2013. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. TCC: Theory of Cryptography Conference, LNCS, vol. 7785, 23–39.","mla":"Krenn, Stephan, et al. <i>A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It</i>. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:<a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">10.1007/978-3-642-36594-2_2</a>.","short":"S. Krenn, K.Z. Pietrzak, A. Wadia, in:, A. Sahai (Ed.), Springer, 2013, pp. 23–39.","chicago":"Krenn, Stephan, Krzysztof Z Pietrzak, and Akshay Wadia. “A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It.” edited by Amit Sahai, 7785:23–39. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">https://doi.org/10.1007/978-3-642-36594-2_2</a>.","ieee":"S. Krenn, K. Z. Pietrzak, and A. Wadia, “A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it,” presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan, 2013, vol. 7785, pp. 23–39.","apa":"Krenn, S., Pietrzak, K. Z., &#38; Wadia, A. (2013). A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. In A. Sahai (Ed.) (Vol. 7785, pp. 23–39). Presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36594-2_2\">https://doi.org/10.1007/978-3-642-36594-2_2</a>"},"file_date_updated":"2020-07-14T12:45:54Z","conference":{"location":"Tokyo, Japan","start_date":"2013-03-03","name":"TCC: Theory of Cryptography Conference","end_date":"2013-03-06"},"editor":[{"full_name":"Sahai, Amit","last_name":"Sahai","first_name":"Amit"}],"author":[{"orcid":"0000-0003-2835-9093","last_name":"Krenn","first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Krenn, Stephan"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"full_name":"Wadia, Akshay","last_name":"Wadia","first_name":"Akshay"}],"date_published":"2013-01-29T00:00:00Z","doi":"10.1007/978-3-642-36594-2_2","related_material":{"record":[{"id":"1479","status":"public","relation":"later_version"}]},"date_updated":"2023-02-23T10:00:43Z","alternative_title":["LNCS"],"scopus_import":1,"quality_controlled":"1","intvolume":"      7785","publication_status":"published","file":[{"date_created":"2019-01-22T14:11:11Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","relation":"main_file","file_name":"2013_LNCS_Krenn.pdf","checksum":"beb0cc1c0579da2d2e84394230a5da78","file_size":414823,"file_id":"5875","date_updated":"2020-07-14T12:45:54Z"}],"day":"29","ddc":["000"],"language":[{"iso":"eng"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7"}],"month":"01"},{"day":"01","language":[{"iso":"eng"}],"month":"02","publication_status":"published","intvolume":"        22","date_updated":"2023-02-23T14:07:19Z","related_material":{"record":[{"id":"9758","status":"public","relation":"research_data"}]},"doi":"10.1111/mec.12165","author":[{"id":"2D35326E-F248-11E8-B48F-1D18A9856A87","full_name":"Aeschbacher, Simon","last_name":"Aeschbacher","first_name":"Simon"},{"first_name":"Andreas","last_name":"Futschik","full_name":"Futschik, Andreas"},{"full_name":"Beaumont, Mark","first_name":"Mark","last_name":"Beaumont"}],"date_published":"2013-02-01T00:00:00Z","quality_controlled":"1","scopus_import":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"issue":"4","acknowledgement":"This study has made use of the computational resources provided by IST Austria and the Edinburgh Compute and Data Facility (ECDF; http://www.ecdf.ed.ac.uk). The ECDF is partially supported by the eDIKT initiative (http://www.edikt.org.uk). S.A. acknowledges financial support by IST Austria, the Janggen-Pöhn Foundation, St. Gallen, the Roche Research Foundation, Basel, the University of Edinburgh in the form of a Torrance Studentship, and the Austrian Science Fund (FWF P21305-N13).","status":"public","citation":{"apa":"Aeschbacher, S., Futschik, A., &#38; Beaumont, M. (2013). Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.12165\">https://doi.org/10.1111/mec.12165</a>","chicago":"Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates. .” <i>Molecular Ecology</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1111/mec.12165\">https://doi.org/10.1111/mec.12165</a>.","ieee":"S. Aeschbacher, A. Futschik, and M. Beaumont, “Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. ,” <i>Molecular Ecology</i>, vol. 22, no. 4. Wiley-Blackwell, pp. 987–1002, 2013.","ista":"Aeschbacher S, Futschik A, Beaumont M. 2013. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . Molecular Ecology. 22(4), 987–1002.","mla":"Aeschbacher, Simon, et al. “Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates. .” <i>Molecular Ecology</i>, vol. 22, no. 4, Wiley-Blackwell, 2013, pp. 987–1002, doi:<a href=\"https://doi.org/10.1111/mec.12165\">10.1111/mec.12165</a>.","short":"S. Aeschbacher, A. Futschik, M. Beaumont, Molecular Ecology 22 (2013) 987–1002.","ama":"Aeschbacher S, Futschik A, Beaumont M. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. . <i>Molecular Ecology</i>. 2013;22(4):987-1002. doi:<a href=\"https://doi.org/10.1111/mec.12165\">10.1111/mec.12165</a>"},"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"987 - 1002","volume":22,"year":"2013","_id":"2944","abstract":[{"lang":"eng","text":"We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction."}],"publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"}],"title":"Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. ","publication":"Molecular Ecology","publist_id":"3788","oa_version":"None","date_created":"2018-12-11T12:00:28Z"},{"intvolume":"      7724","publication_status":"published","file":[{"file_id":"5874","date_updated":"2020-07-14T12:45:55Z","file_name":"2012_ACCV_Tommasi.pdf","checksum":"a0a7234a89e2192af655b0d0ae3bf445","file_size":1513620,"creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2019-01-22T14:03:11Z","content_type":"application/pdf"}],"day":"04","ddc":["000"],"language":[{"iso":"eng"}],"month":"04","file_date_updated":"2020-07-14T12:45:55Z","conference":{"name":"ACCV: Asian Conference on Computer Vision","end_date":"2012-11-09","location":"Daejeon, Korea","start_date":"2012-11-05"},"date_published":"2013-04-04T00:00:00Z","author":[{"full_name":"Tommasi, Tatiana","first_name":"Tatiana","last_name":"Tommasi"},{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"full_name":"Caputo, Barbara","last_name":"Caputo","first_name":"Barbara"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"date_updated":"2020-08-11T10:09:54Z","doi":"10.1007/978-3-642-37331-2_1","alternative_title":["LNCS"],"scopus_import":1,"quality_controlled":"1","page":"1 - 15","volume":7724,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2948","year":"2013","has_accepted_license":"1","oa":1,"acknowledgement":"This work was supported by the PASCAL 2 Network of Excellence (TT) and by the Newton International Fellowship (NQ)","status":"public","citation":{"chicago":"Tommasi, Tatiana, Novi Quadrianto, Barbara Caputo, and Christoph Lampert. “Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">https://doi.org/10.1007/978-3-642-37331-2_1</a>.","ieee":"T. Tommasi, N. Quadrianto, B. Caputo, and C. Lampert, “Beyond dataset bias: Multi-task unaligned shared knowledge transfer,” vol. 7724. Springer, pp. 1–15, 2013.","apa":"Tommasi, T., Quadrianto, N., Caputo, B., &#38; Lampert, C. (2013). Beyond dataset bias: Multi-task unaligned shared knowledge transfer. Presented at the ACCV: Asian Conference on Computer Vision, Daejeon, Korea: Springer. <a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">https://doi.org/10.1007/978-3-642-37331-2_1</a>","ama":"Tommasi T, Quadrianto N, Caputo B, Lampert C. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 2013;7724:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">10.1007/978-3-642-37331-2_1</a>","short":"T. Tommasi, N. Quadrianto, B. Caputo, C. Lampert, 7724 (2013) 1–15.","mla":"Tommasi, Tatiana, et al. <i>Beyond Dataset Bias: Multi-Task Unaligned Shared Knowledge Transfer</i>. Vol. 7724, Springer, 2013, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-37331-2_1\">10.1007/978-3-642-37331-2_1</a>.","ista":"Tommasi T, Quadrianto N, Caputo B, Lampert C. 2013. Beyond dataset bias: Multi-task unaligned shared knowledge transfer. 7724, 1–15."},"department":[{"_id":"ChLa"}],"title":"Beyond dataset bias: Multi-task unaligned shared knowledge transfer","publisher":"Springer","oa_version":"Submitted Version","date_created":"2018-12-11T12:00:30Z","publist_id":"3784","abstract":[{"lang":"eng","text":"Many visual datasets are traditionally used to analyze the performance of different learning techniques. The evaluation is usually done within each dataset, therefore it is questionable if such results are a reliable indicator of true generalization ability. We propose here an algorithm to exploit the existing data resources when learning on a new multiclass problem. Our main idea is to identify an image representation that decomposes orthogonally into two subspaces: a part specific to each dataset, and a part generic to, and therefore shared between, all the considered source sets. This allows us to use the generic representation as un-biased reference knowledge for a novel classification task. By casting the method in the multi-view setting, we also make it possible to use different features for different databases. We call the algorithm MUST, Multitask Unaligned Shared knowledge Transfer. Through extensive experiments on five public datasets, we show that MUST consistently improves the cross-datasets generalization performance."}],"series_title":"Lecture Notes in Computer Science"},{"acknowledgement":"This work is being performed within the FP7 EU project CACE (Computer Aided Cryptography Engineering).","status":"public","oa":1,"day":"08","citation":{"apa":"Bangerter, E., Barzan, S., Krenn, S., Sadeghi, A., Schneider, T., &#38; Tsay, J. (2013). Bringing Zero-Knowledge Proofs of Knowledge to Practice. In B. Christianson, J. Malcolm, V. Matyas, &#38; M. Roe (Eds.) (Vol. 7028, pp. 51–62). Presented at the SPW: Security Protocols Workshop, Springer. <a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">https://doi.org/10.1007/978-3-642-36213-2_9</a>","chicago":"Bangerter, Endre, Stefania Barzan, Stephan Krenn, Ahmad Sadeghi, Thomas Schneider, and Joe Tsay. “Bringing Zero-Knowledge Proofs of Knowledge to Practice.” edited by Bruce Christianson, James Malcolm, Vashek Matyas, and Michael Roe, 7028:51–62. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">https://doi.org/10.1007/978-3-642-36213-2_9</a>.","ieee":"E. Bangerter, S. Barzan, S. Krenn, A. Sadeghi, T. Schneider, and J. Tsay, “Bringing Zero-Knowledge Proofs of Knowledge to Practice,” presented at the SPW: Security Protocols Workshop, 2013, vol. 7028, pp. 51–62.","short":"E. Bangerter, S. Barzan, S. Krenn, A. Sadeghi, T. Schneider, J. Tsay, in:, B. Christianson, J. Malcolm, V. Matyas, M. Roe (Eds.), Springer, 2013, pp. 51–62.","ista":"Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. 2013. Bringing Zero-Knowledge Proofs of Knowledge to Practice. SPW: Security Protocols Workshop, LNCS, vol. 7028, 51–62.","mla":"Bangerter, Endre, et al. <i>Bringing Zero-Knowledge Proofs of Knowledge to Practice</i>. Edited by Bruce Christianson et al., vol. 7028, Springer, 2013, pp. 51–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">10.1007/978-3-642-36213-2_9</a>.","ama":"Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. Bringing Zero-Knowledge Proofs of Knowledge to Practice. In: Christianson B, Malcolm J, Matyas V, Roe M, eds. Vol 7028. Springer; 2013:51-62. doi:<a href=\"https://doi.org/10.1007/978-3-642-36213-2_9\">10.1007/978-3-642-36213-2_9</a>"},"month":"01","page":"51 - 62","volume":7028,"type":"conference","intvolume":"      7028","_id":"2973","main_file_link":[{"url":"http://eprint.iacr.org/2009/211.pdf","open_access":"1"}],"publication_status":"published","year":"2013","editor":[{"first_name":"Bruce","last_name":"Christianson","full_name":"Christianson, Bruce"},{"full_name":"Malcolm, James A.","last_name":"Malcolm","first_name":"James"},{"full_name":"Matyas, Vashek","first_name":"Vashek","last_name":"Matyas"},{"full_name":"Roe, Michael","last_name":"Roe","first_name":"Michael"}],"date_published":"2013-01-08T00:00:00Z","author":[{"first_name":"Endre","last_name":"Bangerter","full_name":"Bangerter, Endre"},{"first_name":"Stefania","last_name":"Barzan","full_name":"Barzan, Stefania"},{"orcid":"0000-0003-2835-9093","last_name":"Krenn","first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Stephan Krenn"},{"last_name":"Sadeghi","first_name":"Ahmad","full_name":"Sadeghi, Ahmad-Reza"},{"last_name":"Schneider","first_name":"Thomas","full_name":"Schneider, Thomas"},{"full_name":"Tsay, Joe-Kai","last_name":"Tsay","first_name":"Joe"}],"doi":"10.1007/978-3-642-36213-2_9","date_updated":"2021-01-12T07:40:10Z","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that critically rely on ZK-PoKs are being deployed in the real world. The most prominent example is Direct Anonymous Attestation (DAA), which was adopted by the Trusted Computing Group (TCG) and implemented as one of the functionalities of the cryptographic Trusted Platform Module (TPM) chip.\n\nImplementing systems using ZK-PoK turns out to be challenging, since ZK-PoK are, loosely speaking, significantly more complex than standard crypto primitives, such as encryption and signature schemes. As a result, implementation cycles of ZK-PoK are time-consuming and error-prone, in particular for developers with minor or no cryptographic skills. \n\nIn this paper we report on our ongoing and future research vision with the goal to bring ZK-PoK to practice by making them accessible to crypto and security engineers. To this end we are developing compilers and related tools that support and partially automate the design, implementation, verification and secure implementation of ZK-PoK protocols."}],"extern":1,"quality_controlled":0,"title":"Bringing Zero-Knowledge Proofs of Knowledge to Practice","publisher":"Springer","date_created":"2018-12-11T12:00:38Z","conference":{"name":"SPW: Security Protocols Workshop"},"publist_id":"3732"},{"year":"2013","publication_status":"published","intvolume":"        42","_id":"3116","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":42,"page":"142 - 174","month":"04","language":[{"iso":"eng"}],"citation":{"ista":"Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.","mla":"Chatterjee, Krishnendu, et al. “Code Aware Resource Management.” <i>Formal Methods in System Design</i>, vol. 42, no. 2, Springer, 2013, pp. 142–74, doi:<a href=\"https://doi.org/10.1007/s10703-012-0170-4\">10.1007/s10703-012-0170-4</a>.","short":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.","ama":"Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. Code aware resource management. <i>Formal Methods in System Design</i>. 2013;42(2):142-174. doi:<a href=\"https://doi.org/10.1007/s10703-012-0170-4\">10.1007/s10703-012-0170-4</a>","apa":"Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., &#38; Raman, V. (2013). Code aware resource management. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-012-0170-4\">https://doi.org/10.1007/s10703-012-0170-4</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar, and Vishwanath Raman. “Code Aware Resource Management.” <i>Formal Methods in System Design</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10703-012-0170-4\">https://doi.org/10.1007/s10703-012-0170-4</a>.","ieee":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” <i>Formal Methods in System Design</i>, vol. 42, no. 2. Springer, pp. 142–174, 2013."},"issue":"2","day":"01","status":"public","acknowledgement":"This research was supported in part by the National Science Foundation CAREER award CCR-0132780, by the ONR grant N00014-02-1-0671, by the National Science Foundation grants CCR-0427202 and CCR-0234690, and by the ARP award TO.030.MM.D.","publist_id":"3583","date_created":"2018-12-11T12:01:29Z","oa_version":"None","publisher":"Springer","publication":"Formal Methods in System Design","department":[{"_id":"KrCh"}],"title":"Code aware resource management","quality_controlled":"1","scopus_import":1,"abstract":[{"lang":"eng","text":"Multithreaded programs coordinate their interaction through synchronization primitives like mutexes and semaphores, which are managed by an OS-provided resource manager. We propose algorithms for the automatic construction of code-aware resource managers for multithreaded embedded applications. Such managers use knowledge about the structure and resource usage (mutex and semaphore usage) of the threads to guarantee deadlock freedom and progress while managing resources in an efficient way. Our algorithms compute managers as winning strategies in certain infinite games, and produce a compact code description of these strategies. We have implemented the algorithms in the tool Cynthesis. Given a multithreaded program in C, the tool produces C code implementing a code-aware resource manager. We show in experiments that Cynthesis produces compact resource managers within a few minutes on a set of embedded benchmarks with up to 6 threads. © 2012 Springer Science+Business Media, LLC."}],"doi":"10.1007/s10703-012-0170-4","date_updated":"2021-01-12T07:41:10Z","date_published":"2013-04-01T00:00:00Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Faella","first_name":"Marco","full_name":"Faella, Marco"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"},{"full_name":"Raman, Vishwanath","first_name":"Vishwanath","last_name":"Raman"}]},{"file_date_updated":"2020-07-14T12:46:06Z","date_published":"2013-10-08T00:00:00Z","author":[{"last_name":"Dubuis","first_name":"Julien","full_name":"Dubuis, Julien"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper"},{"full_name":"Wieschaus, Eric","first_name":"Eric","last_name":"Wieschaus"},{"first_name":"Thomas","last_name":"Gregor","full_name":"Gregor, Thomas"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"date_updated":"2021-01-12T07:42:13Z","doi":"10.1073/pnas.1315642110","scopus_import":1,"quality_controlled":"1","intvolume":"       110","publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","relation":"main_file","date_created":"2019-01-22T13:53:23Z","content_type":"application/pdf","file_id":"5873","date_updated":"2020-07-14T12:46:06Z","checksum":"ecd859fe52a562193027d428b5524a8d","file_name":"2013_PNAS_Dubuis.pdf","file_size":1670548}],"pmid":1,"day":"08","ddc":["570"],"language":[{"iso":"eng"}],"month":"10","title":"Positional information, in bits","department":[{"_id":"GaTk"}],"publication":"PNAS","publisher":"National Academy of Sciences","oa_version":"Published Version","date_created":"2018-12-11T12:02:19Z","publist_id":"3387","abstract":[{"lang":"eng","text":"Cells in a developing embryo have no direct way of &quot;measuring&quot; their physical position. Through a variety of processes, however, the expression levels of multiple genes come to be correlated with position, and these expression levels thus form a code for &quot;positional information.&quot; We show how to measure this information, in bits, using the gap genes in the Drosophila embryo as an example. Individual genes carry nearly two bits of information, twice as much as expected if the expression patterns consisted only of on/off domains separated by sharp boundaries. Taken together, four gap genes carry enough information to define a cell's location with an error bar of ~1% along the anterior-posterior axis of the embryo. This precision is nearly enough for each cell to have a unique identity, which is the maximum information the system can use, and is nearly constant along the length of the embryo. We argue that this constancy is a signature of optimality in the transmission of information from primary morphogen inputs to the output of the gap gene network."}],"page":"16301 - 16308","volume":110,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3261","year":"2013","has_accepted_license":"1","oa":1,"status":"public","external_id":{"pmid":["24089448"]},"issue":"41","citation":{"apa":"Dubuis, J., Tkačik, G., Wieschaus, E., Gregor, T., &#38; Bialek, W. (2013). Positional information, in bits. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1315642110\">https://doi.org/10.1073/pnas.1315642110</a>","ieee":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, and W. Bialek, “Positional information, in bits,” <i>PNAS</i>, vol. 110, no. 41. National Academy of Sciences, pp. 16301–16308, 2013.","chicago":"Dubuis, Julien, Gašper Tkačik, Eric Wieschaus, Thomas Gregor, and William Bialek. “Positional Information, in Bits.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1315642110\">https://doi.org/10.1073/pnas.1315642110</a>.","ista":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. 2013. Positional information, in bits. PNAS. 110(41), 16301–16308.","mla":"Dubuis, Julien, et al. “Positional Information, in Bits.” <i>PNAS</i>, vol. 110, no. 41, National Academy of Sciences, 2013, pp. 16301–08, doi:<a href=\"https://doi.org/10.1073/pnas.1315642110\">10.1073/pnas.1315642110</a>.","short":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, W. Bialek, PNAS 110 (2013) 16301–16308.","ama":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. Positional information, in bits. <i>PNAS</i>. 2013;110(41):16301-16308. doi:<a href=\"https://doi.org/10.1073/pnas.1315642110\">10.1073/pnas.1315642110</a>"}},{"status":"public","issue":"19","day":"30","article_type":"original","citation":{"ista":"Li W, Zamani R, Rivera Gil P, Pelaz B, Ibáñez M, Cadavid D, Shavel A, Alvarez Puebla R, Parak W, Arbiol J, Cabot A. 2013. CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents. Journal of the American Chemical Society. 135(19), 7098–7101.","short":"W. Li, R. Zamani, P. Rivera Gil, B. Pelaz, M. Ibáñez, D. Cadavid, A. Shavel, R. Alvarez Puebla, W. Parak, J. Arbiol, A. Cabot, Journal of the American Chemical Society 135 (2013) 7098–7101.","mla":"Li, Wenhua, et al. “CuTe Nanocrystals: Shape and Size Control, Plasmonic Properties, and Use as SERS Probes and Photothermal Agents.” <i>Journal of the American Chemical Society</i>, vol. 135, no. 19, ACS, 2013, pp. 7098–101, doi:<a href=\"https://doi.org/10.1021/ja401428e\">10.1021/ja401428e</a>.","ama":"Li W, Zamani R, Rivera Gil P, et al. CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents. <i>Journal of the American Chemical Society</i>. 2013;135(19):7098-7101. doi:<a href=\"https://doi.org/10.1021/ja401428e\">10.1021/ja401428e</a>","apa":"Li, W., Zamani, R., Rivera Gil, P., Pelaz, B., Ibáñez, M., Cadavid, D., … Cabot, A. (2013). CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja401428e\">https://doi.org/10.1021/ja401428e</a>","chicago":"Li, Wenhua, Reza Zamani, Pilar Rivera Gil, Beatriz Pelaz, Maria Ibáñez, Doris Cadavid, Alexey Shavel, et al. “CuTe Nanocrystals: Shape and Size Control, Plasmonic Properties, and Use as SERS Probes and Photothermal Agents.” <i>Journal of the American Chemical Society</i>. ACS, 2013. <a href=\"https://doi.org/10.1021/ja401428e\">https://doi.org/10.1021/ja401428e</a>.","ieee":"W. Li <i>et al.</i>, “CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents,” <i>Journal of the American Chemical Society</i>, vol. 135, no. 19. ACS, pp. 7098–7101, 2013."},"month":"04","language":[{"iso":"eng"}],"volume":135,"page":"7098 - 7101","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","_id":"331","intvolume":"       135","year":"2013","publication_status":"published","date_published":"2013-04-30T00:00:00Z","author":[{"last_name":"Li","first_name":"Wenhua","full_name":"Li, Wenhua"},{"first_name":"Reza","last_name":"Zamani","full_name":"Zamani, Reza"},{"last_name":"Rivera Gil","first_name":"Pilar","full_name":"Rivera Gil, Pilar"},{"last_name":"Pelaz","first_name":"Beatriz","full_name":"Pelaz, Beatriz"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"last_name":"Shavel","first_name":"Alexey","full_name":"Shavel, Alexey"},{"full_name":"Alvarez Puebla, Ramon","first_name":"Ramon","last_name":"Alvarez Puebla"},{"last_name":"Parak","first_name":"Wolfgang","full_name":"Parak, Wolfgang"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"article_processing_charge":"No","doi":"10.1021/ja401428e","date_updated":"2021-01-12T07:42:33Z","abstract":[{"text":"We report a procedure to prepare highly monodisperse copper telluride nanocubes, nanoplates, and nanorods. The procedure is based on the reaction of a copper salt with trioctylphosphine telluride in the presence of lithium bis(trimethylsilyl)amide and oleylamine. CuTe nanocrystals display a strong near-infrared optical absorption associated with localized surface plasmon resonances. We exploit this plasmon resonance for the design of surface-enhanced Raman scattering sensors for unconventional optical probes. Furthermore, we also report here our preliminary analysis of the use of CuTe nanocrystals as cytotoxic and photothermal agents.","lang":"eng"}],"quality_controlled":"1","extern":"1","publication":"Journal of the American Chemical Society","title":"CuTe nanocrystals: Shape and size control, plasmonic properties, and use as SERS probes and photothermal agents","publisher":"ACS","date_created":"2018-12-11T11:45:51Z","oa_version":"None","publist_id":"7521"},{"type":"encyclopedia_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1069 - 1069","volume":3,"publication_status":"published","year":"2013","intvolume":"         3","_id":"3321","day":"01","status":"public","language":[{"iso":"eng"}],"month":"01","citation":{"ama":"Quadrianto N, Lampert C. Kernel based learning. In: Dubitzky W, Wolkenhauer O, Cho K, Yokota H, eds. <i>Encyclopedia of Systems Biology</i>. Vol 3. Springer; 2013:1069-1069. doi:<a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">10.1007/978-1-4419-9863-7_604</a>","short":"N. Quadrianto, C. Lampert, in:, W. Dubitzky, O. Wolkenhauer, K. Cho, H. Yokota (Eds.), Encyclopedia of Systems Biology, Springer, 2013, pp. 1069–1069.","mla":"Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” <i>Encyclopedia of Systems Biology</i>, edited by Werner Dubitzky et al., vol. 3, Springer, 2013, pp. 1069–1069, doi:<a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">10.1007/978-1-4419-9863-7_604</a>.","ista":"Quadrianto N, Lampert C. 2013.Kernel based learning. In: Encyclopedia of Systems Biology. vol. 3, 1069–1069.","ieee":"N. Quadrianto and C. Lampert, “Kernel based learning,” in <i>Encyclopedia of Systems Biology</i>, vol. 3, W. Dubitzky, O. Wolkenhauer, K. Cho, and H. Yokota, Eds. Springer, 2013, pp. 1069–1069.","chicago":"Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” In <i>Encyclopedia of Systems Biology</i>, edited by Werner Dubitzky, Olaf Wolkenhauer, Kwang Cho, and Hiroki Yokota, 3:1069–1069. Springer, 2013. <a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">https://doi.org/10.1007/978-1-4419-9863-7_604</a>.","apa":"Quadrianto, N., &#38; Lampert, C. (2013). Kernel based learning. In W. Dubitzky, O. Wolkenhauer, K. Cho, &#38; H. Yokota (Eds.), <i>Encyclopedia of Systems Biology</i> (Vol. 3, pp. 1069–1069). Springer. <a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">https://doi.org/10.1007/978-1-4419-9863-7_604</a>"},"publisher":"Springer","department":[{"_id":"ChLa"}],"title":"Kernel based learning","publication":"Encyclopedia of Systems Biology","publist_id":"3314","oa_version":"None","date_created":"2018-12-11T12:02:39Z","doi":"10.1007/978-1-4419-9863-7_604","date_updated":"2021-01-12T07:42:38Z","editor":[{"last_name":"Dubitzky","first_name":"Werner","full_name":"Dubitzky, Werner"},{"full_name":"Wolkenhauer, Olaf","last_name":"Wolkenhauer","first_name":"Olaf"},{"full_name":"Cho, Kwang","last_name":"Cho","first_name":"Kwang"},{"full_name":"Yokota, Hiroki","last_name":"Yokota","first_name":"Hiroki"}],"author":[{"full_name":"Quadrianto, Novi","first_name":"Novi","last_name":"Quadrianto"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2013-01-01T00:00:00Z","quality_controlled":"1"},{"volume":58,"type":"conference","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10749","year":"2013","oa":1,"acknowledgement":"This work was supported by the Center for Emergent Superconductivity, an Energy Frontier Research Center funded by the US DOE, Office of Science.","status":"public","issue":"1","citation":{"ieee":"H. Polshyn, R. Budakian, and G. Gu, “Cantilever micro-susceptometry of mesoscopic Bi2212 samples,” in <i>APS March Meeting 2013</i>, Baltimore, MD, United States, 2013, vol. 58, no. 1.","chicago":"Polshyn, Hryhoriy, Raffi Budakian, and Genda Gu. “Cantilever Micro-Susceptometry of Mesoscopic Bi2212 Samples.” In <i>APS March Meeting 2013</i>, Vol. 58. American Physical Society, 2013.","apa":"Polshyn, H., Budakian, R., &#38; Gu, G. (2013). Cantilever micro-susceptometry of mesoscopic Bi2212 samples. In <i>APS March Meeting 2013</i> (Vol. 58). Baltimore, MD, United States: American Physical Society.","ama":"Polshyn H, Budakian R, Gu G. Cantilever micro-susceptometry of mesoscopic Bi2212 samples. In: <i>APS March Meeting 2013</i>. Vol 58. American Physical Society; 2013.","ista":"Polshyn H, Budakian R, Gu G. 2013. Cantilever micro-susceptometry of mesoscopic Bi2212 samples. APS March Meeting 2013. APS: American Physical Society, Bulletin of the American Physical Society, vol. 58, N36.00001.","mla":"Polshyn, Hryhoriy, et al. “Cantilever Micro-Susceptometry of Mesoscopic Bi2212 Samples.” <i>APS March Meeting 2013</i>, vol. 58, no. 1, N36.00001, American Physical Society, 2013.","short":"H. Polshyn, R. Budakian, G. Gu, in:, APS March Meeting 2013, American Physical Society, 2013."},"publication_identifier":{"issn":["0003-0503"]},"title":"Cantilever micro-susceptometry of mesoscopic Bi2212 samples","publication":"APS March Meeting 2013","publisher":"American Physical Society","oa_version":"Published Version","date_created":"2022-02-08T10:34:29Z","abstract":[{"lang":"eng","text":"Fluxoid quantization provides a direct means to study phase coherence. In cuprate superconductors, there have been observations which suggest that phase coherent superconducting fluctuations may persist at temperatures significantly above Tc. The focus of this work is to study the vortex states in mesoscopic cuprate superconducting samples to directly probe phase coherence over a wide range of temperatures. We present cantilever torque susceptometry measurements of micron and sub-micron size Bi2212 rings and disks. The high sensitivity of this technique allowed observation of transitions between different fluxoid states of a single ring, and the discrete vortex states of micron size disks. The dependence of magnetic susceptibility on diameter and wall thickness of the ring was investigated. Measurements were made at different values of the in-plane magnetic field, and over a wide range of temperatures."}],"extern":"1","intvolume":"        58","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR13/Event/186873"}],"publication_status":"published","day":"01","language":[{"iso":"eng"}],"month":"03","article_number":"N36.00001","conference":{"end_date":"2013-03-22","name":"APS: American Physical Society","start_date":"2013-03-18","location":"Baltimore, MD, United States"},"date_published":"2013-03-01T00:00:00Z","author":[{"first_name":"Hryhoriy","last_name":"Polshyn","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"full_name":"Budakian, Raffi","first_name":"Raffi","last_name":"Budakian"},{"full_name":"Gu, Genda","last_name":"Gu","first_name":"Genda"}],"date_updated":"2022-02-08T10:48:06Z","alternative_title":["Bulletin of the American Physical Society"],"article_processing_charge":"No","quality_controlled":"1"},{"article_processing_charge":"No","date_updated":"2022-03-21T12:15:29Z","doi":"10.3390/plants2040650","date_published":"2013-10-21T00:00:00Z","author":[{"first_name":"Steffen","last_name":"Vanneste","full_name":"Vanneste, Steffen"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"}],"quality_controlled":"1","keyword":["Plant Science","Ecology","Ecology","Evolution","Behavior and Systematics"],"scopus_import":"1","file_date_updated":"2022-03-21T12:12:56Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"ddc":["580"],"day":"21","pmid":1,"month":"10","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by/3.0/","file":[{"relation":"main_file","access_level":"open_access","creator":"dernst","content_type":"application/pdf","success":1,"date_created":"2022-03-21T12:12:56Z","file_id":"10916","date_updated":"2022-03-21T12:12:56Z","file_size":670188,"file_name":"2013_Plants_Vanneste.pdf","checksum":"fb4ff2e820e344e253c9197544610be6"}],"publication_status":"published","intvolume":"         2","abstract":[{"lang":"eng","text":"Due to their sessile lifestyles, plants need to deal with the limitations and stresses imposed by the changing environment. Plants cope with these by a remarkable developmental flexibility, which is embedded in their strategy to survive. Plants can adjust their size, shape and number of organs, bend according to gravity and light, and regenerate tissues that were damaged, utilizing a coordinating, intercellular signal, the plant hormone, auxin. Another versatile signal is the cation, Ca2+, which is a crucial second messenger for many rapid cellular processes during responses to a wide range of endogenous and environmental signals, such as hormones, light, drought stress and others. Auxin is a good candidate for one of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling is poorly understood. Here, we will provide an overview of possible developmental and physiological roles, as well as mechanisms underlying the interconnection of Ca2+ and auxin signaling. "}],"publisher":"MDPI","publication":"Plants","department":[{"_id":"JiFr"}],"title":"Calcium: The missing link in auxin action","date_created":"2022-03-21T07:13:49Z","oa_version":"Published Version","issue":"4","external_id":{"pmid":["27137397"]},"article_type":"original","oa":1,"status":"public","publication_identifier":{"issn":["2223-7747"]},"citation":{"ama":"Vanneste S, Friml J. Calcium: The missing link in auxin action. <i>Plants</i>. 2013;2(4):650-675. doi:<a href=\"https://doi.org/10.3390/plants2040650\">10.3390/plants2040650</a>","ista":"Vanneste S, Friml J. 2013. Calcium: The missing link in auxin action. Plants. 2(4), 650–675.","mla":"Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.” <i>Plants</i>, vol. 2, no. 4, MDPI, 2013, pp. 650–75, doi:<a href=\"https://doi.org/10.3390/plants2040650\">10.3390/plants2040650</a>.","short":"S. Vanneste, J. Friml, Plants 2 (2013) 650–675.","ieee":"S. Vanneste and J. Friml, “Calcium: The missing link in auxin action,” <i>Plants</i>, vol. 2, no. 4. MDPI, pp. 650–675, 2013.","chicago":"Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.” <i>Plants</i>. MDPI, 2013. <a href=\"https://doi.org/10.3390/plants2040650\">https://doi.org/10.3390/plants2040650</a>.","apa":"Vanneste, S., &#38; Friml, J. (2013). Calcium: The missing link in auxin action. <i>Plants</i>. MDPI. <a href=\"https://doi.org/10.3390/plants2040650\">https://doi.org/10.3390/plants2040650</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":2,"page":"650-675","year":"2013","has_accepted_license":"1","_id":"10895"},{"abstract":[{"text":"Taking images is an efficient way to collect data about the physical world. It can be done fast and in exquisite detail. By definition, image processing is the field that concerns itself with the computation aimed at harnessing the information contained in images [10]. This talk is concerned with topological information. Our main thesis is that persistent homology [5] is a useful method to quantify and summarize topological information, building a bridge that connects algebraic topology with applications. We provide supporting evidence for this thesis by touching upon four technical developments in the overlap between persistent homology and image processing.","lang":"eng"}],"series_title":"LNCS","date_created":"2022-03-21T07:30:33Z","ec_funded":1,"oa_version":"None","publication":"Graph-Based Representations in Pattern Recognition","department":[{"_id":"HeEd"}],"title":"Persistent homology in image processing","publisher":"Springer Nature","citation":{"apa":"Edelsbrunner, H. (2013). Persistent homology in image processing. In <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 7877, pp. 182–183). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">https://doi.org/10.1007/978-3-642-38221-5_19</a>","chicago":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In <i>Graph-Based Representations in Pattern Recognition</i>, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">https://doi.org/10.1007/978-3-642-38221-5_19</a>.","ieee":"H. Edelsbrunner, “Persistent homology in image processing,” in <i>Graph-Based Representations in Pattern Recognition</i>, Vienna, Austria, 2013, vol. 7877, pp. 182–183.","mla":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” <i>Graph-Based Representations in Pattern Recognition</i>, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">10.1007/978-3-642-38221-5_19</a>.","ista":"Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183.","short":"H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.","ama":"Edelsbrunner H. Persistent homology in image processing. In: <i>Graph-Based Representations in Pattern Recognition</i>. Vol 7877. LNCS. Berlin, Heidelberg: Springer Nature; 2013:182-183. doi:<a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">10.1007/978-3-642-38221-5_19</a>"},"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783642382215"],"eissn":["1611-3349"],"isbn":["9783642382208"]},"status":"public","acknowledgement":"This research is partially supported by the European Science Foundation (ESF) under the Research Network Programme, the European Union under the Toposys Project FP7-ICT-318493-STREP, the Russian Government under the Mega Project 11.G34.31.0053.","place":"Berlin, Heidelberg","_id":"10897","year":"2013","volume":7877,"page":"182-183","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","scopus_import":"1","quality_controlled":"1","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_published":"2013-06-01T00:00:00Z","article_processing_charge":"No","date_updated":"2023-09-05T15:10:20Z","doi":"10.1007/978-3-642-38221-5_19","conference":{"end_date":"2013-05-17","name":"GbRPR: Graph-based Representations in Pattern Recognition","start_date":"2013-05-15","location":"Vienna, Austria"},"month":"06","project":[{"grant_number":"318493","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"day":"01","intvolume":"      7877","publication_status":"published"},{"scopus_import":"1","abstract":[{"lang":"eng","text":"A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered."}],"quality_controlled":"1","author":[{"last_name":"Haas","first_name":"Andreas","full_name":"Haas, Andreas"},{"full_name":"Lippautz, Michael","last_name":"Lippautz","first_name":"Michael"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Payer","first_name":"Hannes","full_name":"Payer, Hannes"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"},{"full_name":"Kirsch, Christoph M.","first_name":"Christoph M.","last_name":"Kirsch"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2013-05-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-06-21T08:01:19Z","doi":"10.1145/2482767.2482789","conference":{"end_date":"2013-05-16","name":"CF: Conference on Computing Frontiers","start_date":"2013-05-14","location":"Ischia, Italy"},"date_created":"2022-03-21T07:33:22Z","oa_version":"None","publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13","title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation","department":[{"_id":"ToHe"}],"publisher":"ACM Press","article_number":"17","citation":{"apa":"Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., &#38; Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. Ischia, Italy: ACM Press. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>","chicago":"Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press, 2013. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>.","ieee":"A. Haas <i>et al.</i>, “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, Ischia, Italy, 2013, no. 5.","ista":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.","mla":"Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, no. 5, 17, ACM Press, 2013, doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>.","short":"A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.","ama":"Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press; 2013. doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>"},"month":"05","publication_identifier":{"isbn":["978-145032053-5"]},"language":[{"iso":"eng"}],"status":"public","issue":"5","day":"01","_id":"10898","year":"2013","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference"},{"publication":"Encyclopedia of Biodiversity","title":"Differentiation","department":[{"_id":"NiBa"}],"publisher":"Elsevier","date_created":"2022-03-21T07:46:22Z","oa_version":"None","date_published":"2013-01-01T00:00:00Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"article_processing_charge":"No","doi":"10.1016/b978-0-12-384719-5.00031-9","date_updated":"2022-06-20T09:18:06Z","keyword":["Adaptive landscape","Cline","Coalescent process","Gene flow","Hybrid zone","Local adaptation","Natural selection","Neutral theory","Population structure","Speciation"],"scopus_import":"1","quality_controlled":"1","edition":"2","page":"508-515","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","_id":"10899","year":"2013","publication_status":"published","status":"public","day":"01","citation":{"ista":"Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.","short":"N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013, pp. 508–515.","mla":"Barton, Nicholas H. “Differentiation.” <i>Encyclopedia of Biodiversity</i>, 2nd ed., Elsevier, 2013, pp. 508–15, doi:<a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">10.1016/b978-0-12-384719-5.00031-9</a>.","ama":"Barton NH. Differentiation. In: <i>Encyclopedia of Biodiversity</i>. 2nd ed. Elsevier; 2013:508-515. doi:<a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">10.1016/b978-0-12-384719-5.00031-9</a>","apa":"Barton, N. H. (2013). Differentiation. In <i>Encyclopedia of Biodiversity</i> (2nd ed., pp. 508–515). Elsevier. <a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">https://doi.org/10.1016/b978-0-12-384719-5.00031-9</a>","chicago":"Barton, Nicholas H. “Differentiation.” In <i>Encyclopedia of Biodiversity</i>, 2nd ed., 508–15. Elsevier, 2013. <a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">https://doi.org/10.1016/b978-0-12-384719-5.00031-9</a>.","ieee":"N. H. Barton, “Differentiation,” in <i>Encyclopedia of Biodiversity</i>, 2nd ed., Elsevier, 2013, pp. 508–515."},"month":"01","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-12-384720-1"]}},{"series_title":"MIMB","abstract":[{"lang":"eng","text":"Leukocyte migration through the interstitial space is crucial for the maintenance of tolerance and immunity. The main cues for leukocyte trafficking are chemokines thought to directionally guide these cells towards their targets. However, model systems that facilitate quantification of chemokine-guided leukocyte migration in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted mouse ears that allows the visualization of chemokine-dependent dendritic cell (DC) motility in the dermal interstitium in real time. We present methods for the preparation of mouse ear sheets and their use in multidimensional confocal imaging experiments to monitor and analyze the directional migration of fluorescently labelled DCs through the dermis and into afferent lymphatic vessels. The assay provides a more physiological approach to study leukocyte migration than in vitro three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen gels and transwell assays."}],"date_created":"2022-03-21T07:47:41Z","oa_version":"None","publisher":"Humana Press","publication":"Chemokines","title":"Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations","department":[{"_id":"MiSi"}],"publication_identifier":{"issn":["1064-3745"],"eissn":["1940-6029"],"eisbn":["9781627034265"],"isbn":["9781627034258"]},"citation":{"apa":"Weber, M., &#38; Sixt, M. K. (2013). Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In A. Cardona &#38; E. Ubogu (Eds.), <i>Chemokines</i> (Vol. 1013, pp. 215–226). Totowa, NJ: Humana Press. <a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">https://doi.org/10.1007/978-1-62703-426-5_14</a>","ieee":"M. Weber and M. K. Sixt, “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations,” in <i>Chemokines</i>, vol. 1013, A. Cardona and E. Ubogu, Eds. Totowa, NJ: Humana Press, 2013, pp. 215–226.","chicago":"Weber, Michele, and Michael K Sixt. “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations.” In <i>Chemokines</i>, edited by Astrid Cardona and Eroboghene Ubogu, 1013:215–26. MIMB. Totowa, NJ: Humana Press, 2013. <a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">https://doi.org/10.1007/978-1-62703-426-5_14</a>.","short":"M. Weber, M.K. Sixt, in:, A. Cardona, E. Ubogu (Eds.), Chemokines, Humana Press, Totowa, NJ, 2013, pp. 215–226.","ista":"Weber M, Sixt MK. 2013.Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In: Chemokines. Methods in Molecular Biology, vol. 1013, 215–226.","mla":"Weber, Michele, and Michael K. Sixt. “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations.” <i>Chemokines</i>, edited by Astrid Cardona and Eroboghene Ubogu, vol. 1013, Humana Press, 2013, pp. 215–26, doi:<a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">10.1007/978-1-62703-426-5_14</a>.","ama":"Weber M, Sixt MK. Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In: Cardona A, Ubogu E, eds. <i>Chemokines</i>. Vol 1013. MIMB. Totowa, NJ: Humana Press; 2013:215-226. doi:<a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">10.1007/978-1-62703-426-5_14</a>"},"external_id":{"pmid":["23625502"]},"status":"public","acknowledgement":"We would like to thank Alexander Eichner and Ingrid de Vries for discussion and critical reading of the manuscript, and Mary Frank for assistance with the recording of videos and images in Fig. 1. M.S. is supported through funding from the German Research Foundation (DFG). M.W. acknowledges the Alexander von Humboldt Foundation for funding.","year":"2013","place":"Totowa, NJ","_id":"10900","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"book_chapter","volume":1013,"page":"215-226","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","alternative_title":["Methods in Molecular Biology"],"date_updated":"2023-09-05T13:15:33Z","doi":"10.1007/978-1-62703-426-5_14","date_published":"2013-04-03T00:00:00Z","author":[{"last_name":"Weber","first_name":"Michele","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87","full_name":"Weber, Michele"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt"}],"editor":[{"last_name":"Cardona","first_name":"Astrid","full_name":"Cardona, Astrid"},{"full_name":"Ubogu, Eroboghene","last_name":"Ubogu","first_name":"Eroboghene"}],"month":"04","language":[{"iso":"eng"}],"day":"03","pmid":1,"publication_status":"published","intvolume":"      1013"},{"publication_status":"published","intvolume":"      7810","month":"04","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"day":"15","conference":{"location":"Bilbao, Spain","start_date":"2013-04-02","name":"LATA: Conference on Language and Automata Theory and Applications","end_date":"2013-04-05"},"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-37064-9_20","date_updated":"2023-09-05T15:10:38Z","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Chaubal","first_name":"Siddhesh","full_name":"Chaubal, Siddhesh"},{"first_name":"Sasha","last_name":"Rubin","full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2013-04-15T00:00:00Z","year":"2013","place":"Berlin, Heidelberg","_id":"10902","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","volume":7810,"page":"214-225","publication_identifier":{"isbn":["9783642370632"],"eisbn":["9783642370649"],"eissn":["1611-3349"],"issn":["0302-9743"]},"citation":{"apa":"Chatterjee, K., Chaubal, S., &#38; Rubin, S. (2013). How to travel between languages. In <i>7th International Conference on Language and Automata Theory and Applications</i> (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>","ieee":"K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,” in <i>7th International Conference on Language and Automata Theory and Applications</i>, Bilbao, Spain, 2013, vol. 7810, pp. 214–225.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In <i>7th International Conference on Language and Automata Theory and Applications</i>, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>.","mla":"Chatterjee, Krishnendu, et al. “How to Travel between Languages.” <i>7th International Conference on Language and Automata Theory and Applications</i>, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>.","short":"K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.","ista":"Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.","ama":"Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: <i>7th International Conference on Language and Automata Theory and Applications</i>. Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>"},"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting the problem of identifying a deterministic transducer to compute the optimal cost, and to Martin Chmelik for his comments on the introduction.","status":"public","ec_funded":1,"date_created":"2022-03-21T07:56:21Z","oa_version":"None","publisher":"Springer Nature","publication":"7th International Conference on Language and Automata Theory and Applications","title":"How to travel between languages","department":[{"_id":"KrCh"}],"series_title":"LNCS","abstract":[{"lang":"eng","text":"We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language."}]},{"publication_status":"published","intvolume":"        23","day":"01","pmid":1,"month":"03","language":[{"iso":"eng"}],"article_processing_charge":"No","doi":"10.1016/j.tcb.2012.10.013","date_updated":"2022-07-18T08:45:34Z","author":[{"last_name":"Franks","first_name":"Tobias M.","full_name":"Franks, Tobias M."},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X","first_name":"Martin W"}],"date_published":"2013-03-01T00:00:00Z","quality_controlled":"1","keyword":["Cell Biology"],"scopus_import":"1","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","type":"journal_article","volume":23,"page":"112-117","year":"2013","_id":"11083","issue":"3","article_type":"letter_note","external_id":{"pmid":["23246429"]},"status":"public","publication_identifier":{"issn":["0962-8924"]},"citation":{"apa":"Franks, T. M., &#38; Hetzer, M. (2013). The role of Nup98 in transcription regulation in healthy and diseased cells. <i>Trends in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">https://doi.org/10.1016/j.tcb.2012.10.013</a>","ieee":"T. M. Franks and M. Hetzer, “The role of Nup98 in transcription regulation in healthy and diseased cells,” <i>Trends in Cell Biology</i>, vol. 23, no. 3. Elsevier, pp. 112–117, 2013.","chicago":"Franks, Tobias M., and Martin Hetzer. “The Role of Nup98 in Transcription Regulation in Healthy and Diseased Cells.” <i>Trends in Cell Biology</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">https://doi.org/10.1016/j.tcb.2012.10.013</a>.","short":"T.M. Franks, M. Hetzer, Trends in Cell Biology 23 (2013) 112–117.","ista":"Franks TM, Hetzer M. 2013. The role of Nup98 in transcription regulation in healthy and diseased cells. Trends in Cell Biology. 23(3), 112–117.","mla":"Franks, Tobias M., and Martin Hetzer. “The Role of Nup98 in Transcription Regulation in Healthy and Diseased Cells.” <i>Trends in Cell Biology</i>, vol. 23, no. 3, Elsevier, 2013, pp. 112–17, doi:<a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">10.1016/j.tcb.2012.10.013</a>.","ama":"Franks TM, Hetzer M. The role of Nup98 in transcription regulation in healthy and diseased cells. <i>Trends in Cell Biology</i>. 2013;23(3):112-117. doi:<a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">10.1016/j.tcb.2012.10.013</a>"},"publisher":"Elsevier","publication":"Trends in Cell Biology","title":"The role of Nup98 in transcription regulation in healthy and diseased cells","date_created":"2022-04-07T07:50:33Z","oa_version":"None","extern":"1","abstract":[{"lang":"eng","text":"Nuclear pore complex (NPC) proteins are known for their critical roles in regulating nucleocytoplasmic traffic of macromolecules across the nuclear envelope. However, recent findings suggest that some nucleoporins (Nups), including Nup98, have additional functions in developmental gene regulation. Nup98, which exhibits transcription-dependent mobility at the NPC but can also bind chromatin away from the nuclear envelope, is frequently involved in chromosomal translocations in a subset of patients suffering from acute myeloid leukemia (AML). A common paradigm suggests that Nup98 translocations cause aberrant transcription when they are recuited to aberrant genomic loci. Importantly, this model fails to account for the potential loss of wild type (WT) Nup98 function in the presence of Nup98 translocation mutants. Here we examine how the cell might regulate Nup98 nucleoplasmic protein levels to control transcription in healthy cells. In addition, we discuss the possibility that dominant negative Nup98 fusion proteins disrupt the transcriptional activity of WT Nup98 in the nucleoplasm to drive AML."}]}]