[{"quality_controlled":0,"day":"25","status":"public","_id":"3099","date_created":"2018-12-11T12:01:23Z","type":"journal_article","abstract":[{"lang":"eng","text":"Endomembrane trafficking relies on the coordination of a highly complex, dynamic network of intracellular vesicles. Understanding the network will require a dissection of cargo and vesicle dynamics at the cellular level in vivo. This is also a key to establishing a link between vesicular networks and their functional roles in development. We used a high-content intracellular screen to discover small molecules targeting endomembrane trafficking in vivo in a complex eukaryote, Arabidopsis thaliana. Tens of thousands of molecules were prescreened and a selected subset was interrogated against a panel of plasma membrane (PM) and other endomembrane compartment markers to identify molecules that altered vesicle trafficking. The extensive image dataset was transformed by a flexible algorithm into a marker-by-phenotype-by-treatment time matrix and revealed groups of molecules that induced similar subcellular fingerprints (clusters). This matrix provides a platform for a systems view of trafficking. Molecules from distinct clusters presented avenues and enabled an entry point to dissect recycling at the PM, vacuolar sorting, and cell-plate maturation. Bioactivity in human cells indicated the value of the approach to identifying small molecules that are active in diverse organisms for biology and drug discovery."}],"extern":1,"citation":{"apa":"Drakakaki, G., Robert, S., Szatmári, A., Brown, M., Nagawa, S., Van Damme, D., … Hicks, G. (2011). Clusters of bioactive compounds target dynamic endomembrane networks in vivo. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1108581108\">https://doi.org/10.1073/pnas.1108581108</a>","mla":"Drakakaki, Georgia, et al. “Clusters of Bioactive Compounds Target Dynamic Endomembrane Networks in Vivo.” <i>PNAS</i>, vol. 108, no. 43, National Academy of Sciences, 2011, pp. 17850–55, doi:<a href=\"https://doi.org/10.1073/pnas.1108581108\">10.1073/pnas.1108581108</a>.","ama":"Drakakaki G, Robert S, Szatmári A, et al. Clusters of bioactive compounds target dynamic endomembrane networks in vivo. <i>PNAS</i>. 2011;108(43):17850-17855. doi:<a href=\"https://doi.org/10.1073/pnas.1108581108\">10.1073/pnas.1108581108</a>","ista":"Drakakaki G, Robert S, Szatmári A, Brown M, Nagawa S, Van Damme D, Leonard M, Yang Z, Girke T, Schmid S, Russinova E, Friml J, Raikhel N, Hicks G. 2011. Clusters of bioactive compounds target dynamic endomembrane networks in vivo. PNAS. 108(43), 17850–17855.","short":"G. Drakakaki, S. Robert, A. Szatmári, M. Brown, S. Nagawa, D. Van Damme, M. Leonard, Z. Yang, T. Girke, S. Schmid, E. Russinova, J. Friml, N. Raikhel, G. Hicks, PNAS 108 (2011) 17850–17855.","ieee":"G. Drakakaki <i>et al.</i>, “Clusters of bioactive compounds target dynamic endomembrane networks in vivo,” <i>PNAS</i>, vol. 108, no. 43. National Academy of Sciences, pp. 17850–17855, 2011.","chicago":"Drakakaki, Georgia, Stéphanie Robert, Anna Szatmári, Michelle Brown, Shingo Nagawa, Daniël Van Damme, Marylin Leonard, et al. “Clusters of Bioactive Compounds Target Dynamic Endomembrane Networks in Vivo.” <i>PNAS</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1108581108\">https://doi.org/10.1073/pnas.1108581108</a>."},"volume":108,"publication_status":"published","doi":"10.1073/pnas.1108581108","publication":"PNAS","issue":"43","author":[{"first_name":"Georgia","last_name":"Drakakaki","full_name":"Drakakaki, Georgia"},{"full_name":"Robert, Stéphanie","last_name":"Robert","first_name":"Stéphanie"},{"last_name":"Szatmári","first_name":"Anna","full_name":"Szatmári, Anna-Maria"},{"first_name":"Michelle","last_name":"Brown","full_name":"Brown, Michelle Q"},{"full_name":"Nagawa, Shingo","last_name":"Nagawa","first_name":"Shingo"},{"last_name":"Van Damme","first_name":"Daniël","full_name":"Van Damme, Daniël"},{"full_name":"Leonard, Marylin","first_name":"Marylin","last_name":"Leonard"},{"last_name":"Yang","first_name":"Zhenbiao","full_name":"Yang, Zhenbiao"},{"full_name":"Girke, Thomas","first_name":"Thomas","last_name":"Girke"},{"full_name":"Schmid, Sandra L","last_name":"Schmid","first_name":"Sandra"},{"first_name":"Eugenia","last_name":"Russinova","full_name":"Russinova, Eugenia"},{"full_name":"Jirí Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"full_name":"Raikhel, Natasha V","first_name":"Natasha","last_name":"Raikhel"},{"full_name":"Hicks, Glen R","first_name":"Glen","last_name":"Hicks"}],"title":"Clusters of bioactive compounds target dynamic endomembrane networks in vivo","date_updated":"2021-01-12T07:41:02Z","publisher":"National Academy of Sciences","month":"10","intvolume":"       108","date_published":"2011-10-25T00:00:00Z","year":"2011","publist_id":"3602","page":"17850 - 17855"},{"doi":"10.1038/emboj.2011.240","publication_status":"published","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3160660/","open_access":"1"}],"publication":"EMBO Journal","_id":"3100","date_created":"2018-12-11T12:01:23Z","day":"17","status":"public","quality_controlled":0,"extern":1,"citation":{"chicago":"Vanneste, Steffen, Frederik Coppens, Eunkyoung Lee, Tyler Donner, Zidian Xie, Gert Van Isterdael, Stijn Dhondt, et al. “Developmental Regulation of CYCA2s Contributes to Tissue-Specific Proliferation in Arabidopsis .” <i>EMBO Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1038/emboj.2011.240\">https://doi.org/10.1038/emboj.2011.240</a>.","ama":"Vanneste S, Coppens F, Lee E, et al. Developmental regulation of CYCA2s contributes to tissue-specific proliferation in Arabidopsis . <i>EMBO Journal</i>. 2011;30(16):3430-3441. doi:<a href=\"https://doi.org/10.1038/emboj.2011.240\">10.1038/emboj.2011.240</a>","ieee":"S. Vanneste <i>et al.</i>, “Developmental regulation of CYCA2s contributes to tissue-specific proliferation in Arabidopsis ,” <i>EMBO Journal</i>, vol. 30, no. 16. Wiley-Blackwell, pp. 3430–3441, 2011.","ista":"Vanneste S, Coppens F, Lee E, Donner T, Xie Z, Van Isterdael G, Dhondt S, De Winter F, De Rybel B, Vuylsteke M, De Veylder L, Friml J, Inzé D, Grotewold E, Scarpella E, Sack F, Beemster G, Beeckman T. 2011. Developmental regulation of CYCA2s contributes to tissue-specific proliferation in Arabidopsis . EMBO Journal. 30(16), 3430–3441.","short":"S. Vanneste, F. Coppens, E. Lee, T. Donner, Z. Xie, G. Van Isterdael, S. Dhondt, F. De Winter, B. De Rybel, M. Vuylsteke, L. De Veylder, J. Friml, D. Inzé, E. Grotewold, E. Scarpella, F. Sack, G. Beemster, T. Beeckman, EMBO Journal 30 (2011) 3430–3441.","mla":"Vanneste, Steffen, et al. “Developmental Regulation of CYCA2s Contributes to Tissue-Specific Proliferation in Arabidopsis .” <i>EMBO Journal</i>, vol. 30, no. 16, Wiley-Blackwell, 2011, pp. 3430–41, doi:<a href=\"https://doi.org/10.1038/emboj.2011.240\">10.1038/emboj.2011.240</a>.","apa":"Vanneste, S., Coppens, F., Lee, E., Donner, T., Xie, Z., Van Isterdael, G., … Beeckman, T. (2011). Developmental regulation of CYCA2s contributes to tissue-specific proliferation in Arabidopsis . <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2011.240\">https://doi.org/10.1038/emboj.2011.240</a>"},"volume":30,"type":"journal_article","abstract":[{"lang":"eng","text":"In multicellular organisms, morphogenesis relies on a strict coordination in time and space of cell proliferation and differentiation. In contrast to animals, plant development displays continuous organ formation and adaptive growth responses during their lifespan relying on a tight coordination of cell proliferation. How developmental signals interact with the plant cell-cycle machinery is largely unknown. Here, we characterize plant A2-type cyclins, a small gene family of mitotic cyclins, and show how they contribute to the fine-tuning of local proliferation during plant development. Moreover, the timely repression of CYCA2;3 expression in newly formed guard cells is shown to require the stomatal transcription factors FOUR LIPS/MYB124 and MYB88, providing a direct link between developmental programming and cell-cycle exit in plants. Thus, transcriptional downregulation of CYCA2s represents a critical mechanism to coordinate proliferation during plant development."}],"year":"2011","page":"3430 - 3441","publist_id":"3600","date_updated":"2021-01-12T07:41:04Z","issue":"16","oa":1,"title":"Developmental regulation of CYCA2s contributes to tissue-specific proliferation in Arabidopsis ","author":[{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"full_name":"Coppens, Frederik","last_name":"Coppens","first_name":"Frederik"},{"full_name":"Lee, EunKyoung","last_name":"Lee","first_name":"Eunkyoung"},{"full_name":"Donner, Tyler J","last_name":"Donner","first_name":"Tyler"},{"full_name":"Xie, Zidian","last_name":"Xie","first_name":"Zidian"},{"last_name":"Van Isterdael","first_name":"Gert","full_name":"Van Isterdael, Gert"},{"last_name":"Dhondt","first_name":"Stijn","full_name":"Dhondt, Stijn"},{"first_name":"Freya","last_name":"De Winter","full_name":"De Winter, Freya"},{"first_name":"Bert","last_name":"De Rybel","full_name":"De Rybel, Bert"},{"full_name":"Vuylsteke, Marnik","last_name":"Vuylsteke","first_name":"Marnik"},{"full_name":"De Veylder, Lieven","first_name":"Lieven","last_name":"De Veylder"},{"full_name":"Jirí Friml","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Inzé, Dirk","last_name":"Inzé","first_name":"Dirk"},{"last_name":"Grotewold","first_name":"Erich","full_name":"Grotewold, Erich"},{"first_name":"Enrico","last_name":"Scarpella","full_name":"Scarpella, Enrico"},{"first_name":"Fred","last_name":"Sack","full_name":"Sack, Fred"},{"full_name":"Beemster, Gerrit T","first_name":"Gerrit","last_name":"Beemster"},{"full_name":"Beeckman, Tom","first_name":"Tom","last_name":"Beeckman"}],"month":"08","intvolume":"        30","date_published":"2011-08-17T00:00:00Z","publisher":"Wiley-Blackwell"},{"citation":{"ieee":"M. Zwiewka <i>et al.</i>, “The AP 3 adaptor complex is required for vacuolar function in Arabidopsis,” <i>Cell Research</i>, vol. 21, no. 12. Nature Publishing Group, pp. 1711–1722, 2011.","short":"M. Zwiewka, E. Feraru, B. Möller, I. Hwang, M. Feraru, J. Kleine Vehn, D. Weijers, J. Friml, Cell Research 21 (2011) 1711–1722.","ista":"Zwiewka M, Feraru E, Möller B, Hwang I, Feraru M, Kleine Vehn J, Weijers D, Friml J. 2011. The AP 3 adaptor complex is required for vacuolar function in Arabidopsis. Cell Research. 21(12), 1711–1722.","ama":"Zwiewka M, Feraru E, Möller B, et al. The AP 3 adaptor complex is required for vacuolar function in Arabidopsis. <i>Cell Research</i>. 2011;21(12):1711-1722. doi:<a href=\"https://doi.org/10.1038/cr.2011.99\">10.1038/cr.2011.99</a>","chicago":"Zwiewka, Marta, Elena Feraru, Barbara Möller, Inhwan Hwang, Mugurel Feraru, Jürgen Kleine Vehn, Dolf Weijers, and Jiří Friml. “The AP 3 Adaptor Complex Is Required for Vacuolar Function in Arabidopsis.” <i>Cell Research</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/cr.2011.99\">https://doi.org/10.1038/cr.2011.99</a>.","apa":"Zwiewka, M., Feraru, E., Möller, B., Hwang, I., Feraru, M., Kleine Vehn, J., … Friml, J. (2011). The AP 3 adaptor complex is required for vacuolar function in Arabidopsis. <i>Cell Research</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/cr.2011.99\">https://doi.org/10.1038/cr.2011.99</a>","mla":"Zwiewka, Marta, et al. “The AP 3 Adaptor Complex Is Required for Vacuolar Function in Arabidopsis.” <i>Cell Research</i>, vol. 21, no. 12, Nature Publishing Group, 2011, pp. 1711–22, doi:<a href=\"https://doi.org/10.1038/cr.2011.99\">10.1038/cr.2011.99</a>."},"extern":1,"volume":21,"type":"journal_article","abstract":[{"lang":"eng","text":"Subcellular trafficking is required for a multitude of functions in eukaryotic cells. It involves regulation of cargo sorting, vesicle formation, trafficking and fusion processes at multiple levels. Adaptor protein (AP) complexes are key regulators of cargo sorting into vesicles in yeast and mammals but their existence and function in plants have not been demonstrated. Here we report the identification of the protein-affected trafficking 4 (pat4) mutant defective in the putative δ subunit of the AP-3 complex. pat4 and pat2, a mutant isolated from the same GFP imaging-based forward genetic screen that lacks a functional putative AP-3 β, as well as dominant negative AP-3 μ transgenic lines display undistinguishable phenotypes characterized by largely normal morphology and development, but strong intracellular accumulation of membrane proteins in aberrant vacuolar structures. All mutants are defective in morphology and function of lytic and protein storage vacuoles (PSVs) but show normal sorting of reserve proteins to PSVs. Immunoprecipitation experiments and genetic studies revealed tight functional and physical associations of putative AP-3 β and AP-3 δ subunits. Furthermore, both proteins are closely linked with putative AP-3 μ and σ subunits and several components of the clathrin and dynamin machineries. Taken together, these results demonstrate that AP complexes, similar to those in other eukaryotes, exist in plants, and that AP-3 plays a specific role in the regulation of biogenesis and function of vacuoles in plant cells. © 2011 IBCB, SIBS, CAS All rights reserved"}],"date_created":"2018-12-11T12:01:23Z","_id":"3101","day":"01","status":"public","quality_controlled":0,"doi":"10.1038/cr.2011.99","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3357998/"}],"publication":"Cell Research","month":"01","intvolume":"        21","date_published":"2011-01-01T00:00:00Z","publisher":"Nature Publishing Group","date_updated":"2021-01-12T07:41:04Z","issue":"12","oa":1,"title":"The AP 3 adaptor complex is required for vacuolar function in Arabidopsis","author":[{"full_name":"Zwiewka, Marta","first_name":"Marta","last_name":"Zwiewka"},{"full_name":"Feraru, Elena","last_name":"Feraru","first_name":"Elena"},{"last_name":"Möller","first_name":"Barbara","full_name":"Möller, Barbara"},{"full_name":"Hwang, Inhwan","last_name":"Hwang","first_name":"Inhwan"},{"full_name":"Feraru, Mugurel I","first_name":"Mugurel","last_name":"Feraru"},{"first_name":"Jürgen","last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen"},{"first_name":"Dolf","last_name":"Weijers","full_name":"Weijers, Dolf"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Jirí Friml"}],"page":"1711 - 1722","publist_id":"3597","year":"2011"},{"month":"10","intvolume":"        23","date_published":"2011-10-14T00:00:00Z","publisher":"American Society of Plant Biologists","date_updated":"2021-01-12T07:41:04Z","issue":"10","title":"Auxin Dependent cell cycle reactivation through transcriptional regulation of arabidopsis E2Fa by lateral organ boundary proteins","author":[{"full_name":"Berckmans, Barbara","last_name":"Berckmans","first_name":"Barbara"},{"last_name":"Vassileva","first_name":"Valya","full_name":"Vassileva, Valya"},{"first_name":"Stephan","last_name":"Schmid","full_name":"Schmid, Stephan P"},{"last_name":"Maes","first_name":"Sara","full_name":"Maes, Sara"},{"first_name":"Boris","last_name":"Parizot","full_name":"Parizot, Boris"},{"full_name":"Naramoto, Satoshi","first_name":"Satoshi","last_name":"Naramoto"},{"first_name":"Zoltan","last_name":"Magyar","full_name":"Magyar, Zoltan"},{"last_name":"Lessa Alvim Kamei","first_name":"Claire","full_name":"Lessa Alvim Kamei, Claire"},{"last_name":"Koncz","first_name":"Csaba","full_name":"Koncz, Csaba"},{"full_name":"Bögre, Laszlo","last_name":"Bögre","first_name":"Laszlo"},{"first_name":"Geert","last_name":"Persiau","full_name":"Persiau, Geert"},{"full_name":"De Jaeger, Geert","last_name":"De Jaeger","first_name":"Geert"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Jirí Friml"},{"full_name":"Simon, Rüdiger","first_name":"Rüdiger","last_name":"Simon"},{"full_name":"Beeckman, Tom","last_name":"Beeckman","first_name":"Tom"},{"full_name":"de Veyldera, Lieven","last_name":"De Veyldera","first_name":"Lieven"}],"page":"3671 - 3683","publist_id":"3598","year":"2011","citation":{"apa":"Berckmans, B., Vassileva, V., Schmid, S., Maes, S., Parizot, B., Naramoto, S., … De Veyldera, L. (2011). Auxin Dependent cell cycle reactivation through transcriptional regulation of arabidopsis E2Fa by lateral organ boundary proteins. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.111.088377\">https://doi.org/10.1105/tpc.111.088377</a>","mla":"Berckmans, Barbara, et al. “Auxin Dependent Cell Cycle Reactivation through Transcriptional Regulation of Arabidopsis E2Fa by Lateral Organ Boundary Proteins.” <i>Plant Cell</i>, vol. 23, no. 10, American Society of Plant Biologists, 2011, pp. 3671–83, doi:<a href=\"https://doi.org/10.1105/tpc.111.088377\">10.1105/tpc.111.088377</a>.","ama":"Berckmans B, Vassileva V, Schmid S, et al. Auxin Dependent cell cycle reactivation through transcriptional regulation of arabidopsis E2Fa by lateral organ boundary proteins. <i>Plant Cell</i>. 2011;23(10):3671-3683. doi:<a href=\"https://doi.org/10.1105/tpc.111.088377\">10.1105/tpc.111.088377</a>","ista":"Berckmans B, Vassileva V, Schmid S, Maes S, Parizot B, Naramoto S, Magyar Z, Lessa Alvim Kamei C, Koncz C, Bögre L, Persiau G, De Jaeger G, Friml J, Simon R, Beeckman T, De Veyldera L. 2011. Auxin Dependent cell cycle reactivation through transcriptional regulation of arabidopsis E2Fa by lateral organ boundary proteins. Plant Cell. 23(10), 3671–3683.","short":"B. Berckmans, V. Vassileva, S. Schmid, S. Maes, B. Parizot, S. Naramoto, Z. Magyar, C. Lessa Alvim Kamei, C. Koncz, L. Bögre, G. Persiau, G. De Jaeger, J. Friml, R. Simon, T. Beeckman, L. De Veyldera, Plant Cell 23 (2011) 3671–3683.","ieee":"B. Berckmans <i>et al.</i>, “Auxin Dependent cell cycle reactivation through transcriptional regulation of arabidopsis E2Fa by lateral organ boundary proteins,” <i>Plant Cell</i>, vol. 23, no. 10. American Society of Plant Biologists, pp. 3671–3683, 2011.","chicago":"Berckmans, Barbara, Valya Vassileva, Stephan Schmid, Sara Maes, Boris Parizot, Satoshi Naramoto, Zoltan Magyar, et al. “Auxin Dependent Cell Cycle Reactivation through Transcriptional Regulation of Arabidopsis E2Fa by Lateral Organ Boundary Proteins.” <i>Plant Cell</i>. American Society of Plant Biologists, 2011. <a href=\"https://doi.org/10.1105/tpc.111.088377\">https://doi.org/10.1105/tpc.111.088377</a>."},"extern":1,"volume":23,"type":"journal_article","abstract":[{"lang":"eng","text":"Multicellular organisms depend on cell production, cell fate specification, and correct patterning to shape their adult body. In plants, auxin plays a prominent role in the timely coordination of these different cellular processes. A well-studied example is lateral root initiation, in which auxin triggers founder cell specification and cell cycle activation of xylem pole–positioned pericycle cells. Here, we report that the E2Fa transcription factor of Arabidopsis thaliana is an essential component that regulates the asymmetric cell division marking lateral root initiation. Moreover, we demonstrate that E2Fa expression is regulated by the LATERAL ORGAN BOUNDARY DOMAIN18/LATERAL ORGAN BOUNDARY DOMAIN33 (LBD18/LBD33) dimer that is, in turn, regulated by the auxin signaling pathway. LBD18/LBD33 mediates lateral root organogenesis through E2Fa transcriptional activation, whereas E2Fa expression under control of the LBD18 promoter eliminates the need for LBD18. Besides lateral root initiation, vascular patterning is disrupted in E2Fa knockout plants, similarly as it is affected in auxin signaling and lbd mutants, indicating that the transcriptional induction of E2Fa through LBDs represents a general mechanism for auxin-dependent cell cycle activation. Our data illustrate how a conserved mechanism driving cell cycle entry has been adapted evolutionarily to connect auxin signaling with control of processes determining plant architecture. "}],"_id":"3102","date_created":"2018-12-11T12:01:24Z","status":"public","day":"14","quality_controlled":0,"doi":"10.1105/tpc.111.088377","publication_status":"published","publication":"Plant Cell"},{"abstract":[{"lang":"eng","text":"Endocytosis in plants has an essential role not only for basic cellular functions but also for growth and development, hormonal signaling and communication with the environment including nutrient delivery, toxin avoidance, and pathogen defense. The major endocytic mechanism in plants depends on the coat protein clathrin. It starts by clathrin-coated vesicle formation at the plasma membrane, where specific cargoes are recognized and packaged for internalization. Recently, genetic, biochemical and advanced microscopy studies provided initial insights into mechanisms and roles of clathrin-mediated endocytosis in plants. Here we summarize the present state of knowledge and compare mechanisms of clathrin-mediated endocytosis in plants with animal and yeast paradigms as well as review plant-specific regulations and roles of this process."}],"type":"journal_article","volume":14,"extern":"1","citation":{"apa":"Chen, X., Irani, N., &#38; Friml, J. (2011). Clathrin-mediated endocytosis: The gateway into plant cells. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pbi.2011.08.006\">https://doi.org/10.1016/j.pbi.2011.08.006</a>","mla":"Chen, Xu, et al. “Clathrin-Mediated Endocytosis: The Gateway into Plant Cells.” <i>Current Opinion in Plant Biology</i>, vol. 14, no. 6, Elsevier, 2011, pp. 674–82, doi:<a href=\"https://doi.org/10.1016/j.pbi.2011.08.006\">10.1016/j.pbi.2011.08.006</a>.","ama":"Chen X, Irani N, Friml J. Clathrin-mediated endocytosis: The gateway into plant cells. <i>Current Opinion in Plant Biology</i>. 2011;14(6):674-682. doi:<a href=\"https://doi.org/10.1016/j.pbi.2011.08.006\">10.1016/j.pbi.2011.08.006</a>","short":"X. Chen, N. Irani, J. Friml, Current Opinion in Plant Biology 14 (2011) 674–682.","ieee":"X. Chen, N. Irani, and J. Friml, “Clathrin-mediated endocytosis: The gateway into plant cells,” <i>Current Opinion in Plant Biology</i>, vol. 14, no. 6. Elsevier, pp. 674–682, 2011.","ista":"Chen X, Irani N, Friml J. 2011. Clathrin-mediated endocytosis: The gateway into plant cells. Current Opinion in Plant Biology. 14(6), 674–682.","chicago":"Chen, Xu, Niloufer Irani, and Jiří Friml. “Clathrin-Mediated Endocytosis: The Gateway into Plant Cells.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.pbi.2011.08.006\">https://doi.org/10.1016/j.pbi.2011.08.006</a>."},"status":"public","day":"01","quality_controlled":"1","date_created":"2018-12-11T12:01:24Z","_id":"3103","publication":"Current Opinion in Plant Biology","doi":"10.1016/j.pbi.2011.08.006","publication_status":"published","oa_version":"None","publisher":"Elsevier","date_published":"2011-12-01T00:00:00Z","month":"12","intvolume":"        14","author":[{"full_name":"Chen, Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","first_name":"Xu","last_name":"Chen"},{"full_name":"Irani, Niloufer","last_name":"Irani","first_name":"Niloufer"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Clathrin-mediated endocytosis: The gateway into plant cells","issue":"6","date_updated":"2021-01-12T07:41:05Z","publist_id":"3596","page":"674 - 682","year":"2011","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Hippocampal sharp waves (SPWs) and associated fast (&quot;ripple&quot;) oscillations (SPW-Rs) in the CA1 region are among the most synchronous physiological patterns in the mammalian brain. Using two-dimensional arrays of electrodes for recording local field potentials and unit discharges in freely moving rats, we studied the emergence of ripple oscillations (140-220 Hz) and compared their origin and cellular-synaptic mechanisms with fast gamma oscillations (90-140 Hz). We show that (1) hippocampal SPW-Rs and fast gamma oscillations are quantitatively distinct patterns but involve the same networks and share similar mechanisms; (2) both the frequency and magnitude of fast oscillations are positively correlated with the magnitude of SPWs; (3) during both ripples and fast gamma oscillations the frequency of network oscillation is higher in CA1 than in CA3; and (4) the emergence of CA3 population bursts, a prerequisite for SPW-Rs, is biased by activity patterns in the dentate gyrus and entorhinal cortex, with the highest probability of ripples associated with an &quot;optimum&quot; level of dentate gamma power. We hypothesize that each hippocampal subnetwork possesses distinct resonant properties, tuned by the magnitude of the excitatory drive."}],"type":"journal_article","volume":31,"extern":1,"citation":{"apa":"Sullivan, D., Csicsvari, J. L., Mizuseki, K., Montgomery, S., Diba, K., &#38; Buzsáki, G. (2011). Relationships between hippocampal sharp waves ripples and fast gamma oscillation Influence of dentate and entorhinal cortical activity. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0294-11.2011\">https://doi.org/10.1523/JNEUROSCI.0294-11.2011</a>","mla":"Sullivan, David, et al. “Relationships between Hippocampal Sharp Waves Ripples and Fast Gamma Oscillation Influence of Dentate and Entorhinal Cortical Activity.” <i>Journal of Neuroscience</i>, vol. 31, no. 23, Society for Neuroscience, 2011, pp. 8605–16, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0294-11.2011\">10.1523/JNEUROSCI.0294-11.2011</a>.","ama":"Sullivan D, Csicsvari JL, Mizuseki K, Montgomery S, Diba K, Buzsáki G. Relationships between hippocampal sharp waves ripples and fast gamma oscillation Influence of dentate and entorhinal cortical activity. <i>Journal of Neuroscience</i>. 2011;31(23):8605-8616. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0294-11.2011\">10.1523/JNEUROSCI.0294-11.2011</a>","ieee":"D. Sullivan, J. L. Csicsvari, K. Mizuseki, S. Montgomery, K. Diba, and G. Buzsáki, “Relationships between hippocampal sharp waves ripples and fast gamma oscillation Influence of dentate and entorhinal cortical activity,” <i>Journal of Neuroscience</i>, vol. 31, no. 23. Society for Neuroscience, pp. 8605–8616, 2011.","ista":"Sullivan D, Csicsvari JL, Mizuseki K, Montgomery S, Diba K, Buzsáki G. 2011. Relationships between hippocampal sharp waves ripples and fast gamma oscillation Influence of dentate and entorhinal cortical activity. Journal of Neuroscience. 31(23), 8605–8616.","short":"D. Sullivan, J.L. Csicsvari, K. Mizuseki, S. Montgomery, K. Diba, G. Buzsáki, Journal of Neuroscience 31 (2011) 8605–8616.","chicago":"Sullivan, David, Jozsef L Csicsvari, Kenji Mizuseki, Sean Montgomery, Kamran Diba, and György Buzsáki. “Relationships between Hippocampal Sharp Waves Ripples and Fast Gamma Oscillation Influence of Dentate and Entorhinal Cortical Activity.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2011. <a href=\"https://doi.org/10.1523/JNEUROSCI.0294-11.2011\">https://doi.org/10.1523/JNEUROSCI.0294-11.2011</a>."},"status":"public","quality_controlled":0,"day":"08","_id":"3138","date_created":"2018-12-11T12:01:36Z","publication":"Journal of Neuroscience","doi":"10.1523/JNEUROSCI.0294-11.2011","publication_status":"published","publisher":"Society for Neuroscience","date_published":"2011-06-08T00:00:00Z","intvolume":"        31","month":"06","author":[{"first_name":"David","last_name":"Sullivan","full_name":"Sullivan, David W"},{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Jozsef Csicsvari"},{"first_name":"Kenji","last_name":"Mizuseki","full_name":"Mizuseki, Kenji"},{"last_name":"Montgomery","first_name":"Sean","full_name":"Montgomery, Sean M"},{"full_name":"Diba, Kamran","first_name":"Kamran","last_name":"Diba"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"title":"Relationships between hippocampal sharp waves ripples and fast gamma oscillation Influence of dentate and entorhinal cortical activity","issue":"23","date_updated":"2021-01-12T07:41:19Z","publist_id":"3559","page":"8605 - 8616","year":"2011"},{"day":"10","status":"public","quality_controlled":0,"_id":"3145","date_created":"2018-12-11T12:01:39Z","type":"journal_article","abstract":[{"text":"Microinjection of recombinant DNA into zygotic pronuclei has been widely used for producing transgenic mice. However, with this method, the insertion site, integrity, and copy number of the transgene cannot be controlled. Here, we present an integrase-based approach to produce transgenic mice via pronuclear injection, whereby an intact single-copy transgene can be inserted into predetermined chromosomal loci with high efficiency (up to 40%), and faithfully transmitted through generations. We show that neighboring transgenic elements and bacterial DNA within the transgene cause profound silencing and expression variability of the transgenic marker. Removal of these undesirable elements leads to global high-level marker expression from transgenes driven by a ubiquitous promoter. We also obtained faithful marker expression from a tissue-specific promoter. The technique presented here will greatly facilitate murine transgenesis and precise structure/function dissection of mammalian gene function and regulation in vivo.","lang":"eng"}],"citation":{"mla":"Tasic, Bosiljka, et al. “Site Specific Integrase Mediated Transgenesis in Mice via Pronuclear Injection.” <i>PNAS</i>, vol. 108, no. 19, National Academy of Sciences, 2011, pp. 7902–07, doi:<a href=\"https://doi.org/10.1073/pnas.1019507108\">10.1073/pnas.1019507108</a>.","apa":"Tasic, B., Hippenmeyer, S., Wang, C., Gamboa, M., Zong, H., Chen Tsai, Y., &#38; Luo, L. (2011). Site specific integrase mediated transgenesis in mice via pronuclear injection. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1019507108\">https://doi.org/10.1073/pnas.1019507108</a>","chicago":"Tasic, Bosiljka, Simon Hippenmeyer, Charlene Wang, Matthew Gamboa, Hui Zong, Yanru Chen Tsai, and Liqun Luo. “Site Specific Integrase Mediated Transgenesis in Mice via Pronuclear Injection.” <i>PNAS</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1019507108\">https://doi.org/10.1073/pnas.1019507108</a>.","ama":"Tasic B, Hippenmeyer S, Wang C, et al. Site specific integrase mediated transgenesis in mice via pronuclear injection. <i>PNAS</i>. 2011;108(19):7902-7907. doi:<a href=\"https://doi.org/10.1073/pnas.1019507108\">10.1073/pnas.1019507108</a>","ieee":"B. Tasic <i>et al.</i>, “Site specific integrase mediated transgenesis in mice via pronuclear injection,” <i>PNAS</i>, vol. 108, no. 19. National Academy of Sciences, pp. 7902–7907, 2011.","short":"B. Tasic, S. Hippenmeyer, C. Wang, M. Gamboa, H. Zong, Y. Chen Tsai, L. Luo, PNAS 108 (2011) 7902–7907.","ista":"Tasic B, Hippenmeyer S, Wang C, Gamboa M, Zong H, Chen Tsai Y, Luo L. 2011. Site specific integrase mediated transgenesis in mice via pronuclear injection. PNAS. 108(19), 7902–7907."},"extern":1,"volume":108,"publication_status":"published","doi":"10.1073/pnas.1019507108","publication":"PNAS","issue":"19","author":[{"first_name":"Bosiljka","last_name":"Tasic","full_name":"Tasic, Bosiljka"},{"full_name":"Simon Hippenmeyer","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"full_name":"Wang, Charlene","first_name":"Charlene","last_name":"Wang"},{"first_name":"Matthew","last_name":"Gamboa","full_name":"Gamboa, Matthew"},{"last_name":"Zong","first_name":"Hui","full_name":"Zong, Hui"},{"first_name":"Yanru","last_name":"Chen Tsai","full_name":"Chen-Tsai, Yanru"},{"last_name":"Luo","first_name":"Liqun","full_name":"Luo, Liqun"}],"title":"Site specific integrase mediated transgenesis in mice via pronuclear injection","date_updated":"2021-01-12T07:41:22Z","publisher":"National Academy of Sciences","month":"05","intvolume":"       108","date_published":"2011-05-10T00:00:00Z","year":"2011","publist_id":"3549","page":"7902 - 7907"},{"day":"22","quality_controlled":0,"status":"public","_id":"3147","date_created":"2018-12-11T12:01:40Z","type":"journal_article","abstract":[{"text":"Cancer cell of origin is difficult to identify by analyzing cells within terminal stage tumors, whose identity could be concealed by the acquired plasticity. Thus, an ideal approach to identify the cell of origin is to analyze proliferative abnormalities in distinct lineages prior to malignancy. Here, we use mosaic analysis with double markers (MADM) in mice to model gliomagenesis by initiating concurrent p53/Nf1 mutations sporadically in neural stem cells (NSCs). Surprisingly, MADM-based lineage tracing revealed significant aberrant growth prior to malignancy only in oligodendrocyte precursor cells (OPCs), but not in any other NSC-derived lineages or NSCs themselves. Upon tumor formation, phenotypic and transcriptome analyses of tumor cells revealed salient OPC features. Finally, introducing the same p53/Nf1 mutations directly into OPCs consistently led to gliomagenesis. Our findings suggest OPCs as the cell of origin in this model, even when initial mutations occur in NSCs, and highlight the importance of analyzing premalignant stages to identify the cancer cell of origin.","lang":"eng"}],"extern":1,"citation":{"short":"C. Liu, J. Sage, M. Miller, R. Verhaak, S. Hippenmeyer, H. Vogel, O. Foreman, R. Bronson, A. Nishiyama, L. Luo, H. Zong, Cell 146 (2011) 209–221.","ista":"Liu C, Sage J, Miller M, Verhaak R, Hippenmeyer S, Vogel H, Foreman O, Bronson R, Nishiyama A, Luo L, Zong H. 2011. Mosaic analysis with double markers reveals tumor cell of origin in glioma. Cell. 146(2), 209–221.","ieee":"C. Liu <i>et al.</i>, “Mosaic analysis with double markers reveals tumor cell of origin in glioma,” <i>Cell</i>, vol. 146, no. 2. Cell Press, pp. 209–221, 2011.","ama":"Liu C, Sage J, Miller M, et al. Mosaic analysis with double markers reveals tumor cell of origin in glioma. <i>Cell</i>. 2011;146(2):209-221. doi:<a href=\"https://doi.org/10.1016/j.cell.2011.06.014\">10.1016/j.cell.2011.06.014</a>","chicago":"Liu, Chong, Jonathan Sage, Michael Miller, Roel Verhaak, Simon Hippenmeyer, Hannes Vogel, Oded Foreman, et al. “Mosaic Analysis with Double Markers Reveals Tumor Cell of Origin in Glioma.” <i>Cell</i>. Cell Press, 2011. <a href=\"https://doi.org/10.1016/j.cell.2011.06.014\">https://doi.org/10.1016/j.cell.2011.06.014</a>.","apa":"Liu, C., Sage, J., Miller, M., Verhaak, R., Hippenmeyer, S., Vogel, H., … Zong, H. (2011). Mosaic analysis with double markers reveals tumor cell of origin in glioma. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2011.06.014\">https://doi.org/10.1016/j.cell.2011.06.014</a>","mla":"Liu, Chong, et al. “Mosaic Analysis with Double Markers Reveals Tumor Cell of Origin in Glioma.” <i>Cell</i>, vol. 146, no. 2, Cell Press, 2011, pp. 209–21, doi:<a href=\"https://doi.org/10.1016/j.cell.2011.06.014\">10.1016/j.cell.2011.06.014</a>."},"volume":146,"doi":"10.1016/j.cell.2011.06.014","publication_status":"published","publication":"Cell","issue":"2","title":"Mosaic analysis with double markers reveals tumor cell of origin in glioma","author":[{"last_name":"Liu","first_name":"Chong","full_name":"Liu, Chong"},{"full_name":"Sage, Jonathan C","first_name":"Jonathan","last_name":"Sage"},{"full_name":"Miller, Michael R","first_name":"Michael","last_name":"Miller"},{"full_name":"Verhaak, Roel G","last_name":"Verhaak","first_name":"Roel"},{"full_name":"Simon Hippenmeyer","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061"},{"first_name":"Hannes","last_name":"Vogel","full_name":"Vogel, Hannes"},{"first_name":"Oded","last_name":"Foreman","full_name":"Foreman, Oded"},{"full_name":"Bronson, Roderick T","last_name":"Bronson","first_name":"Roderick"},{"full_name":"Nishiyama, Akiko","last_name":"Nishiyama","first_name":"Akiko"},{"last_name":"Luo","first_name":"Liqun","full_name":"Luo, Liqun"},{"first_name":"Hui","last_name":"Zong","full_name":"Zong, Hui"}],"date_updated":"2021-01-12T07:41:23Z","publisher":"Cell Press","month":"07","intvolume":"       146","date_published":"2011-07-22T00:00:00Z","year":"2011","publist_id":"3548","page":"209 - 221"},{"doi":"10.1016/j.devcel.2010.12.007","publication_status":"published","publication":"Developmental Cell","status":"public","day":"15","quality_controlled":0,"_id":"3154","date_created":"2018-12-11T12:01:42Z","type":"journal_article","abstract":[{"text":"Regulated adhesion between cells and their environment is critical for normal cell migration. We have identified mutations in a gene encoding the Drosophila hydrogen peroxide (H2O2)-degrading enzyme Jafrac1, which lead to germ cell adhesion defects. During gastrulation, primordial germ cells (PGCs) associate tightly with the invaginating midgut primordium as it enters the embryo; however, in embryos from jafrac1 mutant mothers this association is disrupted, leaving some PGCs trailing on the outside of the embryo. We observed similar phenotypes in embryos from DE-cadherin/shotgun (shg) mutant mothers and were able to rescue the jafrac1 phenotype by increasing DE-cadherin levels. This and our biochemical evidence strongly suggest that Jafrac1-mediated reduction of H2O2 is required to maintain DE-cadherin protein levels in the early embryo. Our results present in vivo evidence of a peroxiredoxin regulating DE-cadherin-mediated adhesion.","lang":"eng"}],"extern":1,"citation":{"mla":"Degennaro, Matthew, et al. “Peroxiredoxin Stabilization of DE-Cadherin Promotes Primordial Germ Cell Adhesion.” <i>Developmental Cell</i>, vol. 20, no. 2, Cell Press, 2011, pp. 233–43, doi:<a href=\"https://doi.org/10.1016/j.devcel.2010.12.007\">10.1016/j.devcel.2010.12.007</a>.","apa":"Degennaro, M., Hurd, T., Siekhaus, D. E., Biteau, B., Jasper, H., &#38; Lehmann, R. (2011). Peroxiredoxin stabilization of DE-cadherin promotes primordial germ cell adhesion. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2010.12.007\">https://doi.org/10.1016/j.devcel.2010.12.007</a>","chicago":"Degennaro, Matthew, Thomas Hurd, Daria E Siekhaus, Benoit Biteau, Heinrich Jasper, and Ruth Lehmann. “Peroxiredoxin Stabilization of DE-Cadherin Promotes Primordial Germ Cell Adhesion.” <i>Developmental Cell</i>. Cell Press, 2011. <a href=\"https://doi.org/10.1016/j.devcel.2010.12.007\">https://doi.org/10.1016/j.devcel.2010.12.007</a>.","ista":"Degennaro M, Hurd T, Siekhaus DE, Biteau B, Jasper H, Lehmann R. 2011. Peroxiredoxin stabilization of DE-cadherin promotes primordial germ cell adhesion. Developmental Cell. 20(2), 233–243.","ieee":"M. Degennaro, T. Hurd, D. E. Siekhaus, B. Biteau, H. Jasper, and R. Lehmann, “Peroxiredoxin stabilization of DE-cadherin promotes primordial germ cell adhesion,” <i>Developmental Cell</i>, vol. 20, no. 2. Cell Press, pp. 233–243, 2011.","short":"M. Degennaro, T. Hurd, D.E. Siekhaus, B. Biteau, H. Jasper, R. Lehmann, Developmental Cell 20 (2011) 233–243.","ama":"Degennaro M, Hurd T, Siekhaus DE, Biteau B, Jasper H, Lehmann R. Peroxiredoxin stabilization of DE-cadherin promotes primordial germ cell adhesion. <i>Developmental Cell</i>. 2011;20(2):233-243. doi:<a href=\"https://doi.org/10.1016/j.devcel.2010.12.007\">10.1016/j.devcel.2010.12.007</a>"},"volume":20,"year":"2011","publist_id":"3541","page":"233 - 243","issue":"2","title":"Peroxiredoxin stabilization of DE-cadherin promotes primordial germ cell adhesion","author":[{"full_name":"DeGennaro, Matthew","last_name":"Degennaro","first_name":"Matthew"},{"full_name":"Hurd, Thomas R","last_name":"Hurd","first_name":"Thomas"},{"full_name":"Daria Siekhaus","orcid":"0000-0001-8323-8353","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E"},{"first_name":"Benoit","last_name":"Biteau","full_name":"Biteau, Benoit"},{"first_name":"Heinrich","last_name":"Jasper","full_name":"Jasper, Heinrich"},{"last_name":"Lehmann","first_name":"Ruth","full_name":"Lehmann, Ruth"}],"date_updated":"2021-01-12T07:41:26Z","publisher":"Cell Press","intvolume":"        20","month":"02","date_published":"2011-02-15T00:00:00Z"},{"citation":{"ama":"Lampert C. Maximum margin multi-label structured prediction. In: Neural Information Processing Systems; 2011.","short":"C. Lampert, in:, Neural Information Processing Systems, 2011.","ista":"Lampert C. 2011. Maximum margin multi-label structured prediction. NIPS: Neural Information Processing Systems.","ieee":"C. Lampert, “Maximum margin multi-label structured prediction,” presented at the NIPS: Neural Information Processing Systems, Granada, Spain, 2011.","chicago":"Lampert, Christoph. “Maximum Margin Multi-Label Structured Prediction.” Neural Information Processing Systems, 2011.","apa":"Lampert, C. (2011). Maximum margin multi-label structured prediction. Presented at the NIPS: Neural Information Processing Systems, Granada, Spain: Neural Information Processing Systems.","mla":"Lampert, Christoph. <i>Maximum Margin Multi-Label Structured Prediction</i>. Neural Information Processing Systems, 2011."},"type":"conference","scopus_import":1,"abstract":[{"lang":"eng","text":"We study multi-label prediction for structured output sets, a problem that occurs, for example, in object detection in images, secondary structure prediction in computational biology, and graph matching with symmetries. Conventional multilabel classification techniques are typically not applicable in this situation, because they require explicit enumeration of the label set, which is infeasible in case of structured outputs. Relying on techniques originally designed for single-label structured prediction, in particular structured support vector machines, results in reduced prediction accuracy, or leads to infeasible optimization problems. In this work we derive a maximum-margin training formulation for multi-label structured prediction that remains computationally tractable while achieving high prediction accuracy. It also shares most beneficial properties with single-label maximum-margin approaches, in particular formulation as a convex optimization problem, efficient working set training, and PAC-Bayesian generalization bounds."}],"date_created":"2018-12-11T12:01:45Z","_id":"3163","quality_controlled":"1","status":"public","day":"01","publication_status":"published","related_material":{"record":[{"id":"3322","status":"public","relation":"later_version"}]},"oa_version":"None","month":"12","date_published":"2011-12-01T00:00:00Z","publisher":"Neural Information Processing Systems","date_updated":"2023-10-17T11:47:35Z","author":[{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"title":"Maximum margin multi-label structured prediction","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"conference":{"location":"Granada, Spain","start_date":"2011-12-12","end_date":"2011-12-14","name":"NIPS: Neural Information Processing Systems"},"publist_id":"3522","language":[{"iso":"eng"}],"year":"2011"},{"date_published":"2011-08-09T00:00:00Z","alternative_title":["LNCS"],"month":"08","intvolume":"      6907","publisher":"Springer","date_updated":"2021-01-12T07:41:47Z","title":"Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions","author":[{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Vladimir Kolmogorov"}],"page":"400 - 411","publist_id":"3478","conference":{"name":"MFCS: Mathematical Foundations of Computer Science"},"year":"2011","volume":6907,"citation":{"ieee":"V. Kolmogorov, “Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions,” presented at the MFCS: Mathematical Foundations of Computer Science, 2011, vol. 6907, pp. 400–411.","short":"V. Kolmogorov, in:, Springer, 2011, pp. 400–411.","ista":"Kolmogorov V. 2011. Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 400–411.","ama":"Kolmogorov V. Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions. In: Vol 6907. Springer; 2011:400-411. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">10.1007/978-3-642-22993-0_37</a>","chicago":"Kolmogorov, Vladimir. “Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions,” 6907:400–411. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">https://doi.org/10.1007/978-3-642-22993-0_37</a>.","apa":"Kolmogorov, V. (2011). Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions (Vol. 6907, pp. 400–411). Presented at the MFCS: Mathematical Foundations of Computer Science, Springer. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">https://doi.org/10.1007/978-3-642-22993-0_37</a>","mla":"Kolmogorov, Vladimir. <i>Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions</i>. Vol. 6907, Springer, 2011, pp. 400–11, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">10.1007/978-3-642-22993-0_37</a>."},"extern":1,"abstract":[{"lang":"eng","text":"We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions f satisfying f(x) + f(y) ≥ f(x ∏ y) + f(x ∐ y) where the domain of each variable x i corresponds to nodes of a rooted binary tree, and operations ∏,∐ are defined with respect to this tree. Special cases include previously studied L-convex and bisubmodular functions, which can be obtained with particular choices of trees. We present a polynomial-time algorithm for minimizing functions in the new class. It combines Murota's steepest descent algorithm for L-convex functions with bisubmodular minimization algorithms. "}],"type":"conference","_id":"3204","date_created":"2018-12-11T12:02:00Z","quality_controlled":0,"status":"public","day":"09","publication_status":"published","doi":"10.1007/978-3-642-22993-0_37","main_file_link":[{"url":"http://arxiv.org/pdf/1007.1229v3","open_access":"0"}]},{"publisher":"Omnipress","month":"01","date_published":"2011-01-01T00:00:00Z","title":"Dynamic tree block coordinate ascent","author":[{"full_name":"Tarlow, Daniel","last_name":"Tarlow","first_name":"Daniel"},{"first_name":"Druv","last_name":"Batra","full_name":"Batra, Druv"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"}],"date_updated":"2021-01-12T07:41:47Z","publist_id":"3475","conference":{"name":"ICML: International Conference on Machine Learning"},"page":"113 - 120","year":"2011","type":"conference","abstract":[{"lang":"eng","text":"This paper proposes a novel Linear Programming (LP) based algorithm, called Dynamic Tree-Block Coordinate Ascent (DT-BCA), for performing maximum a posteriori (MAP) inference in probabilistic graphical models. Unlike traditional message passing algorithms, which operate uniformly on the whole factor graph, our method dynamically chooses regions of the factor graph on which to focus message-passing efforts. We propose two criteria for selecting regions, including an efficiently computable upper-bound on the increase in the objective possible by passing messages in any particular region. This bound is derived from the theory of primal-dual methods from combinatorial optimization, and the forest that maximizes the bounds can be chosen efficiently using a maximum-spanning-tree-like algorithm. Experimental results show that our dynamic schedules significantly speed up state-of-the-art LP-based message-passing algorithms on a wide variety of real-world problems."}],"citation":{"chicago":"Tarlow, Daniel, Druv Batra, Pushmeet Kohli, and Vladimir Kolmogorov. “Dynamic Tree Block Coordinate Ascent,” 113–20. Omnipress, 2011.","ista":"Tarlow D, Batra D, Kohli P, Kolmogorov V. 2011. Dynamic tree block coordinate ascent. ICML: International Conference on Machine Learning, 113–120.","short":"D. Tarlow, D. Batra, P. Kohli, V. Kolmogorov, in:, Omnipress, 2011, pp. 113–120.","ieee":"D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov, “Dynamic tree block coordinate ascent,” presented at the ICML: International Conference on Machine Learning, 2011, pp. 113–120.","ama":"Tarlow D, Batra D, Kohli P, Kolmogorov V. Dynamic tree block coordinate ascent. In: Omnipress; 2011:113-120.","mla":"Tarlow, Daniel, et al. <i>Dynamic Tree Block Coordinate Ascent</i>. Omnipress, 2011, pp. 113–20.","apa":"Tarlow, D., Batra, D., Kohli, P., &#38; Kolmogorov, V. (2011). Dynamic tree block coordinate ascent (pp. 113–120). Presented at the ICML: International Conference on Machine Learning, Omnipress."},"extern":1,"status":"public","day":"01","quality_controlled":0,"date_created":"2018-12-11T12:02:00Z","_id":"3205","publication_status":"published","main_file_link":[{"url":"http://ttic.uchicago.edu/~dbatra/publications/assets/tbkk_icml11.pdf","open_access":"0"}]},{"year":"2011","conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"publist_id":"3476","page":"1889 - 1896","author":[{"full_name":"Osokin, Anton","first_name":"Anton","last_name":"Osokin"},{"full_name":"Vetrov, Dmitry","last_name":"Vetrov","first_name":"Dmitry"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"}],"title":"Submodular decomposition framework for inference in associative Markov networks with global constraints","date_updated":"2021-01-12T07:41:47Z","publisher":"IEEE","date_published":"2011-08-22T00:00:00Z","month":"08","publication_status":"published","main_file_link":[{"open_access":"0","url":"http://arxiv.org/pdf/1103.1077v1"}],"doi":"10.1109/CVPR.2011.5995361","day":"22","status":"public","quality_controlled":0,"date_created":"2018-12-11T12:02:00Z","_id":"3206","abstract":[{"lang":"eng","text":"In this paper we address the problem of finding the most probable state of discrete Markov random field (MRF) with associative pairwise terms. Although of practical importance, this problem is known to be NP-hard in general. We propose a new type of MRF decomposition, submod-ular decomposition (SMD). Unlike existing decomposition approaches SMD decomposes the initial problem into sub-problems corresponding to a specific class label while preserving the graph structure of each subproblem. Such decomposition enables us to take into account several types of global constraints in an efficient manner. We study theoretical properties of the proposed approach and demonstrate its applicability on a number of problems."}],"type":"conference","extern":1,"citation":{"mla":"Osokin, Anton, et al. <i>Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints</i>. IEEE, 2011, pp. 1889–96, doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">10.1109/CVPR.2011.5995361</a>.","apa":"Osokin, A., Vetrov, D., &#38; Kolmogorov, V. (2011). Submodular decomposition framework for inference in associative Markov networks with global constraints (pp. 1889–1896). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">https://doi.org/10.1109/CVPR.2011.5995361</a>","chicago":"Osokin, Anton, Dmitry Vetrov, and Vladimir Kolmogorov. “Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints,” 1889–96. IEEE, 2011. <a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">https://doi.org/10.1109/CVPR.2011.5995361</a>.","short":"A. Osokin, D. Vetrov, V. Kolmogorov, in:, IEEE, 2011, pp. 1889–1896.","ista":"Osokin A, Vetrov D, Kolmogorov V. 2011. Submodular decomposition framework for inference in associative Markov networks with global constraints. CVPR: Computer Vision and Pattern Recognition, 1889–1896.","ieee":"A. Osokin, D. Vetrov, and V. Kolmogorov, “Submodular decomposition framework for inference in associative Markov networks with global constraints,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 1889–1896.","ama":"Osokin A, Vetrov D, Kolmogorov V. Submodular decomposition framework for inference in associative Markov networks with global constraints. In: IEEE; 2011:1889-1896. doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">10.1109/CVPR.2011.5995361</a>"}},{"month":"08","date_published":"2011-08-22T00:00:00Z","publisher":"IEEE","date_updated":"2021-01-12T07:41:48Z","author":[{"full_name":"Vicente, Sara","first_name":"Sara","last_name":"Vicente"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"},{"full_name":"Vladimir Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"title":"Object cosegmentation","page":"2217 - 2224","conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"publist_id":"3477","year":"2011","citation":{"mla":"Vicente, Sara, et al. <i>Object Cosegmentation</i>. IEEE, 2011, pp. 2217–24, doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">10.1109/CVPR.2011.5995530</a>.","apa":"Vicente, S., Rother, C., &#38; Kolmogorov, V. (2011). Object cosegmentation (pp. 2217–2224). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">https://doi.org/10.1109/CVPR.2011.5995530</a>","chicago":"Vicente, Sara, Carsten Rother, and Vladimir Kolmogorov. “Object Cosegmentation,” 2217–24. IEEE, 2011. <a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">https://doi.org/10.1109/CVPR.2011.5995530</a>.","ama":"Vicente S, Rother C, Kolmogorov V. Object cosegmentation. In: IEEE; 2011:2217-2224. doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">10.1109/CVPR.2011.5995530</a>","ieee":"S. Vicente, C. Rother, and V. Kolmogorov, “Object cosegmentation,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 2217–2224.","short":"S. Vicente, C. Rother, V. Kolmogorov, in:, IEEE, 2011, pp. 2217–2224.","ista":"Vicente S, Rother C, Kolmogorov V. 2011. Object cosegmentation. CVPR: Computer Vision and Pattern Recognition, 2217–2224."},"extern":1,"type":"conference","abstract":[{"text":"Cosegmentation is typically defined as the task of jointly segmenting something similar in a given set of images. Existing methods are too generic and so far have not demonstrated competitive results for any specific task. In this paper we overcome this limitation by adding two new aspects to cosegmentation: (1) the &quot;something&quot; has to be an object, and (2) the &quot;similarity&quot; measure is learned. In this way, we are able to achieve excellent results on the recently introduced iCoseg dataset, which contains small sets of images of either the same object instance or similar objects of the same class. The challenge of this dataset lies in the extreme changes in viewpoint, lighting, and object deformations within each set. We are able to considerably outperform several competitors. To achieve this performance, we borrow recent ideas from object recognition: the use of powerful features extracted from a pool of candidate object-like segmentations. We believe that our work will be beneficial to several application areas, such as image retrieval.","lang":"eng"}],"date_created":"2018-12-11T12:02:01Z","_id":"3207","quality_controlled":0,"status":"public","day":"22","doi":"10.1109/CVPR.2011.5995530","publication_status":"published"},{"author":[{"full_name":"Jain, Abhishek","first_name":"Abhishek","last_name":"Jain"},{"full_name":"Krzysztof Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"title":"Parallel repetition for leakage resilience amplification revisited","date_updated":"2021-01-12T07:42:00Z","publisher":"Springer","date_published":"2011-01-01T00:00:00Z","alternative_title":["LNCS"],"month":"01","year":"2011","publist_id":"3443","conference":{"name":"TCC: Theory of Cryptography Conference"},"page":"58 - 69","status":"public","quality_controlled":0,"day":"01","_id":"3236","date_created":"2018-12-11T12:02:11Z","abstract":[{"text":"If a cryptographic primitive remains secure even if ℓ bits about the secret key are leaked to the adversary, one would expect that at least one of n independent instantiations of the scheme remains secure given n·ℓ bits of leakage. This intuition has been proven true for schemes satisfying some special information-theoretic properties by Alwen et al. [Eurocrypt'10]. On the negative side, Lewko and Waters [FOCS'10] construct a CPA secure public-key encryption scheme for which this intuition fails. The counterexample of Lewko and Waters leaves open the interesting possibility that for any scheme there exists a constant c&gt;0, such that n fold repetition remains secure against c·n·ℓ bits of leakage. Furthermore, their counterexample requires the n copies of the encryption scheme to share a common reference parameter, leaving open the possibility that the intuition is true for all schemes without common setup. In this work we give a stronger counterexample ruling out these possibilities. We construct a signature scheme such that: 1. a single instantiation remains secure given ℓ = log(k) bits of leakage where k is a security parameter. 2. any polynomial number of independent instantiations can be broken (in the strongest sense of key-recovery) given ℓ′ = poly(k) bits of leakage. Note that ℓ does not depend on the number of instances. The computational assumption underlying our counterexample is that non-interactive computationally sound proofs exist. Moreover, under a stronger (non-standard) assumption about such proofs, our counterexample does not require a common reference parameter. The underlying idea of our counterexample is rather generic and can be applied to other primitives like encryption schemes. © 2011 International Association for Cryptologic Research.","lang":"eng"}],"type":"conference","volume":"6597 ","citation":{"chicago":"Jain, Abhishek, and Krzysztof Z Pietrzak. “Parallel Repetition for Leakage Resilience Amplification Revisited,” 6597:58–69. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">https://doi.org/10.1007/978-3-642-19571-6_5</a>.","ama":"Jain A, Pietrzak KZ. Parallel repetition for leakage resilience amplification revisited. In: Vol 6597. Springer; 2011:58-69. doi:<a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">10.1007/978-3-642-19571-6_5</a>","ieee":"A. Jain and K. Z. Pietrzak, “Parallel repetition for leakage resilience amplification revisited,” presented at the TCC: Theory of Cryptography Conference, 2011, vol. 6597, pp. 58–69.","short":"A. Jain, K.Z. Pietrzak, in:, Springer, 2011, pp. 58–69.","ista":"Jain A, Pietrzak KZ. 2011. Parallel repetition for leakage resilience amplification revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 6597, 58–69.","mla":"Jain, Abhishek, and Krzysztof Z. Pietrzak. <i>Parallel Repetition for Leakage Resilience Amplification Revisited</i>. Vol. 6597, Springer, 2011, pp. 58–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">10.1007/978-3-642-19571-6_5</a>.","apa":"Jain, A., &#38; Pietrzak, K. Z. (2011). Parallel repetition for leakage resilience amplification revisited (Vol. 6597, pp. 58–69). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">https://doi.org/10.1007/978-3-642-19571-6_5</a>"},"extern":1,"publication_status":"published","doi":"10.1007/978-3-642-19571-6_5"},{"doi":"10.1007/978-3-642-20465-4_3","publication_status":"published","oa_version":"None","related_material":{"record":[{"id":"1187","status":"public","relation":"later_version"}]},"type":"conference","abstract":[{"text":"We construct efficient authentication protocols and message-authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work - starting with the HB protocol of Hopper and Blum in 2001 - until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle (MIM) attacks. A MAC implies such a (two-round) protocol. © 2011 International Association for Cryptologic Research","lang":"eng"}],"citation":{"chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, David Cash, Abhishek Jain, and Daniele Venturi. “Efficient Authentication from Hard Learning Problems,” 6632:7–26. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">https://doi.org/10.1007/978-3-642-20465-4_3</a>.","ieee":"E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.","ista":"Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. 2011. Efficient authentication from hard learning problems. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 6632, 7–26.","short":"E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.","ama":"Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. Efficient authentication from hard learning problems. In: Vol 6632. Springer; 2011:7-26. doi:<a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">10.1007/978-3-642-20465-4_3</a>","mla":"Kiltz, Eike, et al. <i>Efficient Authentication from Hard Learning Problems</i>. Vol. 6632, Springer, 2011, pp. 7–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">10.1007/978-3-642-20465-4_3</a>.","apa":"Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., &#38; Venturi, D. (2011). Efficient authentication from hard learning problems (Vol. 6632, pp. 7–26). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">https://doi.org/10.1007/978-3-642-20465-4_3</a>"},"extern":"1","volume":6632,"day":"01","status":"public","quality_controlled":"1","date_created":"2018-12-11T12:02:11Z","_id":"3238","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2011-05-15","end_date":"2011-05-19","location":"Tallinn, Estonia"},"publist_id":"3442","page":"7 - 26","year":"2011","language":[{"iso":"eng"}],"publisher":"Springer","acknowledgement":"The European Regional Development Fund (ERDF),Guardtime,Qualcomm,Swedbank","intvolume":"      6632","month":"05","alternative_title":["LNCS"],"date_published":"2011-05-01T00:00:00Z","title":"Efficient authentication from hard learning problems","author":[{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"full_name":"Cash, David","first_name":"David","last_name":"Cash"},{"full_name":"Jain, Abhishek","first_name":"Abhishek","last_name":"Jain"},{"last_name":"Venturi","first_name":"Daniele","full_name":"Venturi, Daniele"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-20T11:20:57Z"},{"date_updated":"2021-01-12T07:42:02Z","title":"Tamper proof circuits How to trade leakage for tamper resilience","author":[{"first_name":"Sebastian","last_name":"Faust","full_name":"Faust, Sebastian"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak"},{"full_name":"Venturi, Daniele","last_name":"Venturi","first_name":"Daniele"}],"issue":"Part 1","alternative_title":["LNCS"],"date_published":"2011-01-01T00:00:00Z","month":"01","publisher":"Springer","year":"2011","page":"391 - 402","conference":{"name":"ICALP: Automata, Languages and Programming"},"publist_id":"3441","_id":"3239","date_created":"2018-12-11T12:02:12Z","status":"public","quality_controlled":0,"day":"01","volume":"6755 ","extern":1,"citation":{"mla":"Faust, Sebastian, et al. <i>Tamper Proof Circuits How to Trade Leakage for Tamper Resilience</i>. Vol. 6755, no. Part 1, Springer, 2011, pp. 391–402, doi:<a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">10.1007/978-3-642-22006-7_33</a>.","apa":"Faust, S., Pietrzak, K. Z., &#38; Venturi, D. (2011). Tamper proof circuits How to trade leakage for tamper resilience (Vol. 6755, pp. 391–402). Presented at the ICALP: Automata, Languages and Programming, Springer. <a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">https://doi.org/10.1007/978-3-642-22006-7_33</a>","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Daniele Venturi. “Tamper Proof Circuits How to Trade Leakage for Tamper Resilience,” 6755:391–402. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">https://doi.org/10.1007/978-3-642-22006-7_33</a>.","ama":"Faust S, Pietrzak KZ, Venturi D. Tamper proof circuits How to trade leakage for tamper resilience. In: Vol 6755. Springer; 2011:391-402. doi:<a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">10.1007/978-3-642-22006-7_33</a>","short":"S. Faust, K.Z. Pietrzak, D. Venturi, in:, Springer, 2011, pp. 391–402.","ista":"Faust S, Pietrzak KZ, Venturi D. 2011. Tamper proof circuits How to trade leakage for tamper resilience. ICALP: Automata, Languages and Programming, LNCS, vol. 6755, 391–402.","ieee":"S. Faust, K. Z. Pietrzak, and D. Venturi, “Tamper proof circuits How to trade leakage for tamper resilience,” presented at the ICALP: Automata, Languages and Programming, 2011, vol. 6755, no. Part 1, pp. 391–402."},"abstract":[{"text":"Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that the tampered device will reveal secret information. Inspired by the work of Ishai et al. [Eurocrypt'06], we propose a compiler that transforms any circuit into a new circuit with the same functionality, but which is resilient against a well-defined and powerful tampering adversary. More concretely, our transformed circuits remain secure even if the adversary can adaptively tamper with every wire in the circuit as long as the tampering fails with some probability δ&gt;0. This additional requirement is motivated by practical tampering attacks, where it is often difficult to guarantee the success of a specific attack. Formally, we show that a q-query tampering attack against the transformed circuit can be &quot;simulated&quot; with only black-box access to the original circuit and log(q) bits of additional auxiliary information. Thus, if the implemented cryptographic scheme is secure against log(q) bits of leakage, then our implementation is tamper-proof in the above sense. Surprisingly, allowing for this small amount of information leakage allows for much more efficient compilers, which moreover do not require randomness during evaluation. Similar to earlier works our compiler requires small, stateless and computation-independent tamper-proof gadgets. Thus, our result can be interpreted as reducing the problem of shielding arbitrary complex computation to protecting simple components. © 2011 Springer-Verlag.","lang":"eng"}],"type":"conference","doi":"10.1007/978-3-642-22006-7_33","publication_status":"published"},{"publisher":"Springer","date_published":"2011-01-01T00:00:00Z","alternative_title":["LNCS"],"month":"01","intvolume":"      6841","author":[{"last_name":"Barak","first_name":"Boaz","full_name":"Barak,  Boaz"},{"last_name":"Dodis","first_name":"Yevgeniy","full_name":"Dodis, Yevgeniy"},{"full_name":"Krawczyk, Hugo","last_name":"Krawczyk","first_name":"Hugo"},{"first_name":"Olivier","last_name":"Pereira","full_name":"Pereira, Olivier"},{"full_name":"Krzysztof Pietrzak","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Standaert, François-Xavier","first_name":"François","last_name":"Standaert"},{"last_name":"Yu","first_name":"Yu","full_name":"Yu, Yu"}],"title":"Leftover hash lemma revisited","date_updated":"2021-01-12T07:42:03Z","publist_id":"3440","conference":{"name":"CRYPTO: International Cryptology Conference"},"page":"1 - 20","year":"2011","abstract":[{"text":"The famous Leftover Hash Lemma (LHL) states that (almost) universal hash functions are good randomness extractors. Despite its numerous applications, LHL-based extractors suffer from the following two limitations: - Large Entropy Loss: to extract v bits from distribution X of min-entropy m which are ε-close to uniform, one must set v ≤ m - 2log(1/ε), meaning that the entropy loss L = def m - v ≥ 2 log(1/ε). For many applications, such entropy loss is too large. - Large Seed Length: the seed length n of (almost) universal hash function required by the LHL must be at least n ≥ min (u - v, v + 2log(1/ε)) - O(1), where u is the length of the source, and must grow with the number of extracted bits. Quite surprisingly, we show that both limitations of the LHL - large entropy loss and large seed - can be overcome (or, at least, mitigated) in various important scenarios. First, we show that entropy loss could be reduced to L = log(1/ε) for the setting of deriving secret keys for a wide range of cryptographic applications. Specifically, the security of these schemes with an LHL-derived key gracefully degrades from ε to at most ε + √ε2-L. (Notice that, unlike standard LHL, this bound is meaningful even when one extracts more bits than the min-entropy we have!) Based on these results we build a general computational extractor that enjoys low entropy loss and can be used to instantiate a generic key derivation function for any cryptographic application. Second, we study the soundness of the natural expand-then-extract approach, where one uses a pseudorandom generator (PRG) to expand a short &quot;input seed&quot; S into a longer &quot;output seed&quot; S′, and then use the resulting S′ as the seed required by the LHL (or, more generally, by any randomness extractor). We show that, in general, the expand-then-extract approach is not sound if the Decisional Diffie-Hellman assumption is true. Despite that, we show that it is sound either: (1) when extracting a &quot;small&quot; (logarithmic in the security of the PRG) number of bits; or (2) in minicrypt. Implication (2) suggests that the expand-then-extract approach is likely secure when used with &quot;practical&quot; PRGs, despite lacking a reductionist proof of security! © 2011 International Association for Cryptologic Research.","lang":"eng"}],"type":"conference","volume":6841,"extern":1,"citation":{"chicago":"Barak, Boaz, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Z Pietrzak, François Standaert, and Yu Yu. “Leftover Hash Lemma Revisited,” 6841:1–20. Springer, 2011. <a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\">https://doi.org/ 10.1007/978-3-642-22792-9_1</a>.","ieee":"B. Barak <i>et al.</i>, “Leftover hash lemma revisited,” presented at the CRYPTO: International Cryptology Conference, 2011, vol. 6841, pp. 1–20.","ista":"Barak B, Dodis Y, Krawczyk H, Pereira O, Pietrzak KZ, Standaert F, Yu Y. 2011. Leftover hash lemma revisited. CRYPTO: International Cryptology Conference, LNCS, vol. 6841, 1–20.","short":"B. Barak, Y. Dodis, H. Krawczyk, O. Pereira, K.Z. Pietrzak, F. Standaert, Y. Yu, in:, Springer, 2011, pp. 1–20.","ama":"Barak B, Dodis Y, Krawczyk H, et al. Leftover hash lemma revisited. In: Vol 6841. Springer; 2011:1-20. doi:<a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\"> 10.1007/978-3-642-22792-9_1</a>","mla":"Barak, Boaz, et al. <i>Leftover Hash Lemma Revisited</i>. Vol. 6841, Springer, 2011, pp. 1–20, doi:<a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\"> 10.1007/978-3-642-22792-9_1</a>.","apa":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K. Z., Standaert, F., &#38; Yu, Y. (2011). Leftover hash lemma revisited (Vol. 6841, pp. 1–20). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\">https://doi.org/ 10.1007/978-3-642-22792-9_1</a>"},"status":"public","day":"01","quality_controlled":0,"_id":"3240","date_created":"2018-12-11T12:02:12Z","doi":" 10.1007/978-3-642-22792-9_1","publication_status":"published"},{"publisher":"Springer","alternative_title":["LNCS"],"date_published":"2011-12-05T00:00:00Z","month":"12","intvolume":"      7078","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Solving recursion-free Horn clauses over LI+UIF","author":[{"full_name":"Gupta, Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"full_name":"Popeea, Corneliu","last_name":"Popeea","first_name":"Corneliu"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"date_updated":"2021-01-12T07:42:15Z","department":[{"_id":"ToHe"}],"conference":{"end_date":"2011-12-07","start_date":"2011-12-05","name":"APLAS: Asian Symposium on Programming Languages and Systems","location":"Kenting, Taiwan"},"publist_id":"3383","page":"188 - 203","year":"2011","language":[{"iso":"eng"}],"abstract":[{"text":"Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms.","lang":"eng"}],"type":"conference","volume":7078,"citation":{"apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>","mla":"Gupta, Ashutosh, et al. <i>Solving Recursion-Free Horn Clauses over LI+UIF</i>. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.","ista":"Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.","ama":"Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>."},"quality_controlled":"1","status":"public","day":"05","date_created":"2018-12-11T12:02:20Z","_id":"3264","editor":[{"full_name":"Yang, Hongseok","last_name":"Yang","first_name":"Hongseok"}],"doi":"10.1007/978-3-642-25318-8_16","publication_status":"published","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"ec_funded":1,"oa_version":"None"},{"year":"2011","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"publist_id":"3381","conference":{"start_date":"2011-12-12","end_date":"2011-12-14","name":"NIPS: Neural Information Processing Systems","location":"Granada, Spain"},"page":"1827 - 1835","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ion, Adrian","last_name":"Ion","first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joao","last_name":"Carreira","full_name":"Carreira, Joao"},{"full_name":"Sminchisescu, Cristian","last_name":"Sminchisescu","first_name":"Cristian"}],"title":"Probabilistic joint image segmentation and labeling","date_updated":"2021-01-12T07:42:15Z","publisher":"Neural Information Processing Systems Foundation","month":"12","intvolume":"        24","date_published":"2011-12-01T00:00:00Z","oa_version":"None","publication_status":"published","publication":"NIPS Proceedings","day":"01","quality_controlled":"1","status":"public","date_created":"2018-12-11T12:02:21Z","_id":"3266","type":"conference","abstract":[{"lang":"eng","text":"We present a joint image segmentation and labeling model (JSL) which, given a bag of figure-ground segment hypotheses extracted at multiple image locations and scales, constructs a joint probability distribution over both the compatible image interpretations (tilings or image segmentations) composed from those segments, and over their labeling into categories. The process of drawing samples from the joint distribution can be interpreted as first sampling tilings, modeled as maximal cliques, from a graph connecting spatially non-overlapping segments in the bag [1], followed by sampling labels for those segments, conditioned on the choice of a particular tiling. We learn the segmentation and labeling parameters jointly, based on Maximum Likelihood with a novel Incremental Saddle Point estimation procedure. The partition function over tilings and labelings is increasingly more accurately approximated by including incorrect configurations that a not-yet-competent model rates probable during learning. We show that the proposed methodologymatches the current state of the art in the Stanford dataset [2], as well as in VOC2010, where 41.7% accuracy on the test set is achieved."}],"scopus_import":1,"citation":{"chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Probabilistic Joint Image Segmentation and Labeling.” In <i>NIPS Proceedings</i>, 24:1827–35. Neural Information Processing Systems Foundation, 2011.","ama":"Ion A, Carreira J, Sminchisescu C. Probabilistic joint image segmentation and labeling. In: <i>NIPS Proceedings</i>. Vol 24. Neural Information Processing Systems Foundation; 2011:1827-1835.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, NIPS Proceedings, Neural Information Processing Systems Foundation, 2011, pp. 1827–1835.","ista":"Ion A, Carreira J, Sminchisescu C. 2011. Probabilistic joint image segmentation and labeling. NIPS Proceedings. NIPS: Neural Information Processing Systems vol. 24, 1827–1835.","ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in <i>NIPS Proceedings</i>, Granada, Spain, 2011, vol. 24, pp. 1827–1835.","mla":"Ion, Adrian, et al. “Probabilistic Joint Image Segmentation and Labeling.” <i>NIPS Proceedings</i>, vol. 24, Neural Information Processing Systems Foundation, 2011, pp. 1827–35.","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2011). Probabilistic joint image segmentation and labeling. In <i>NIPS Proceedings</i> (Vol. 24, pp. 1827–1835). Granada, Spain: Neural Information Processing Systems Foundation."},"volume":24}]