[{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"555","intvolume":" 50","status":"public","title":"Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets?","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"Conventional wisdom has it that proteins fold and assemble into definite structures, and that this defines their function. Glycosaminoglycans (GAGs) are different. In most cases the structures they form have a low degree of order, even when interacting with proteins. Here, we discuss how physical features common to all GAGs — hydrophilicity, charge, linearity and semi-flexibility — underpin the overall properties of GAG-rich matrices. By integrating soft matter physics concepts (e.g. polymer brushes and phase separation) with our molecular understanding of GAG–protein interactions, we can better comprehend how GAG-rich matrices assemble, what their properties are, and how they function. Taking perineuronal nets (PNNs) — a GAG-rich matrix enveloping neurons — as a relevant example, we propose that microphase separation determines the holey PNN anatomy that is pivotal to PNN functions."}],"citation":{"ista":"Richter R, Baranova NS, Day A, Kwok J. 2018. Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets? Current Opinion in Structural Biology. 50, 65–74.","ieee":"R. Richter, N. S. Baranova, A. Day, and J. Kwok, “Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets?,” Current Opinion in Structural Biology, vol. 50. Elsevier, pp. 65–74, 2018.","apa":"Richter, R., Baranova, N. S., Day, A., & Kwok, J. (2018). Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets? Current Opinion in Structural Biology. Elsevier. https://doi.org/10.1016/j.sbi.2017.12.002","ama":"Richter R, Baranova NS, Day A, Kwok J. Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets? Current Opinion in Structural Biology. 2018;50:65-74. doi:10.1016/j.sbi.2017.12.002","chicago":"Richter, Ralf, Natalia S. Baranova, Anthony Day, and Jessica Kwok. “Glycosaminoglycans in Extracellular Matrix Organisation: Are Concepts from Soft Matter Physics Key to Understanding the Formation of Perineuronal Nets?” Current Opinion in Structural Biology. Elsevier, 2018. https://doi.org/10.1016/j.sbi.2017.12.002.","mla":"Richter, Ralf, et al. “Glycosaminoglycans in Extracellular Matrix Organisation: Are Concepts from Soft Matter Physics Key to Understanding the Formation of Perineuronal Nets?” Current Opinion in Structural Biology, vol. 50, Elsevier, 2018, pp. 65–74, doi:10.1016/j.sbi.2017.12.002.","short":"R. Richter, N.S. Baranova, A. Day, J. Kwok, Current Opinion in Structural Biology 50 (2018) 65–74."},"publication":"Current Opinion in Structural Biology","page":"65 - 74","article_type":"original","date_published":"2018-06-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","acknowledgement":"This work was supported by the European Research Council [Starting Grant 306435 ‘JELLY’; to RPR], the Spanish Ministry of Competitiveness and Innovation [MAT2014-54867-R, to RPR], the EPSRC Centre for Doctoral Training in Tissue Engineering and Regenerative Medicine — Innovation in Medical and Biological Engineering [EP/L014823/1, to JCFK], the Royal Society [RG160410, to JCFK], Wings for Life [WFL-UK-008/15, to JCFK] and the European Union, the Operational Programme Research, Development and Education in the framework of the project ‘Centre of Reconstructive Neuroscience’ [CZ.02.1.01/0.0./0.0/15_003/0000419, to JCFK]. AJD would like to thank Arthritis Research UK [16539, 19489] and the MRC [76445, G0900538] for funding his work on GAG–protein interactions.\r\n","year":"2018","department":[{"_id":"MaLo"}],"publisher":"Elsevier","publication_status":"published","author":[{"last_name":"Richter","first_name":"Ralf","full_name":"Richter, Ralf"},{"full_name":"Baranova, Natalia","last_name":"Baranova","first_name":"Natalia","orcid":"0000-0002-3086-9124","id":"38661662-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Day, Anthony","first_name":"Anthony","last_name":"Day"},{"full_name":"Kwok, Jessica","first_name":"Jessica","last_name":"Kwok"}],"volume":50,"date_created":"2018-12-11T11:47:09Z","date_updated":"2023-09-11T14:07:03Z","publist_id":"7259","external_id":{"isi":["000443661300011"]},"main_file_link":[{"open_access":"1","url":"http://eprints.whiterose.ac.uk/125524/"}],"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1016/j.sbi.2017.12.002","language":[{"iso":"eng"}],"month":"06"},{"acknowledgement":"We thank O. Niehuis for allowing use of the unpublished E. danica genome, J. Gadau and C. Smith for comments and advice on the manuscript, and J. Schmitz for assistance with analyses and proofreading the manuscript. J.K. thanks Charles Darwin University (Australia), especially S. Garnett and the Horticulture and Aquaculture team, for providing logistic support to collect C. secundus. The Parks and Wildlife Commission, Northern Territory, the Department of the Environment, Water, Heritage and the Arts gave permission to collect (Permit number 36401) and export (Permit WT2010-6997) the termites. USDA is an equal opportunity provider and employer. M.C.H. and E.J. are supported by DFG grant BO2544/11-1 to E.B.-B. J.K. is supported by University of Osnabrück and DFG grant KO1895/16-1. X.B. and M.-D.P. are supported by Spanish Ministerio de Economía y Competitividad (CGL2012-36251 and CGL2015-64727-P to X.B., and CGL2016-76011-R to M.-D.P.), including FEDER funds, and by Catalan Government (2014 SGR 619). C.S. is supported by grants from the US Department of Housing and Urban Development (NCHHU-0017-13), the National Science Foundation (IOS-1557864), the Alfred P. Sloan Foundation (2013-5-35 MBE), the National Institute of Environmental Health Sciences (P30ES025128) to the Center for Human Health and the Environment, and the Blanton J. Whitmire Endowment. M.P. is supported by a Villum Kann Rasmussen Young Investigator Fellowship (VKR10101).","year":"2018","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"BeVi"}],"author":[{"full_name":"Harrison, Mark","first_name":"Mark","last_name":"Harrison"},{"last_name":"Jongepier","first_name":"Evelien","full_name":"Jongepier, Evelien"},{"first_name":"Hugh","last_name":"Robertson","full_name":"Robertson, Hugh"},{"full_name":"Arning, Nicolas","last_name":"Arning","first_name":"Nicolas"},{"full_name":"Bitard Feildel, Tristan","first_name":"Tristan","last_name":"Bitard Feildel"},{"first_name":"Hsu","last_name":"Chao","full_name":"Chao, Hsu"},{"full_name":"Childers, Christopher","last_name":"Childers","first_name":"Christopher"},{"last_name":"Dinh","first_name":"Huyen","full_name":"Dinh, Huyen"},{"full_name":"Doddapaneni, Harshavardhan","first_name":"Harshavardhan","last_name":"Doddapaneni"},{"first_name":"Shannon","last_name":"Dugan","full_name":"Dugan, Shannon"},{"last_name":"Gowin","first_name":"Johannes","full_name":"Gowin, Johannes"},{"first_name":"Carolin","last_name":"Greiner","full_name":"Greiner, Carolin"},{"full_name":"Han, Yi","first_name":"Yi","last_name":"Han"},{"full_name":"Hu, Haofu","first_name":"Haofu","last_name":"Hu"},{"full_name":"Hughes, Daniel","first_name":"Daniel","last_name":"Hughes"},{"full_name":"Huylmans, Ann K","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8871-4961","first_name":"Ann K","last_name":"Huylmans"},{"full_name":"Kemena, Karsten","last_name":"Kemena","first_name":"Karsten"},{"full_name":"Kremer, Lukas","last_name":"Kremer","first_name":"Lukas"},{"full_name":"Lee, Sandra","last_name":"Lee","first_name":"Sandra"},{"last_name":"López Ezquerra","first_name":"Alberto","full_name":"López Ezquerra, Alberto"},{"full_name":"Mallet, Ludovic","last_name":"Mallet","first_name":"Ludovic"},{"full_name":"Monroy Kuhn, Jose","last_name":"Monroy Kuhn","first_name":"Jose"},{"last_name":"Moser","first_name":"Annabell","full_name":"Moser, Annabell"},{"first_name":"Shwetha","last_name":"Murali","full_name":"Murali, Shwetha"},{"last_name":"Muzny","first_name":"Donna","full_name":"Muzny, Donna"},{"last_name":"Otani","first_name":"Saria","full_name":"Otani, Saria"},{"full_name":"Piulachs, Maria","first_name":"Maria","last_name":"Piulachs"},{"first_name":"Monica","last_name":"Poelchau","full_name":"Poelchau, Monica"},{"first_name":"Jiaxin","last_name":"Qu","full_name":"Qu, Jiaxin"},{"full_name":"Schaub, Florentine","first_name":"Florentine","last_name":"Schaub"},{"full_name":"Wada Katsumata, Ayako","first_name":"Ayako","last_name":"Wada Katsumata"},{"last_name":"Worley","first_name":"Kim","full_name":"Worley, Kim"},{"last_name":"Xie","first_name":"Qiaolin","full_name":"Xie, Qiaolin"},{"last_name":"Ylla","first_name":"Guillem","full_name":"Ylla, Guillem"},{"full_name":"Poulsen, Michael","first_name":"Michael","last_name":"Poulsen"},{"first_name":"Richard","last_name":"Gibbs","full_name":"Gibbs, Richard"},{"full_name":"Schal, Coby","first_name":"Coby","last_name":"Schal"},{"last_name":"Richards","first_name":"Stephen","full_name":"Richards, Stephen"},{"full_name":"Belles, Xavier","last_name":"Belles","first_name":"Xavier"},{"last_name":"Korb","first_name":"Judith","full_name":"Korb, Judith"},{"first_name":"Erich","last_name":"Bornberg Bauer","full_name":"Bornberg Bauer, Erich"}],"related_material":{"record":[{"id":"9841","status":"public","relation":"research_data"}]},"date_created":"2018-12-11T11:46:32Z","date_updated":"2023-09-11T14:10:57Z","volume":2,"file_date_updated":"2020-07-14T12:46:30Z","publist_id":"7375","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000426559600026"]},"isi":1,"quality_controlled":"1","doi":"10.1038/s41559-017-0459-1","language":[{"iso":"eng"}],"month":"02","_id":"448","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Hemimetabolous genomes reveal molecular basis of termite eusociality","ddc":["576"],"status":"public","intvolume":" 2","pubrep_id":"969","file":[{"file_size":3730583,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2018-969-v1+1_2018_Huylmans_Hemimetabolous_genomes.pdf","checksum":"874953136ac125e65f37971d3cabc5b7","date_updated":"2020-07-14T12:46:30Z","date_created":"2018-12-12T10:09:08Z","relation":"main_file","file_id":"4731"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Around 150 million years ago, eusocial termites evolved from within the cockroaches, 50 million years before eusocial Hymenoptera, such as bees and ants, appeared. Here, we report the 2-Gb genome of the German cockroach, Blattella germanica, and the 1.3-Gb genome of the drywood termite Cryptotermes secundus. We show evolutionary signatures of termite eusociality by comparing the genomes and transcriptomes of three termites and the cockroach against the background of 16 other eusocial and non-eusocial insects. Dramatic adaptive changes in genes underlying the production and perception of pheromones confirm the importance of chemical communication in the termites. These are accompanied by major changes in gene regulation and the molecular evolution of caste determination. Many of these results parallel molecular mechanisms of eusocial evolution in Hymenoptera. However, the specific solutions are remarkably different, thus revealing a striking case of convergence in one of the major evolutionary transitions in biological complexity.","lang":"eng"}],"issue":"3","publication":"Nature Ecology and Evolution","citation":{"apa":"Harrison, M., Jongepier, E., Robertson, H., Arning, N., Bitard Feildel, T., Chao, H., … Bornberg Bauer, E. (2018). Hemimetabolous genomes reveal molecular basis of termite eusociality. Nature Ecology and Evolution. Springer Nature. https://doi.org/10.1038/s41559-017-0459-1","ieee":"M. Harrison et al., “Hemimetabolous genomes reveal molecular basis of termite eusociality,” Nature Ecology and Evolution, vol. 2, no. 3. Springer Nature, pp. 557–566, 2018.","ista":"Harrison M, Jongepier E, Robertson H, Arning N, Bitard Feildel T, Chao H, Childers C, Dinh H, Doddapaneni H, Dugan S, Gowin J, Greiner C, Han Y, Hu H, Hughes D, Huylmans AK, Kemena K, Kremer L, Lee S, López Ezquerra A, Mallet L, Monroy Kuhn J, Moser A, Murali S, Muzny D, Otani S, Piulachs M, Poelchau M, Qu J, Schaub F, Wada Katsumata A, Worley K, Xie Q, Ylla G, Poulsen M, Gibbs R, Schal C, Richards S, Belles X, Korb J, Bornberg Bauer E. 2018. Hemimetabolous genomes reveal molecular basis of termite eusociality. Nature Ecology and Evolution. 2(3), 557–566.","ama":"Harrison M, Jongepier E, Robertson H, et al. Hemimetabolous genomes reveal molecular basis of termite eusociality. Nature Ecology and Evolution. 2018;2(3):557-566. doi:10.1038/s41559-017-0459-1","chicago":"Harrison, Mark, Evelien Jongepier, Hugh Robertson, Nicolas Arning, Tristan Bitard Feildel, Hsu Chao, Christopher Childers, et al. “Hemimetabolous Genomes Reveal Molecular Basis of Termite Eusociality.” Nature Ecology and Evolution. Springer Nature, 2018. https://doi.org/10.1038/s41559-017-0459-1.","short":"M. Harrison, E. Jongepier, H. Robertson, N. Arning, T. Bitard Feildel, H. Chao, C. Childers, H. Dinh, H. Doddapaneni, S. Dugan, J. Gowin, C. Greiner, Y. Han, H. Hu, D. Hughes, A.K. Huylmans, K. Kemena, L. Kremer, S. Lee, A. López Ezquerra, L. Mallet, J. Monroy Kuhn, A. Moser, S. Murali, D. Muzny, S. Otani, M. Piulachs, M. Poelchau, J. Qu, F. Schaub, A. Wada Katsumata, K. Worley, Q. Xie, G. Ylla, M. Poulsen, R. Gibbs, C. Schal, S. Richards, X. Belles, J. Korb, E. Bornberg Bauer, Nature Ecology and Evolution 2 (2018) 557–566.","mla":"Harrison, Mark, et al. “Hemimetabolous Genomes Reveal Molecular Basis of Termite Eusociality.” Nature Ecology and Evolution, vol. 2, no. 3, Springer Nature, 2018, pp. 557–66, doi:10.1038/s41559-017-0459-1."},"page":"557-566","date_published":"2018-02-05T00:00:00Z","scopus_import":"1","day":"05","has_accepted_license":"1","article_processing_charge":"No"},{"month":"05","doi":"10.1007/s00453-017-0369-2","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000428239300010"]},"project":[{"call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091"}],"isi":1,"quality_controlled":"1","publist_id":"6957","ec_funded":1,"file_date_updated":"2020-07-14T12:47:54Z","author":[{"full_name":"Oliveto, Pietro","first_name":"Pietro","last_name":"Oliveto"},{"full_name":"Paixao, Tiago","first_name":"Tiago","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953"},{"last_name":"Pérez Heredia","first_name":"Jorge","full_name":"Pérez Heredia, Jorge"},{"first_name":"Dirk","last_name":"Sudholt","full_name":"Sudholt, Dirk"},{"first_name":"Barbora","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6873-2967","full_name":"Trubenova, Barbora"}],"volume":80,"date_updated":"2023-09-11T14:11:35Z","date_created":"2018-12-11T11:48:09Z","year":"2018","publisher":"Springer","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"publication_status":"published","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-05-01T00:00:00Z","citation":{"short":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 80 (2018) 1604–1633.","mla":"Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2.","chicago":"Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2.","ama":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2","ieee":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How to escape local optima in black box optimisation when non elitism outperforms elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018.","apa":"Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2018). How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2","ista":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 80(5), 1604–1633."},"publication":"Algorithmica","page":"1604 - 1633","issue":"5","abstract":[{"lang":"eng","text":"Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The (1+1) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the (1+1) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys."}],"type":"journal_article","pubrep_id":"1014","file":[{"file_name":"IST-2018-1014-v1+1_2018_Paixao_Escape.pdf","access_level":"open_access","content_type":"application/pdf","file_size":691245,"creator":"system","relation":"main_file","file_id":"4674","date_created":"2018-12-12T10:08:14Z","date_updated":"2020-07-14T12:47:54Z","checksum":"7d92f5d7be81e387edeec4f06442791c"}],"oa_version":"Published Version","_id":"723","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 80","ddc":["576"],"status":"public","title":"How to escape local optima in black box optimisation when non elitism outperforms elitism"},{"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","page":"1029 - 1031","article_type":"original","citation":{"chicago":"Darrell, Trevor, Christoph Lampert, Nico Sebe, Ying Wu, and Yan Yan. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2018.2804998.","short":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, Y. Yan, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1029–1031.","mla":"Darrell, Trevor, et al. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 5, IEEE, 2018, pp. 1029–31, doi:10.1109/TPAMI.2018.2804998.","apa":"Darrell, T., Lampert, C., Sebe, N., Wu, Y., & Yan, Y. (2018). Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2018.2804998","ieee":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, and Y. Yan, “Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 5. IEEE, pp. 1029–1031, 2018.","ista":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. 2018. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(5), 1029–1031.","ama":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(5):1029-1031. doi:10.1109/TPAMI.2018.2804998"},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","date_published":"2018-05-01T00:00:00Z","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"The twelve papers in this special section focus on learning systems with shared information for computer vision and multimedia communication analysis. In the real world, a realistic setting for computer vision or multimedia recognition problems is that we have some classes containing lots of training data and many classes containing a small amount of training data. Therefore, how to use frequent classes to help learning rare classes for which it is harder to collect the training data is an open question. Learning with shared information is an emerging topic in machine learning, computer vision and multimedia analysis. There are different levels of components that can be shared during concept modeling and machine learning stages, such as sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, etc. Regarding the specific methods, multi-task learning, transfer learning and deep learning can be seen as using different strategies to share information. These learning with shared information methods are very effective in solving real-world large-scale problems."}],"intvolume":" 40","ddc":["000"],"status":"public","title":"Guest editors' introduction to the special section on learning with Shared information for computer vision and multimedia analysis","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"321","file":[{"relation":"main_file","file_id":"7835","date_updated":"2020-07-14T12:46:03Z","date_created":"2020-05-14T12:50:48Z","checksum":"b19c75da06faf3291a3ca47dfa50ef63","file_name":"2018_IEEE_Darrell.pdf","access_level":"open_access","file_size":141724,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","month":"05","quality_controlled":"1","isi":1,"external_id":{"isi":["000428901200001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/TPAMI.2018.2804998","publist_id":"7544","file_date_updated":"2020-07-14T12:46:03Z","publisher":"IEEE","department":[{"_id":"ChLa"}],"publication_status":"published","year":"2018","volume":40,"date_updated":"2023-09-11T14:07:54Z","date_created":"2018-12-11T11:45:48Z","author":[{"first_name":"Trevor","last_name":"Darrell","full_name":"Darrell, Trevor"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"},{"first_name":"Nico","last_name":"Sebe","full_name":"Sebe, Nico"},{"full_name":"Wu, Ying","last_name":"Wu","first_name":"Ying"},{"first_name":"Yan","last_name":"Yan","full_name":"Yan, Yan"}]},{"article_processing_charge":"No","day":"12","month":"12","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.51d4r"}],"citation":{"ieee":"M. C. Harrison et al., “Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality.” Dryad, 2018.","apa":"Harrison, M. C., Jongepier, E., Robertson, H. M., Arning, N., Bitard-Feildel, T., Chao, H., … Bornberg-Bauer, E. (2018). Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality. Dryad. https://doi.org/10.5061/dryad.51d4r","ista":"Harrison MC, Jongepier E, Robertson HM, Arning N, Bitard-Feildel T, Chao H, Childers CP, Dinh H, Doddapaneni H, Dugan S, Gowin J, Greiner C, Han Y, Hu H, Hughes DST, Huylmans AK, Kemena C, Kremer LPM, Lee SL, Lopez-Ezquerra A, Mallet L, Monroy-Kuhn JM, Moser A, Murali SC, Muzny DM, Otani S, Piulachs M-D, Poelchau M, Qu J, Schaub F, Wada-Katsumata A, Worley KC, Xie Q, Ylla G, Poulsen M, Gibbs RA, Schal C, Richards S, Belles X, Korb J, Bornberg-Bauer E. 2018. Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality, Dryad, 10.5061/dryad.51d4r.","ama":"Harrison MC, Jongepier E, Robertson HM, et al. Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality. 2018. doi:10.5061/dryad.51d4r","chicago":"Harrison, Mark C., Evelien Jongepier, Hugh M. Robertson, Nicolas Arning, Tristan Bitard-Feildel, Hsu Chao, Christopher P. Childers, et al. “Data from: Hemimetabolous Genomes Reveal Molecular Basis of Termite Eusociality.” Dryad, 2018. https://doi.org/10.5061/dryad.51d4r.","short":"M.C. Harrison, E. Jongepier, H.M. Robertson, N. Arning, T. Bitard-Feildel, H. Chao, C.P. Childers, H. Dinh, H. Doddapaneni, S. Dugan, J. Gowin, C. Greiner, Y. Han, H. Hu, D.S.T. Hughes, A.K. Huylmans, C. Kemena, L.P.M. Kremer, S.L. Lee, A. Lopez-Ezquerra, L. Mallet, J.M. Monroy-Kuhn, A. Moser, S.C. Murali, D.M. Muzny, S. Otani, M.-D. Piulachs, M. Poelchau, J. Qu, F. Schaub, A. Wada-Katsumata, K.C. Worley, Q. Xie, G. Ylla, M. Poulsen, R.A. Gibbs, C. Schal, S. Richards, X. Belles, J. Korb, E. Bornberg-Bauer, (2018).","mla":"Harrison, Mark C., et al. Data from: Hemimetabolous Genomes Reveal Molecular Basis of Termite Eusociality. Dryad, 2018, doi:10.5061/dryad.51d4r."},"oa":1,"date_published":"2018-12-12T00:00:00Z","doi":"10.5061/dryad.51d4r","type":"research_data_reference","abstract":[{"lang":"eng","text":"Around 150 million years ago, eusocial termites evolved from within the cockroaches, 50 million years before eusocial Hymenoptera, such as bees and ants, appeared. Here, we report the 2-Gb genome of the German cockroach, Blattella germanica, and the 1.3-Gb genome of the drywood termite Cryptotermes secundus. We show evolutionary signatures of termite eusociality by comparing the genomes and transcriptomes of three termites and the cockroach against the background of 16 other eusocial and non-eusocial insects. Dramatic adaptive changes in genes underlying the production and perception of pheromones confirm the importance of chemical communication in the termites. These are accompanied by major changes in gene regulation and the molecular evolution of caste determination. Many of these results parallel molecular mechanisms of eusocial evolution in Hymenoptera. However, the specific solutions are remarkably different, thus revealing a striking case of convergence in one of the major evolutionary transitions in biological complexity."}],"_id":"9841","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","department":[{"_id":"BeVi"}],"publisher":"Dryad","title":"Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality","status":"public","related_material":{"record":[{"id":"448","status":"public","relation":"used_in_publication"}]},"author":[{"last_name":"Harrison","first_name":"Mark C.","full_name":"Harrison, Mark C."},{"last_name":"Jongepier","first_name":"Evelien","full_name":"Jongepier, Evelien"},{"last_name":"Robertson","first_name":"Hugh M.","full_name":"Robertson, Hugh M."},{"full_name":"Arning, Nicolas","last_name":"Arning","first_name":"Nicolas"},{"first_name":"Tristan","last_name":"Bitard-Feildel","full_name":"Bitard-Feildel, Tristan"},{"full_name":"Chao, Hsu","last_name":"Chao","first_name":"Hsu"},{"first_name":"Christopher P.","last_name":"Childers","full_name":"Childers, Christopher P."},{"full_name":"Dinh, Huyen","first_name":"Huyen","last_name":"Dinh"},{"first_name":"Harshavardhan","last_name":"Doddapaneni","full_name":"Doddapaneni, Harshavardhan"},{"last_name":"Dugan","first_name":"Shannon","full_name":"Dugan, Shannon"},{"full_name":"Gowin, Johannes","last_name":"Gowin","first_name":"Johannes"},{"last_name":"Greiner","first_name":"Carolin","full_name":"Greiner, Carolin"},{"full_name":"Han, Yi","first_name":"Yi","last_name":"Han"},{"first_name":"Haofu","last_name":"Hu","full_name":"Hu, Haofu"},{"full_name":"Hughes, Daniel S. T.","last_name":"Hughes","first_name":"Daniel S. T."},{"first_name":"Ann K","last_name":"Huylmans","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8871-4961","full_name":"Huylmans, Ann K"},{"full_name":"Kemena, Carsten","first_name":"Carsten","last_name":"Kemena"},{"last_name":"Kremer","first_name":"Lukas P. M.","full_name":"Kremer, Lukas P. M."},{"last_name":"Lee","first_name":"Sandra L.","full_name":"Lee, Sandra L."},{"last_name":"Lopez-Ezquerra","first_name":"Alberto","full_name":"Lopez-Ezquerra, Alberto"},{"last_name":"Mallet","first_name":"Ludovic","full_name":"Mallet, Ludovic"},{"first_name":"Jose M.","last_name":"Monroy-Kuhn","full_name":"Monroy-Kuhn, Jose M."},{"full_name":"Moser, Annabell","last_name":"Moser","first_name":"Annabell"},{"full_name":"Murali, Shwetha C.","first_name":"Shwetha C.","last_name":"Murali"},{"last_name":"Muzny","first_name":"Donna M.","full_name":"Muzny, Donna M."},{"first_name":"Saria","last_name":"Otani","full_name":"Otani, Saria"},{"full_name":"Piulachs, Maria-Dolors","first_name":"Maria-Dolors","last_name":"Piulachs"},{"last_name":"Poelchau","first_name":"Monica","full_name":"Poelchau, Monica"},{"first_name":"Jiaxin","last_name":"Qu","full_name":"Qu, Jiaxin"},{"full_name":"Schaub, Florentine","last_name":"Schaub","first_name":"Florentine"},{"full_name":"Wada-Katsumata, Ayako","last_name":"Wada-Katsumata","first_name":"Ayako"},{"full_name":"Worley, Kim C.","last_name":"Worley","first_name":"Kim C."},{"last_name":"Xie","first_name":"Qiaolin","full_name":"Xie, Qiaolin"},{"first_name":"Guillem","last_name":"Ylla","full_name":"Ylla, Guillem"},{"full_name":"Poulsen, Michael","last_name":"Poulsen","first_name":"Michael"},{"first_name":"Richard A.","last_name":"Gibbs","full_name":"Gibbs, Richard A."},{"last_name":"Schal","first_name":"Coby","full_name":"Schal, Coby"},{"first_name":"Stephen","last_name":"Richards","full_name":"Richards, Stephen"},{"first_name":"Xavier","last_name":"Belles","full_name":"Belles, Xavier"},{"first_name":"Judith","last_name":"Korb","full_name":"Korb, Judith"},{"first_name":"Erich","last_name":"Bornberg-Bauer","full_name":"Bornberg-Bauer, Erich"}],"oa_version":"Published Version","date_created":"2021-08-09T13:13:48Z","date_updated":"2023-09-11T14:10:56Z"},{"publist_id":"7430","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"ACM","year":"2018","date_created":"2018-12-11T11:46:14Z","date_updated":"2023-09-11T14:10:25Z","volume":53,"author":[{"full_name":"Arbel Raviv, Maya","last_name":"Arbel Raviv","first_name":"Maya"},{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","last_name":"Brown","full_name":"Brown, Trevor A"}],"month":"02","publication_identifier":{"isbn":["978-1-4503-4982-6"]},"isi":1,"quality_controlled":"1","external_id":{"isi":["000446161100002"]},"language":[{"iso":"eng"}],"conference":{"name":"PPoPP: Principles and Practice of Parallel Programming","end_date":"2018-02-28","start_date":"2018-02-24","location":"Vienna, Austria"},"doi":"10.1145/3178487.3178489","alternative_title":["PPoPP"],"type":"conference","abstract":[{"lang":"eng","text":"Concurrent sets with range query operations are highly desirable in applications such as in-memory databases. However, few set implementations offer range queries. Known techniques for augmenting data structures with range queries (or operations that can be used to build range queries) have numerous problems that limit their usefulness. For example, they impose high overhead or rely heavily on garbage collection. In this work, we show how to augment data structures with highly efficient range queries, without relying on garbage collection. We identify a property of epoch-based memory reclamation algorithms that makes them ideal for implementing range queries, and produce three algorithms, which use locks, transactional memory and lock-free techniques, respectively. Our algorithms are applicable to more data structures than previous work, and are shown to be highly efficient on a large scale Intel system. "}],"issue":"1","status":"public","title":"Harnessing epoch-based reclamation for efficient range queries","intvolume":" 53","_id":"397","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"None","scopus_import":"1","day":"10","article_processing_charge":"No","page":"14 - 27","citation":{"chicago":"Arbel Raviv, Maya, and Trevor A Brown. “Harnessing Epoch-Based Reclamation for Efficient Range Queries,” 53:14–27. ACM, 2018. https://doi.org/10.1145/3178487.3178489.","mla":"Arbel Raviv, Maya, and Trevor A. Brown. Harnessing Epoch-Based Reclamation for Efficient Range Queries. Vol. 53, no. 1, ACM, 2018, pp. 14–27, doi:10.1145/3178487.3178489.","short":"M. Arbel Raviv, T.A. Brown, in:, ACM, 2018, pp. 14–27.","ista":"Arbel Raviv M, Brown TA. 2018. Harnessing epoch-based reclamation for efficient range queries. PPoPP: Principles and Practice of Parallel Programming, PPoPP, vol. 53, 14–27.","apa":"Arbel Raviv, M., & Brown, T. A. (2018). Harnessing epoch-based reclamation for efficient range queries (Vol. 53, pp. 14–27). Presented at the PPoPP: Principles and Practice of Parallel Programming, Vienna, Austria: ACM. https://doi.org/10.1145/3178487.3178489","ieee":"M. Arbel Raviv and T. A. Brown, “Harnessing epoch-based reclamation for efficient range queries,” presented at the PPoPP: Principles and Practice of Parallel Programming, Vienna, Austria, 2018, vol. 53, no. 1, pp. 14–27.","ama":"Arbel Raviv M, Brown TA. Harnessing epoch-based reclamation for efficient range queries. In: Vol 53. ACM; 2018:14-27. doi:10.1145/3178487.3178489"},"date_published":"2018-02-10T00:00:00Z"},{"external_id":{"isi":["000448219500005"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1016/j.celrep.2018.09.066","language":[{"iso":"eng"}],"month":"10","year":"2018","acknowledgement":"This work was supported by Deutsche Forschungsgemeinschaft (DFG) grant KU2569/1-1 (to M.K.); DFG project EXC307Centre for Integrative Neuroscience (CIN), including grant Pool Project 2011-12 (jointly to M.K. and I.E.); and the Charitable Hertie Foundation (to I.E.). CIN is an Excellence Cluster funded by the DFG within the framework of the Excellence Initiative for 2008–2018. M.K. is supported by the Tistou & Charlotte Kerstan Foundation.","department":[{"_id":"SaSi"}],"publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Chen, Ting","first_name":"Ting","last_name":"Chen"},{"first_name":"Bartosz","last_name":"Kula","full_name":"Kula, Bartosz"},{"full_name":"Nagy, Balint","first_name":"Balint","last_name":"Nagy","id":"30F830CE-02D1-11E9-9BAA-DAF4881429F2","orcid":"0000-0002-4002-4686"},{"last_name":"Barzan","first_name":"Ruxandra","full_name":"Barzan, Ruxandra"},{"full_name":"Gall, Andrea","last_name":"Gall","first_name":"Andrea"},{"last_name":"Ehrlich","first_name":"Ingrid","full_name":"Ehrlich, Ingrid"},{"last_name":"Kukley","first_name":"Maria","full_name":"Kukley, Maria"}],"volume":25,"date_created":"2018-12-11T11:44:16Z","date_updated":"2023-09-11T14:13:32Z","publist_id":"8023","file_date_updated":"2020-07-14T12:46:03Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","citation":{"apa":"Chen, T., Kula, B., Nagy, B., Barzan, R., Gall, A., Ehrlich, I., & Kukley, M. (2018). In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2018.09.066","ieee":"T. Chen et al., “In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2,” Cell Reports, vol. 25, no. 4. Elsevier, p. 852–861.e7, 2018.","ista":"Chen T, Kula B, Nagy B, Barzan R, Gall A, Ehrlich I, Kukley M. 2018. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. 25(4), 852–861.e7.","ama":"Chen T, Kula B, Nagy B, et al. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. 2018;25(4):852-861.e7. doi:10.1016/j.celrep.2018.09.066","chicago":"Chen, Ting, Bartosz Kula, Balint Nagy, Ruxandra Barzan, Andrea Gall, Ingrid Ehrlich, and Maria Kukley. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” Cell Reports. Elsevier, 2018. https://doi.org/10.1016/j.celrep.2018.09.066.","short":"T. Chen, B. Kula, B. Nagy, R. Barzan, A. Gall, I. Ehrlich, M. Kukley, Cell Reports 25 (2018) 852–861.e7.","mla":"Chen, Ting, et al. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” Cell Reports, vol. 25, no. 4, Elsevier, 2018, p. 852–861.e7, doi:10.1016/j.celrep.2018.09.066."},"publication":"Cell Reports","page":"852 - 861.e7","date_published":"2018-10-23T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"23","_id":"32","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 25","title":"In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2","ddc":["570"],"status":"public","file":[{"file_id":"5703","relation":"main_file","date_updated":"2020-07-14T12:46:03Z","date_created":"2018-12-17T12:42:57Z","checksum":"d9f74277fd57176e04732707d575cf08","file_name":"2018_CellReports_Chen.pdf","access_level":"open_access","creator":"dernst","file_size":4461997,"content_type":"application/pdf"}],"oa_version":"Published Version","type":"journal_article","issue":"4","abstract":[{"text":"The functional role of AMPA receptor (AMPAR)-mediated synaptic signaling between neurons and oligodendrocyte precursor cells (OPCs) remains enigmatic. We modified the properties of AMPARs at axon-OPC synapses in the mouse corpus callosum in vivo during the peak of myelination by targeting the GluA2 subunit. Expression of the unedited (Ca2+ permeable) or the pore-dead GluA2 subunit of AMPARs triggered proliferation of OPCs and reduced their differentiation into oligodendrocytes. Expression of the cytoplasmic C-terminal (GluA2(813-862)) of the GluA2 subunit (C-tail), a modification designed to affect the interaction between GluA2 and AMPAR-binding proteins and to perturb trafficking of GluA2-containing AMPARs, decreased the differentiation of OPCs without affecting their proliferation. These findings suggest that ionotropic and non-ionotropic properties of AMPARs in OPCs, as well as specific aspects of AMPAR-mediated signaling at axon-OPC synapses in the mouse corpus callosum, are important for balancing the response of OPCs to proliferation and differentiation cues. In the brain, oligodendrocyte precursor cells (OPCs) receive glutamatergic AMPA-receptor-mediated synaptic input from neurons. Chen et al. show that modifying AMPA-receptor properties at axon-OPC synapses alters proliferation and differentiation of OPCs. This expands the traditional view of synaptic transmission by suggesting neurons also use synapses to modulate behavior of glia.","lang":"eng"}]},{"author":[{"full_name":"Reversat, Anne","last_name":"Reversat","first_name":"Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"}],"volume":215,"date_created":"2018-12-16T22:59:18Z","date_updated":"2023-09-11T14:12:06Z","year":"2018","department":[{"_id":"MiSi"}],"publisher":"Rockefeller University Press","publication_status":"published","file_date_updated":"2020-07-14T12:47:09Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","doi":"10.1084/jem.20181934","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"external_id":{"isi":["000451920600002"]},"quality_controlled":"1","isi":1,"publication_identifier":{"issn":["00221007"]},"month":"11","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_JournalExperMed_Reversat.pdf","creator":"dernst","content_type":"application/pdf","file_size":1216437,"file_id":"5931","relation":"main_file","checksum":"687beea1d64c213f4cb9e3c29ec11a14","date_updated":"2020-07-14T12:47:09Z","date_created":"2019-02-06T08:49:52Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5672","intvolume":" 215","ddc":["570"],"status":"public","title":"IgM's exit route","issue":"12","abstract":[{"lang":"eng","text":"The release of IgM is the first line of an antibody response and precedes the generation of high affinity IgG in germinal centers. Once secreted by freshly activated plasmablasts, IgM is released into the efferent lymph of reactive lymph nodes as early as 3 d after immunization. As pentameric IgM has an enormous size of 1,000 kD, its diffusibility is low, and one might wonder how it can pass through the densely lymphocyte-packed environment of a lymph node parenchyma in order to reach its exit. In this issue of JEM, Thierry et al. show that, in order to reach the blood stream, IgM molecules take a specific micro-anatomical route via lymph node conduits."}],"type":"journal_article","date_published":"2018-11-20T00:00:00Z","citation":{"ieee":"A. Reversat and M. K. Sixt, “IgM’s exit route,” Journal of Experimental Medicine, vol. 215, no. 12. Rockefeller University Press, pp. 2959–2961, 2018.","apa":"Reversat, A., & Sixt, M. K. (2018). IgM’s exit route. Journal of Experimental Medicine. Rockefeller University Press. https://doi.org/10.1084/jem.20181934","ista":"Reversat A, Sixt MK. 2018. IgM’s exit route. Journal of Experimental Medicine. 215(12), 2959–2961.","ama":"Reversat A, Sixt MK. IgM’s exit route. Journal of Experimental Medicine. 2018;215(12):2959-2961. doi:10.1084/jem.20181934","chicago":"Reversat, Anne, and Michael K Sixt. “IgM’s Exit Route.” Journal of Experimental Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20181934.","short":"A. Reversat, M.K. Sixt, Journal of Experimental Medicine 215 (2018) 2959–2961.","mla":"Reversat, Anne, and Michael K. Sixt. “IgM’s Exit Route.” Journal of Experimental Medicine, vol. 215, no. 12, Rockefeller University Press, 2018, pp. 2959–61, doi:10.1084/jem.20181934."},"publication":"Journal of Experimental Medicine","page":"2959-2961","article_processing_charge":"No","has_accepted_license":"1","day":"20","scopus_import":"1"},{"_id":"398","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Elsevier","intvolume":" 13","department":[{"_id":"BeBi"}],"status":"public","title":"Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device","publication_status":"published","author":[{"full_name":"Dodier, Philippe","first_name":"Philippe","last_name":"Dodier"},{"full_name":"Frischer, Josa","first_name":"Josa","last_name":"Frischer"},{"first_name":"Wei","last_name":"Wang","full_name":"Wang, Wei"},{"full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","first_name":"Thomas"},{"full_name":"Mallouhi, Ammar","last_name":"Mallouhi","first_name":"Ammar"},{"last_name":"Serles","first_name":"Wolfgang","full_name":"Serles, Wolfgang"},{"full_name":"Gruber, Andreas","last_name":"Gruber","first_name":"Andreas"},{"full_name":"Knosp, Engelbert","last_name":"Knosp","first_name":"Engelbert"},{"first_name":"Gerhard","last_name":"Bavinzski","full_name":"Bavinzski, Gerhard"}],"oa_version":"None","volume":13,"date_updated":"2023-09-11T14:12:33Z","date_created":"2018-12-11T11:46:15Z","type":"journal_article","publist_id":"7431","abstract":[{"text":"Objective: To report long-term results after Pipeline Embolization Device (PED) implantation, characterize complex and standard aneurysms comprehensively, and introduce a modified flow disruption scale. Methods: We retrospectively reviewed a consecutive series of 40 patients harboring 59 aneurysms treated with 54 PEDs. Aneurysm complexity was assessed using our proposed classification. Immediate angiographic results were analyzed using previously published grading scales and our novel flow disruption scale. Results: According to our new definition, 46 (78%) aneurysms were classified as complex. Most PED interventions were performed in the paraophthalmic and cavernous internal carotid artery segments. Excellent neurologic outcome (modified Rankin Scale 0 and 1) was observed in 94% of patients. Our data showed low permanent procedure-related mortality (0%) and morbidity (3%) rates. Long-term angiographic follow-up showed complete occlusion in 81% and near-total obliteration in a further 14%. Complete obliteration after deployment of a single PED was achieved in all standard aneurysms with 1-year follow-up. Our new scale was an independent predictor of aneurysm occlusion in a multivariable analysis. All aneurysms with a high flow disruption grade showed complete occlusion at follow-up regardless of PED number or aneurysm complexity. Conclusions: Treatment with the PED should be recognized as a primary management strategy for a highly selected cohort with predominantly complex intracranial aneurysms. We further show that a priori assessment of aneurysm complexity and our new postinterventional angiographic flow disruption scale predict occlusion probability and may help to determine the adequate number of per-aneurysm devices.","lang":"eng"}],"external_id":{"isi":["000432942700070"]},"citation":{"ama":"Dodier P, Frischer J, Wang W, et al. Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device. World Neurosurgery. 2018;13:e568-e578. doi:10.1016/j.wneu.2018.02.096","ieee":"P. Dodier et al., “Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device,” World Neurosurgery, vol. 13. Elsevier, pp. e568–e578, 2018.","apa":"Dodier, P., Frischer, J., Wang, W., Auzinger, T., Mallouhi, A., Serles, W., … Bavinzski, G. (2018). Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device. World Neurosurgery. Elsevier. https://doi.org/10.1016/j.wneu.2018.02.096","ista":"Dodier P, Frischer J, Wang W, Auzinger T, Mallouhi A, Serles W, Gruber A, Knosp E, Bavinzski G. 2018. Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device. World Neurosurgery. 13, e568–e578.","short":"P. Dodier, J. Frischer, W. Wang, T. Auzinger, A. Mallouhi, W. Serles, A. Gruber, E. Knosp, G. Bavinzski, World Neurosurgery 13 (2018) e568–e578.","mla":"Dodier, Philippe, et al. “Immediate Flow Disruption as a Prognostic Factor after Flow Diverter Treatment Long Term Experience with the Pipeline Embolization Device.” World Neurosurgery, vol. 13, Elsevier, 2018, pp. e568–78, doi:10.1016/j.wneu.2018.02.096.","chicago":"Dodier, Philippe, Josa Frischer, Wei Wang, Thomas Auzinger, Ammar Mallouhi, Wolfgang Serles, Andreas Gruber, Engelbert Knosp, and Gerhard Bavinzski. “Immediate Flow Disruption as a Prognostic Factor after Flow Diverter Treatment Long Term Experience with the Pipeline Embolization Device.” World Neurosurgery. Elsevier, 2018. https://doi.org/10.1016/j.wneu.2018.02.096."},"publication":"World Neurosurgery","page":"e568-e578","isi":1,"quality_controlled":"1","doi":"10.1016/j.wneu.2018.02.096","date_published":"2018-05-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","day":"01","month":"05"},{"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Transactions of the American Mathematical Society","citation":{"ama":"Akopyan A, Bobenko A. Incircular nets and confocal conics. Transactions of the American Mathematical Society. 2018;370(4):2825-2854. doi:10.1090/tran/7292","ieee":"A. Akopyan and A. Bobenko, “Incircular nets and confocal conics,” Transactions of the American Mathematical Society, vol. 370, no. 4. American Mathematical Society, pp. 2825–2854, 2018.","apa":"Akopyan, A., & Bobenko, A. (2018). Incircular nets and confocal conics. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7292","ista":"Akopyan A, Bobenko A. 2018. Incircular nets and confocal conics. Transactions of the American Mathematical Society. 370(4), 2825–2854.","short":"A. Akopyan, A. Bobenko, Transactions of the American Mathematical Society 370 (2018) 2825–2854.","mla":"Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal Conics.” Transactions of the American Mathematical Society, vol. 370, no. 4, American Mathematical Society, 2018, pp. 2825–54, doi:10.1090/tran/7292.","chicago":"Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal Conics.” Transactions of the American Mathematical Society. American Mathematical Society, 2018. https://doi.org/10.1090/tran/7292."},"page":"2825 - 2854","date_published":"2018-04-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We consider congruences of straight lines in a plane with the combinatorics of the square grid, with all elementary quadrilaterals possessing an incircle. It is shown that all the vertices of such nets (we call them incircular or IC-nets) lie on confocal conics. Our main new results are on checkerboard IC-nets in the plane. These are congruences of straight lines in the plane with the combinatorics of the square grid, combinatorially colored as a checkerboard, such that all black coordinate quadrilaterals possess inscribed circles. We show how this larger class of IC-nets appears quite naturally in Laguerre geometry of oriented planes and spheres and leads to new remarkable incidence theorems. Most of our results are valid in hyperbolic and spherical geometries as well. We present also generalizations in spaces of higher dimension, called checkerboard IS-nets. The construction of these nets is based on a new 9 inspheres incidence theorem.","lang":"eng"}],"issue":"4","_id":"458","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Incircular nets and confocal conics","intvolume":" 370","oa_version":"Preprint","month":"04","external_id":{"isi":["000423197800019"]},"main_file_link":[{"url":"https://arxiv.org/abs/1602.04637","open_access":"1"}],"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"doi":"10.1090/tran/7292","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"7363","year":"2018","acknowledgement":"DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”; People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) REA grant agreement n◦[291734]","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"American Mathematical Society","author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"first_name":"Alexander","last_name":"Bobenko","full_name":"Bobenko, Alexander"}],"date_created":"2018-12-11T11:46:35Z","date_updated":"2023-09-11T14:19:12Z","volume":370}]