[{"abstract":[{"lang":"eng","text":" Cholecystokinin-expressing interneurons (CCK-INs) mediate behavior state-dependent inhibition in cortical circuits and themselves receive strong GABAergic input. However, it remains unclear to what extent GABABreceptors (GABABRs) contribute to their inhibitory control. Using immunoelectron microscopy, we found that CCK-INs in the rat hippocampus possessed high levels of dendritic GABABRs and KCTD12 auxiliary proteins, whereas postsynaptic effector Kir3 channels were present at lower levels. Consistently, whole-cell recordings revealed slow GABABR-mediated inhibitory postsynaptic currents (IPSCs) in most CCK-INs. In spite of the higher surface density of GABABRs in CCK-INs than in CA1 principal cells, the amplitudes of IPSCs were comparable, suggesting that the expression of Kir3 channels is the limiting factor for the GABABR currents in these INs. Morphological analysis showed that CCK-INs were diverse, comprising perisomatic-targeting basket cells (BCs), as well as dendrite-targeting (DT) interneurons, including a previously undescribed DT type. GABABR-mediated IPSCs in CCK-INs were large in BCs, but small in DT subtypes. In response to prolonged activation, GABABR-mediated currents displayed strong desensitization, which was absent in KCTD12-deficient mice. This study highlights that GABABRs differentially control CCK-IN subtypes, and the kinetics and desensitization of GABABR-mediated currents are modulated by KCTD12 proteins. "}],"month":"04","publication_status":"published","_id":"1083","page":"2318 - 2334","issue":"3","date_updated":"2021-01-12T06:48:09Z","date_published":"2016-04-12T00:00:00Z","date_created":"2018-12-11T11:50:03Z","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":27,"intvolume":"        27","language":[{"iso":"eng"}],"type":"journal_article","day":"12","author":[{"full_name":"Booker, Sam","first_name":"Sam","last_name":"Booker"},{"full_name":"Althof, Daniel","last_name":"Althof","first_name":"Daniel"},{"first_name":"Anna","last_name":"Gross","full_name":"Gross, Anna"},{"last_name":"Loreth","first_name":"Desiree","full_name":"Loreth, Desiree"},{"last_name":"Müller","first_name":"Johanna","full_name":"Müller, Johanna"},{"full_name":"Unger, Andreas","last_name":"Unger","first_name":"Andreas"},{"full_name":"Fakler, Bernd","last_name":"Fakler","first_name":"Bernd"},{"last_name":"Varro","first_name":"Andrea","full_name":"Varro, Andrea"},{"first_name":"Masahiko","last_name":"Watanabe","full_name":"Watanabe, Masahiko"},{"first_name":"Martin","last_name":"Gassmann","full_name":"Gassmann, Martin"},{"full_name":"Bettler, Bernhard","last_name":"Bettler","first_name":"Bernhard"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"first_name":"Imre","last_name":"Vida","full_name":"Vida, Imre"},{"last_name":"Kulik","first_name":"Ákos","full_name":"Kulik, Ákos"}],"doi":"10.1093/cercor/bhw090","citation":{"ama":"Booker S, Althof D, Gross A, et al. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. 2016;27(3):2318-2334. doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>","ista":"Booker S, Althof D, Gross A, Loreth D, Müller J, Unger A, Fakler B, Varro A, Watanabe M, Gassmann M, Bettler B, Shigemoto R, Vida I, Kulik Á. 2016. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. Cerebral Cortex. 27(3), 2318–2334.","short":"S. Booker, D. Althof, A. Gross, D. Loreth, J. Müller, A. Unger, B. Fakler, A. Varro, M. Watanabe, M. Gassmann, B. Bettler, R. Shigemoto, I. Vida, Á. Kulik, Cerebral Cortex 27 (2016) 2318–2334.","apa":"Booker, S., Althof, D., Gross, A., Loreth, D., Müller, J., Unger, A., … Kulik, Á. (2016). KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>","ieee":"S. Booker <i>et al.</i>, “KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons,” <i>Cerebral Cortex</i>, vol. 27, no. 3. Oxford University Press, pp. 2318–2334, 2016.","chicago":"Booker, Sam, Daniel Althof, Anna Gross, Desiree Loreth, Johanna Müller, Andreas Unger, Bernd Fakler, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>.","mla":"Booker, Sam, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>, vol. 27, no. 3, Oxford University Press, 2016, pp. 2318–34, doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>."},"department":[{"_id":"RySh"}],"publisher":"Oxford University Press","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG SFB 780 A2, A.K.; SFB TR3 I.V. and EXC 257, I.V.; FOR 2143, A.K. and I.V.), Spemann Graduate School (D.A.), BIOSS-2 (A6, A.K.), the Swiss National Science Foundation (3100A0-117816, B.B.), The McNaught Bequest (S.A.B. and I.V.), and Tenovus Scotland (I.V.).\r\n\r\n\r\nWe thank Cheryl Hutton and Chinmaya Sadangi for their contributions to neuronal reconstruction as well as Natalie Wernet, Sigrun Nestel, Anikó Schneider, Ina Wolter, and Ulrich Noeller for their excellent technical support. VGAT-Venus transgenic rats were generated by Drs Y. Yanagawa, M. Hirabayashi, and Y. Kawaguchi in National Institute for Physiological Sciences, Okazaki, Japan, using pCS2-Venus provided by Dr A. Miyawaki. The monoclonal mouse CCK antibody was generously provided by Dr G.V. Ohning, CURE Center, UCLA, CA. ","status":"public","year":"2016","publication":"Cerebral Cortex","title":"KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons","publist_id":"6297","oa_version":"None"},{"publist_id":"6289","oa_version":"None","title":"Geometric control and modeling of genome reprogramming","year":"2016","status":"public","publication":"BioArchitecture","publisher":"Taylor & Francis","citation":{"mla":"Uhler, Caroline, and G. V. Shivashankar. “Geometric Control and Modeling of Genome Reprogramming.” <i>BioArchitecture</i>, vol. 6, no. 4, Taylor &#38; Francis, 2016, pp. 76–84, doi:<a href=\"https://doi.org/10.1080/19490992.2016.1201620\">10.1080/19490992.2016.1201620</a>.","chicago":"Uhler, Caroline, and G V Shivashankar. “Geometric Control and Modeling of Genome Reprogramming.” <i>BioArchitecture</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/19490992.2016.1201620\">https://doi.org/10.1080/19490992.2016.1201620</a>.","ieee":"C. Uhler and G. V. Shivashankar, “Geometric control and modeling of genome reprogramming,” <i>BioArchitecture</i>, vol. 6, no. 4. Taylor &#38; Francis, pp. 76–84, 2016.","apa":"Uhler, C., &#38; Shivashankar, G. V. (2016). Geometric control and modeling of genome reprogramming. <i>BioArchitecture</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/19490992.2016.1201620\">https://doi.org/10.1080/19490992.2016.1201620</a>","short":"C. Uhler, G.V. Shivashankar, BioArchitecture 6 (2016) 76–84.","ista":"Uhler C, Shivashankar GV. 2016. Geometric control and modeling of genome reprogramming. BioArchitecture. 6(4), 76–84.","ama":"Uhler C, Shivashankar GV. Geometric control and modeling of genome reprogramming. <i>BioArchitecture</i>. 2016;6(4):76-84. doi:<a href=\"https://doi.org/10.1080/19490992.2016.1201620\">10.1080/19490992.2016.1201620</a>"},"doi":"10.1080/19490992.2016.1201620","author":[{"full_name":"Uhler, Caroline","last_name":"Uhler","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216"},{"full_name":"Shivashankar, G V","first_name":"G V","last_name":"Shivashankar"}],"day":"27","type":"journal_article","language":[{"iso":"eng"}],"volume":6,"intvolume":"         6","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-07-27T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T11:50:05Z","date_updated":"2021-01-12T06:48:11Z","extern":"1","page":"76 - 84","issue":"4","_id":"1088","month":"07","abstract":[{"lang":"eng","text":"Cell geometry is tightly coupled to gene expression patterns within the tissue microenvironment. This perspective synthesizes evidence that the 3D organization of chromosomes is a critical intermediate for geometric control of genomic programs. Using a combination of experiments and modeling we outline approaches to decipher the mechano-genomic code that governs cellular homeostasis and reprogramming."}],"publication_status":"published"},{"_id":"1090","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-01-12T06:48:12Z","file":[{"creator":"system","file_id":"5286","date_created":"2018-12-12T10:17:31Z","date_updated":"2018-12-12T10:17:31Z","file_size":564560,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf"}],"language":[{"iso":"eng"}],"date_published":"2016-08-01T00:00:00Z","quality_controlled":"1","conference":{"location":"Krakow; Poland","name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2016-08-26","start_date":"2016-08-22"},"type":"conference","file_date_updated":"2018-12-12T10:17:31Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under grant 2014/15/D/ST6/04543.","status":"public","year":"2016","title":"Nested weighted limit-average automata of bounded width","doi":"10.4230/LIPIcs.MFCS.2016.24","ddc":["004"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"6286","has_accepted_license":"1","oa_version":"Published Version","publication_status":"published","abstract":[{"lang":"eng","text":" While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness."}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"article_number":"24","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":58,"intvolume":"        58","date_created":"2018-12-11T11:50:05Z","alternative_title":["LIPIcs"],"scopus_import":1,"day":"01","pubrep_id":"795","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Limit-Average Automata of Bounded Width</i>. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58."},"ec_funded":1,"oa":1},{"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-08-01T00:00:00Z","date_updated":"2023-09-07T11:58:33Z","file":[{"date_created":"2018-12-12T10:11:39Z","creator":"system","file_id":"4895","file_size":501827,"date_updated":"2018-12-12T10:11:39Z","content_type":"application/pdf","file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf","relation":"main_file","access_level":"open_access"}],"_id":"1093","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","has_accepted_license":"1","publist_id":"6283","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF) under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award), by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced Postdoc. Mobility Fellowship – grant number P300P2_161067.","status":"public","year":"2016","title":"Linear distances between Markov chains","doi":"10.4230/LIPIcs.CONCUR.2016.20","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["004"],"file_date_updated":"2018-12-12T10:11:39Z","author":[{"first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"first_name":"Tatjana","last_name":"Petrov","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905"}],"conference":{"start_date":"2016-08-23","name":"CONCUR: Concurrency Theory","end_date":"2016-08-26","location":"Quebec City; Canada"},"type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":59,"intvolume":"        59","date_created":"2018-12-11T11:50:06Z","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"article_number":"20","abstract":[{"text":"We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results. ","lang":"eng"}],"publication_status":"published","ec_funded":1,"oa":1,"citation":{"ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>.","mla":"Daca, Przemyslaw, et al. <i>Linear Distances between Markov Chains</i>. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>"},"department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"pubrep_id":"794","related_material":{"record":[{"id":"1155","status":"public","relation":"dissertation_contains"}]},"scopus_import":1,"day":"01","alternative_title":["LIPIcs"]},{"date_created":"2018-12-11T11:50:06Z","volume":1474,"intvolume":"      1474","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"604102","name":"Localization of ion channels and receptors by two and three-dimensional immunoelectron microscopic approaches","_id":"25CD3DD2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"abstract":[{"text":"Immunogold labeling of freeze-fracture replicas has recently been used for high-resolution visualization of protein localization in electron microscopy. This method has higher labeling efficiency than conventional immunogold methods for membrane molecules allowing precise quantitative measurements. However, one of the limitations of freeze-fracture replica immunolabeling is difficulty in keeping structural orientation and identifying labeled profiles in complex tissues like brain. The difficulty is partly due to fragmentation of freeze-fracture replica preparations during labeling procedures and limited morphological clues on the replica surface. To overcome these issues, we introduce here a grid-glued replica method combined with SEM observation. This method allows histological staining before dissolving the tissue and easy handling of replicas during immunogold labeling, and keeps the whole replica surface intact without fragmentation. The procedure described here is also useful for matched double-replica analysis allowing further identification of labeled profiles in corresponding P-face and E-face.","lang":"eng"}],"publication_status":"published","ec_funded":1,"citation":{"ista":"Harada H, Shigemoto R. 2016.Immunogold protein localization on grid-glued freeze-fracture replicas. In: High-Resolution Imaging of Cellular Proteins. Methods in Molecular Biology, vol. 1474, 203–216.","ama":"Harada H, Shigemoto R. Immunogold protein localization on grid-glued freeze-fracture replicas. In: <i>High-Resolution Imaging of Cellular Proteins</i>. Vol 1474. Springer; 2016:203-216. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>","short":"H. Harada, R. Shigemoto, in:, High-Resolution Imaging of Cellular Proteins, Springer, 2016, pp. 203–216.","chicago":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” In <i>High-Resolution Imaging of Cellular Proteins</i>, 1474:203–16. Springer, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>.","mla":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–16, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>.","apa":"Harada, H., &#38; Shigemoto, R. (2016). Immunogold protein localization on grid-glued freeze-fracture replicas. In <i>High-Resolution Imaging of Cellular Proteins</i> (Vol. 1474, pp. 203–216). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>","ieee":"H. Harada and R. Shigemoto, “Immunogold protein localization on grid-glued freeze-fracture replicas,” in <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–216."},"department":[{"_id":"RySh"}],"publication":"High-Resolution Imaging of Cellular Proteins","acknowledged_ssus":[{"_id":"EM-Fac"}],"alternative_title":["Methods in Molecular Biology"],"day":"12","date_published":"2016-08-12T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"page":"203 - 216","date_updated":"2023-09-05T14:09:01Z","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"]},"article_processing_charge":"No","month":"08","_id":"1094","publist_id":"6281","oa_version":"None","publisher":"Springer","doi":"10.1007/978-1-4939-6352-2_12","status":"public","year":"2016","title":"Immunogold protein localization on grid-glued freeze-fracture replicas","acknowledgement":"We thank Prof. Elek Molnár for providing us a pan-AMPAR anti-body used in Fig.2 and Dr. Ludek Lovicar for technical assistance in scanning electron microscope imaging. This work was supported by the European Union (HBP—Project Ref. 604102). ","author":[{"first_name":"Harumi","last_name":"Harada","full_name":"Harada, Harumi","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7429-7896"},{"orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"type":"book_chapter"},{"_id":"1095","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-01-12T06:48:14Z","file":[{"content_type":"application/pdf","file_name":"IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:10:10Z","creator":"system","file_id":"4795","file_size":589747,"date_updated":"2018-12-12T10:10:10Z"}],"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-08-01T00:00:00Z","type":"conference","conference":{"location":"Quebec City; Canada","end_date":"2016-08-26","name":"CONCUR: Concurrency Theory","start_date":"2016-08-23"},"file_date_updated":"2018-12-12T10:10:10Z","author":[{"first_name":"Andreas","last_name":"Haas","full_name":"Haas, Andreas"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Andreas","last_name":"Holzer","full_name":"Holzer, Andreas"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"full_name":"Lippautz, Michael","first_name":"Michael","last_name":"Lippautz"},{"full_name":"Payer, Hannes","first_name":"Hannes","last_name":"Payer"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"}],"acknowledgement":"This work has been supported by the National Research Network RiSE on Rigorous Systems Engineering\r\n(Austrian Science Fund (FWF): S11402-N23, S11403-N23, S11404-N23, S11411-N23), a Google\r\nPhD Fellowship, an Erwin Schrödinger Fellowship (Austrian Science Fund (FWF): J3696-N26), EPSRC\r\ngrants EP/H005633/1 and EP/K008528/1, the Vienna Science and Technology Fund (WWTF) trough\r\ngrant PROSEED, the European Research Council (ERC) under grant 267989 (QUAREM) and by the\r\nAustrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","title":"Local linearizability for concurrent container-type data structures","status":"public","year":"2016","doi":"10.4230/LIPIcs.CONCUR.2016.6","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["004"],"publist_id":"6280","oa_version":"Published Version","has_accepted_license":"1","abstract":[{"lang":"eng","text":" The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of concurrent data structures by relaxing their semantics. In this paper, we present local linearizability, a relaxed consistency condition that is applicable to container-type concurrent data structures like pools, queues, and stacks. While linearizability requires that the effect of each operation is observed by all threads at the same time, local linearizability only requires that for each thread T, the effects of its local insertion operations and the effects of those removal operations that remove values inserted by T are observed by all threads at the same time. We investigate theoretical and practical properties of local linearizability and its relationship to many existing consistency conditions. We present a generic implementation method for locally linearizable data structures that uses existing linearizable data structures as building blocks. Our implementations show performance and scalability improvements over the original building blocks and outperform the fastest existing container-type implementations. "}],"publication_status":"published","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"article_number":"6","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        59","volume":59,"date_created":"2018-12-11T11:50:07Z","day":"01","scopus_import":1,"alternative_title":["LIPIcs"],"pubrep_id":"793","publication":"Leibniz International Proceedings in Informatics","citation":{"ista":"Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A, Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 6.","ama":"Haas A, Henzinger TA, Holzer A, et al. Local linearizability for concurrent container-type data structures. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">10.4230/LIPIcs.CONCUR.2016.6</a>","short":"A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A. Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability for Concurrent Container-Type Data Structures.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>.","mla":"Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type Data Structures.” <i>Leibniz International Proceedings in Informatics</i>, vol. 59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">10.4230/LIPIcs.CONCUR.2016.6</a>.","apa":"Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H., … Veith, H. (2016). Local linearizability for concurrent container-type data structures. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 59). Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>","ieee":"A. Haas <i>et al.</i>, “Local linearizability for concurrent container-type data structures,” in <i>Leibniz International Proceedings in Informatics</i>, Quebec City; Canada, 2016, vol. 59."},"department":[{"_id":"ToHe"}],"oa":1,"ec_funded":1},{"scopus_import":1,"day":"20","type":"journal_article","related_material":{"record":[{"id":"7186","status":"public","relation":"part_of_dissertation"}]},"author":[{"orcid":"0000-0001-5130-2226","last_name":"Schwayer","first_name":"Cornelia","full_name":"Schwayer, Cornelia","id":"3436488C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sikora","first_name":"Mateusz K","full_name":"Sikora, Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87"},{"id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87","last_name":"Slovakova","first_name":"Jana","full_name":"Slovakova, Jana"},{"id":"4039350E-F248-11E8-B48F-1D18A9856A87","full_name":"Kardos, Roland","first_name":"Roland","last_name":"Kardos"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"year":"2016","status":"public","publication":"Developmental Cell","title":"Actin rings of power","publisher":"Cell Press","doi":"10.1016/j.devcel.2016.05.024","citation":{"ieee":"C. Schwayer, M. K. Sikora, J. Slovakova, R. Kardos, and C.-P. J. Heisenberg, “Actin rings of power,” <i>Developmental Cell</i>, vol. 37, no. 6. Cell Press, pp. 493–506, 2016.","apa":"Schwayer, C., Sikora, M. K., Slovakova, J., Kardos, R., &#38; Heisenberg, C.-P. J. (2016). Actin rings of power. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">https://doi.org/10.1016/j.devcel.2016.05.024</a>","chicago":"Schwayer, Cornelia, Mateusz K Sikora, Jana Slovakova, Roland Kardos, and Carl-Philipp J Heisenberg. “Actin Rings of Power.” <i>Developmental Cell</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">https://doi.org/10.1016/j.devcel.2016.05.024</a>.","mla":"Schwayer, Cornelia, et al. “Actin Rings of Power.” <i>Developmental Cell</i>, vol. 37, no. 6, Cell Press, 2016, pp. 493–506, doi:<a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">10.1016/j.devcel.2016.05.024</a>.","ama":"Schwayer C, Sikora MK, Slovakova J, Kardos R, Heisenberg C-PJ. Actin rings of power. <i>Developmental Cell</i>. 2016;37(6):493-506. doi:<a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">10.1016/j.devcel.2016.05.024</a>","ista":"Schwayer C, Sikora MK, Slovakova J, Kardos R, Heisenberg C-PJ. 2016. Actin rings of power. Developmental Cell. 37(6), 493–506.","short":"C. Schwayer, M.K. Sikora, J. Slovakova, R. Kardos, C.-P.J. Heisenberg, Developmental Cell 37 (2016) 493–506."},"department":[{"_id":"CaHe"}],"oa_version":"None","publist_id":"6279","_id":"1096","month":"06","publication_status":"published","date_updated":"2023-09-07T12:56:41Z","page":"493 - 506","issue":"6","volume":37,"language":[{"iso":"eng"}],"intvolume":"        37","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-06-20T00:00:00Z","date_created":"2018-12-11T11:50:07Z","quality_controlled":"1"},{"ec_funded":1,"oa":1,"citation":{"chicago":"Du, Tao, Adriana Schulz, Bo Zhu, Bernd Bickel, and Wojciech Matusik. “Computational Multicopter Design,” Vol. 35. ACM, 2016. <a href=\"https://doi.org/10.1145/2980179.2982427\">https://doi.org/10.1145/2980179.2982427</a>.","mla":"Du, Tao, et al. <i>Computational Multicopter Design</i>. Vol. 35, no. 6, 227, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2980179.2982427\">10.1145/2980179.2982427</a>.","ieee":"T. Du, A. Schulz, B. Zhu, B. Bickel, and W. Matusik, “Computational multicopter design,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no. 6.","apa":"Du, T., Schulz, A., Zhu, B., Bickel, B., &#38; Matusik, W. (2016). Computational multicopter design (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. <a href=\"https://doi.org/10.1145/2980179.2982427\">https://doi.org/10.1145/2980179.2982427</a>","ista":"Du T, Schulz A, Zhu B, Bickel B, Matusik W. 2016. Computational multicopter design. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol. 35, 227.","ama":"Du T, Schulz A, Zhu B, Bickel B, Matusik W. Computational multicopter design. In: Vol 35. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2980179.2982427\">10.1145/2980179.2982427</a>","short":"T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016."},"department":[{"_id":"BeBi"}],"pubrep_id":"759","alternative_title":["ACM Transactions on Graphics"],"scopus_import":1,"day":"01","volume":35,"intvolume":"        35","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:50:07Z","project":[{"call_identifier":"H2020","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation"}],"article_number":"227","publication_status":"published","abstract":[{"text":"We present an interactive system for computational design, optimization, and fabrication of multicopters. Our computational approach allows non-experts to design, explore, and evaluate a wide range of different multicopters. We provide users with an intuitive interface for assembling a multicopter from a collection of components (e.g., propellers, motors, and carbon fiber rods). Our algorithm interactively optimizes shape and controller parameters of the current design to ensure its proper operation. In addition, we allow incorporating a variety of other metrics (such as payload, battery usage, size, and cost) into the design process and exploring tradeoffs between them. We show the efficacy of our method and system by designing, optimizing, fabricating, and operating multicopters with complex geometries and propeller configurations. We also demonstrate the ability of our optimization algorithm to improve the multicopter performance under different metrics.","lang":"eng"}],"has_accepted_license":"1","publist_id":"6278","oa_version":"Submitted Version","title":"Computational multicopter design","status":"public","year":"2016","acknowledgement":"We thank Nobuyuki Umetani for his insightful suggestions in our discussions. We thank Alan Schultz and his colleagues at NRL for building the hexacopter and for the valuable discussions. We thank Randall Davis, Boris Katz, and Howard Shrobe at MIT for their advice. We are grateful to Nick Bandiera for preprocessing mechanical parts and providing 3D printing technical support; Charles Blouin from RCBenchmark for dynamometer hardware support; Brian Saavedra for the composition UI; Yingzhe Yuan for data acquisition and video recording in the experiments; Michael Foshey and David Kim for their comments on the draft of the paper. \r\n\r\n\r\nThis work was partially supported by Air Force Research Laboratory’s sponsorship of Julia: A Fresh Approach to Technical Computing and Data Processing (Sponsor Award ID FA8750-15-2- 0272, MIT Award ID 024831-00003), and NSF Expedition project (Sponsor Award ID CCF-1138967, MIT Award ID 020610-00002). The views expressed herein are not endorsed by the sponsors. This project has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No 645599. ","publisher":"ACM","ddc":["006"],"doi":"10.1145/2980179.2982427","file_date_updated":"2018-12-12T10:17:42Z","author":[{"first_name":"Tao","last_name":"Du","full_name":"Du, Tao"},{"first_name":"Adriana","last_name":"Schulz","full_name":"Schulz, Adriana"},{"first_name":"Bo","last_name":"Zhu","full_name":"Zhu, Bo"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"}],"type":"conference","conference":{"end_date":"2016-12-08","name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","start_date":"2016-12-05","location":"Macao, China"},"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-11-01T00:00:00Z","date_updated":"2021-01-12T06:48:15Z","file":[{"file_id":"5298","creator":"system","date_created":"2018-12-12T10:17:42Z","date_updated":"2018-12-12T10:17:42Z","file_size":33114420,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"IST-2017-759-v1+1_copter.pdf"}],"issue":"6","_id":"1097","month":"11"},{"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-12-01T00:00:00Z","date_updated":"2021-01-12T06:48:15Z","page":"3619-3627","file":[{"access_level":"open_access","relation":"main_file","file_name":"IST-2017-775-v1+1_main.pdf","content_type":"application/pdf","date_updated":"2018-12-12T10:12:42Z","file_size":237111,"creator":"system","file_id":"4961","date_created":"2018-12-12T10:12:42Z"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2017-775-v1+2_supplementary.pdf","creator":"system","file_id":"4962","date_created":"2018-12-12T10:12:43Z","date_updated":"2018-12-12T10:12:43Z","file_size":185818}],"_id":"1098","month":"12","has_accepted_license":"1","oa_version":"Published Version","publist_id":"6277","acknowledgement":"This work was in parts funded by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.\r\n\r\n","year":"2016","title":"Lifelong learning with weighted majority votes","status":"public","publisher":"Neural Information Processing Systems","ddc":["006"],"file_date_updated":"2018-12-12T10:12:43Z","author":[{"full_name":"Pentina, Anastasia","last_name":"Pentina","first_name":"Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Urner","first_name":"Ruth","full_name":"Urner, Ruth"}],"conference":{"location":"Barcelona, Spain","start_date":"2016-12-05","end_date":"2016-12-10","name":"NIPS: Neural Information Processing Systems"},"type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        29","volume":29,"date_created":"2018-12-11T11:50:08Z","project":[{"call_identifier":"FP7","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","abstract":[{"text":"Better understanding of the potential benefits of information transfer and representation learning is an important step towards the goal of building intelligent systems that are able to persist in the world and learn over time. In this work, we consider a setting where the learner encounters a stream of tasks but is able to retain only limited information from each encountered task, such as a learned predictor. In contrast to most previous works analyzing this scenario, we do not make any distributional assumptions on the task generating process. Instead, we formulate a complexity measure that captures the diversity of the observed tasks. We provide a lifelong learning algorithm with error guarantees for every observed task (rather than on average). We show sample complexity reductions in comparison to solving every task in isolation in terms of our task complexity measure. Further, our algorithmic framework can naturally be viewed as learning a representation from encountered tasks with a neural network.","lang":"eng"}],"oa":1,"ec_funded":1,"citation":{"short":"A. Pentina, R. Urner, in:, Neural Information Processing Systems, 2016, pp. 3619–3627.","ista":"Pentina A, Urner R. 2016. Lifelong learning with weighted majority votes. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 3619–3627.","ama":"Pentina A, Urner R. Lifelong learning with weighted majority votes. In: Vol 29. Neural Information Processing Systems; 2016:3619-3627.","ieee":"A. Pentina and R. Urner, “Lifelong learning with weighted majority votes,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 3619–3627.","apa":"Pentina, A., &#38; Urner, R. (2016). Lifelong learning with weighted majority votes (Vol. 29, pp. 3619–3627). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems.","mla":"Pentina, Anastasia, and Ruth Urner. <i>Lifelong Learning with Weighted Majority Votes</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 3619–27.","chicago":"Pentina, Anastasia, and Ruth Urner. “Lifelong Learning with Weighted Majority Votes,” 29:3619–27. Neural Information Processing Systems, 2016."},"department":[{"_id":"ChLa"}],"pubrep_id":"775","day":"01","alternative_title":["Advances in Neural Information Processing Systems"],"scopus_import":1},{"issue":"6","file":[{"file_name":"IST-2017-760-v1+1_flexmolds.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":11122029,"date_updated":"2018-12-12T10:12:01Z","date_created":"2018-12-12T10:12:01Z","creator":"system","file_id":"4918"}],"date_updated":"2021-01-12T06:48:16Z","quality_controlled":"1","date_published":"2016-11-01T00:00:00Z","language":[{"iso":"eng"}],"month":"11","_id":"1099","doi":"10.1145/2980179.2982397","ddc":["000","005"],"publisher":"ACM","acknowledgement":"The armadillo, bunny and dragon models are courtesy of the Stanford  3D  Scanning  Repository.   The  bimba,  fertility  and  elephant models are courtesy of the AIM@SHAPE Shape Repository.  \r\nThis project has received funding from the European Union’s Horizon 2020  research  and  innovation  programme  under  grant  agreement\r\nNo. 645599.","status":"public","year":"2016","title":"FlexMolds: Automatic design of flexible shells for molding","has_accepted_license":"1","oa_version":"Submitted Version","publist_id":"6276","conference":{"name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","end_date":"2016-12-08","start_date":"2016-12-05","location":"Macao, China"},"type":"conference","author":[{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"}],"file_date_updated":"2018-12-12T10:12:01Z","date_created":"2018-12-11T11:50:08Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        35","volume":35,"abstract":[{"text":"We present FlexMolds, a novel computational approach to automatically design flexible, reusable molds that, once 3D printed, allow us to physically fabricate, by means of liquid casting, multiple copies of complex shapes with rich surface details and complex topology. The approach to design such flexible molds is based on a greedy bottom-up search of possible cuts over an object, evaluating for each possible cut the feasibility of the resulting mold. We use a dynamic simulation approach to evaluate candidate molds, providing a heuristic to generate forces that are able to open, detach, and remove a complex mold from the object it surrounds. We have tested the approach with a number of objects with nontrivial shapes and topologies.","lang":"eng"}],"publication_status":"published","article_number":"223","project":[{"call_identifier":"H2020","_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599"}],"citation":{"apa":"Malomo, L., Pietroni, N., Bickel, B., &#38; Cignoni, P. (2016). FlexMolds: Automatic design of flexible shells for molding (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. <a href=\"https://doi.org/10.1145/2980179.2982397\">https://doi.org/10.1145/2980179.2982397</a>","ieee":"L. Malomo, N. Pietroni, B. Bickel, and P. Cignoni, “FlexMolds: Automatic design of flexible shells for molding,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no. 6.","mla":"Malomo, Luigi, et al. <i>FlexMolds: Automatic Design of Flexible Shells for Molding</i>. Vol. 35, no. 6, 223, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2980179.2982397\">10.1145/2980179.2982397</a>.","chicago":"Malomo, Luigi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “FlexMolds: Automatic Design of Flexible Shells for Molding,” Vol. 35. ACM, 2016. <a href=\"https://doi.org/10.1145/2980179.2982397\">https://doi.org/10.1145/2980179.2982397</a>.","short":"L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016.","ista":"Malomo L, Pietroni N, Bickel B, Cignoni P. 2016. FlexMolds: Automatic design of flexible shells for molding. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol. 35, 223.","ama":"Malomo L, Pietroni N, Bickel B, Cignoni P. FlexMolds: Automatic design of flexible shells for molding. In: Vol 35. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2980179.2982397\">10.1145/2980179.2982397</a>"},"department":[{"_id":"BeBi"}],"oa":1,"ec_funded":1,"day":"01","alternative_title":["ACM Transactions on Graphics"],"scopus_import":1,"pubrep_id":"760"},{"file_date_updated":"2018-12-12T10:11:04Z","author":[{"last_name":"Sako","first_name":"Keisuke","full_name":"Sako, Keisuke","id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6453-8075"},{"full_name":"Pradhan, Saurabh","first_name":"Saurabh","last_name":"Pradhan"},{"orcid":"0000-0003-2676-3367","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","full_name":"Barone, Vanessa","first_name":"Vanessa","last_name":"Barone"},{"first_name":"Álvaro","last_name":"Inglés Prieto","full_name":"Inglés Prieto, Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5409-8571"},{"first_name":"Patrick","last_name":"Mueller","full_name":"Mueller, Patrick"},{"id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","full_name":"Ruprecht, Verena","last_name":"Ruprecht","first_name":"Verena","orcid":"0000-0003-4088-8633"},{"orcid":"0000-0001-5199-9940","first_name":"Daniel","last_name":"Capek","full_name":"Capek, Daniel","id":"31C42484-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sanjeev","last_name":"Galande","full_name":"Galande, Sanjeev"},{"orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"type":"journal_article","has_accepted_license":"1","oa_version":"Published Version","publist_id":"6275","title":"Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation","year":"2016","status":"public","acknowledgement":"We are grateful to members of the C.-P.H. and H.J. labs for discussions, R. Hauschild and the different Scientific Service Units at IST Austria for technical help, M. Dravecka for performing initial experiments, A. Schier for reading an earlier version of the manuscript, K.W. Rogers for technical help, and C. Hill, A. Bruce, and L. Solnica-Krezel for sending plasmids. This work was supported by grants from the Austrian Science Foundation (FWF): (T560-B17) and (I 812-B12) to V.R. and C.-P.H., and from the European Union (EU FP7): (6275) to H.J. A.I.-P. is supported by a Ramon Areces fellowship.","publisher":"Cell Press","ddc":["570","576"],"doi":"10.1016/j.celrep.2016.06.036","_id":"1100","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"07","language":[{"iso":"eng"}],"date_published":"2016-07-19T00:00:00Z","quality_controlled":"1","date_updated":"2024-03-25T23:30:13Z","file":[{"date_created":"2018-12-12T10:11:04Z","creator":"system","file_id":"4857","file_size":3921947,"date_updated":"2018-12-12T10:11:04Z","content_type":"application/pdf","file_name":"IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf","relation":"main_file","access_level":"open_access"}],"page":"866 - 877","issue":"3","pubrep_id":"754","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"961"},{"relation":"dissertation_contains","status":"public","id":"50"}]},"acknowledged_ssus":[{"_id":"SSU"}],"scopus_import":1,"day":"19","ec_funded":1,"oa":1,"publication":"Cell Reports","citation":{"mla":"Sako, Keisuke, et al. “Optogenetic Control of Nodal Signaling Reveals a Temporal Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.” <i>Cell Reports</i>, vol. 16, no. 3, Cell Press, 2016, pp. 866–77, doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">10.1016/j.celrep.2016.06.036</a>.","chicago":"Sako, Keisuke, Saurabh Pradhan, Vanessa Barone, Álvaro Inglés Prieto, Patrick Mueller, Verena Ruprecht, Daniel Capek, Sanjeev Galande, Harald L Janovjak, and Carl-Philipp J Heisenberg. “Optogenetic Control of Nodal Signaling Reveals a Temporal Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.” <i>Cell Reports</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">https://doi.org/10.1016/j.celrep.2016.06.036</a>.","apa":"Sako, K., Pradhan, S., Barone, V., Inglés Prieto, Á., Mueller, P., Ruprecht, V., … Heisenberg, C.-P. J. (2016). Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">https://doi.org/10.1016/j.celrep.2016.06.036</a>","ieee":"K. Sako <i>et al.</i>, “Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation,” <i>Cell Reports</i>, vol. 16, no. 3. Cell Press, pp. 866–877, 2016.","short":"K. Sako, S. Pradhan, V. Barone, Á. Inglés Prieto, P. Mueller, V. Ruprecht, D. Capek, S. Galande, H.L. Janovjak, C.-P.J. Heisenberg, Cell Reports 16 (2016) 866–877.","ama":"Sako K, Pradhan S, Barone V, et al. Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. <i>Cell Reports</i>. 2016;16(3):866-877. doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">10.1016/j.celrep.2016.06.036</a>","ista":"Sako K, Pradhan S, Barone V, Inglés Prieto Á, Mueller P, Ruprecht V, Capek D, Galande S, Janovjak HL, Heisenberg C-PJ. 2016. Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. Cell Reports. 16(3), 866–877."},"department":[{"_id":"CaHe"},{"_id":"HaJa"}],"project":[{"name":"Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation","_id":"2529486C-B435-11E9-9278-68D0E5697425","grant_number":"T 560-B17","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I 812-B12","name":"Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation","_id":"2527D5CC-B435-11E9-9278-68D0E5697425"},{"name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication_status":"published","abstract":[{"text":"During metazoan development, the temporal pattern of morphogen signaling is critical for organizing cell fates in space and time. Yet, tools for temporally controlling morphogen signaling within the embryo are still scarce. Here, we developed a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal signaling affects cell fate specification during zebrafish gastrulation. By using this receptor to manipulate the duration of Nodal signaling in vivo by light, we show that extended Nodal signaling within the organizer promotes prechordal plate specification and suppresses endoderm differentiation. Endoderm differentiation is suppressed by extended Nodal signaling inducing expression of the transcriptional repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains Nodal signaling from upregulating the endoderm differentiation gene sox17 within these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical role of Nodal signaling duration for organizer cell fate specification during gastrulation.","lang":"eng"}],"intvolume":"        16","volume":16,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:50:08Z"},{"publisher":"American Chemical Society","department":[{"_id":"HaJa"}],"doi":"10.1021/acssensors.6b00576","citation":{"mla":"Mitchell, Joshua, et al. “Rangefinder: A Semisynthetic FRET Sensor Design Algorithm.” <i>ACS SENSORS</i>, vol. 1, no. 11, American Chemical Society, 2016, pp. 1286–90, doi:<a href=\"https://doi.org/10.1021/acssensors.6b00576\">10.1021/acssensors.6b00576</a>.","chicago":"Mitchell, Joshua, Jason Whitfield, William Zhang, Christian Henneberger, Harald L Janovjak, Megan O’Mara, and Colin Jackson. “Rangefinder: A Semisynthetic FRET Sensor Design Algorithm.” <i>ACS SENSORS</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acssensors.6b00576\">https://doi.org/10.1021/acssensors.6b00576</a>.","ieee":"J. Mitchell <i>et al.</i>, “Rangefinder: A semisynthetic FRET sensor design algorithm,” <i>ACS SENSORS</i>, vol. 1, no. 11. American Chemical Society, pp. 1286–1290, 2016.","apa":"Mitchell, J., Whitfield, J., Zhang, W., Henneberger, C., Janovjak, H. L., O’Mara, M., &#38; Jackson, C. (2016). Rangefinder: A semisynthetic FRET sensor design algorithm. <i>ACS SENSORS</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acssensors.6b00576\">https://doi.org/10.1021/acssensors.6b00576</a>","short":"J. Mitchell, J. Whitfield, W. Zhang, C. Henneberger, H.L. Janovjak, M. O’Mara, C. Jackson, ACS SENSORS 1 (2016) 1286–1290.","ama":"Mitchell J, Whitfield J, Zhang W, et al. Rangefinder: A semisynthetic FRET sensor design algorithm. <i>ACS SENSORS</i>. 2016;1(11):1286-1290. doi:<a href=\"https://doi.org/10.1021/acssensors.6b00576\">10.1021/acssensors.6b00576</a>","ista":"Mitchell J, Whitfield J, Zhang W, Henneberger C, Janovjak HL, O’Mara M, Jackson C. 2016. Rangefinder: A semisynthetic FRET sensor design algorithm. ACS SENSORS. 1(11), 1286–1290."},"title":"Rangefinder: A semisynthetic FRET sensor design algorithm","status":"public","year":"2016","publication":"ACS SENSORS","acknowledgement":"J.A.M., J.H.W., and W.H.Z. were supported by Australian\r\nPostgraduate Awards (APA), AS Sargeson Supplementary\r\nscholarships, and RSC supplementary scholarships. C.J.J.\r\nacknowledges support from a Human Frontiers in Science\r\nYoung Investigator Award and a Discovery Project and Future\r\nFellowship from the Australian Research Council. M.L.O. is\r\nsupported by an Australian Research Council Discovery Project\r\n(DP130102153) and the Merit Allocation Scheme of the\r\nNational Computational Infrastructure.","oa_version":"None","publist_id":"6274","type":"journal_article","scopus_import":"1","day":"10","author":[{"full_name":"Mitchell, Joshua","last_name":"Mitchell","first_name":"Joshua"},{"full_name":"Whitfield, Jason","first_name":"Jason","last_name":"Whitfield"},{"first_name":"William","last_name":"Zhang","full_name":"Zhang, William"},{"full_name":"Henneberger, Christian","last_name":"Henneberger","first_name":"Christian"},{"orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L"},{"last_name":"O'Mara","first_name":"Megan","full_name":"O'Mara, Megan"},{"first_name":"Colin","last_name":"Jackson","full_name":"Jackson, Colin"}],"issue":"11","page":"1286 - 1290","date_updated":"2023-03-30T11:32:33Z","quality_controlled":"1","date_created":"2018-12-11T11:50:09Z","date_published":"2016-11-10T00:00:00Z","language":[{"iso":"eng"}],"volume":1,"intvolume":"         1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"11","publication_status":"published","abstract":[{"lang":"eng","text":"Optical sensors based on the phenomenon of Förster resonance energy transfer (FRET) are powerful tools that have advanced the study of small molecules in biological systems. However, sensor construction is not trivial and often requires multiple rounds of engineering or an ability to screen large numbers of variants. A method that would allow the accurate rational design of FRET sensors would expedite the production of biologically useful sensors. Here, we present Rangefinder, a computational algorithm that allows rapid in silico screening of dye attachment sites in a ligand-binding protein for the conjugation of a dye molecule to act as a Förster acceptor for a fused fluorescent protein. We present three ratiometric fluorescent sensors designed with Rangefinder, including a maltose sensor with a dynamic range of &gt;300% and the first sensors for the most abundant sialic acid in human cells, N-acetylneuraminic acid. Provided a ligand-binding protein exists, it is our expectation that this model will facilitate the design of an optical sensor for any small molecule of interest."}],"_id":"1101"},{"date_created":"2018-12-11T11:50:09Z","volume":"2016-September","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Weakly-supervised object localization methods tend to fail for object classes that consistently co-occur with the same background elements, e.g. trains on tracks. We propose a method to overcome these failures by adding a very small amount of model-specific additional annotation. The main idea is to cluster a deep network\\'s mid-level representations and assign object or distractor labels to each cluster. Experiments show substantially improved localization results on the challenging ILSVC2014 dataset for bounding box detection and the PASCAL VOC2012 dataset for semantic segmentation.","lang":"eng"}],"project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"ama":"Kolesnikov A, Lampert C. Improving weakly-supervised object localization by micro-annotation. In: <i>Proceedings of the British Machine Vision Conference 2016</i>. Vol 2016-September. BMVA Press; 2016:92.1-92.12. doi:<a href=\"https://doi.org/10.5244/C.30.92\">10.5244/C.30.92</a>","ista":"Kolesnikov A, Lampert C. 2016. Improving weakly-supervised object localization by micro-annotation. Proceedings of the British Machine Vision Conference 2016. BMVC: British Machine Vision Conference vol. 2016–September, 92.1-92.12.","short":"A. Kolesnikov, C. Lampert, in:, Proceedings of the British Machine Vision Conference 2016, BMVA Press, 2016, p. 92.1-92.12.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised Object Localization by Micro-Annotation.” In <i>Proceedings of the British Machine Vision Conference 2016</i>, 2016–September:92.1-92.12. BMVA Press, 2016. <a href=\"https://doi.org/10.5244/C.30.92\">https://doi.org/10.5244/C.30.92</a>.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised Object Localization by Micro-Annotation.” <i>Proceedings of the British Machine Vision Conference 2016</i>, vol. 2016–September, BMVA Press, 2016, p. 92.1-92.12, doi:<a href=\"https://doi.org/10.5244/C.30.92\">10.5244/C.30.92</a>.","apa":"Kolesnikov, A., &#38; Lampert, C. (2016). Improving weakly-supervised object localization by micro-annotation. In <i>Proceedings of the British Machine Vision Conference 2016</i> (Vol. 2016–September, p. 92.1-92.12). York, United Kingdom: BMVA Press. <a href=\"https://doi.org/10.5244/C.30.92\">https://doi.org/10.5244/C.30.92</a>","ieee":"A. Kolesnikov and C. Lampert, “Improving weakly-supervised object localization by micro-annotation,” in <i>Proceedings of the British Machine Vision Conference 2016</i>, York, United Kingdom, 2016, vol. 2016–September, p. 92.1-92.12."},"department":[{"_id":"ChLa"}],"publication":"Proceedings of the British Machine Vision Conference 2016","oa":1,"ec_funded":1,"day":"01","scopus_import":1,"page":"92.1-92.12","date_updated":"2021-01-12T06:48:18Z","date_published":"2016-09-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"month":"09","_id":"1102","publisher":"BMVA Press","doi":"10.5244/C.30.92","title":"Improving weakly-supervised object localization by micro-annotation","year":"2016","status":"public","acknowledgement":"This work was funded in parts by the European Research Council\r\nunder the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant\r\nagreement no 308036. We gratefully acknowledge the support of NVIDIA Corporation with\r\nthe donation of the GPUs used for this research.","oa_version":"Published Version","publist_id":"6273","conference":{"location":"York, United Kingdom","name":"BMVC: British Machine Vision Conference","end_date":"2016-09-22","start_date":"2016-09-19"},"type":"conference","author":[{"id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"main_file_link":[{"url":"http://www.bmva.org/bmvc/2016/papers/paper092/paper092.pdf","open_access":"1"}]},{"article_number":"7797741","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"abstract":[{"lang":"eng","text":"We propose two parallel state-space-exploration algorithms for hybrid automaton (HA), with the goal of enhancing performance on multi-core shared-memory systems. The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN model checker, when traversing the discrete modes of the HA, and enhances it with a parallel exploration of the continuous states within each mode. We show that this simple-minded extension of PBFS does not provide the desired load balancing in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS), which uses a cheap precomputation of the cost associated with the post operations (both continuous and discrete) in order to improve load balancing. We illustrate the TP-BFS and the cost precomputation of the post operators on a support-function-based algorithm for state-space exploration. The performance comparison of the two algorithms shows that, in general, TP-BFS provides a better utilization/load-balancing of the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect to SpaceEx LGG scenario. In order to make the comparison fair, we employed an equal number of post operations in both tools. To the best of our knowledge, this paper represents the first attempt to provide parallel, reachability-analysis algorithms for HA."}],"month":"12","publication_status":"published","_id":"1103","quality_controlled":"1","date_created":"2018-12-11T11:50:09Z","date_published":"2016-12-27T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:48:18Z","author":[{"first_name":"Amit","last_name":"Gurung","full_name":"Gurung, Amit"},{"full_name":"Deka, Arup","last_name":"Deka","first_name":"Arup"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"last_name":"Ray","first_name":"Rajarshi","full_name":"Ray, Rajarshi"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.05473"}],"type":"conference","conference":{"start_date":"2016-11-18","end_date":"2016-11-20","name":"MEMOCODE: International Conference on Formal Methods and Models for System Design","location":"Kanpur, India "},"day":"27","scopus_import":1,"oa_version":"Preprint","ec_funded":1,"oa":1,"publist_id":"6272","doi":"10.1109/MEMCOD.2016.7797741","department":[{"_id":"ToHe"}],"citation":{"apa":"Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., &#38; Ray, R. (2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India : IEEE. <a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">https://doi.org/10.1109/MEMCOD.2016.7797741</a>","ieee":"A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel reachability analysis for hybrid systems,” presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India , 2016.","chicago":"Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.” IEEE, 2016. <a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">https://doi.org/10.1109/MEMCOD.2016.7797741</a>.","mla":"Gurung, Amit, et al. <i>Parallel Reachability Analysis for Hybrid Systems</i>. 7797741, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">10.1109/MEMCOD.2016.7797741</a>.","ama":"Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. Parallel reachability analysis for hybrid systems. In: IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">10.1109/MEMCOD.2016.7797741</a>","ista":"Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. 2016. Parallel reachability analysis for hybrid systems. MEMOCODE: International Conference on Formal Methods and Models for System Design, 7797741.","short":"A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, R. Ray, in:, IEEE, 2016."},"publisher":"IEEE","acknowledgement":"This work was supported in part by DST-SERB, GoI under Project No. YSS/2014/000623 and by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).","year":"2016","status":"public","title":"Parallel reachability analysis for hybrid systems"},{"date_created":"2018-12-11T11:50:10Z","intvolume":"        29","volume":29,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"publication_status":"published","abstract":[{"text":"Jointly characterizing neural responses in terms of several external variables promises novel insights into circuit function, but remains computationally prohibitive in practice. Here we use gaussian process (GP) priors and exploit recent advances in fast GP inference and learning based on Kronecker methods, to efficiently estimate multidimensional nonlinear tuning functions. Our estimator require considerably less data than traditional methods and further provides principled uncertainty estimates. We apply these tools to hippocampal recordings during open field exploration and use them to characterize the joint dependence of CA1 responses on the position of the animal and several other variables, including the animal\\'s speed, direction of motion, and network oscillations.Our results provide an unprecedentedly detailed quantification of the tuning of hippocampal neurons. The model\\'s generality suggests that our approach can be used to estimate neural response properties in other brain regions.","lang":"eng"}],"ec_funded":1,"citation":{"short":"C. Savin, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 3610–3618.","ista":"Savin C, Tkačik G. 2016. Estimating nonlinear neural response functions using GP priors and Kronecker methods. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 3610–3618.","ama":"Savin C, Tkačik G. Estimating nonlinear neural response functions using GP priors and Kronecker methods. In: Vol 29. Neural Information Processing Systems; 2016:3610-3618.","mla":"Savin, Cristina, and Gašper Tkačik. <i>Estimating Nonlinear Neural Response Functions Using GP Priors and Kronecker Methods</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 3610–18.","chicago":"Savin, Cristina, and Gašper Tkačik. “Estimating Nonlinear Neural Response Functions Using GP Priors and Kronecker Methods,” 29:3610–18. Neural Information Processing Systems, 2016.","apa":"Savin, C., &#38; Tkačik, G. (2016). Estimating nonlinear neural response functions using GP priors and Kronecker methods (Vol. 29, pp. 3610–3618). Presented at the NIPS: Neural Information Processing Systems, Barcelona; Spain: Neural Information Processing Systems.","ieee":"C. Savin and G. Tkačik, “Estimating nonlinear neural response functions using GP priors and Kronecker methods,” presented at the NIPS: Neural Information Processing Systems, Barcelona; Spain, 2016, vol. 29, pp. 3610–3618."},"department":[{"_id":"GaTk"}],"scopus_import":1,"alternative_title":["Advances in Neural Information Processing Systems"],"day":"01","quality_controlled":"1","date_published":"2016-12-01T00:00:00Z","language":[{"iso":"eng"}],"page":"3610-3618","date_updated":"2021-01-12T06:48:19Z","month":"12","_id":"1105","publist_id":"6265","oa_version":"None","publisher":"Neural Information Processing Systems","year":"2016","status":"public","title":"Estimating nonlinear neural response functions using GP priors and Kronecker methods","acknowledgement":"We  thank  Jozsef  Csicsvari  for  kindly  sharing  the  CA1  data.\r\nThis work was supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme(FP7/2007-2013) under REA grant agreement no. 291734.","author":[{"id":"3933349E-F248-11E8-B48F-1D18A9856A87","full_name":"Savin, Cristina","last_name":"Savin","first_name":"Cristina"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455"}],"main_file_link":[{"url":"http://papers.nips.cc/paper/6153-estimating-nonlinear-neural-response-functions-using-gp-priors-and-kronecker-methods"}],"type":"conference","conference":{"start_date":"2016-12-05","end_date":"2016-12-10","name":"NIPS: Neural Information Processing Systems","location":"Barcelona; Spain"}},{"scopus_import":"1","day":"03","keyword":["Cell Biology"],"citation":{"short":"E.M. Hatch, M. Hetzer, Journal of Cell Biology 215 (2016) 27–36.","ama":"Hatch EM, Hetzer M. Nuclear envelope rupture is induced by actin-based nucleus confinement. <i>Journal of Cell Biology</i>. 2016;215(1):27-36. doi:<a href=\"https://doi.org/10.1083/jcb.201603053\">10.1083/jcb.201603053</a>","ista":"Hatch EM, Hetzer M. 2016. Nuclear envelope rupture is induced by actin-based nucleus confinement. Journal of Cell Biology. 215(1), 27–36.","apa":"Hatch, E. M., &#38; Hetzer, M. (2016). Nuclear envelope rupture is induced by actin-based nucleus confinement. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201603053\">https://doi.org/10.1083/jcb.201603053</a>","ieee":"E. M. Hatch and M. Hetzer, “Nuclear envelope rupture is induced by actin-based nucleus confinement,” <i>Journal of Cell Biology</i>, vol. 215, no. 1. Rockefeller University Press, pp. 27–36, 2016.","mla":"Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced by Actin-Based Nucleus Confinement.” <i>Journal of Cell Biology</i>, vol. 215, no. 1, Rockefeller University Press, 2016, pp. 27–36, doi:<a href=\"https://doi.org/10.1083/jcb.201603053\">10.1083/jcb.201603053</a>.","chicago":"Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced by Actin-Based Nucleus Confinement.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2016. <a href=\"https://doi.org/10.1083/jcb.201603053\">https://doi.org/10.1083/jcb.201603053</a>."},"publication":"Journal of Cell Biology","oa":1,"publication_status":"published","abstract":[{"lang":"eng","text":"Repeated rounds of nuclear envelope (NE) rupture and repair have been observed in laminopathy and cancer cells and result in intermittent loss of nucleus compartmentalization. Currently, the causes of NE rupture are unclear. Here, we show that NE rupture in cancer cells relies on the assembly of contractile actin bundles that interact with the nucleus via the linker of nucleoskeleton and cytoskeleton (LINC) complex. We found that the loss of actin bundles or the LINC complex did not rescue nuclear lamina defects, a previously identified determinant of nuclear membrane stability, but did decrease the number and size of chromatin hernias. Finally, NE rupture inhibition could be rescued in cells treated with actin-depolymerizing drugs by mechanically constraining nucleus height. These data suggest a model of NE rupture where weak membrane areas, caused by defects in lamina organization, rupture because of an increase in intranuclear pressure from actin-based nucleus confinement."}],"pmid":1,"extern":"1","date_created":"2022-04-07T07:47:42Z","intvolume":"       215","volume":215,"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","type":"journal_article","author":[{"first_name":"Emily M.","last_name":"Hatch","full_name":"Hatch, Emily M."},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X"}],"main_file_link":[{"url":"https://doi.org/10.1083/jcb.201603053","open_access":"1"}],"publisher":"Rockefeller University Press","doi":"10.1083/jcb.201603053","year":"2016","status":"public","title":"Nuclear envelope rupture is induced by actin-based nucleus confinement","oa_version":"Published Version","article_processing_charge":"No","month":"10","_id":"11069","publication_identifier":{"issn":["0021-9525","1540-8140"]},"page":"27-36","issue":"1","external_id":{"pmid":["27697922"]},"date_updated":"2022-07-18T08:33:47Z","article_type":"original","date_published":"2016-10-03T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}]},{"citation":{"chicago":"Ibarra, Arkaitz, Chris Benner, Swati Tyagi, Jonah Cool, and Martin Hetzer. “Nucleoporin-Mediated Regulation of Cell Identity Genes.” <i>Genes &#38; Development</i>. Cold Spring Harbor Laboratory, 2016. <a href=\"https://doi.org/10.1101/gad.287417.116\">https://doi.org/10.1101/gad.287417.116</a>.","mla":"Ibarra, Arkaitz, et al. “Nucleoporin-Mediated Regulation of Cell Identity Genes.” <i>Genes &#38; Development</i>, vol. 30, no. 20, Cold Spring Harbor Laboratory, 2016, pp. 2253–58, doi:<a href=\"https://doi.org/10.1101/gad.287417.116\">10.1101/gad.287417.116</a>.","ieee":"A. Ibarra, C. Benner, S. Tyagi, J. Cool, and M. Hetzer, “Nucleoporin-mediated regulation of cell identity genes,” <i>Genes &#38; Development</i>, vol. 30, no. 20. Cold Spring Harbor Laboratory, pp. 2253–2258, 2016.","apa":"Ibarra, A., Benner, C., Tyagi, S., Cool, J., &#38; Hetzer, M. (2016). Nucleoporin-mediated regulation of cell identity genes. <i>Genes &#38; Development</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/gad.287417.116\">https://doi.org/10.1101/gad.287417.116</a>","ama":"Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. Nucleoporin-mediated regulation of cell identity genes. <i>Genes &#38; Development</i>. 2016;30(20):2253-2258. doi:<a href=\"https://doi.org/10.1101/gad.287417.116\">10.1101/gad.287417.116</a>","ista":"Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. 2016. Nucleoporin-mediated regulation of cell identity genes. Genes &#38; Development. 30(20), 2253–2258.","short":"A. Ibarra, C. Benner, S. Tyagi, J. Cool, M. Hetzer, Genes &#38; Development 30 (2016) 2253–2258."},"keyword":["Developmental Biology","Genetics"],"publication":"Genes & Development","oa":1,"scopus_import":"1","day":"02","extern":"1","pmid":1,"date_created":"2022-04-07T07:48:08Z","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","volume":30,"intvolume":"        30","publication_status":"published","abstract":[{"lang":"eng","text":"The organization of the genome in the three-dimensional space of the nucleus is coupled with cell type-specific gene expression. However, how nuclear architecture influences transcription that governs cell identity remains unknown. Here, we show that nuclear pore complex (NPC) components Nup93 and Nup153 bind superenhancers (SE), regulatory structures that drive the expression of key genes that specify cell identity. We found that nucleoporin-associated SEs localize preferentially to the nuclear periphery, and absence of Nup153 and Nup93 results in dramatic transcriptional changes of SE-associated genes. Our results reveal a crucial role of NPC components in the regulation of cell type-specifying genes and highlight nuclear architecture as a regulatory layer of genome functions in cell fate."}],"doi":"10.1101/gad.287417.116","publisher":"Cold Spring Harbor Laboratory","year":"2016","title":"Nucleoporin-mediated regulation of cell identity genes","status":"public","oa_version":"Published Version","type":"journal_article","author":[{"last_name":"Ibarra","first_name":"Arkaitz","full_name":"Ibarra, Arkaitz"},{"full_name":"Benner, Chris","last_name":"Benner","first_name":"Chris"},{"last_name":"Tyagi","first_name":"Swati","full_name":"Tyagi, Swati"},{"full_name":"Cool, Jonah","first_name":"Jonah","last_name":"Cool"},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","last_name":"HETZER","first_name":"Martin W","orcid":"0000-0002-2111-992X"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/gad.287417.116"}],"issue":"20","page":"2253-2258","article_type":"original","date_updated":"2022-07-18T08:33:49Z","external_id":{"pmid":["27807035"]},"quality_controlled":"1","date_published":"2016-11-02T00:00:00Z","language":[{"iso":"eng"}],"month":"11","article_processing_charge":"No","_id":"11070","publication_identifier":{"issn":["0890-9369"],"eissn":["1549-5477"]}},{"publication_status":"published","abstract":[{"lang":"eng","text":"Nuclear pore complexes (NPCs) emerged as nuclear transport channels in eukaryotic cells ∼1.5 billion years ago. While the primary role of NPCs is to regulate nucleo–cytoplasmic transport, recent research suggests that certain NPC proteins have additionally acquired the role of affecting gene expression at the nuclear periphery and in the nucleoplasm in metazoans. Here we identify a widely expressed variant of the transmembrane nucleoporin (Nup) Pom121 (named sPom121, for “soluble Pom121”) that arose by genomic rearrangement before the divergence of hominoids. sPom121 lacks the nuclear membrane-anchoring domain and thus does not localize to the NPC. Instead, sPom121 colocalizes and interacts with nucleoplasmic Nup98, a previously identified transcriptional regulator, at gene promoters to control transcription of its target genes in human cells. Interestingly, sPom121 transcripts appear independently in several mammalian species, suggesting convergent innovation of Nup-mediated transcription regulation during mammalian evolution. Our findings implicate alternate transcription initiation as a mechanism to increase the functional diversity of NPC components."}],"date_created":"2022-04-07T07:48:20Z","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","intvolume":"        30","volume":30,"pmid":1,"extern":"1","day":"19","scopus_import":"1","oa":1,"citation":{"short":"T.M. Franks, C. Benner, I. Narvaiza, M.C.N. Marchetto, J.M. Young, H.S. Malik, F.H. Gage, M. Hetzer, Genes &#38; Development 30 (2016) 1155–1171.","ista":"Franks TM, Benner C, Narvaiza I, Marchetto MCN, Young JM, Malik HS, Gage FH, Hetzer M. 2016. Evolution of a transcriptional regulator from a transmembrane nucleoporin. Genes &#38; Development. 30(10), 1155–1171.","ama":"Franks TM, Benner C, Narvaiza I, et al. Evolution of a transcriptional regulator from a transmembrane nucleoporin. <i>Genes &#38; Development</i>. 2016;30(10):1155-1171. doi:<a href=\"https://doi.org/10.1101/gad.280941.116\">10.1101/gad.280941.116</a>","ieee":"T. M. Franks <i>et al.</i>, “Evolution of a transcriptional regulator from a transmembrane nucleoporin,” <i>Genes &#38; Development</i>, vol. 30, no. 10. Cold Spring Harbor Laboratory, pp. 1155–1171, 2016.","apa":"Franks, T. M., Benner, C., Narvaiza, I., Marchetto, M. C. N., Young, J. M., Malik, H. S., … Hetzer, M. (2016). Evolution of a transcriptional regulator from a transmembrane nucleoporin. <i>Genes &#38; Development</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/gad.280941.116\">https://doi.org/10.1101/gad.280941.116</a>","mla":"Franks, Tobias M., et al. “Evolution of a Transcriptional Regulator from a Transmembrane Nucleoporin.” <i>Genes &#38; Development</i>, vol. 30, no. 10, Cold Spring Harbor Laboratory, 2016, pp. 1155–71, doi:<a href=\"https://doi.org/10.1101/gad.280941.116\">10.1101/gad.280941.116</a>.","chicago":"Franks, Tobias M., Chris Benner, Iñigo Narvaiza, Maria C.N. Marchetto, Janet M. Young, Harmit S. Malik, Fred H. Gage, and Martin Hetzer. “Evolution of a Transcriptional Regulator from a Transmembrane Nucleoporin.” <i>Genes &#38; Development</i>. Cold Spring Harbor Laboratory, 2016. <a href=\"https://doi.org/10.1101/gad.280941.116\">https://doi.org/10.1101/gad.280941.116</a>."},"keyword":["Developmental Biology","Genetics"],"publication":"Genes & Development","publication_identifier":{"eissn":["1549-5477"],"issn":["0890-9369"]},"month":"05","article_processing_charge":"No","_id":"11071","quality_controlled":"1","date_published":"2016-05-19T00:00:00Z","language":[{"iso":"eng"}],"issue":"10","page":"1155-1171","article_type":"original","external_id":{"pmid":["27198230"]},"date_updated":"2022-07-18T08:33:50Z","author":[{"first_name":"Tobias M.","last_name":"Franks","full_name":"Franks, Tobias M."},{"last_name":"Benner","first_name":"Chris","full_name":"Benner, Chris"},{"last_name":"Narvaiza","first_name":"Iñigo","full_name":"Narvaiza, Iñigo"},{"full_name":"Marchetto, Maria C.N.","first_name":"Maria C.N.","last_name":"Marchetto"},{"last_name":"Young","first_name":"Janet M.","full_name":"Young, Janet M."},{"last_name":"Malik","first_name":"Harmit S.","full_name":"Malik, Harmit S."},{"first_name":"Fred H.","last_name":"Gage","full_name":"Gage, Fred H."},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER","first_name":"Martin W","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X"}],"main_file_link":[{"url":"https://doi.org/10.1101/gad.280941.116","open_access":"1"}],"type":"journal_article","oa_version":"Published Version","doi":"10.1101/gad.280941.116","publisher":"Cold Spring Harbor Laboratory","title":"Evolution of a transcriptional regulator from a transmembrane nucleoporin","status":"public","year":"2016"},{"date_created":"2022-04-07T07:48:34Z","intvolume":"         7","volume":7,"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","extern":"1","pmid":1,"article_number":"13874","abstract":[{"text":"Spatiotemporal activation of RhoA and actomyosin contraction underpins cellular adhesion and division. Loss of cell–cell adhesion and chromosomal instability are cardinal events that drive tumour progression. Here, we show that p120-catenin (p120) not only controls cell–cell adhesion, but also acts as a critical regulator of cytokinesis. We find that p120 regulates actomyosin contractility through concomitant binding to RhoA and the centralspindlin component MKLP1, independent of cadherin association. In anaphase, p120 is enriched at the cleavage furrow where it binds MKLP1 to spatially control RhoA GTPase cycling. Binding of p120 to MKLP1 during cytokinesis depends on the N-terminal coiled-coil domain of p120 isoform 1A. Importantly, clinical data show that loss of p120 expression is a common event in breast cancer that strongly correlates with multinucleation and adverse patient survival. In summary, our study identifies p120 loss as a driver event of chromosomal instability in cancer.\r\n","lang":"eng"}],"publication_status":"published","oa":1,"keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry"],"citation":{"short":"R.A.H. van de Ven, J.S. de Groot, D. Park, R. van Domselaar, D. de Jong, K. Szuhai, E. van der Wall, O.M. Rueda, H.R. Ali, C. Caldas, P.J. van Diest, M. Hetzer, E. Sahai, P.W.B. Derksen, Nature Communications 7 (2016).","ista":"van de Ven RAH, de Groot JS, Park D, van Domselaar R, de Jong D, Szuhai K, van der Wall E, Rueda OM, Ali HR, Caldas C, van Diest PJ, Hetzer M, Sahai E, Derksen PWB. 2016. p120-catenin prevents multinucleation through control of MKLP1-dependent RhoA activity during cytokinesis. Nature Communications. 7, 13874.","ama":"van de Ven RAH, de Groot JS, Park D, et al. p120-catenin prevents multinucleation through control of MKLP1-dependent RhoA activity during cytokinesis. <i>Nature Communications</i>. 2016;7. doi:<a href=\"https://doi.org/10.1038/ncomms13874\">10.1038/ncomms13874</a>","mla":"van de Ven, Robert A. H., et al. “P120-Catenin Prevents Multinucleation through Control of MKLP1-Dependent RhoA Activity during Cytokinesis.” <i>Nature Communications</i>, vol. 7, 13874, Springer Nature, 2016, doi:<a href=\"https://doi.org/10.1038/ncomms13874\">10.1038/ncomms13874</a>.","chicago":"Ven, Robert A.H. van de, Jolien S. de Groot, Danielle Park, Robert van Domselaar, Danielle de Jong, Karoly Szuhai, Elsken van der Wall, et al. “P120-Catenin Prevents Multinucleation through Control of MKLP1-Dependent RhoA Activity during Cytokinesis.” <i>Nature Communications</i>. Springer Nature, 2016. <a href=\"https://doi.org/10.1038/ncomms13874\">https://doi.org/10.1038/ncomms13874</a>.","ieee":"R. A. H. van de Ven <i>et al.</i>, “p120-catenin prevents multinucleation through control of MKLP1-dependent RhoA activity during cytokinesis,” <i>Nature Communications</i>, vol. 7. Springer Nature, 2016.","apa":"van de Ven, R. A. H., de Groot, J. S., Park, D., van Domselaar, R., de Jong, D., Szuhai, K., … Derksen, P. W. B. (2016). p120-catenin prevents multinucleation through control of MKLP1-dependent RhoA activity during cytokinesis. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/ncomms13874\">https://doi.org/10.1038/ncomms13874</a>"},"publication":"Nature Communications","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/ncomms16030"}]},"day":"22","scopus_import":"1","quality_controlled":"1","date_published":"2016-12-22T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"pmid":["28004812"]},"date_updated":"2022-07-18T08:34:32Z","article_type":"original","publication_identifier":{"issn":["2041-1723"]},"article_processing_charge":"No","month":"12","_id":"11072","oa_version":"Published Version","publisher":"Springer Nature","doi":"10.1038/ncomms13874","title":"p120-catenin prevents multinucleation through control of MKLP1-dependent RhoA activity during cytokinesis","status":"public","year":"2016","author":[{"full_name":"van de Ven, Robert A.H.","last_name":"van de Ven","first_name":"Robert A.H."},{"full_name":"de Groot, Jolien S.","last_name":"de Groot","first_name":"Jolien S."},{"first_name":"Danielle","last_name":"Park","full_name":"Park, Danielle"},{"first_name":"Robert","last_name":"van Domselaar","full_name":"van Domselaar, Robert"},{"full_name":"de Jong, Danielle","last_name":"de Jong","first_name":"Danielle"},{"first_name":"Karoly","last_name":"Szuhai","full_name":"Szuhai, Karoly"},{"full_name":"van der Wall, Elsken","first_name":"Elsken","last_name":"van der Wall"},{"full_name":"Rueda, Oscar M.","first_name":"Oscar M.","last_name":"Rueda"},{"last_name":"Ali","first_name":"H. Raza","full_name":"Ali, H. Raza"},{"full_name":"Caldas, Carlos","first_name":"Carlos","last_name":"Caldas"},{"last_name":"van Diest","first_name":"Paul J.","full_name":"van Diest, Paul J."},{"orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","last_name":"HETZER","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"},{"full_name":"Sahai, Erik","first_name":"Erik","last_name":"Sahai"},{"last_name":"Derksen","first_name":"Patrick W.B.","full_name":"Derksen, Patrick W.B."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/ncomms13874"}],"type":"journal_article"},{"date_updated":"2022-09-06T07:23:25Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","date_created":"2018-12-11T11:50:14Z","date_published":"2016-12-16T00:00:00Z","_id":"1115","article_processing_charge":"No","abstract":[{"text":"We present a coherent microwave to telecom signal converter based on the electro-optical effect using a crystalline WGM-resonator coupled to a 3D microwave cavity, achieving high photon conversion efficiency of 0.1% with MHz bandwidth.","lang":"eng"}],"month":"12","publication_status":"published","article_number":"7788479","title":"Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator","status":"public","year":"2016","publisher":"IEEE","doi":"10.1364/CLEO_SI.2016.SF2G.3","department":[{"_id":"JoFi"}],"citation":{"mla":"Rueda, Alfredo, et al. <i>Efficient Single Sideband Microwave to Optical Conversion Using a LiNbO₃ WGM-Resonator</i>. 7788479, IEEE, 2016, doi:<a href=\"https://doi.org/10.1364/CLEO_SI.2016.SF2G.3\">10.1364/CLEO_SI.2016.SF2G.3</a>.","chicago":"Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Georg Schunk, Dimitry Strekalov, et al. “Efficient Single Sideband Microwave to Optical Conversion Using a LiNbO₃ WGM-Resonator.” IEEE, 2016. <a href=\"https://doi.org/10.1364/CLEO_SI.2016.SF2G.3\">https://doi.org/10.1364/CLEO_SI.2016.SF2G.3</a>.","apa":"Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2016). Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. Presented at the CLEO: Conference on Lasers and Electro Optics, San Jose, CA, USA: IEEE. <a href=\"https://doi.org/10.1364/CLEO_SI.2016.SF2G.3\">https://doi.org/10.1364/CLEO_SI.2016.SF2G.3</a>","ieee":"A. Rueda <i>et al.</i>, “Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator,” presented at the CLEO: Conference on Lasers and Electro Optics, San Jose, CA, USA, 2016.","short":"A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, IEEE, 2016.","ama":"Rueda A, Sedlmeir F, Collodo M, et al. Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. In: IEEE; 2016. doi:<a href=\"https://doi.org/10.1364/CLEO_SI.2016.SF2G.3\">10.1364/CLEO_SI.2016.SF2G.3</a>","ista":"Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. CLEO: Conference on Lasers and Electro Optics, 7788479."},"publist_id":"6251","oa":1,"oa_version":"Preprint","scopus_import":"1","day":"16","conference":{"location":"San Jose, CA, USA","name":"CLEO: Conference on Lasers and Electro Optics","end_date":"2016-06-10","start_date":"2016-06-05"},"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1601.07261"}],"related_material":{"link":[{"url":"http://ieeexplore.ieee.org/document/7788479/","relation":"other"}]},"author":[{"first_name":"Alfredo","last_name":"Rueda","full_name":"Rueda, Alfredo"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"full_name":"Collodo, Michele","last_name":"Collodo","first_name":"Michele"},{"full_name":"Vogl, Ulrich","first_name":"Ulrich","last_name":"Vogl"},{"full_name":"Stiller, Birgit","first_name":"Birgit","last_name":"Stiller"},{"last_name":"Schunk","first_name":"Georg","full_name":"Schunk, Georg"},{"full_name":"Strekalov, Dimitry","last_name":"Strekalov","first_name":"Dimitry"},{"full_name":"Marquardt, Christoph","last_name":"Marquardt","first_name":"Christoph"},{"full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"},{"full_name":"Painter, Oskar","last_name":"Painter","first_name":"Oskar"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"last_name":"Schwefel","first_name":"Harald","full_name":"Schwefel, Harald"}]}]