[{"intvolume":"        37","date_created":"2019-02-14T13:52:25Z","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020"}],"publication_status":"published","ec_funded":1,"month":"09","isi":1,"author":[{"last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"},{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"type":"journal_article","year":"2018","_id":"6003","publisher":"Wiley","department":[{"_id":"BeBi"}],"date_updated":"2023-09-19T14:33:40Z","abstract":[{"text":"Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research.","lang":"eng"}],"has_accepted_license":"1","quality_controlled":"1","citation":{"apa":"Bickel, B., Cignoni, P., Malomo, L., &#38; Pietroni, N. (2018). State of the art on stylized fabrication. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13327\">https://doi.org/10.1111/cgf.13327</a>","mla":"Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” <i>Computer Graphics Forum</i>, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:<a href=\"https://doi.org/10.1111/cgf.13327\">10.1111/cgf.13327</a>.","ama":"Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication. <i>Computer Graphics Forum</i>. 2018;37(6):325-342. doi:<a href=\"https://doi.org/10.1111/cgf.13327\">10.1111/cgf.13327</a>","ieee":"B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized fabrication,” <i>Computer Graphics Forum</i>, vol. 37, no. 6. Wiley, pp. 325–342, 2018.","chicago":"Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of the Art on Stylized Fabrication.” <i>Computer Graphics Forum</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/cgf.13327\">https://doi.org/10.1111/cgf.13327</a>.","short":"B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37 (2018) 325–342.","ista":"Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized fabrication. Computer Graphics Forum. 37(6), 325–342."},"volume":37,"pubrep_id":"1051","page":"325-342","status":"public","ddc":["004"],"date_published":"2018-09-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication":"Computer Graphics Forum","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"State of the art on stylized fabrication","file_date_updated":"2020-07-14T12:47:15Z","oa_version":"Submitted Version","doi":"10.1111/cgf.13327","file":[{"creator":"kschuh","date_created":"2019-02-14T14:09:28Z","file_size":6209349,"file_name":"StylizedFabricationSTAR-Personal.pdf","content_type":"application/pdf","relation":"main_file","file_id":"6004","checksum":"d2bbe5c658d8159fbe9016a4f5e82b19","access_level":"open_access","date_updated":"2020-07-14T12:47:15Z"}],"publication_identifier":{"issn":["0167-7055"]},"external_id":{"isi":["000437272800019"]},"issue":"6","scopus_import":"1","oa":1,"day":"01"},{"oa_version":"Published Version","doi":"10.4230/LIPICS.MFCS.2018.23","file":[{"creator":"dernst","file_size":542889,"date_created":"2019-02-14T14:22:04Z","file_name":"2018_LIPIcs_Avni.pdf","file_id":"6007","checksum":"41ab2ae9b63f5eb49fa995250c0ba128","access_level":"open_access","date_updated":"2020-07-14T12:47:15Z","relation":"main_file","content_type":"application/pdf"}],"publication_identifier":{"issn":["1868-8969"]},"scopus_import":"1","oa":1,"day":"01","status":"public","ddc":["000"],"date_published":"2018-08-01T00:00:00Z","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Timed network games with clocks","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:15Z","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2018-08-31","start_date":"2018-08-27","location":"Liverpool, United Kingdom"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"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"},"date_updated":"2023-02-23T14:02:58Z","abstract":[{"lang":"eng","text":"Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load.  Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks.  The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting."}],"has_accepted_license":"1","quality_controlled":"1","citation":{"chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>.","ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>.","ista":"Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23."},"volume":117,"intvolume":"       117","date_created":"2019-02-14T14:12:09Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"},{"grant_number":"M02369","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","month":"08","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"type":"conference","article_number":"23","related_material":{"record":[{"relation":"earlier_version","id":"963","status":"public"}]},"_id":"6005","year":"2018"},{"_id":"6006","year":"2018","type":"journal_article","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1003"}]},"article_number":"39","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy"},{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"publication_status":"published","project":[{"grant_number":"M02369","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"month":"09","date_created":"2019-02-14T14:17:54Z","intvolume":"         9","citation":{"ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. 2018;9(3). doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” <i>Games</i>, vol. 9, no. 3. MDPI AG, 2018.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>. MDPI AG, 2018. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>, vol. 9, no. 3, 39, MDPI AG, 2018, doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. MDPI AG. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>"},"volume":9,"has_accepted_license":"1","quality_controlled":"1","date_updated":"2023-09-22T09:48:59Z","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"},"abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. "}],"department":[{"_id":"ToHe"}],"publisher":"MDPI AG","file_date_updated":"2020-07-14T12:47:16Z","title":"An abstraction-refinement methodology for reasoning about network games","publication":"Games","language":[{"iso":"eng"}],"date_published":"2018-09-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"status":"public","oa":1,"day":"01","scopus_import":1,"issue":"3","publication_identifier":{"issn":["2073-4336"]},"file":[{"file_name":"2018_MDPI_Avni.pdf","checksum":"749d65ca4ce74256a029d9644a1b1cb0","file_id":"6008","date_updated":"2020-07-14T12:47:16Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"kschuh","file_size":505155,"date_created":"2019-02-14T14:20:31Z"}],"oa_version":"Published Version","doi":"10.3390/g9030039"},{"status":"public","date_published":"2018-08-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication":"ACM Transactions on Programming Languages and Systems","language":[{"iso":"eng"}],"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","article_processing_charge":"No","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.07565"}],"oa_version":"Preprint","doi":"10.1145/3210257","publication_identifier":{"issn":["0164-0925"]},"external_id":{"isi":["000444694800001"],"arxiv":["1510.07565"]},"scopus_import":"1","issue":"3","oa":1,"day":"01","intvolume":"        40","date_created":"2019-02-14T14:31:52Z","publication_status":"published","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"}],"isi":1,"month":"08","ec_funded":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"}],"type":"journal_article","article_number":"9","related_material":{"record":[{"id":"1437","status":"public","relation":"earlier_version"},{"relation":"earlier_version","id":"5441","status":"public"},{"relation":"earlier_version","id":"5442","status":"public"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"year":"2018","_id":"6009","publisher":"Association for Computing Machinery (ACM)","department":[{"_id":"KrCh"}],"date_updated":"2024-03-25T23:30:19Z","abstract":[{"text":"We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n","lang":"eng"}],"quality_controlled":"1","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery (ACM), 2018. <a href=\"https://doi.org/10.1145/3210257\">https://doi.org/10.1145/3210257</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. <i>ACM Transactions on Programming Languages and Systems</i>. 2018;40(3). doi:<a href=\"https://doi.org/10.1145/3210257\">10.1145/3210257</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:<a href=\"https://doi.org/10.1145/3210257\">10.1145/3210257</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &#38; Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/3210257\">https://doi.org/10.1145/3210257</a>"},"volume":40},{"oa_version":"Submitted Version","doi":"10.1073/pnas.1804517115","external_id":{"pmid":["30026198"],"isi":["000440982000020"]},"issue":"32","scopus_import":"1","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"oa":1,"day":"07","status":"public","date_published":"2018-08-07T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","title":"“Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network","publication":"Proceedings of the National Academy of Sciences","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30026198","open_access":"1"}],"publisher":"National Academy of Sciences","pmid":1,"department":[{"_id":"MaJö"}],"quality_controlled":"1","date_updated":"2023-09-19T14:35:36Z","abstract":[{"lang":"eng","text":"The optic tectum (TeO), or superior colliculus, is a multisensory midbrain center that organizes spatially orienting responses to relevant stimuli. To define the stimulus with the highest priority at each moment, a network of reciprocal connections between the TeO and the isthmi promotes competition between concurrent tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression of tectal inputs are located in separate isthmic nuclei, facilitating the analysis of the neural processes that mediate competition. A specific subset of radial neurons in the intermediate tectal layers relay retinal inputs to the isthmi, but at present it is unclear whether separate neurons innervate individual nuclei or a single neural type sends a common input to several of them. In this study, we used in vitro neural tracing and cell-filling experiments in chickens to show that single neurons innervate, via axon collaterals, the three nuclei that comprise the isthmotectal network. This demonstrates that the input signals representing the strength of the incoming stimuli are simultaneously relayed to the mechanisms promoting both enhancement and suppression of the input signals. By performing in vivo recordings in anesthetized chicks, we also show that this common input generates synchrony between both antagonistic mechanisms, demonstrating that activity enhancement and suppression are closely coordinated. From a computational point of view, these results suggest that these tectal neurons constitute integrative nodes that combine inputs from different sources to drive in parallel several concurrent neural processes, each performing complementary functions within the network through different firing patterns and connectivity."}],"page":"E7615-E7623","citation":{"ista":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, Fernandez P, López-Jury L, González-Cabrera C, Karten HJ, Luksch H, Marín GJ. 2018. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 115(32), E7615–E7623.","apa":"Garrido-Charad, F., Vega Zuniga, T. A., Gutiérrez-Ibáñez, C., Fernandez, P., López-Jury, L., González-Cabrera, C., … Marín, G. J. (2018). “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1804517115\">https://doi.org/10.1073/pnas.1804517115</a>","mla":"Garrido-Charad, Florencia, et al. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 32, National Academy of Sciences, 2018, pp. E7615–23, doi:<a href=\"https://doi.org/10.1073/pnas.1804517115\">10.1073/pnas.1804517115</a>.","ama":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, et al. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(32):E7615-E7623. doi:<a href=\"https://doi.org/10.1073/pnas.1804517115\">10.1073/pnas.1804517115</a>","ieee":"F. Garrido-Charad <i>et al.</i>, ““Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 32. National Academy of Sciences, pp. E7615–E7623, 2018.","short":"F. Garrido-Charad, T.A. Vega Zuniga, C. Gutiérrez-Ibáñez, P. Fernandez, L. López-Jury, C. González-Cabrera, H.J. Karten, H. Luksch, G.J. Marín, Proceedings of the National Academy of Sciences 115 (2018) E7615–E7623.","chicago":"Garrido-Charad, Florencia, Tomas A Vega Zuniga, Cristián Gutiérrez-Ibáñez, Pedro Fernandez, Luciana López-Jury, Cristian González-Cabrera, Harvey J. Karten, Harald Luksch, and Gonzalo J. Marín. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1804517115\">https://doi.org/10.1073/pnas.1804517115</a>."},"volume":115,"date_created":"2019-02-14T14:33:34Z","intvolume":"       115","author":[{"full_name":"Garrido-Charad, Florencia","last_name":"Garrido-Charad","first_name":"Florencia"},{"full_name":"Vega Zuniga, Tomas A","last_name":"Vega Zuniga","first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gutiérrez-Ibáñez","first_name":"Cristián","full_name":"Gutiérrez-Ibáñez, Cristián"},{"first_name":"Pedro","last_name":"Fernandez","full_name":"Fernandez, Pedro"},{"last_name":"López-Jury","first_name":"Luciana","full_name":"López-Jury, Luciana"},{"first_name":"Cristian","last_name":"González-Cabrera","full_name":"González-Cabrera, Cristian"},{"last_name":"Karten","first_name":"Harvey J.","full_name":"Karten, Harvey J."},{"full_name":"Luksch, Harald","last_name":"Luksch","first_name":"Harald"},{"first_name":"Gonzalo J.","last_name":"Marín","full_name":"Marín, Gonzalo J."}],"publication_status":"published","isi":1,"month":"08","year":"2018","_id":"6010","type":"journal_article"},{"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2018-07-15","start_date":"2018-07-10","location":"Stockholm, Sweden"},"publisher":"ML Research Press","department":[{"_id":"ChLa"}],"abstract":[{"lang":"eng","text":"We establish a data-dependent notion of algorithmic stability for Stochastic Gradient Descent (SGD), and employ it to develop novel generalization bounds. This is in contrast to previous distribution-free algorithmic stability results for SGD which depend on the worst-case constants. By virtue of the data-dependent argument, our bounds provide new insights into learning with SGD on convex and non-convex problems. In the convex case, we show that the bound on the generalization error depends on the risk at the initialization point. In the non-convex case, we prove that the expected curvature of the objective function around the initialization point has crucial influence on the generalization error. In both cases, our results suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization. As a corollary, our results allow us to show optimistic generalization bounds that exhibit fast convergence rates for SGD subject to a vanishing empirical risk and low noise of stochastic gradient. "}],"date_updated":"2023-10-17T09:51:13Z","quality_controlled":"1","page":"2815-2824","citation":{"mla":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” <i>Proceedings of the 35 Th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 2815–24.","apa":"Kuzborskij, I., &#38; Lampert, C. (2018). Data-dependent stability of stochastic gradient descent. In <i>Proceedings of the 35 th International Conference on Machine Learning</i> (Vol. 80, pp. 2815–2824). Stockholm, Sweden: ML Research Press.","ieee":"I. Kuzborskij and C. Lampert, “Data-dependent stability of stochastic gradient descent,” in <i>Proceedings of the 35 th International Conference on Machine Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 2815–2824.","ama":"Kuzborskij I, Lampert C. Data-dependent stability of stochastic gradient descent. In: <i>Proceedings of the 35 Th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:2815-2824.","chicago":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” In <i>Proceedings of the 35 Th International Conference on Machine Learning</i>, 80:2815–24. ML Research Press, 2018.","short":"I. Kuzborskij, C. Lampert, in:, Proceedings of the 35 Th International Conference on Machine Learning, ML Research Press, 2018, pp. 2815–2824.","ista":"Kuzborskij I, Lampert C. 2018. Data-dependent stability of stochastic gradient descent. Proceedings of the 35 th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 2815–2824."},"volume":80,"intvolume":"        80","date_created":"2019-02-14T14:51:57Z","month":"02","ec_funded":1,"isi":1,"publication_status":"published","project":[{"call_identifier":"FP7","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Kuzborskij, Ilja","last_name":"Kuzborskij","first_name":"Ilja"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"type":"conference","_id":"6011","year":"2018","oa_version":"Preprint","scopus_import":"1","external_id":{"isi":["000683379202095"],"arxiv":["1703.01678"]},"day":"01","oa":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-02-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 35 th International Conference on Machine Learning","arxiv":1,"title":"Data-dependent stability of stochastic gradient descent","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.01678"}]},{"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class of learnable equations for a recently proposed equation learning network to include divisions, and we improve the learning and model selection strategy to be useful for challenging real-world data. For systems governed by analytical expressions, our method can in many cases identify the true underlying equation and extrapolate to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum system, where only 2 random rollouts are required to learn the forward dynamics and successfully achieve the swing-up task."}],"date_updated":"2023-10-17T09:50:53Z","page":"4442-4450","citation":{"ista":"Sahoo S, Lampert C, Martius GS. 2018. Learning equations for extrapolation and control. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 4442–4450.","chicago":"Sahoo, Subham, Christoph Lampert, and Georg S Martius. “Learning Equations for Extrapolation and Control.” In <i>Proceedings of the 35th International Conference on Machine Learning</i>, 80:4442–50. ML Research Press, 2018.","short":"S. Sahoo, C. Lampert, G.S. Martius, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 4442–4450.","ama":"Sahoo S, Lampert C, Martius GS. Learning equations for extrapolation and control. In: <i>Proceedings of the 35th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:4442-4450.","ieee":"S. Sahoo, C. Lampert, and G. S. Martius, “Learning equations for extrapolation and control,” in <i>Proceedings of the 35th International Conference on Machine Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 4442–4450.","apa":"Sahoo, S., Lampert, C., &#38; Martius, G. S. (2018). Learning equations for extrapolation and control. In <i>Proceedings of the 35th International Conference on Machine Learning</i> (Vol. 80, pp. 4442–4450). Stockholm, Sweden: ML Research Press.","mla":"Sahoo, Subham, et al. “Learning Equations for Extrapolation and Control.” <i>Proceedings of the 35th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 4442–50."},"volume":80,"publisher":"ML Research Press","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2018-07-15","start_date":"2018-07-10","location":"Stockholm, Sweden"},"department":[{"_id":"ChLa"}],"year":"2018","_id":"6012","related_material":{"link":[{"url":"https://ist.ac.at/en/news/first-machine-learning-method-capable-of-accurate-extrapolation/","description":"News on IST Homepage","relation":"press_release"}]},"type":"conference","date_created":"2019-02-14T15:21:07Z","intvolume":"        80","author":[{"full_name":"Sahoo, Subham","last_name":"Sahoo","first_name":"Subham"},{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S","last_name":"Martius","full_name":"Martius, Georg S"}],"month":"02","isi":1,"ec_funded":1,"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"publication_status":"published","day":"01","oa":1,"oa_version":"Preprint","scopus_import":"1","external_id":{"arxiv":["1806.07259"],"isi":["000683379204058"]},"arxiv":1,"title":"Learning equations for extrapolation and control","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Proceedings of the 35th International Conference on Machine Learning","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.07259"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-02-01T00:00:00Z"},{"date_created":"2019-02-17T22:59:25Z","status":"public","author":[{"full_name":"Stojanov, Alen","last_name":"Stojanov","first_name":"Alen"},{"first_name":"Tyler Michael","last_name":"Smith","full_name":"Smith, Tyler Michael"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Markus","last_name":"Puschel","full_name":"Puschel, Markus"}],"date_published":"2018-12-31T00:00:00Z","publication_status":"published","month":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"title":"Fast quantized arithmetic on x86: Trading compute for data movement","article_processing_charge":"No","publication":"2018 IEEE International Workshop on Signal Processing Systems","language":[{"iso":"eng"}],"year":"2018","_id":"6031","type":"conference","article_number":"8598402","publisher":"IEEE","oa_version":"None","doi":"10.1109/SiPS.2018.8598402","conference":{"name":"SiPS: Workshop on Signal Processing Systems","end_date":"2018-10-24","location":"Cape Town, South Africa","start_date":"2018-10-21"},"external_id":{"isi":["000465106800060"]},"department":[{"_id":"DaAl"}],"scopus_import":"1","quality_controlled":"1","date_updated":"2023-09-19T14:41:51Z","abstract":[{"text":"We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved.","lang":"eng"}],"volume":"2018-October","citation":{"ama":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: <i>2018 IEEE International Workshop on Signal Processing Systems</i>. Vol 2018-October. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">10.1109/SiPS.2018.8598402</a>","chicago":"Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In <i>2018 IEEE International Workshop on Signal Processing Systems</i>, Vol. 2018–October. IEEE, 2018. <a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">https://doi.org/10.1109/SiPS.2018.8598402</a>.","ieee":"A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in <i>2018 IEEE International Workshop on Signal Processing Systems</i>, Cape Town, South Africa, 2018, vol. 2018–October.","short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","mla":"Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” <i>2018 IEEE International Workshop on Signal Processing Systems</i>, vol. 2018–October, 8598402, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">10.1109/SiPS.2018.8598402</a>.","apa":"Stojanov, A., Smith, T. M., Alistarh, D.-A., &#38; Puschel, M. (2018). Fast quantized arithmetic on x86: Trading compute for data movement. In <i>2018 IEEE International Workshop on Signal Processing Systems</i> (Vol. 2018–October). Cape Town, South Africa: IEEE. <a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">https://doi.org/10.1109/SiPS.2018.8598402</a>","ista":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402."},"day":"31"},{"date_updated":"2023-09-20T11:20:26Z","abstract":[{"text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids.","lang":"eng"}],"quality_controlled":"1","citation":{"ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” <i>ACM Transactions on Algorithms</i>, vol. 15, no. 2. ACM, 2018.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” <i>ACM Transactions on Algorithms</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3230649\">https://doi.org/10.1145/3230649</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. <i>ACM Transactions on Algorithms</i>. 2018;15(2). doi:<a href=\"https://doi.org/10.1145/3230649\">10.1145/3230649</a>","mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” <i>ACM Transactions on Algorithms</i>, vol. 15, no. 2, 22, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3230649\">10.1145/3230649</a>.","apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. <i>ACM Transactions on Algorithms</i>. ACM. <a href=\"https://doi.org/10.1145/3230649\">https://doi.org/10.1145/3230649</a>"},"volume":15,"publisher":"ACM","department":[{"_id":"VlKo"}],"type":"journal_article","related_material":{"record":[{"status":"public","id":"1192","relation":"earlier_version"}]},"article_number":"22","_id":"6032","year":"2018","intvolume":"        15","date_created":"2019-02-17T22:59:25Z","publication_status":"published","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160"}],"isi":1,"month":"12","ec_funded":1,"author":[{"first_name":"Alexandr","last_name":"Kazda","full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michal","last_name":"Rolinek","full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"day":"01","oa_version":"Preprint","doi":"10.1145/3230649","external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"scopus_import":"1","issue":"2","publication":"ACM Transactions on Algorithms","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Even delta-matroids and the complexity of planar boolean CSPs","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"status":"public","date_published":"2018-12-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_type":"original"},{"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-08-01T00:00:00Z","acknowledgement":"The work of the author is supported by F.R.S.-FNRS ( Fonds de la Recherche Scientifique - FNRS ) through a Research Fellowship.\r\n\r\n","arxiv":1,"article_processing_charge":"No","title":"Well-posedness for mean-field evolutions arising in superconductivity","language":[{"iso":"eng"}],"publication":"Annales de l'Institut Henri Poincare (C) Non Linear Analysis","main_file_link":[{"url":"https://arxiv.org/abs/1607.00268","open_access":"1"}],"doi":"10.1016/j.anihpc.2017.11.004","oa_version":"Submitted Version","issue":"5","scopus_import":"1","external_id":{"isi":["000437975500005"],"arxiv":["1607.00268"]},"day":"01","oa":1,"date_created":"2018-12-11T11:47:27Z","intvolume":"        35","author":[{"first_name":"Mitia","last_name":"Duerinckx","full_name":"Duerinckx, Mitia"},{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","first_name":"Julian L","last_name":"Fischer","full_name":"Fischer, Julian L"}],"month":"08","isi":1,"publication_status":"published","_id":"606","year":"2018","type":"journal_article","publisher":"Elsevier","department":[{"_id":"JuFi"}],"publist_id":"7199","quality_controlled":"1","abstract":[{"lang":"eng","text":"We establish the existence of a global solution for a new family of fluid-like equations, which are obtained in certain regimes in as the mean-field evolution of the supercurrent density in a (2D section of a) type-II superconductor with pinning and with imposed electric current. We also consider general vortex-sheet initial data, and investigate the uniqueness and regularity properties of the solution. For some choice of parameters, the equation under investigation coincides with the so-called lake equation from 2D shallow water fluid dynamics, and our analysis then leads to a new existence result for rough initial data."}],"date_updated":"2023-09-19T10:39:09Z","volume":35,"citation":{"ista":"Duerinckx M, Fischer JL. 2018. Well-posedness for mean-field evolutions arising in superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 35(5), 1267–1319.","ieee":"M. Duerinckx and J. L. Fischer, “Well-posedness for mean-field evolutions arising in superconductivity,” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>, vol. 35, no. 5. Elsevier, pp. 1267–1319, 2018.","chicago":"Duerinckx, Mitia, and Julian L Fischer. “Well-Posedness for Mean-Field Evolutions Arising in Superconductivity.” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">https://doi.org/10.1016/j.anihpc.2017.11.004</a>.","ama":"Duerinckx M, Fischer JL. Well-posedness for mean-field evolutions arising in superconductivity. <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. 2018;35(5):1267-1319. doi:<a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">10.1016/j.anihpc.2017.11.004</a>","short":"M. Duerinckx, J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non Linear Analysis 35 (2018) 1267–1319.","apa":"Duerinckx, M., &#38; Fischer, J. L. (2018). Well-posedness for mean-field evolutions arising in superconductivity. <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">https://doi.org/10.1016/j.anihpc.2017.11.004</a>","mla":"Duerinckx, Mitia, and Julian L. Fischer. “Well-Posedness for Mean-Field Evolutions Arising in Superconductivity.” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>, vol. 35, no. 5, Elsevier, 2018, pp. 1267–319, doi:<a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">10.1016/j.anihpc.2017.11.004</a>."},"page":"1267-1319"},{"external_id":{"arxiv":["1704.08757"],"isi":["000437962900012"]},"scopus_import":"1","oa_version":"Submitted Version","doi":"10.1016/j.physd.2017.10.015","oa":1,"day":"01","date_published":"2018-08-01T00:00:00Z","acknowledgement":"JH and PM are funded by KAUST baseline funds and grant no. 1000000193 .\r\nWe thank Nicholas Barton (IST Austria) for his useful comments and suggestions. \r\n\r\n","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1704.08757","open_access":"1"}],"publication":"Physica D: Nonlinear Phenomena","language":[{"iso":"eng"}],"title":"Well posedness and maximum entropy approximation for the dynamics of quantitative traits","article_processing_charge":"No","arxiv":1,"department":[{"_id":"NiBa"},{"_id":"GaTk"}],"publisher":"Elsevier","citation":{"short":"K. Bodova, J. Haskovec, P. Markowich, Physica D: Nonlinear Phenomena 376–377 (2018) 108–120.","ieee":"K. Bodova, J. Haskovec, and P. Markowich, “Well posedness and maximum entropy approximation for the dynamics of quantitative traits,” <i>Physica D: Nonlinear Phenomena</i>, vol. 376–377. Elsevier, pp. 108–120, 2018.","ama":"Bodova K, Haskovec J, Markowich P. Well posedness and maximum entropy approximation for the dynamics of quantitative traits. <i>Physica D: Nonlinear Phenomena</i>. 2018;376-377:108-120. doi:<a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">10.1016/j.physd.2017.10.015</a>","chicago":"Bodova, Katarina, Jan Haskovec, and Peter Markowich. “Well Posedness and Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” <i>Physica D: Nonlinear Phenomena</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">https://doi.org/10.1016/j.physd.2017.10.015</a>.","mla":"Bodova, Katarina, et al. “Well Posedness and Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” <i>Physica D: Nonlinear Phenomena</i>, vol. 376–377, Elsevier, 2018, pp. 108–20, doi:<a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">10.1016/j.physd.2017.10.015</a>.","apa":"Bodova, K., Haskovec, J., &#38; Markowich, P. (2018). Well posedness and maximum entropy approximation for the dynamics of quantitative traits. <i>Physica D: Nonlinear Phenomena</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">https://doi.org/10.1016/j.physd.2017.10.015</a>","ista":"Bodova K, Haskovec J, Markowich P. 2018. Well posedness and maximum entropy approximation for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena. 376–377, 108–120."},"volume":"376-377","page":"108-120","date_updated":"2023-09-19T10:38:34Z","abstract":[{"lang":"eng","text":"We study the Fokker-Planck equation derived in the large system limit of the Markovian process describing the dynamics of quantitative traits. The Fokker-Planck equation is posed on a bounded domain and its transport and diffusion coefficients vanish on the domain's boundary. We first argue that, despite this degeneracy, the standard no-flux boundary condition is valid. We derive the weak formulation of the problem and prove the existence and uniqueness of its solutions by constructing the corresponding contraction semigroup on a suitable function space. Then, we prove that for the parameter regime with high enough mutation rate the problem exhibits a positive spectral gap, which implies exponential convergence to equilibrium.Next, we provide a simple derivation of the so-called Dynamic Maximum Entropy (DynMaxEnt) method for approximation of observables (moments) of the Fokker-Planck solution, which can be interpreted as a nonlinear Galerkin approximation. The limited applicability of the DynMaxEnt method inspires us to introduce its modified version that is valid for the whole range of admissible parameters. Finally, we present several numerical experiments to demonstrate the performance of both the original and modified DynMaxEnt methods. We observe that in the parameter regimes where both methods are valid, the modified one exhibits slightly better approximation properties compared to the original one."}],"publist_id":"7198","quality_controlled":"1","publication_status":"published","isi":1,"month":"08","author":[{"full_name":"Bodova, Katarina","last_name":"Bodova","first_name":"Katarina","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7214-0171"},{"full_name":"Haskovec, Jan","first_name":"Jan","last_name":"Haskovec"},{"first_name":"Peter","last_name":"Markowich","full_name":"Markowich, Peter"}],"date_created":"2018-12-11T11:47:28Z","type":"journal_article","year":"2018","_id":"607"},{"department":[{"_id":"ToHe"}],"publisher":"Elsevier","citation":{"ista":"Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.","mla":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>, vol. 712, Elsevier, 2018, pp. 50–72, doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>.","apa":"Avni, G., &#38; Kupferman, O. (2018). Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>","ama":"Avni G, Kupferman O. Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. 2018;712:50-72. doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>","chicago":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>.","ieee":"G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” <i>Theoretical Computer Science</i>, vol. 712. Elsevier, pp. 50–72, 2018.","short":"G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72."},"volume":712,"page":"50 - 72","abstract":[{"text":"Synthesis is the automated construction of a system from its specification. In real life, hardware and software systems are rarely constructed from scratch. Rather, a system is typically constructed from a library of components. Lustig and Vardi formalized this intuition and studied LTL synthesis from component libraries. In real life, designers seek optimal systems. In this paper we add optimality considerations to the setting. We distinguish between quality considerations (for example, size - the smaller a system is, the better it is), and pricing (for example, the payment to the company who manufactured the component). We study the problem of designing systems with minimal quality-cost and price. A key point is that while the quality cost is individual - the choices of a designer are independent of choices made by other designers that use the same library, pricing gives rise to a resource-allocation game - designers that use the same component share its price, with the share being proportional to the number of uses (a component can be used several times in a design). We study both closed and open settings, and in both we solve the problem of finding an optimal design. In a setting with multiple designers, we also study the game-theoretic problems of the induced resource-allocation game.","lang":"eng"}],"date_updated":"2023-09-19T10:00:21Z","quality_controlled":"1","publist_id":"7197","isi":1,"month":"02","ec_funded":1,"project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"publication_status":"published","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"intvolume":"       712","date_created":"2018-12-11T11:47:28Z","type":"journal_article","year":"2018","_id":"608","scopus_import":"1","external_id":{"isi":["000424959200003"]},"doi":"10.1016/j.tcs.2017.11.001","oa_version":"Published Version","day":"15","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-02-15T00:00:00Z","article_type":"original","status":"public","main_file_link":[{"open_access":"1","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529"}],"language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","title":"Synthesis from component libraries with costs","article_processing_charge":"No"},{"doi":"10.1007/978-3-319-72456-0_7","publisher":"Springer","extern":"1","oa_version":"Preprint","department":[{"_id":"TaHa"}],"external_id":{"arxiv":["1509.06286"]},"publist_id":"7993","quality_controlled":"1","abstract":[{"lang":"eng","text":"We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. "}],"date_updated":"2021-01-12T08:06:06Z","day":"23","citation":{"ista":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.","ieee":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in <i>Contemporary Computational Mathematics</i>, Springer, 2018, pp. 131–134.","short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","chicago":"Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In <i>Contemporary Computational Mathematics</i>, 131–34. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">https://doi.org/10.1007/978-3-319-72456-0_7</a>.","ama":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: <i>Contemporary Computational Mathematics</i>. Springer; 2018:131-134. doi:<a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">10.1007/978-3-319-72456-0_7</a>","apa":"Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., &#38; Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In <i>Contemporary Computational Mathematics</i> (pp. 131–134). Springer. <a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">https://doi.org/10.1007/978-3-319-72456-0_7</a>","mla":"Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” <i>Contemporary Computational Mathematics</i>, Springer, 2018, pp. 131–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">10.1007/978-3-319-72456-0_7</a>."},"page":"131 - 134","oa":1,"date_created":"2018-12-11T11:44:25Z","status":"public","author":[{"first_name":"Andriy","last_name":"Bondarenko","full_name":"Bondarenko, Andriy"},{"id":"388D3134-F248-11E8-B48F-1D18A9856A87","last_name":"Mellit","first_name":"Anton","full_name":"Mellit, Anton"},{"full_name":"Prymak, Andriy","first_name":"Andriy","last_name":"Prymak"},{"full_name":"Radchenko, Danylo","first_name":"Danylo","last_name":"Radchenko"},{"last_name":"Viazovska","first_name":"Maryna","full_name":"Viazovska, Maryna"}],"month":"05","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2018-05-23T00:00:00Z","arxiv":1,"title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Contemporary Computational Mathematics","_id":"61","year":"2018","main_file_link":[{"url":"https://arxiv.org/abs/1509.06286","open_access":"1"}],"type":"book_chapter"},{"title":"Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron","publication":"Proceedings of the National Academy of Sciences","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:19Z","ddc":["570"],"status":"public","date_published":"2018-07-17T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"17","extern":"1","oa_version":"Published Version","doi":"10.1073/pnas.1714610115","external_id":{"pmid":["29959203"]},"issue":"29","publication_identifier":{"issn":["0027-8424","1091-6490"]},"file":[{"creator":"kschuh","date_created":"2019-03-19T13:01:58Z","file_size":1567765,"file_name":"2018_PNAS_Laurent.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:19Z","checksum":"5e81665377441cdd8d99ab952c534319","file_id":"6110"}],"_id":"6109","year":"2018","type":"journal_article","date_created":"2019-03-19T12:41:33Z","intvolume":"       115","author":[{"full_name":"Laurent, Patrick","first_name":"Patrick","last_name":"Laurent"},{"full_name":"Ch’ng, QueeLim","last_name":"Ch’ng","first_name":"QueeLim"},{"full_name":"Jospin, Maëlle","first_name":"Maëlle","last_name":"Jospin"},{"full_name":"Chen, Changchun","last_name":"Chen","first_name":"Changchun"},{"full_name":"Lorenzo, Ramiro","first_name":"Ramiro","last_name":"Lorenzo"},{"last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443"}],"publication_status":"published","month":"07","has_accepted_license":"1","quality_controlled":"1","date_updated":"2021-01-12T08:06:09Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"abstract":[{"text":"Neuropeptides are ubiquitous modulators of behavior and physiology. They are packaged in specialized secretory organelles called dense core vesicles (DCVs) that are released upon neural stimulation. Unlike synaptic vesicles, which can be recycled and refilled close to release sites, DCVs must be replenished by de novo synthesis in the cell body. Here, we dissect DCV cell biology in vivo in a Caenorhabditis elegans sensory neuron whose tonic activity we can control using a natural stimulus. We express fluorescently tagged neuropeptides in the neuron and define parameters that describe their subcellular distribution. We measure these parameters at high and low neural activity in 187 mutants defective in proteins implicated in membrane traffic, neuroendocrine secretion, and neuronal or synaptic activity. Using unsupervised hierarchical clustering methods, we analyze these data and identify 62 groups of genes with similar mutant phenotypes. We explore the function of a subset of these groups. We recapitulate many previous findings, validating our paradigm. We uncover a large battery of proteins involved in recycling DCV membrane proteins, something hitherto poorly explored. We show that the unfolded protein response promotes DCV production, which may contribute to intertissue communication of stress. We also find evidence that different mechanisms of priming and exocytosis may operate at high and low neural activity. Our work provides a defined framework to study DCV biology at different neural activity levels.","lang":"eng"}],"volume":115,"page":"E6890-E6899","citation":{"chicago":"Laurent, Patrick, QueeLim Ch’ng, Maëlle Jospin, Changchun Chen, Ramiro Lorenzo, and Mario de Bono. “Genetic Dissection of Neuropeptide Cell Biology at High and Low Activity in a Defined Sensory Neuron.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1714610115\">https://doi.org/10.1073/pnas.1714610115</a>.","ama":"Laurent P, Ch’ng Q, Jospin M, Chen C, Lorenzo R, de Bono M. Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(29):E6890-E6899. doi:<a href=\"https://doi.org/10.1073/pnas.1714610115\">10.1073/pnas.1714610115</a>","ieee":"P. Laurent, Q. Ch’ng, M. Jospin, C. Chen, R. Lorenzo, and M. de Bono, “Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 29. National Academy of Sciences, pp. E6890–E6899, 2018.","short":"P. Laurent, Q. Ch’ng, M. Jospin, C. Chen, R. Lorenzo, M. de Bono, Proceedings of the National Academy of Sciences 115 (2018) E6890–E6899.","apa":"Laurent, P., Ch’ng, Q., Jospin, M., Chen, C., Lorenzo, R., &#38; de Bono, M. (2018). Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1714610115\">https://doi.org/10.1073/pnas.1714610115</a>","mla":"Laurent, Patrick, et al. “Genetic Dissection of Neuropeptide Cell Biology at High and Low Activity in a Defined Sensory Neuron.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 29, National Academy of Sciences, 2018, pp. E6890–99, doi:<a href=\"https://doi.org/10.1073/pnas.1714610115\">10.1073/pnas.1714610115</a>.","ista":"Laurent P, Ch’ng Q, Jospin M, Chen C, Lorenzo R, de Bono M. 2018. Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. Proceedings of the National Academy of Sciences. 115(29), E6890–E6899."},"publisher":"National Academy of Sciences","pmid":1},{"publisher":"Public Library of Science","pmid":1,"quality_controlled":"1","has_accepted_license":"1","abstract":[{"text":"Neurons develop elaborate morphologies that provide a model for understanding cellular architecture. By studying C. elegans sensory dendrites, we previously identified genes that act to promote the extension of ciliated sensory dendrites during embryogenesis. Interestingly, the nonciliated dendrite of the oxygen-sensing neuron URX is not affected by these genes, suggesting it develops through a distinct mechanism. Here, we use a visual forward genetic screen to identify mutants that affect URX dendrite morphogenesis. We find that disruption of the MAP kinase MAPK-15 or the βH-spectrin SMA-1 causes a phenotype opposite to what we had seen before: dendrites extend normally during embryogenesis but begin to overgrow as the animals reach adulthood, ultimately extending up to 150% of their normal length. SMA-1 is broadly expressed and acts non-cell-autonomously, while MAPK-15 is expressed in many sensory neurons including URX and acts cell-autonomously. MAPK-15 acts at the time of overgrowth, localizes at the dendrite ending, and requires its kinase activity, suggesting it acts locally in time and space to constrain dendrite growth. Finally, we find that the oxygen-sensing guanylate cyclase GCY-35, which normally localizes at the dendrite ending, is localized throughout the overgrown region, and that overgrowth can be suppressed by overexpressing GCY-35 or by genetically mimicking elevated cGMP signaling. These results suggest that overgrowth may correspond to expansion of a sensory compartment at the dendrite ending, reminiscent of the remodeling of sensory cilia or dendritic spines. Thus, in contrast to established pathways that promote dendrite growth during early development, our results reveal a distinct mechanism that constrains dendrite growth throughout the life of the animal, possibly by controlling the size of a sensory compartment at the dendrite ending.","lang":"eng"}],"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"},"date_updated":"2021-01-12T08:06:11Z","volume":14,"citation":{"mla":"McLachlan, Ian G., et al. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” <i>PLOS Genetics</i>, vol. 14, no. 6, e1007435, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007435\">10.1371/journal.pgen.1007435</a>.","apa":"McLachlan, I. G., Beets, I., de Bono, M., &#38; Heiman, M. G. (2018). A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. <i>PLOS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007435\">https://doi.org/10.1371/journal.pgen.1007435</a>","short":"I.G. McLachlan, I. Beets, M. de Bono, M.G. Heiman, PLOS Genetics 14 (2018).","ama":"McLachlan IG, Beets I, de Bono M, Heiman MG. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. <i>PLOS Genetics</i>. 2018;14(6). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007435\">10.1371/journal.pgen.1007435</a>","chicago":"McLachlan, Ian G., Isabel Beets, Mario de Bono, and Maxwell G. Heiman. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” <i>PLOS Genetics</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pgen.1007435\">https://doi.org/10.1371/journal.pgen.1007435</a>.","ieee":"I. G. McLachlan, I. Beets, M. de Bono, and M. G. Heiman, “A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism,” <i>PLOS Genetics</i>, vol. 14, no. 6. Public Library of Science, 2018.","ista":"McLachlan IG, Beets I, de Bono M, Heiman MG. 2018. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. 14(6), e1007435."},"date_created":"2019-03-19T13:09:28Z","intvolume":"        14","author":[{"full_name":"McLachlan, Ian G.","first_name":"Ian G.","last_name":"McLachlan"},{"first_name":"Isabel","last_name":"Beets","full_name":"Beets, Isabel"},{"full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443"},{"first_name":"Maxwell G.","last_name":"Heiman","full_name":"Heiman, Maxwell G."}],"month":"06","publication_status":"published","year":"2018","_id":"6111","article_number":"e1007435","type":"journal_article","doi":"10.1371/journal.pgen.1007435","oa_version":"Published Version","extern":"1","issue":"6","external_id":{"pmid":["29879119"]},"file":[{"file_name":"2018_PLOS_McLachlan.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:19Z","file_id":"6112","checksum":"622036b945365dbc575bea2768aa9bc8","relation":"main_file","content_type":"application/pdf","creator":"kschuh","file_size":13011506,"date_created":"2019-03-19T13:18:01Z"}],"publication_identifier":{"issn":["1553-7404"]},"day":"07","oa":1,"ddc":["570"],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2018-06-07T00:00:00Z","title":"A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism","language":[{"iso":"eng"}],"publication":"PLOS Genetics","file_date_updated":"2020-07-14T12:47:19Z"},{"publisher":"Springer","department":[{"_id":"RySh"}],"abstract":[{"text":"Metabotropic GABAB receptors mediate slow inhibitory effects presynaptically and postsynaptically through the modulation of different effector signalling pathways. Here, we analysed the distribution of GABAB receptors using highly sensitive SDS-digested freeze-fracture replica labelling in mouse cerebellar Purkinje cells. Immunoreactivity for GABAB1 was observed on presynaptic and, more abundantly, on postsynaptic compartments, showing both scattered and clustered distribution patterns. Quantitative analysis of immunoparticles revealed a somato-dendritic gradient, with the density of immunoparticles increasing 26-fold from somata to dendritic spines. To understand the spatial relationship of GABAB receptors with two key effector ion channels, the G protein-gated inwardly rectifying K+ (GIRK/Kir3) channel and the voltage-dependent Ca2+ channel, biochemical and immunohistochemical approaches were performed. Co-immunoprecipitation analysis demonstrated that GABAB receptors co-assembled with GIRK and CaV2.1 channels in the cerebellum. Using double-labelling immunoelectron microscopic techniques, co-clustering between GABAB1 and GIRK2 was detected in dendritic spines, whereas they were mainly segregated in the dendritic shafts. In contrast, co-clustering of GABAB1 and CaV2.1 was detected in dendritic shafts but not spines. Presynaptically, although no significant co-clustering of GABAB1 and GIRK2 or CaV2.1 channels was detected, inter-cluster distance for GABAB1 and GIRK2 was significantly smaller in the active zone than in the dendritic shafts, and that for GABAB1 and CaV2.1 was significantly smaller in the active zone than in the dendritic shafts and spines. Thus, GABAB receptors are associated with GIRK and CaV2.1 channels in different subcellular compartments. These data provide a better framework for understanding the different roles played by GABAB receptors and their effector ion channels in the cerebellar network.","lang":"eng"}],"date_updated":"2024-03-25T23:30:16Z","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","publist_id":"7192","volume":223,"pubrep_id":"1013","citation":{"ista":"Luján R, Aguado C, Ciruela F, Cózar J, Kleindienst D, De La Ossa L, Bettler B, Wickman K, Watanabe M, Shigemoto R, Fukazawa Y. 2018. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. 223(3), 1565–1587.","chicago":"Luján, Rafael, Carolina Aguado, Francisco Ciruela, Javier Cózar, David Kleindienst, Luis De La Ossa, Bernhard Bettler, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” <i>Brain Structure and Function</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00429-017-1568-y\">https://doi.org/10.1007/s00429-017-1568-y</a>.","ama":"Luján R, Aguado C, Ciruela F, et al. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. <i>Brain Structure and Function</i>. 2018;223(3):1565-1587. doi:<a href=\"https://doi.org/10.1007/s00429-017-1568-y\">10.1007/s00429-017-1568-y</a>","short":"R. Luján, C. Aguado, F. Ciruela, J. Cózar, D. Kleindienst, L. De La Ossa, B. Bettler, K. Wickman, M. Watanabe, R. Shigemoto, Y. Fukazawa, Brain Structure and Function 223 (2018) 1565–1587.","ieee":"R. Luján <i>et al.</i>, “Differential association of GABAB receptors with their effector ion channels in Purkinje cells,” <i>Brain Structure and Function</i>, vol. 223, no. 3. Springer, pp. 1565–1587, 2018.","mla":"Luján, Rafael, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” <i>Brain Structure and Function</i>, vol. 223, no. 3, Springer, 2018, pp. 1565–87, doi:<a href=\"https://doi.org/10.1007/s00429-017-1568-y\">10.1007/s00429-017-1568-y</a>.","apa":"Luján, R., Aguado, C., Ciruela, F., Cózar, J., Kleindienst, D., De La Ossa, L., … Fukazawa, Y. (2018). Differential association of GABAB receptors with their effector ion channels in Purkinje cells. <i>Brain Structure and Function</i>. Springer. <a href=\"https://doi.org/10.1007/s00429-017-1568-y\">https://doi.org/10.1007/s00429-017-1568-y</a>"},"page":"1565 - 1587","intvolume":"       223","date_created":"2018-12-11T11:47:29Z","ec_funded":1,"isi":1,"month":"04","project":[{"call_identifier":"H2020","grant_number":"720270","_id":"25CBA828-B435-11E9-9278-68D0E5697425","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","author":[{"first_name":"Rafael","last_name":"Luján","full_name":"Luján, Rafael"},{"full_name":"Aguado, Carolina","last_name":"Aguado","first_name":"Carolina"},{"full_name":"Ciruela, Francisco","first_name":"Francisco","last_name":"Ciruela"},{"last_name":"Cózar","first_name":"Javier","full_name":"Cózar, Javier"},{"id":"42E121A4-F248-11E8-B48F-1D18A9856A87","full_name":"Kleindienst, David","last_name":"Kleindienst","first_name":"David"},{"full_name":"De La Ossa, Luis","first_name":"Luis","last_name":"De La Ossa"},{"last_name":"Bettler","first_name":"Bernhard","full_name":"Bettler, Bernhard"},{"full_name":"Wickman, Kevin","last_name":"Wickman","first_name":"Kevin"},{"full_name":"Watanabe, Masahiko","last_name":"Watanabe","first_name":"Masahiko"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Fukazawa, Yugo","last_name":"Fukazawa","first_name":"Yugo"}],"related_material":{"record":[{"status":"public","id":"9562","relation":"dissertation_contains"}]},"type":"journal_article","year":"2018","_id":"612","doi":"10.1007/s00429-017-1568-y","oa_version":"Published Version","file":[{"file_name":"IST-2018-1013-v1+1_2018_Kleindienst_Differential.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:47:20Z","access_level":"open_access","checksum":"a55b3103476ecb5f4f983d8801807e8b","file_id":"5157","creator":"system","date_created":"2018-12-12T10:15:36Z","file_size":5542926}],"scopus_import":"1","issue":"3","external_id":{"isi":["000428419500030"]},"day":"01","oa":1,"status":"public","ddc":["571"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-04-01T00:00:00Z","article_type":"original","language":[{"iso":"eng"}],"publication":"Brain Structure and Function","title":"Differential association of GABAB receptors with their effector ion channels in Purkinje cells","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:20Z"},{"oa":1,"day":"09","file":[{"file_size":1435585,"date_created":"2018-12-12T10:10:43Z","creator":"system","file_id":"4832","checksum":"540f941e8d3530a9441e4affd94f07d7","access_level":"open_access","date_updated":"2020-07-14T12:47:20Z","content_type":"application/pdf","relation":"main_file","file_name":"IST-2018-978-v1+1_elife-32073-v1.pdf"}],"external_id":{"isi":["000419601300001"]},"scopus_import":"1","oa_version":"Published Version","doi":"10.7554/eLife.32073","file_date_updated":"2020-07-14T12:47:20Z","publication":"eLife","language":[{"iso":"eng"}],"article_processing_charge":"Yes","title":"Destructive disinfection of infected brood prevents systemic disease spread in ant colonies","date_published":"2018-01-09T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["570","590"],"volume":7,"citation":{"ama":"Pull C, Ugelvig LV, Wiesenhofer F, et al. Destructive disinfection of infected brood prevents systemic disease spread in ant colonies. <i>eLife</i>. 2018;7. doi:<a href=\"https://doi.org/10.7554/eLife.32073\">10.7554/eLife.32073</a>","ieee":"C. Pull <i>et al.</i>, “Destructive disinfection of infected brood prevents systemic disease spread in ant colonies,” <i>eLife</i>, vol. 7. eLife Sciences Publications, 2018.","chicago":"Pull, Christopher, Line V Ugelvig, Florian Wiesenhofer, Anna V Grasse, Simon Tragust, Thomas Schmitt, Mark Brown, and Sylvia Cremer. “Destructive Disinfection of Infected Brood Prevents Systemic Disease Spread in Ant Colonies.” <i>ELife</i>. eLife Sciences Publications, 2018. <a href=\"https://doi.org/10.7554/eLife.32073\">https://doi.org/10.7554/eLife.32073</a>.","short":"C. Pull, L.V. Ugelvig, F. Wiesenhofer, A.V. Grasse, S. Tragust, T. Schmitt, M. Brown, S. Cremer, ELife 7 (2018).","mla":"Pull, Christopher, et al. “Destructive Disinfection of Infected Brood Prevents Systemic Disease Spread in Ant Colonies.” <i>ELife</i>, vol. 7, e32073, eLife Sciences Publications, 2018, doi:<a href=\"https://doi.org/10.7554/eLife.32073\">10.7554/eLife.32073</a>.","apa":"Pull, C., Ugelvig, L. V., Wiesenhofer, F., Grasse, A. V., Tragust, S., Schmitt, T., … Cremer, S. (2018). Destructive disinfection of infected brood prevents systemic disease spread in ant colonies. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.32073\">https://doi.org/10.7554/eLife.32073</a>","ista":"Pull C, Ugelvig LV, Wiesenhofer F, Grasse AV, Tragust S, Schmitt T, Brown M, Cremer S. 2018. Destructive disinfection of infected brood prevents systemic disease spread in ant colonies. eLife. 7, e32073."},"pubrep_id":"978","date_updated":"2023-09-11T12:54:26Z","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"},"abstract":[{"text":"Social insects protect their colonies from infectious disease through collective defences that result in social immunity. In ants, workers first try to prevent infection of colony members. Here, we show that if this fails and a pathogen establishes an infection, ants employ an efficient multicomponent behaviour − &quot;destructive disinfection&quot; − to prevent further spread of disease through the colony. Ants specifically target infected pupae during the pathogen's non-contagious incubation period, relying on chemical 'sickness cues' emitted by pupae. They then remove the pupal cocoon, perforate its cuticle and administer antimicrobial poison, which enters the body and prevents pathogen replication from the inside out. Like the immune system of a body that specifically targets and eliminates infected cells, this social immunity measure sacrifices infected brood to stop the pathogen completing its lifecycle, thus protecting the rest of the colony. Hence, the same principles of disease defence apply at different levels of biological organisation.","lang":"eng"}],"publist_id":"7188","has_accepted_license":"1","quality_controlled":"1","department":[{"_id":"SyCr"}],"publisher":"eLife Sciences Publications","type":"journal_article","related_material":{"record":[{"id":"819","status":"public","relation":"dissertation_contains"}]},"article_number":"e32073","year":"2018","_id":"616","publication_status":"published","project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071","call_identifier":"FP7"},{"name":"Pathogen Detectors Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach","_id":"25DDF0F0-B435-11E9-9278-68D0E5697425","grant_number":"302004","call_identifier":"FP7"}],"month":"01","isi":1,"ec_funded":1,"author":[{"full_name":"Pull, Christopher","first_name":"Christopher","last_name":"Pull","orcid":"0000-0003-1122-3982","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V"},{"id":"39523C54-F248-11E8-B48F-1D18A9856A87","full_name":"Wiesenhofer, Florian","first_name":"Florian","last_name":"Wiesenhofer"},{"last_name":"Grasse","first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","first_name":"Simon","full_name":"Tragust, Simon"},{"full_name":"Schmitt, Thomas","last_name":"Schmitt","first_name":"Thomas"},{"last_name":"Brown","first_name":"Mark","full_name":"Brown, Mark"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia"}],"intvolume":"         7","date_created":"2018-12-11T11:47:31Z"},{"date_created":"2019-03-21T12:16:58Z","intvolume":"     11255","status":"public","author":[{"full_name":"Koshti, Girish","first_name":"Girish","last_name":"Koshti"},{"first_name":"Ranita","last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"last_name":"Zrour","first_name":"Rita","full_name":"Zrour, Rita"},{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"alternative_title":["LNCS"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"11","publication_status":"published","date_published":"2018-11-22T00:00:00Z","article_processing_charge":"No","title":"Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D","language":[{"iso":"eng"}],"publication":"19th International Workshop","_id":"6164","year":"2018","type":"conference","doi":"10.1007/978-3-030-05288-1_7","publisher":"Springer","extern":"1","oa_version":"None","conference":{"name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2018-11-24","location":"Porto, Portugal","start_date":"2018-11-22"},"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-05288-1"],"isbn":["978-3-030-05287-4"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"In this paper, we propose an algorithm to build discrete spherical shell having integer center and real-valued inner and outer radii on the face-centered cubic (FCC) grid. We address the problem by mapping it to a 2D scenario and building the shell layer by layer on hexagonal grids with additive manufacturing in mind. The layered hexagonal grids get shifted according to need as we move from one layer to another and forms the FCC grid in 3D. However, we restrict our computation strictly to 2D in order to utilize symmetry and simplicity."}],"date_updated":"2022-01-27T15:26:39Z","day":"22","place":"Cham","volume":11255,"citation":{"ama":"Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In: <i>19th International Workshop</i>. Vol 11255. Cham: Springer; 2018:82-96. doi:<a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">10.1007/978-3-030-05288-1_7</a>","chicago":"Koshti, Girish, Ranita Biswas, Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres, and Partha Bhowmick. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.” In <i>19th International Workshop</i>, 11255:82–96. Cham: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">https://doi.org/10.1007/978-3-030-05288-1_7</a>.","short":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, P. Bhowmick, in:, 19th International Workshop, Springer, Cham, 2018, pp. 82–96.","ieee":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, and P. Bhowmick, “Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D,” in <i>19th International Workshop</i>, Porto, Portugal, 2018, vol. 11255, pp. 82–96.","apa":"Koshti, G., Biswas, R., Largeteau-Skapin, G., Zrour, R., Andres, E., &#38; Bhowmick, P. (2018). Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In <i>19th International Workshop</i> (Vol. 11255, pp. 82–96). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">https://doi.org/10.1007/978-3-030-05288-1_7</a>","mla":"Koshti, Girish, et al. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.” <i>19th International Workshop</i>, vol. 11255, Springer, 2018, pp. 82–96, doi:<a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">10.1007/978-3-030-05288-1_7</a>.","ista":"Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. 2018. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. 19th International Workshop. IWCIA: International Workshop on Combinatorial Image Analysis, LNCS, vol. 11255, 82–96."},"page":"82-96"},{"abstract":[{"lang":"eng","text":"Insects are exposed to a variety of potential pathogens in their environment, many of which can severely impact fitness and health. Consequently, hosts have evolved resistance and tolerance strategies to suppress or cope with infections. Hosts utilizing resistance improve fitness by clearing or reducing pathogen loads, and hosts utilizing tolerance reduce harmful fitness effects per pathogen load. To understand variation in, and selective pressures on, resistance and tolerance, we asked to what degree they are shaped by host genetic background, whether plasticity in these responses depends upon dietary environment, and whether there are interactions between these two factors. Females from ten wild-type Drosophila melanogaster genotypes were kept on high- or low-protein (yeast) diets and infected with one of two opportunistic bacterial pathogens, Lactococcus lactis or Pseudomonas entomophila. We measured host resistance as the inverse of bacterial load in the early infection phase. The relationship (slope) between fly fecundity and individual-level bacteria load provided our fecundity tolerance measure. Genotype and dietary yeast determined host fecundity and strongly affected survival after infection with pathogenic P. entomophila. There was considerable genetic variation in host resistance, a commonly found phenomenon resulting from for example varying resistance costs or frequency-dependent selection. Despite this variation and the reproductive cost of higher P. entomophila loads, fecundity tolerance did not vary across genotypes. The absence of genetic variation in tolerance may suggest that at this early infection stage, fecundity tolerance is fixed or that any evolved tolerance mechanisms are not expressed under these infection conditions."}],"date_updated":"2023-09-11T14:06:04Z","quality_controlled":"1","publist_id":"7187","citation":{"ista":"Kutzer M, Kurtz J, Armitage S. 2018. Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance. Journal of Evolutionary Biology. 31(1), 159–171.","ieee":"M. Kutzer, J. Kurtz, and S. Armitage, “Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance,” <i>Journal of Evolutionary Biology</i>, vol. 31, no. 1. Wiley, pp. 159–171, 2018.","short":"M. Kutzer, J. Kurtz, S. Armitage, Journal of Evolutionary Biology 31 (2018) 159–171.","chicago":"Kutzer, Megan, Joachim Kurtz, and Sophie Armitage. “Genotype and Diet Affect Resistance, Survival, and Fecundity but Not Fecundity Tolerance.” <i>Journal of Evolutionary Biology</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/jeb.13211\">https://doi.org/10.1111/jeb.13211</a>.","ama":"Kutzer M, Kurtz J, Armitage S. Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance. <i>Journal of Evolutionary Biology</i>. 2018;31(1):159-171. doi:<a href=\"https://doi.org/10.1111/jeb.13211\">10.1111/jeb.13211</a>","apa":"Kutzer, M., Kurtz, J., &#38; Armitage, S. (2018). Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance. <i>Journal of Evolutionary Biology</i>. Wiley. <a href=\"https://doi.org/10.1111/jeb.13211\">https://doi.org/10.1111/jeb.13211</a>","mla":"Kutzer, Megan, et al. “Genotype and Diet Affect Resistance, Survival, and Fecundity but Not Fecundity Tolerance.” <i>Journal of Evolutionary Biology</i>, vol. 31, no. 1, Wiley, 2018, pp. 159–71, doi:<a href=\"https://doi.org/10.1111/jeb.13211\">10.1111/jeb.13211</a>."},"page":"159  - 171","volume":31,"pmid":1,"publisher":"Wiley","department":[{"_id":"SyCr"}],"type":"journal_article","year":"2018","_id":"617","intvolume":"        31","date_created":"2018-12-11T11:47:31Z","isi":1,"month":"01","publication_status":"published","author":[{"id":"29D0B332-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8696-6978","last_name":"Kutzer","first_name":"Megan","full_name":"Kutzer, Megan"},{"first_name":"Joachim","last_name":"Kurtz","full_name":"Kurtz, Joachim"},{"first_name":"Sophie","last_name":"Armitage","full_name":"Armitage, Sophie"}],"day":"01","oa":1,"doi":"10.1111/jeb.13211","oa_version":"Published Version","publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]},"scopus_import":"1","issue":"1","external_id":{"isi":["000419307000014"],"pmid":["29150962"]},"language":[{"iso":"eng"}],"publication":"Journal of Evolutionary Biology","title":"Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/jeb.13211"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"We would like to thank Susann Wicke for performing the genome-wide SNP/indel analyses, as well as Veronica Alves, Kevin Ferro, Momir Futo, Barbara Hasert, Dafne Maximo, Nora Schulz, Marlene Sroka, and Barth Wieczorek for technical help. We thank Brian Lazzaro for the L. lactis strain and Bruno Lemaitre for the Pseudomonas entomophila strain. We would like to thank two anonymous reviewers for their helpful comments. We are grateful to the Deutsche Forschungsgemeinschaft (DFG) priority programme 1399 ‘Host parasite coevolution’ for funding this project (AR 872/1-1). ","date_published":"2018-01-01T00:00:00Z","article_type":"original"},{"abstract":[{"text":"We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z - a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq 0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$. We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect to the Lebesgue measure, which\r\nis supported on finitely many intervals, called bands. In fact, the density is\r\nanalytic inside the bands with a square-root growth at the edges and internal\r\ncubic root cusps whenever the gap between two bands vanishes. The shape of\r\nthese singularities is universal and no other singularity may occur. We give a\r\nprecise asymptotic description of $m$ near the singular points. These\r\nasymptotics generalize the analysis at the regular edges given in the companion\r\npaper on the Tracy-Widom universality for the edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744] and they play a key role in the\r\nproof of the Pearcey universality at the cusp for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically rigid under\r\ndeformations and we conclude that these masses are quantized in some important\r\ncases.","lang":"eng"}],"date_updated":"2023-12-18T10:46:08Z","day":"20","oa":1,"citation":{"short":"J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and  Cusps.” <i>ArXiv</i>, n.d.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and  cusps,” <i>arXiv</i>. .","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. <i>arXiv</i>.","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and  Cusps.” <i>ArXiv</i>, 1804.07752.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. <i>arXiv</i>.","ista":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. arXiv, 1804.07752."},"oa_version":"Preprint","department":[{"_id":"LaEr"}],"external_id":{"arxiv":["1804.07752"]},"arxiv":1,"article_processing_charge":"No","title":"The Dyson equation with linear self-energy: Spectral bands, edges and  cusps","language":[{"iso":"eng"}],"publication":"arXiv","year":"2018","_id":"6183","article_number":"1804.07752","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07752"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"149","status":"public"},{"id":"14694","status":"public","relation":"later_version"}]},"type":"preprint","date_created":"2019-03-28T09:20:06Z","status":"public","author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","first_name":"László"},{"full_name":"Krüger, Torben H","last_name":"Krüger","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","publication_status":"submitted","date_published":"2018-04-20T00:00:00Z"}]