[{"arxiv":1,"oa":1,"day":"01","publication":"2017 IEEE Global Communications Conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","external_id":{"arxiv":["1705.05497"]},"title":"Partitioned list decoding of polar codes: Analysis and improvement of finite length performance","oa_version":"Preprint","month":"12","doi":"10.1109/glocom.2017.8254940","author":[{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"first_name":"Ruediger","last_name":"Urbanke","full_name":"Urbanke, Ruediger"},{"full_name":"Gross, Warren","last_name":"Gross","first_name":"Warren"}],"publication_status":"published","language":[{"iso":"eng"}],"citation":{"ista":"Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. 2017. Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. 2017 IEEE Global Communications Conference. GLOBECOM: Global Communications Conference, 1–7.","mla":"Hashemi, Seyyed Ali, et al. “Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance.” <i>2017 IEEE Global Communications Conference</i>, IEEE, 2017, pp. 1–7, doi:<a href=\"https://doi.org/10.1109/glocom.2017.8254940\">10.1109/glocom.2017.8254940</a>.","ama":"Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. In: <i>2017 IEEE Global Communications Conference</i>. IEEE; 2017:1-7. doi:<a href=\"https://doi.org/10.1109/glocom.2017.8254940\">10.1109/glocom.2017.8254940</a>","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Hamed Hassani, Ruediger Urbanke, and Warren Gross. “Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance.” In <i>2017 IEEE Global Communications Conference</i>, 1–7. IEEE, 2017. <a href=\"https://doi.org/10.1109/glocom.2017.8254940\">https://doi.org/10.1109/glocom.2017.8254940</a>.","apa":"Hashemi, S. A., Mondelli, M., Hassani, H., Urbanke, R., &#38; Gross, W. (2017). Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. In <i>2017 IEEE Global Communications Conference</i> (pp. 1–7). Singapore, Singapore: IEEE. <a href=\"https://doi.org/10.1109/glocom.2017.8254940\">https://doi.org/10.1109/glocom.2017.8254940</a>","ieee":"S. A. Hashemi, M. Mondelli, H. Hassani, R. Urbanke, and W. Gross, “Partitioned list decoding of polar codes: Analysis and improvement of finite length performance,” in <i>2017 IEEE Global Communications Conference</i>, Singapore, Singapore, 2017, pp. 1–7.","short":"S.A. Hashemi, M. Mondelli, H. Hassani, R. Urbanke, W. Gross, in:, 2017 IEEE Global Communications Conference, IEEE, 2017, pp. 1–7."},"date_created":"2019-07-24T13:55:25Z","year":"2017","date_published":"2017-12-01T00:00:00Z","type":"conference","quality_controlled":"1","date_updated":"2021-01-12T08:08:34Z","_id":"6679","status":"public","page":"1-7","conference":{"location":"Singapore, Singapore","end_date":"2017-12-08","name":"GLOBECOM: Global Communications Conference","start_date":"2017-12-04"},"abstract":[{"text":"Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of decoding algorithms with good error performance and efficient hardware implementation. One of the leading candidates in this regard is represented by successive-cancellation list (SCL) decoding. However, its hardware implementation requires a large amount of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly reduce the memory consumption [1]. In this paper, we examine the paradigm of PSCL decoding from both theoretical and practical standpoints: (i) by changing the construction of the code, we are able to improve the performance at no additional computational, latency or memory cost, (ii) we present an optimal scheme to allocate cyclic redundancy checks (CRCs), and (iii) we provide an upper bound on the list size that allows MAP performance.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.05497"}],"extern":"1"},{"page":"7258 - 7273","_id":"668","date_created":"2018-12-11T11:47:49Z","year":"2017","date_published":"2017-04-28T00:00:00Z","publist_id":"7059","publication_status":"published","article_processing_charge":"No","language":[{"iso":"eng"}],"citation":{"ieee":"M. Horsthemke <i>et al.</i>, “Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion,” <i>Journal of Biological Chemistry</i>, vol. 292, no. 17. American Society for Biochemistry and Molecular Biology, pp. 7258–7273, 2017.","short":"M. Horsthemke, A. Bachg, K. Groll, S. Moyzio, B. Müther, S. Hemkemeyer, R. Wedlich Söldner, M.K. Sixt, S. Tacke, M. Bähler, P. Hanley, Journal of Biological Chemistry 292 (2017) 7258–7273.","apa":"Horsthemke, M., Bachg, A., Groll, K., Moyzio, S., Müther, B., Hemkemeyer, S., … Hanley, P. (2017). Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M116.766923\">https://doi.org/10.1074/jbc.M116.766923</a>","chicago":"Horsthemke, Markus, Anne Bachg, Katharina Groll, Sven Moyzio, Barbara Müther, Sandra Hemkemeyer, Roland Wedlich Söldner, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2017. <a href=\"https://doi.org/10.1074/jbc.M116.766923\">https://doi.org/10.1074/jbc.M116.766923</a>.","ama":"Horsthemke M, Bachg A, Groll K, et al. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. <i>Journal of Biological Chemistry</i>. 2017;292(17):7258-7273. doi:<a href=\"https://doi.org/10.1074/jbc.M116.766923\">10.1074/jbc.M116.766923</a>","mla":"Horsthemke, Markus, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” <i>Journal of Biological Chemistry</i>, vol. 292, no. 17, American Society for Biochemistry and Molecular Biology, 2017, pp. 7258–73, doi:<a href=\"https://doi.org/10.1074/jbc.M116.766923\">10.1074/jbc.M116.766923</a>.","ista":"Horsthemke M, Bachg A, Groll K, Moyzio S, Müther B, Hemkemeyer S, Wedlich Söldner R, Sixt MK, Tacke S, Bähler M, Hanley P. 2017. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 292(17), 7258–7273."},"isi":1,"type":"journal_article","intvolume":"       292","date_updated":"2025-09-11T07:03:17Z","has_accepted_license":"1","title":"Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion","publication_identifier":{"issn":["0021-9258"]},"file":[{"file_id":"6971","checksum":"d488162874326a4bb056065fa549dc4a","date_created":"2019-10-24T15:25:42Z","date_updated":"2020-07-14T12:47:37Z","relation":"main_file","file_name":"2017_JBC_Horsthemke.pdf","file_size":5647880,"content_type":"application/pdf","access_level":"open_access","creator":"dernst"}],"issue":"17","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000400478300035"]},"file_date_updated":"2020-07-14T12:47:37Z","department":[{"_id":"MiSi"}],"status":"public","abstract":[{"text":"Macrophage filopodia, finger-like membrane protrusions, were first implicated in phagocytosis more than 100 years ago, but little is still known about the involvement of these actin-dependent structures in particle clearance. Using spinning disk confocal microscopy to image filopodial dynamics in mouse resident Lifeact-EGFP macrophages, we show that filopodia, or filopodia-like structures, support pathogen clearance by multiple means. Filopodia supported the phagocytic uptake of bacterial (Escherichia coli) particles by (i) capturing along the filopodial shaft and surfing toward the cell body, the most common mode of capture; (ii) capturing via the tip followed by retraction; (iii) combinations of surfing and retraction; or (iv) sweeping actions. In addition, filopodia supported the uptake of zymosan (Saccharomyces cerevisiae) particles by (i) providing fixation, (ii) capturing at the tip and filopodia-guided actin anterograde flow with phagocytic cup formation, and (iii) the rapid growth of new protrusions. To explore the role of filopodia-inducing Cdc42, we generated myeloid-restricted Cdc42 knock-out mice. Cdc42-deficient macrophages exhibited rapid phagocytic cup kinetics, but reduced particle clearance, which could be explained by the marked rounded-up morphology of these cells. Macrophages lacking Myo10, thought to act downstream of Cdc42, had normal morphology, motility, and phagocytic cup formation, but displayed markedly reduced filopodia formation. In conclusion, live-cell imaging revealed multiple mechanisms involving macrophage filopodia in particle capture and engulfment. Cdc42 is not critical for filopodia or phagocytic cup formation, but plays a key role in driving macrophage lamellipodial spreading.","lang":"eng"}],"ddc":["570"],"quality_controlled":"1","scopus_import":"1","article_type":"original","volume":292,"oa_version":"Published Version","author":[{"last_name":"Horsthemke","first_name":"Markus","full_name":"Horsthemke, Markus"},{"last_name":"Bachg","first_name":"Anne","full_name":"Bachg, Anne"},{"last_name":"Groll","first_name":"Katharina","full_name":"Groll, Katharina"},{"full_name":"Moyzio, Sven","last_name":"Moyzio","first_name":"Sven"},{"full_name":"Müther, Barbara","first_name":"Barbara","last_name":"Müther"},{"first_name":"Sandra","last_name":"Hemkemeyer","full_name":"Hemkemeyer, Sandra"},{"full_name":"Wedlich Söldner, Roland","last_name":"Wedlich Söldner","first_name":"Roland"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"},{"last_name":"Tacke","first_name":"Sebastian","full_name":"Tacke, Sebastian"},{"last_name":"Bähler","first_name":"Martin","full_name":"Bähler, Martin"},{"full_name":"Hanley, Peter","last_name":"Hanley","first_name":"Peter"}],"doi":"10.1074/jbc.M116.766923","month":"04","day":"28","oa":1,"publication":"Journal of Biological Chemistry","publisher":"American Society for Biochemistry and Molecular Biology"},{"pmid":1,"volume":174,"article_type":"original","scopus_import":"1","oa_version":"Submitted Version","doi":"10.1104/pp.16.01282","author":[{"full_name":"Synek, Lukáš","first_name":"Lukáš","last_name":"Synek"},{"last_name":"Vukašinović","first_name":"Nemanja","full_name":"Vukašinović, Nemanja"},{"full_name":"Kulich, Ivan","last_name":"Kulich","first_name":"Ivan"},{"full_name":"Hála, Michal","last_name":"Hála","first_name":"Michal"},{"full_name":"Aldorfová, Klára","last_name":"Aldorfová","first_name":"Klára"},{"full_name":"Fendrych, Matyas","orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87","first_name":"Matyas","last_name":"Fendrych"},{"last_name":"Žárský","first_name":"Viktor","full_name":"Žárský, Viktor"}],"month":"05","publication":"Plant Physiology","day":"01","oa":1,"publisher":"American Society of Plant Biologists","status":"public","abstract":[{"text":"The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis as an effector of small GTPases in polarized cell growth. In land plants, several exocyst subunits are encoded by double or triple paralogs, culminating in tens of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed seven isoforms expressed in pollen. Genetic and microscopic analyses of single mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes revealed that only a loss-of-function EXO70C2 allele resulted in a significant male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2 pollen tubes could frequently recover and restart their speedy elongation, resulting in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background, resulted in a complete pollen-specific transmission defect, suggesting redundant functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed under the control of their native promoters, localized in the cytoplasm of pollen grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization, and genetic effect suggest an unconventional EXO70 function possibly as a regulator of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes. ","lang":"eng"}],"ddc":["580"],"quality_controlled":"1","has_accepted_license":"1","title":"EXO70C2 is a key regulatory factor for optimal tip growth of pollen","publication_identifier":{"issn":["0032-0889"]},"issue":"1","file":[{"date_created":"2019-11-18T16:16:18Z","checksum":"97155acc6aa5f0d0a78e0589a932fe02","file_id":"7041","date_updated":"2020-07-14T12:47:37Z","file_size":2176903,"relation":"main_file","file_name":"2017_PlantPhysio_Synek.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf"}],"external_id":{"isi":["000402057200017"],"pmid":["28356503"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:47:37Z","department":[{"_id":"JiFr"}],"page":"223 - 240","_id":"669","date_published":"2017-05-01T00:00:00Z","publist_id":"7058","year":"2017","date_created":"2018-12-11T11:47:49Z","citation":{"ista":"Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 174(1), 223–240.","mla":"Synek, Lukáš, et al. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” <i>Plant Physiology</i>, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 223–40, doi:<a href=\"https://doi.org/10.1104/pp.16.01282\">10.1104/pp.16.01282</a>.","chicago":"Synek, Lukáš, Nemanja Vukašinović, Ivan Kulich, Michal Hála, Klára Aldorfová, Matyas Fendrych, and Viktor Žárský. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.01282\">https://doi.org/10.1104/pp.16.01282</a>.","ama":"Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. <i>Plant Physiology</i>. 2017;174(1):223-240. doi:<a href=\"https://doi.org/10.1104/pp.16.01282\">10.1104/pp.16.01282</a>","apa":"Synek, L., Vukašinović, N., Kulich, I., Hála, M., Aldorfová, K., Fendrych, M., &#38; Žárský, V. (2017). EXO70C2 is a key regulatory factor for optimal tip growth of pollen. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.01282\">https://doi.org/10.1104/pp.16.01282</a>","ieee":"L. Synek <i>et al.</i>, “EXO70C2 is a key regulatory factor for optimal tip growth of pollen,” <i>Plant Physiology</i>, vol. 174, no. 1. American Society of Plant Biologists, pp. 223–240, 2017.","short":"L. Synek, N. Vukašinović, I. Kulich, M. Hála, K. Aldorfová, M. Fendrych, V. Žárský, Plant Physiology 174 (2017) 223–240."},"article_processing_charge":"No","language":[{"iso":"eng"}],"publication_status":"published","isi":1,"date_updated":"2025-09-11T07:02:41Z","intvolume":"       174","type":"journal_article"},{"oa_version":"Published Version","scopus_import":"1","article_type":"original","volume":36,"project":[{"call_identifier":"FWF","_id":"25357BD2-B435-11E9-9278-68D0E5697425","name":"Deep Pictures: Creating Visual and Haptic Vector Images","grant_number":"P 24352-N23"}],"month":"05","doi":"10.1111/cgf.13110","author":[{"full_name":"Schreck, Camille","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","last_name":"Schreck"},{"first_name":"Damien","last_name":"Rohmer","full_name":"Rohmer, Damien"},{"first_name":"Stefanie","last_name":"Hahmann","full_name":"Hahmann, Stefanie"}],"day":"01","oa":1,"publication":"Computer Graphics Forum","publisher":"Wiley","status":"public","abstract":[{"lang":"eng","text":"We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears."}],"main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf"}],"quality_controlled":"1","ddc":["000"],"title":"Interactive paper tearing","publication_identifier":{"issn":["01677055"]},"issue":"2","department":[{"_id":"ChWo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000404474000011"]},"_id":"670","page":"95 - 106","publication_status":"published","article_processing_charge":"No","citation":{"ama":"Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. <i>Computer Graphics Forum</i>. 2017;36(2):95-106. doi:<a href=\"https://doi.org/10.1111/cgf.13110\">10.1111/cgf.13110</a>","chicago":"Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper Tearing.” <i>Computer Graphics Forum</i>. Wiley, 2017. <a href=\"https://doi.org/10.1111/cgf.13110\">https://doi.org/10.1111/cgf.13110</a>.","apa":"Schreck, C., Rohmer, D., &#38; Hahmann, S. (2017). Interactive paper tearing. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13110\">https://doi.org/10.1111/cgf.13110</a>","ista":"Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer Graphics Forum. 36(2), 95–106.","mla":"Schreck, Camille, et al. “Interactive Paper Tearing.” <i>Computer Graphics Forum</i>, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:<a href=\"https://doi.org/10.1111/cgf.13110\">10.1111/cgf.13110</a>.","short":"C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106.","ieee":"C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” <i>Computer Graphics Forum</i>, vol. 36, no. 2. Wiley, pp. 95–106, 2017."},"language":[{"iso":"eng"}],"year":"2017","date_created":"2018-12-11T11:47:49Z","date_published":"2017-05-01T00:00:00Z","publist_id":"7056","type":"journal_article","intvolume":"        36","date_updated":"2025-09-11T07:02:03Z","isi":1},{"corr_author":"1","oa_version":"Published Version","volume":114,"scopus_import":"1","pmid":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"}],"month":"05","doi":"10.1073/pnas.1621239114","author":[{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe"},{"full_name":"Martinez, Vaquero","last_name":"Martinez","first_name":"Vaquero"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"day":"02","oa":1,"publication":"PNAS","publisher":"National Academy of Sciences","status":"public","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/","open_access":"1"}],"abstract":[{"text":"Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation.","lang":"eng"}],"ec_funded":1,"quality_controlled":"1","title":"Memory-n strategies of direct reciprocity","publication_identifier":{"issn":["0027-8424"]},"issue":"18","department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000400358000050"],"pmid":["28420786"]},"_id":"671","page":"4715 - 4720","publication_status":"published","citation":{"ista":"Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.","mla":"Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:<a href=\"https://doi.org/10.1073/pnas.1621239114\">10.1073/pnas.1621239114</a>.","ama":"Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. <i>PNAS</i>. 2017;114(18):4715-4720. doi:<a href=\"https://doi.org/10.1073/pnas.1621239114\">10.1073/pnas.1621239114</a>","chicago":"Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1621239114\">https://doi.org/10.1073/pnas.1621239114</a>.","apa":"Hilbe, C., Martinez, V., Chatterjee, K., &#38; Nowak, M. (2017). Memory-n strategies of direct reciprocity. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1621239114\">https://doi.org/10.1073/pnas.1621239114</a>","ieee":"C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” <i>PNAS</i>, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.","short":"C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720."},"article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:47:50Z","year":"2017","publist_id":"7053","date_published":"2017-05-02T00:00:00Z","type":"journal_article","date_updated":"2025-09-10T14:28:19Z","intvolume":"       114","isi":1},{"department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"EM-Fac"}],"file_date_updated":"2020-07-14T12:47:38Z","external_id":{"isi":["000402124100002"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"5","file":[{"date_updated":"2020-07-14T12:47:38Z","file_id":"5109","checksum":"8fdddaab1f1d76a6ec9ca94dcb6b07a2","date_created":"2018-12-12T10:14:54Z","content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file","file_name":"IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf","file_size":2248814}],"publication_identifier":{"issn":["2211-1247"]},"title":"Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia","has_accepted_license":"1","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"},"date_updated":"2025-09-10T14:27:34Z","intvolume":"        19","type":"journal_article","isi":1,"article_processing_charge":"Yes","language":[{"iso":"eng"}],"citation":{"ieee":"K. Vaahtomeri <i>et al.</i>, “Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia,” <i>Cell Reports</i>, vol. 19, no. 5. Cell Press, pp. 902–909, 2017.","short":"K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling, W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909.","mla":"Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>, vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">10.1016/j.celrep.2017.04.027</a>.","ista":"Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.","apa":"Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling, M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">https://doi.org/10.1016/j.celrep.2017.04.027</a>","ama":"Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>. 2017;19(5):902-909. doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">10.1016/j.celrep.2017.04.027</a>","chicago":"Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">https://doi.org/10.1016/j.celrep.2017.04.027</a>."},"publication_status":"published","publist_id":"7052","date_published":"2017-05-02T00:00:00Z","date_created":"2018-12-11T11:47:50Z","year":"2017","_id":"672","page":"902 - 909","publisher":"Cell Press","publication":"Cell Reports","oa":1,"day":"02","month":"05","pubrep_id":"900","author":[{"last_name":"Vaahtomeri","first_name":"Kari","id":"368EE576-F248-11E8-B48F-1D18A9856A87","full_name":"Vaahtomeri, Kari","orcid":"0000-0001-7829-3518"},{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","last_name":"Brown","full_name":"Brown, Markus"},{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522"},{"last_name":"De Vries","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid","full_name":"De Vries, Ingrid"},{"full_name":"Leithner, Alexander F","orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander F","last_name":"Leithner"},{"first_name":"Matthias","id":"3C23B994-F248-11E8-B48F-1D18A9856A87","last_name":"Mehling","orcid":"0000-0001-8599-1226","full_name":"Mehling, Matthias"},{"first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","last_name":"Kaufmann","full_name":"Kaufmann, Walter","orcid":"0000-0001-9735-5315"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"}],"doi":"10.1016/j.celrep.2017.04.027","corr_author":"1","oa_version":"Published Version","project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"281556"},{"_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","grant_number":"Y 564-B12"}],"scopus_import":"1","volume":19,"quality_controlled":"1","ddc":["570"],"ec_funded":1,"abstract":[{"lang":"eng","text":"Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration."}],"status":"public"},{"related_material":{"record":[{"id":"6663","status":"public","relation":"later_version"}]},"quality_controlled":"1","date_updated":"2023-02-23T12:49:08Z","type":"conference","date_published":"2017-06-15T00:00:00Z","year":"2017","date_created":"2019-07-30T07:14:18Z","citation":{"ama":"Mondelli M, Hassani SH, Urbanke R. Construction of polar codes with sublinear complexity. In: <i>2017 IEEE International Symposium on Information Theory </i>. IEEE; 2017:1853-1857. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006850\">10.1109/isit.2017.8006850</a>","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” In <i>2017 IEEE International Symposium on Information Theory </i>, 1853–57. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006850\">https://doi.org/10.1109/isit.2017.8006850</a>.","apa":"Mondelli, M., Hassani, S. H., &#38; Urbanke, R. (2017). Construction of polar codes with sublinear complexity. In <i>2017 IEEE International Symposium on Information Theory </i> (pp. 1853–1857). Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006850\">https://doi.org/10.1109/isit.2017.8006850</a>","ista":"Mondelli M, Hassani SH, Urbanke R. 2017. Construction of polar codes with sublinear complexity. 2017 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1853–1857.","mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” <i>2017 IEEE International Symposium on Information Theory </i>, IEEE, 2017, pp. 1853–57, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006850\">10.1109/isit.2017.8006850</a>.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, in:, 2017 IEEE International Symposium on Information Theory , IEEE, 2017, pp. 1853–1857.","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” in <i>2017 IEEE International Symposium on Information Theory </i>, Aachen, Germany, 2017, pp. 1853–1857."},"language":[{"iso":"eng"}],"publication_status":"published","extern":"1","abstract":[{"lang":"eng","text":"Consider the problem of constructing a polar code of block length N for the transmission over a given channel W. Typically this requires to compute the reliability of all the N synthetic channels and then to include those that are sufficiently reliable. However, we know from [1], [2] that there is a partial order among the synthetic channels. Hence, it is natural to ask whether we can exploit it to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order [1], [2], we can construct a polar code by computing the reliability of roughly N/ log 3/2 N synthetic channels. Such a set of synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists in reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general and it can be used to further improve the complexity of the construction problem in case a new partial order on the synthetic channels of polar codes is discovered."}],"main_file_link":[{"url":"https://arxiv.org/abs/1612.05295","open_access":"1"}],"page":"1853-1857","conference":{"name":"ISIT: International Symposium on Information Theory","start_date":"2017-06-25","location":"Aachen, Germany","end_date":"2017-06-30"},"status":"public","_id":"6729","external_id":{"arxiv":["1612.05295"]},"publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"2017 IEEE International Symposium on Information Theory ","day":"15","oa":1,"arxiv":1,"doi":"10.1109/isit.2017.8006850","author":[{"last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"full_name":"Hassani, S. Hamed","first_name":"S. Hamed","last_name":"Hassani"},{"full_name":"Urbanke, Rudiger","first_name":"Rudiger","last_name":"Urbanke"}],"month":"06","publication_identifier":{"isbn":["9781509040964"],"eissn":["2157-8117"]},"oa_version":"Preprint","title":"Construction of polar codes with sublinear complexity"},{"quality_controlled":"1","article_number":"053103","abstract":[{"text":"We present a numerical study of wavy supercritical cylindrical Couette flow between counter-rotating cylinders in which the wavy pattern propagates either prograde with the inner cylinder or retrograde opposite the rotation of the inner cylinder. The wave propagation reversals from prograde to retrograde and vice versa occur at distinct values of the inner cylinder Reynolds number when the associated frequency of the wavy instability vanishes. The reversal occurs for both twofold and threefold symmetric wavy vortices. Moreover, the wave propagation reversal only occurs for sufficiently strong counter-rotation. The flow pattern reversal appears to be intrinsic in the system as either periodic boundary conditions or fixed end wall boundary conditions for different system sizes always result in the wave propagation reversal. We present a detailed bifurcation sequence and parameter space diagram with respect to retrograde behavior of wavy flows. The retrograde propagation of the instability occurs when the inner Reynolds number is about two times the outer Reynolds number. The mechanism for the retrograde propagation is associated with the inviscidly unstable region near the inner cylinder and the direction of the global average azimuthal velocity. Flow dynamics, spatio-temporal behavior, global mean angular velocity, and torque of the flow with the wavy pattern are explored.","lang":"eng"}],"status":"public","publisher":"American Physical Society","day":"10","publication":"Physical Review E","month":"05","author":[{"full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","last_name":"Altmeyer"},{"first_name":"Richard","last_name":"Lueptow","full_name":"Lueptow, Richard"}],"doi":"10.1103/PhysRevE.95.053103","oa_version":"None","corr_author":"1","volume":95,"scopus_import":"1","article_type":"original","pmid":1,"type":"journal_article","date_updated":"2025-09-10T14:26:12Z","intvolume":"        95","isi":1,"publication_status":"published","article_processing_charge":"No","citation":{"ieee":"S. Altmeyer and R. Lueptow, “Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow,” <i>Physical Review E</i>, vol. 95, no. 5. American Physical Society, 2017.","short":"S. Altmeyer, R. Lueptow, Physical Review E 95 (2017).","chicago":"Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review E</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">https://doi.org/10.1103/PhysRevE.95.053103</a>.","ama":"Altmeyer S, Lueptow R. Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. 2017;95(5). doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">10.1103/PhysRevE.95.053103</a>","apa":"Altmeyer, S., &#38; Lueptow, R. (2017). Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">https://doi.org/10.1103/PhysRevE.95.053103</a>","ista":"Altmeyer S, Lueptow R. 2017. Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. Physical Review E. 95(5), 053103.","mla":"Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review E</i>, vol. 95, no. 5, 053103, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">10.1103/PhysRevE.95.053103</a>."},"language":[{"iso":"eng"}],"OA_type":"closed access","date_created":"2018-12-11T11:47:50Z","year":"2017","date_published":"2017-05-10T00:00:00Z","publist_id":"7049","_id":"673","department":[{"_id":"BjHo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"pmid":["28618504"],"isi":["000401233900007"]},"issue":"5","publication_identifier":{"issn":["2470-0045"]},"title":"Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow"},{"date_published":"2017-07-01T00:00:00Z","date_created":"2019-07-30T07:18:11Z","year":"2017","citation":{"ieee":"S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. L. Urbanke, “Reed–Muller codes achieve capacity on erasure channels,” <i>IEEE Transactions on Information Theory</i>, vol. 63, no. 7. IEEE, pp. 4298–4316, 2017.","short":"S. Kudekar, S. Kumar, M. Mondelli, H.D. Pfister, E. Sasoglu, R.L. Urbanke, IEEE Transactions on Information Theory 63 (2017) 4298–4316.","mla":"Kudekar, Shrinivas, et al. “Reed–Muller Codes Achieve Capacity on Erasure Channels.” <i>IEEE Transactions on Information Theory</i>, vol. 63, no. 7, IEEE, 2017, pp. 4298–316, doi:<a href=\"https://doi.org/10.1109/tit.2017.2673829\">10.1109/tit.2017.2673829</a>.","ista":"Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. 2017. Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. 63(7), 4298–4316.","apa":"Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Sasoglu, E., &#38; Urbanke, R. L. (2017). Reed–Muller codes achieve capacity on erasure channels. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2017.2673829\">https://doi.org/10.1109/tit.2017.2673829</a>","ama":"Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. Reed–Muller codes achieve capacity on erasure channels. <i>IEEE Transactions on Information Theory</i>. 2017;63(7):4298-4316. doi:<a href=\"https://doi.org/10.1109/tit.2017.2673829\">10.1109/tit.2017.2673829</a>","chicago":"Kudekar, Shrinivas, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, and Ridiger L. Urbanke. “Reed–Muller Codes Achieve Capacity on Erasure Channels.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/tit.2017.2673829\">https://doi.org/10.1109/tit.2017.2673829</a>."},"language":[{"iso":"eng"}],"publication_status":"published","intvolume":"        63","date_updated":"2021-01-12T08:08:43Z","type":"journal_article","page":"4298-4316","_id":"6730","issue":"7","external_id":{"arxiv":["1601.04689"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Reed–Muller codes achieve capacity on erasure channels","publication_identifier":{"eissn":["1557-9654"],"issn":["0018-9448"]},"quality_controlled":"1","status":"public","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1601.04689"}],"abstract":[{"lang":"eng","text":"We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry alone implies near-optimal performance. An important consequence of this result is that a sequence of Reed-Muller codes with increasing block length and converging rate achieves capacity. This possibility has been suggested previously in the literature but it has only been proven for cases where the limiting code rate is 0 or 1. Moreover, these results extend naturally to all affine-invariant codes and, thus, to extended primitive narrow-sense BCH codes. This also resolves, in the affirmative, the existence question for capacity-achieving sequences of binary cyclic codes. The primary tools used in the proof are the sharp threshold property for symmetric monotone Boolean functions and the area theorem for extrinsic information transfer functions."}],"publication":"IEEE Transactions on Information Theory","oa":1,"day":"01","arxiv":1,"publisher":"IEEE","volume":63,"oa_version":"Preprint","doi":"10.1109/tit.2017.2673829","author":[{"first_name":"Shrinivas","last_name":"Kudekar","full_name":"Kudekar, Shrinivas"},{"last_name":"Kumar","first_name":"Santhosh","full_name":"Kumar, Santhosh"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli"},{"last_name":"Pfister","first_name":"Henry D.","full_name":"Pfister, Henry D."},{"full_name":"Sasoglu, Eren","last_name":"Sasoglu","first_name":"Eren"},{"first_name":"Ridiger L.","last_name":"Urbanke","full_name":"Urbanke, Ridiger L."}],"month":"07"},{"doi":"10.1109/wcncw.2017.7919107","author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"Hamed","last_name":"Hassani","full_name":"Hassani, Hamed"},{"last_name":"Maric","first_name":"Ivana","full_name":"Maric, Ivana"},{"first_name":"Dennis","last_name":"Hui","full_name":"Hui, Dennis"},{"full_name":"Hong, Song-Nam","first_name":"Song-Nam","last_name":"Hong"}],"publication_identifier":{"isbn":["9781509059089"]},"month":"05","oa_version":"Preprint","title":"Capacity-achieving rate-compatible polar codes for general channels","external_id":{"arxiv":["1611.01199"]},"publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"2017 IEEE Wireless Communications and Networking Conference Workshops ","oa":1,"day":"04","arxiv":1,"extern":"1","main_file_link":[{"url":"https://arxiv.org/abs/1611.01199","open_access":"1"}],"abstract":[{"lang":"eng","text":"We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of universal polar codes. Our scheme possesses the usual attractive features of polar codes: low complexity code construction, encoding, and decoding; super-polynomial scaling of the error probability with the block length; and absence of error floors. On the negative side, the scaling of the gap to capacity with the block length is slower than in standard polar codes, and we prove an upper bound on the scaling exponent."}],"article_number":"7919107","conference":{"name":"WCNCW: Wireless communications and networking conference workshops","start_date":"2017-03-19","end_date":"2017-03-22","location":"San Francisco, CA, USA"},"status":"public","_id":"6731","quality_controlled":"1","date_updated":"2021-01-12T08:08:43Z","type":"conference","date_published":"2017-05-04T00:00:00Z","date_created":"2019-07-31T05:56:58Z","year":"2017","citation":{"short":"M. Mondelli, H. Hassani, I. Maric, D. Hui, S.-N. Hong, in:, 2017 IEEE Wireless Communications and Networking Conference Workshops , IEEE, 2017.","ieee":"M. Mondelli, H. Hassani, I. Maric, D. Hui, and S.-N. Hong, “Capacity-achieving rate-compatible polar codes for general channels,” in <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>, San Francisco, CA, USA, 2017.","apa":"Mondelli, M., Hassani, H., Maric, I., Hui, D., &#38; Hong, S.-N. (2017). Capacity-achieving rate-compatible polar codes for general channels. In <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>. San Francisco, CA, USA: IEEE. <a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">https://doi.org/10.1109/wcncw.2017.7919107</a>","ama":"Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. Capacity-achieving rate-compatible polar codes for general channels. In: <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">10.1109/wcncw.2017.7919107</a>","chicago":"Mondelli, Marco, Hamed Hassani, Ivana Maric, Dennis Hui, and Song-Nam Hong. “Capacity-Achieving Rate-Compatible Polar Codes for General Channels.” In <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">https://doi.org/10.1109/wcncw.2017.7919107</a>.","mla":"Mondelli, Marco, et al. “Capacity-Achieving Rate-Compatible Polar Codes for General Channels.” <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>, 7919107, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">10.1109/wcncw.2017.7919107</a>.","ista":"Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. 2017. Capacity-achieving rate-compatible polar codes for general channels. 2017 IEEE Wireless Communications and Networking Conference Workshops . WCNCW: Wireless communications and networking conference workshops, 7919107."},"language":[{"iso":"eng"}],"publication_status":"published"},{"quality_controlled":"1","ec_funded":1,"abstract":[{"lang":"eng","text":"Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo."}],"status":"public","publisher":"Cell Press","publication":"Current Biology","day":"09","month":"05","doi":"10.1016/j.cub.2017.04.004","author":[{"first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz","full_name":"Schwarz, Jan"},{"full_name":"Bierbaum, Veronika","last_name":"Bierbaum","id":"3FD04378-F248-11E8-B48F-1D18A9856A87","first_name":"Veronika"},{"orcid":"0000-0001-7829-3518","full_name":"Vaahtomeri, Kari","first_name":"Kari","id":"368EE576-F248-11E8-B48F-1D18A9856A87","last_name":"Vaahtomeri"},{"orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"full_name":"Brown, Markus","last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus"},{"full_name":"De Vries, Ingrid","first_name":"Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","last_name":"De Vries"},{"last_name":"Leithner","first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1073-744X","full_name":"Leithner, Alexander F"},{"id":"35B76592-F248-11E8-B48F-1D18A9856A87","first_name":"Anne","last_name":"Reversat","orcid":"0000-0003-0666-8928","full_name":"Reversat, Anne"},{"first_name":"Jack","id":"4515C308-F248-11E8-B48F-1D18A9856A87","last_name":"Merrin","full_name":"Merrin, Jack","orcid":"0000-0001-5145-4609"},{"first_name":"Teresa","last_name":"Tarrant","full_name":"Tarrant, Teresa"},{"last_name":"Bollenbach","first_name":"Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Tobias"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt"}],"oa_version":"None","corr_author":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"grant_number":"Y 564-B12","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":27,"scopus_import":"1","intvolume":"        27","date_updated":"2025-09-10T14:26:47Z","type":"journal_article","isi":1,"citation":{"chicago":"Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” <i>Current Biology</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">https://doi.org/10.1016/j.cub.2017.04.004</a>.","ama":"Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. <i>Current Biology</i>. 2017;27(9):1314-1325. doi:<a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">10.1016/j.cub.2017.04.004</a>","apa":"Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries, I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">https://doi.org/10.1016/j.cub.2017.04.004</a>","ista":"Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.","mla":"Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” <i>Current Biology</i>, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:<a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">10.1016/j.cub.2017.04.004</a>.","short":"J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries, A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt, Current Biology 27 (2017) 1314–1325.","ieee":"J. Schwarz <i>et al.</i>, “Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6,” <i>Current Biology</i>, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017."},"language":[{"iso":"eng"}],"article_processing_charge":"No","publication_status":"published","date_published":"2017-05-09T00:00:00Z","publist_id":"7050","year":"2017","date_created":"2018-12-11T11:47:51Z","_id":"674","page":"1314 - 1325","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"NanoFab"}],"external_id":{"isi":["000400741700021"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"9","publication_identifier":{"issn":["09609822"]},"title":"Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6"},{"author":[{"first_name":"Johannes","last_name":"Haase","full_name":"Haase, Johannes"},{"orcid":"0000-0002-0122-9603","full_name":"Bagiante, Salvatore","last_name":"Bagiante","first_name":"Salvatore","id":"38ED402E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sigg","first_name":"Hans","full_name":"Sigg, Hans"},{"full_name":"Van Bokhoven, Jeroen","last_name":"Van Bokhoven","first_name":"Jeroen"}],"doi":"10.1364/OL.42.001931","month":"05","scopus_import":"1","volume":42,"article_type":"original","oa_version":"None","publisher":"Optica Publishing Group","publication":"Optics Letters","day":"15","abstract":[{"lang":"eng","text":"We report the enhancement of infrared absorption of chemisorbed carbon monoxide on platinum in the gap of plasmonic nanoantennas. Our method is based on the self-assembled formation of platinum nanoislands on nanoscopic dipole antenna arrays manufactured via electron beam lithography. We employ systematic variations of the plasmonic antenna resonance to precisely couple to the molecular stretch vibration of carbon monoxide adsorbed on the platinum nanoislands. Ultimately, we reach more than 1500-fold infrared absorption enhancements, allowing for an ultrasensitive detection of a monolayer of chemisorbed carbon monoxide. The developed procedure can be adapted to other metal adsorbents and molecular species and could be utilized for coverage sensing in surface catalytic reactions. "}],"status":"public","ddc":["530"],"quality_controlled":"1","title":"Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas","external_id":{"isi":["000401424900016"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"NanoFab"}],"issue":"10","page":"1931 - 1934","_id":"675","isi":1,"intvolume":"        42","date_updated":"2025-09-10T14:25:19Z","type":"journal_article","publist_id":"7048","date_published":"2017-05-15T00:00:00Z","date_created":"2018-12-11T11:47:51Z","year":"2017","citation":{"ista":"Haase J, Bagiante S, Sigg H, Van Bokhoven J. 2017. Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. Optics Letters. 42(10), 1931–1934.","mla":"Haase, Johannes, et al. “Surface Enhanced Infrared Absorption of Chemisorbed Carbon Monoxide Using Plasmonic Nanoantennas.” <i>Optics Letters</i>, vol. 42, no. 10, Optica Publishing Group, 2017, pp. 1931–34, doi:<a href=\"https://doi.org/10.1364/OL.42.001931\">10.1364/OL.42.001931</a>.","chicago":"Haase, Johannes, Salvatore Bagiante, Hans Sigg, and Jeroen Van Bokhoven. “Surface Enhanced Infrared Absorption of Chemisorbed Carbon Monoxide Using Plasmonic Nanoantennas.” <i>Optics Letters</i>. Optica Publishing Group, 2017. <a href=\"https://doi.org/10.1364/OL.42.001931\">https://doi.org/10.1364/OL.42.001931</a>.","ama":"Haase J, Bagiante S, Sigg H, Van Bokhoven J. Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. <i>Optics Letters</i>. 2017;42(10):1931-1934. doi:<a href=\"https://doi.org/10.1364/OL.42.001931\">10.1364/OL.42.001931</a>","apa":"Haase, J., Bagiante, S., Sigg, H., &#38; Van Bokhoven, J. (2017). Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OL.42.001931\">https://doi.org/10.1364/OL.42.001931</a>","ieee":"J. Haase, S. Bagiante, H. Sigg, and J. Van Bokhoven, “Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas,” <i>Optics Letters</i>, vol. 42, no. 10. Optica Publishing Group, pp. 1931–1934, 2017.","short":"J. Haase, S. Bagiante, H. Sigg, J. Van Bokhoven, Optics Letters 42 (2017) 1931–1934."},"language":[{"iso":"eng"}],"article_processing_charge":"No","publication_status":"published"},{"ddc":["570"],"quality_controlled":"1","status":"public","abstract":[{"text":"The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR.","lang":"eng"}],"day":"16","oa":1,"publication":"Cell Reports","publisher":"Cell Press","scopus_import":"1","volume":19,"oa_version":"Published Version","author":[{"full_name":"Lademann, Claudio","last_name":"Lademann","first_name":"Claudio"},{"orcid":"0000-0003-2856-3369","full_name":"Renkawitz, Jörg","last_name":"Renkawitz","first_name":"Jörg","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pfander, Boris","first_name":"Boris","last_name":"Pfander"},{"first_name":"Stefan","last_name":"Jentsch","full_name":"Jentsch, Stefan"}],"doi":"10.1016/j.celrep.2017.04.051","month":"05","pubrep_id":"899","year":"2017","date_created":"2018-12-11T11:47:52Z","publist_id":"7046","date_published":"2017-05-16T00:00:00Z","publication_status":"published","language":[{"iso":"eng"}],"citation":{"ama":"Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. <i>Cell Reports</i>. 2017;19(7):1294-1303. doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">10.1016/j.celrep.2017.04.051</a>","chicago":"Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">https://doi.org/10.1016/j.celrep.2017.04.051</a>.","apa":"Lademann, C., Renkawitz, J., Pfander, B., &#38; Jentsch, S. (2017). The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">https://doi.org/10.1016/j.celrep.2017.04.051</a>","ista":"Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 19(7), 1294–1303.","mla":"Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” <i>Cell Reports</i>, vol. 19, no. 7, Cell Press, 2017, pp. 1294–303, doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">10.1016/j.celrep.2017.04.051</a>.","ieee":"C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination,” <i>Cell Reports</i>, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017.","short":"C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017) 1294–1303."},"article_processing_charge":"No","isi":1,"type":"journal_article","intvolume":"        19","date_updated":"2025-09-10T14:23:55Z","page":"1294 - 1303","_id":"677","issue":"7","file":[{"date_updated":"2020-07-14T12:47:40Z","file_id":"5171","date_created":"2018-12-12T10:15:48Z","checksum":"efc7287d9c6354983cb151880e9ad72a","content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file","file_name":"IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf","file_size":3005610}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000402125100002"]},"department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:40Z","has_accepted_license":"1","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"},"title":"The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination","publication_identifier":{"issn":["2211-1247"]}},{"_id":"678","page":"581 - 588","publication_status":"published","citation":{"ieee":"N. Petridou, Z. P. Spiro, and C.-P. J. Heisenberg, “Multiscale force sensing in development,” <i>Nature Cell Biology</i>, vol. 19, no. 6. Nature Publishing Group, pp. 581–588, 2017.","short":"N. Petridou, Z.P. Spiro, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017) 581–588.","chicago":"Petridou, Nicoletta, Zoltan P Spiro, and Carl-Philipp J Heisenberg. “Multiscale Force Sensing in Development.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncb3524\">https://doi.org/10.1038/ncb3524</a>.","ama":"Petridou N, Spiro ZP, Heisenberg C-PJ. Multiscale force sensing in development. <i>Nature Cell Biology</i>. 2017;19(6):581-588. doi:<a href=\"https://doi.org/10.1038/ncb3524\">10.1038/ncb3524</a>","apa":"Petridou, N., Spiro, Z. P., &#38; Heisenberg, C.-P. J. (2017). Multiscale force sensing in development. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb3524\">https://doi.org/10.1038/ncb3524</a>","ista":"Petridou N, Spiro ZP, Heisenberg C-PJ. 2017. Multiscale force sensing in development. Nature Cell Biology. 19(6), 581–588.","mla":"Petridou, Nicoletta, et al. “Multiscale Force Sensing in Development.” <i>Nature Cell Biology</i>, vol. 19, no. 6, Nature Publishing Group, 2017, pp. 581–88, doi:<a href=\"https://doi.org/10.1038/ncb3524\">10.1038/ncb3524</a>."},"language":[{"iso":"eng"}],"article_processing_charge":"No","year":"2017","date_created":"2018-12-11T11:47:53Z","publist_id":"7040","date_published":"2017-05-31T00:00:00Z","type":"journal_article","intvolume":"        19","date_updated":"2025-09-10T14:23:21Z","isi":1,"title":"Multiscale force sensing in development","publication_identifier":{"issn":["1465-7392"]},"issue":"6","department":[{"_id":"CaHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000402525200003"]},"status":"public","abstract":[{"text":"The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development.","lang":"eng"}],"quality_controlled":"1","oa_version":"None","corr_author":"1","scopus_import":"1","volume":19,"project":[{"_id":"25236028-B435-11E9-9278-68D0E5697425","name":"The generation and function of anisotropic tissue tension in zebrafish epiboly","grant_number":"ALTF534-2016"}],"month":"05","doi":"10.1038/ncb3524","author":[{"id":"2A003F6C-F248-11E8-B48F-1D18A9856A87","first_name":"Nicoletta","last_name":"Petridou","full_name":"Petridou, Nicoletta","orcid":"0000-0002-8451-1195"},{"full_name":"Spiro, Zoltan P","id":"426AD026-F248-11E8-B48F-1D18A9856A87","first_name":"Zoltan P","last_name":"Spiro"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"day":"31","publication":"Nature Cell Biology","publisher":"Nature Publishing Group"},{"_id":"680","year":"2017","date_created":"2018-12-11T11:47:53Z","date_published":"2017-06-01T00:00:00Z","publist_id":"7035","publication_status":"published","article_processing_charge":"No","citation":{"short":"M.J. Chalk, P. Masset, B. Gutkin, S. Denève, PLoS Computational Biology 13 (2017).","ieee":"M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Sensory noise predicts divisive reshaping of receptive fields,” <i>PLoS Computational Biology</i>, vol. 13, no. 6. Public Library of Science, 2017.","apa":"Chalk, M. J., Masset, P., Gutkin, B., &#38; Denève, S. (2017). Sensory noise predicts divisive reshaping of receptive fields. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">https://doi.org/10.1371/journal.pcbi.1005582</a>","ama":"Chalk MJ, Masset P, Gutkin B, Denève S. Sensory noise predicts divisive reshaping of receptive fields. <i>PLoS Computational Biology</i>. 2017;13(6). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">10.1371/journal.pcbi.1005582</a>","chicago":"Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Sensory Noise Predicts Divisive Reshaping of Receptive Fields.” <i>PLoS Computational Biology</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">https://doi.org/10.1371/journal.pcbi.1005582</a>.","mla":"Chalk, Matthew J., et al. “Sensory Noise Predicts Divisive Reshaping of Receptive Fields.” <i>PLoS Computational Biology</i>, vol. 13, no. 6, e1005582, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">10.1371/journal.pcbi.1005582</a>.","ista":"Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Sensory noise predicts divisive reshaping of receptive fields. PLoS Computational Biology. 13(6), e1005582."},"language":[{"iso":"eng"}],"isi":1,"related_material":{"record":[{"status":"public","relation":"research_data","id":"9855"}]},"type":"journal_article","date_updated":"2025-09-10T14:20:48Z","intvolume":"        13","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","title":"Sensory noise predicts divisive reshaping of receptive fields","publication_identifier":{"issn":["1553-734X"]},"file":[{"access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":14555676,"relation":"main_file","file_name":"IST-2017-898-v1+1_journal.pcbi.1005582.pdf","date_updated":"2020-07-14T12:47:40Z","checksum":"796a1026076af6f4405a47d985bc7b68","date_created":"2018-12-12T10:07:47Z","file_id":"4645"}],"issue":"6","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000404565400034"]},"file_date_updated":"2020-07-14T12:47:40Z","department":[{"_id":"GaTk"}],"status":"public","abstract":[{"lang":"eng","text":"In order to respond reliably to specific features of their environment, sensory neurons need to integrate multiple incoming noisy signals. Crucially, they also need to compete for the interpretation of those signals with other neurons representing similar features. The form that this competition should take depends critically on the noise corrupting these signals. In this study we show that for the type of noise commonly observed in sensory systems, whose variance scales with the mean signal, sensory neurons should selectively divide their input signals by their predictions, suppressing ambiguous cues while amplifying others. Any change in the stimulus context alters which inputs are suppressed, leading to a deep dynamic reshaping of neural receptive fields going far beyond simple surround suppression. Paradoxically, these highly variable receptive fields go alongside and are in fact required for an invariant representation of external sensory features. In addition to offering a normative account of context-dependent changes in sensory responses, perceptual inference in the presence of signal-dependent noise accounts for ubiquitous features of sensory neurons such as divisive normalization, gain control and contrast dependent temporal dynamics."}],"article_number":"e1005582","ddc":["571"],"quality_controlled":"1","scopus_import":"1","volume":13,"corr_author":"1","oa_version":"Published Version","author":[{"last_name":"Chalk","first_name":"Matthew J","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","full_name":"Chalk, Matthew J","orcid":"0000-0001-7782-4436"},{"first_name":"Paul","last_name":"Masset","full_name":"Masset, Paul"},{"last_name":"Gutkin","first_name":"Boris","full_name":"Gutkin, Boris"},{"first_name":"Sophie","last_name":"Denève","full_name":"Denève, Sophie"}],"doi":"10.1371/journal.pcbi.1005582","month":"06","pubrep_id":"898","day":"01","oa":1,"publication":"PLoS Computational Biology","publisher":"Public Library of Science"},{"intvolume":"        77","date_updated":"2025-04-15T06:53:14Z","type":"conference","related_material":{"record":[{"id":"5986","status":"public","relation":"later_version"}]},"citation":{"short":"A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia, 2017, vol. 77.","ama":"Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">10.4230/LIPIcs.SoCG.2017.49</a>","chicago":"Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>.","apa":"Lubiw, A., Masárová, Z., &#38; Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>","ista":"Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.","mla":"Lubiw, Anna, et al. <i>A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations</i>. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">10.4230/LIPIcs.SoCG.2017.49</a>."},"language":[{"iso":"eng"}],"publication_status":"published","publist_id":"7033","date_published":"2017-06-01T00:00:00Z","date_created":"2018-12-11T11:47:54Z","year":"2017","_id":"683","file_date_updated":"2020-07-14T12:47:41Z","department":[{"_id":"UlWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5265","checksum":"24fdde981cc513352a78dcf9b0660ae9","date_created":"2018-12-12T10:17:12Z","date_updated":"2020-07-14T12:47:41Z","relation":"main_file","file_name":"IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf","file_size":710007,"content_type":"application/pdf","access_level":"open_access","creator":"system"}],"title":"A proof of the orbit conjecture for flipping edge labelled triangulations","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","quality_controlled":"1","ddc":["514","516"],"abstract":[{"text":"Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.","lang":"eng"}],"article_number":"49","conference":{"location":"Brisbane, Australia","end_date":"2017-07-07","start_date":"2017-07-04","name":"SoCG: Symposium on Computational Geometry"},"status":"public","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"01","pubrep_id":"896","month":"06","author":[{"full_name":"Lubiw, Anna","last_name":"Lubiw","first_name":"Anna"},{"last_name":"Masárová","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322"},{"last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"doi":"10.4230/LIPIcs.SoCG.2017.49","oa_version":"Published Version","corr_author":"1","scopus_import":1,"volume":77},{"volume":82,"scopus_import":"1","corr_author":"1","oa_version":"Submitted Version","doi":"10.1017/jsl.2016.71","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"month":"06","oa":1,"day":"01","publication":"Journal of Symbolic Logic","arxiv":1,"publisher":"Cambridge University Press","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1206.5174","open_access":"1"}],"abstract":[{"lang":"eng","text":"We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic."}],"quality_controlled":"1","title":"Obligation blackwell games and p-automata","publication_identifier":{"eissn":["1943-5886"],"issn":["0022-4812"]},"issue":"2","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"arxiv":["1206.5174"],"isi":["000403796700002"]},"department":[{"_id":"KrCh"}],"page":"420 - 452","_id":"684","date_created":"2018-12-11T11:47:54Z","year":"2017","publist_id":"7026","date_published":"2017-06-01T00:00:00Z","publication_status":"published","citation":{"ista":"Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.","mla":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” <i>Journal of Symbolic Logic</i>, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:<a href=\"https://doi.org/10.1017/jsl.2016.71\">10.1017/jsl.2016.71</a>.","ama":"Chatterjee K, Piterman N. Obligation blackwell games and p-automata. <i>Journal of Symbolic Logic</i>. 2017;82(2):420-452. doi:<a href=\"https://doi.org/10.1017/jsl.2016.71\">10.1017/jsl.2016.71</a>","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” <i>Journal of Symbolic Logic</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jsl.2016.71\">https://doi.org/10.1017/jsl.2016.71</a>.","apa":"Chatterjee, K., &#38; Piterman, N. (2017). Obligation blackwell games and p-automata. <i>Journal of Symbolic Logic</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jsl.2016.71\">https://doi.org/10.1017/jsl.2016.71</a>","short":"K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.","ieee":"K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” <i>Journal of Symbolic Logic</i>, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017."},"language":[{"iso":"eng"}],"article_processing_charge":"No","isi":1,"type":"journal_article","intvolume":"        82","date_updated":"2025-09-10T14:18:30Z"},{"arxiv":1,"day":"21","oa":1,"publication":"5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings","department":[{"_id":"ChLa"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1610.02995"]},"publisher":"International Conference on Learning Representations","title":"Extrapolation and learning equations","oa_version":"Preprint","scopus_import":1,"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"month":"02","author":[{"first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","full_name":"Martius, Georg S"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"publication_status":"published","citation":{"ieee":"G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>, Toulon, France, 2017.","short":"G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017.","ama":"Martius GS, Lampert C. Extrapolation and learning equations. In: <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. International Conference on Learning Representations; 2017.","chicago":"Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.” In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. International Conference on Learning Representations, 2017.","apa":"Martius, G. S., &#38; Lampert, C. (2017). Extrapolation and learning equations. In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. Toulon, France: International Conference on Learning Representations.","ista":"Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. ICLR: International Conference on Learning Representations.","mla":"Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.” <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>, International Conference on Learning Representations, 2017."},"language":[{"iso":"eng"}],"ec_funded":1,"date_created":"2019-09-01T22:01:00Z","year":"2017","date_published":"2017-02-21T00:00:00Z","type":"conference","quality_controlled":"1","date_updated":"2021-01-12T08:09:17Z","_id":"6841","status":"public","conference":{"end_date":"2017-04-26","location":"Toulon, France","start_date":"2017-04-24","name":"ICLR: International Conference on Learning Representations"},"abstract":[{"lang":"eng","text":"In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified."}],"main_file_link":[{"url":"https://arxiv.org/abs/1610.02995","open_access":"1"}]},{"abstract":[{"lang":"eng","text":"Pursuing the similarity between the Kontsevich-Soibelman construction of the cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of canonical bases for quantum enveloping algebras, and the similarity between the integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem for quantum enveloping algebras, we build a coproduct on the CoHA associated to a quiver with potential. We also prove a cohomological dimensional reduction theorem, further linking a special class of CoHAs with Yangians, and explaining how to connect the study of character varieties with the study of CoHAs."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1311.7172"}],"status":"public","quality_controlled":"1","ec_funded":1,"author":[{"id":"4634AB1E-F248-11E8-B48F-1D18A9856A87","first_name":"Ben","last_name":"Davison","full_name":"Davison, Ben","orcid":"0000-0002-8944-4390"}],"doi":"10.1093/qmath/haw053","month":"06","project":[{"grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Arithmetic and physics of Higgs moduli spaces"}],"volume":68,"scopus_import":"1","corr_author":"1","oa_version":"Submitted Version","publisher":"Oxford University Press","publication":"Quarterly Journal of Mathematics","day":"01","oa":1,"arxiv":1,"page":"635 - 703","_id":"687","isi":1,"date_updated":"2025-09-10T14:15:30Z","intvolume":"        68","type":"journal_article","publist_id":"7022","date_published":"2017-06-01T00:00:00Z","year":"2017","date_created":"2018-12-11T11:47:55Z","article_processing_charge":"No","citation":{"short":"B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703.","ieee":"B. Davison, “The critical CoHA of a quiver with potential,” <i>Quarterly Journal of Mathematics</i>, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017.","mla":"Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly Journal of Mathematics</i>, vol. 68, no. 2, Oxford University Press, 2017, pp. 635–703, doi:<a href=\"https://doi.org/10.1093/qmath/haw053\">10.1093/qmath/haw053</a>.","ista":"Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal of Mathematics. 68(2), 635–703.","apa":"Davison, B. (2017). The critical CoHA of a quiver with potential. <i>Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haw053\">https://doi.org/10.1093/qmath/haw053</a>","chicago":"Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly Journal of Mathematics</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/qmath/haw053\">https://doi.org/10.1093/qmath/haw053</a>.","ama":"Davison B. The critical CoHA of a quiver with potential. <i>Quarterly Journal of Mathematics</i>. 2017;68(2):635-703. doi:<a href=\"https://doi.org/10.1093/qmath/haw053\">10.1093/qmath/haw053</a>"},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0033-5606"]},"title":"The critical CoHA of a quiver with potential","external_id":{"arxiv":["1311.7172"],"isi":["000404545300015"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"TaHa"}],"issue":"2"},{"type":"conference","date_updated":"2025-07-10T11:53:56Z","intvolume":"        77","year":"2017","date_created":"2018-12-11T11:47:56Z","date_published":"2017-06-01T00:00:00Z","publist_id":"7021","publication_status":"published","article_processing_charge":"No","language":[{"iso":"eng"}],"citation":{"ieee":"H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,” presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia, 2017, vol. 77, pp. 391–3916.","short":"H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916.","ista":"Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.","mla":"Edelsbrunner, Herbert, and Hubert Wagner. <i>Topological Data Analysis with Bregman Divergences</i>. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>.","ama":"Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>","chicago":"Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>.","apa":"Edelsbrunner, H., &#38; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>"},"page":"391-3916","_id":"688","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:42Z","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"file":[{"file_id":"4856","checksum":"067ab0cb3f962bae6c3af6bf0094e0f3","date_created":"2018-12-12T10:11:03Z","date_updated":"2020-07-14T12:47:42Z","file_name":"IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf","relation":"main_file","file_size":990546,"content_type":"application/pdf","creator":"system","access_level":"open_access"}],"publication_identifier":{"issn":["1868-8969"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","title":"Topological data analysis with Bregman divergences","ddc":["514","516"],"quality_controlled":"1","abstract":[{"text":"We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. ","lang":"eng"}],"status":"public","conference":{"end_date":"2017-07-07","location":"Brisbane, Australia","name":"Symposium on Computational Geometry, SoCG","start_date":"2017-07-04"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"day":"01","oa":1,"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"doi":"10.4230/LIPIcs.SoCG.2017.39","pubrep_id":"895","month":"06","volume":77,"scopus_import":"1","oa_version":"Published Version","corr_author":"1"}]