[{"page":"733 - 747","external_id":{"arxiv":["1510.07565"]},"date_created":"2018-12-11T11:52:01Z","doi":"10.1145/2837614.2837624","ec_funded":1,"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"status":"public","quality_controlled":"1","_id":"1437","date_updated":"2024-03-25T23:30:18Z","type":"conference","volume":"20-22","conference":{"start_date":"2016-01-20","location":"St. Petersburg, FL, USA","end_date":"2016-01-22","name":"POPL: Principles of Programming Languages"},"language":[{"iso":"eng"}],"date_published":"2016-01-11T00:00:00Z","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"}],"scopus_import":1,"citation":{"ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: Vol 20-22. ACM; 2016:733-747. doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. Vol. 20–22, ACM, 2016, pp. 733–47, doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>"},"publisher":"ACM","publist_id":"5761","year":"2016","oa":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.07565"}],"alternative_title":["POPL"],"day":"11","oa_version":"Preprint","abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. 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. Our 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.","lang":"eng"}],"related_material":{"record":[{"id":"5441","status":"public","relation":"earlier_version"},{"id":"5442","status":"public","relation":"earlier_version"},{"id":"821","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"later_version","id":"6009"},{"id":"8934","relation":"dissertation_contains","status":"public"}]},"department":[{"_id":"KrCh"}],"month":"01","arxiv":1},{"publist_id":"5760","publisher":"ACM","citation":{"short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs</i>. Vol. 20–22, ACM, 2016, pp. 327–42, doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>"},"alternative_title":["POPL"],"main_file_link":[{"url":"http://arxiv.org/abs/1510.08517","open_access":"1"}],"oa":1,"publication_status":"published","year":"2016","arxiv":1,"month":"01","department":[{"_id":"KrCh"}],"abstract":[{"text":"In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism.","lang":"eng"}],"related_material":{"record":[{"id":"5993","status":"public","relation":"later_version"}]},"day":"11","oa_version":"Preprint","ec_funded":1,"title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","doi":"10.1145/2837614.2837639","date_created":"2018-12-11T11:52:01Z","page":"327 - 342","external_id":{"arxiv":["1510.08517"]},"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Supported by the Natural Science Foundation of China (NSFC) under Grant No. 61532019 ","volume":"20-22","type":"conference","_id":"1438","date_updated":"2023-09-19T14:38:41Z","quality_controlled":"1","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"first_name":"Petr","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"full_name":"Hasheminezhad, Rouzbeh","first_name":"Rouzbeh","last_name":"Hasheminezhad"}],"scopus_import":1,"date_published":"2016-01-11T00:00:00Z","language":[{"iso":"eng"}],"conference":{"name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA","start_date":"2016-01-20"}},{"main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/hal-01251199/"}],"alternative_title":["ACM SIGPLAN Notices"],"year":"2016","publication_status":"published","oa":1,"publist_id":"5759","citation":{"mla":"Dragoi, Cezara, et al. <i>PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms</i>. Vol. 20–22, ACM, 2016, pp. 400–15, doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>.","chicago":"Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms,” 20–22:400–415. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>.","ama":"Dragoi C, Henzinger TA, Zufferey D. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. In: Vol 20-22. ACM; 2016:400-415. doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>","ista":"Dragoi C, Henzinger TA, Zufferey D. 2016. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 20–22, 400–415.","short":"C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.","apa":"Dragoi, C., Henzinger, T. A., &#38; Zufferey, D. (2016). PSYNC: A partially synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp. 400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>","ieee":"C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous language for fault-tolerant distributed algorithms,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415."},"publisher":"ACM","month":"01","department":[{"_id":"ToHe"}],"oa_version":"Preprint","day":"11","abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalize the relation between the runtime system and PSYNC in terms of observational refinement. The high-level lockstep abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Damien Zufferey was supported by DARPA (Grants FA8650-11-C-7192 and FA8650-15-C-7564) and NSF (Grant CCF-1138967). ","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/2837614.2837650","ec_funded":1,"title":"PSYNC: A partially synchronous language for fault-tolerant distributed algorithms","page":"400 - 415","date_created":"2018-12-11T11:52:01Z","date_published":"2016-01-11T00:00:00Z","scopus_import":1,"author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","full_name":"Dragoi, Cezara","first_name":"Cezara"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey"}],"conference":{"location":"St. Petersburg, FL, USA","start_date":"2016-01-20","name":"POPL: Principles of Programming Languages","end_date":"2016-01-22"},"language":[{"iso":"eng"}],"_id":"1439","type":"conference","date_updated":"2021-01-12T06:50:45Z","volume":"20-22","status":"public","quality_controlled":"1"},{"month":"02","department":[{"_id":"HaJa"}],"date_published":"2016-02-02T00:00:00Z","author":[{"full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"issue":"2","day":"02","oa_version":"None","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:50:46Z","_id":"1440","type":"journal_article","volume":24,"status":"public","quality_controlled":"1","acknowledgement":"The author thanks Banerjee et al. (2016) for providing coordinates prior to public release and apologizes to colleagues whose work was not cited or discussed due to the limited space available. The author is supported by grants from EU FP7 (CIG-303564), HFSP (RGY0084_2012), and FWF (W1232).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"255BFFFA-B435-11E9-9278-68D0E5697425","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","grant_number":"RGY0084/2012"},{"_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"W1232-B24","name":"Molecular Drug Targets"}],"year":"2016","publication_status":"published","doi":"10.1016/j.str.2016.01.002","intvolume":"        24","title":"Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain","publist_id":"5756","ec_funded":1,"page":"213 - 215","citation":{"short":"H.L. Janovjak, Structure 24 (2016) 213–215.","ista":"Janovjak HL. 2016. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. Structure. 24(2), 213–215.","chicago":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>.","ama":"Janovjak HL. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. 2016;24(2):213-215. doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>","mla":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>, vol. 24, no. 2, Cell Press, 2016, pp. 213–15, doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>.","ieee":"H. L. Janovjak, “Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain,” <i>Structure</i>, vol. 24, no. 2. Cell Press, pp. 213–215, 2016.","apa":"Janovjak, H. L. (2016). Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>"},"publisher":"Cell Press","publication":"Structure","date_created":"2018-12-11T11:52:02Z"},{"intvolume":"        55","publist_id":"5755","file":[{"access_level":"open_access","file_id":"5255","checksum":"26da07960e57ac4750b54179197ce57f","relation":"main_file","creator":"system","file_name":"IST-2017-840-v1+1_reichhart.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:55Z","file_size":1268662,"date_created":"2018-12-12T10:17:03Z"}],"citation":{"apa":"Gschaider-Reichhart, E., Inglés Prieto, Á., Tichy, A.-M., Mckenzie, C., &#38; Janovjak, H. L. (2016). A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>","ieee":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, and H. L. Janovjak, “A phytochrome sensory domain permits receptor activation by red light,” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21. Wiley, pp. 6339–6342, 2016.","ista":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. 2016. A phytochrome sensory domain permits receptor activation by red light. Angewandte Chemie - International Edition. 55(21), 6339–6342.","short":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, H.L. Janovjak, Angewandte Chemie - International Edition 55 (2016) 6339–6342.","mla":"Gschaider-Reichhart, Eva, et al. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21, Wiley, 2016, pp. 6339–42, doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>.","ama":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. 2016;55(21):6339-6342. doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>","chicago":"Gschaider-Reichhart, Eva, Álvaro Inglés Prieto, Alexandra-Madelaine Tichy, Catherine Mckenzie, and Harald L Janovjak. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>."},"publisher":"Wiley","year":"2016","ddc":["571","576"],"publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:44:55Z","department":[{"_id":"HaJa"}],"month":"05","oa_version":"Submitted Version","issue":"21","day":"17","abstract":[{"lang":"eng","text":"Optogenetics and photopharmacology enable the spatio-temporal control of cell and animal behavior by light. Although red light offers deep-tissue penetration and minimal phototoxicity, very few red-light-sensitive optogenetic methods are currently available. We have now developed a red-light-induced homodimerization domain. We first showed that an optimized sensory domain of the cyanobacterial phytochrome 1 can be expressed robustly and without cytotoxicity in human cells. We then applied this domain to induce the dimerization of two receptor tyrosine kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway non-invasively in mammalian tissue and in multicolor cell-signaling experiments. The light-controlled dimerizer and red-light-activated receptor tyrosine kinases will prove useful to regulate a variety of cellular processes with light. Go deep with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was repurposed to induce the homodimerization of proteins in living cells by red light. By using this domain, light-activated protein kinases were engineered that can be activated orthogonally from many fluorescent proteins and through mammalian tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"418"}]},"doi":"10.1002/anie.201601736","title":"A phytochrome sensory domain permits receptor activation by red light","ec_funded":1,"page":"6339 - 6342","publication":"Angewandte Chemie - International Edition","date_created":"2018-12-11T11:52:02Z","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W1232) and a FemTech fellowship (Austrian Research Promotion Agency: 3580812).","project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","call_identifier":"FP7"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular Drug Targets","grant_number":"W1232-B24"}],"type":"journal_article","_id":"1441","date_updated":"2023-09-07T12:49:08Z","volume":55,"status":"public","quality_controlled":"1","pubrep_id":"840","date_published":"2016-05-17T00:00:00Z","scopus_import":1,"author":[{"last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","full_name":"Gschaider-Reichhart, Eva","orcid":"0000-0002-7218-7738","first_name":"Eva"},{"last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro","orcid":"0000-0002-5409-8571","first_name":"Álvaro"},{"first_name":"Alexandra-Madelaine","full_name":"Tichy, Alexandra-Madelaine","last_name":"Tichy","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87"},{"id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","last_name":"Mckenzie","full_name":"Mckenzie, Catherine","first_name":"Catherine"},{"last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"}],"language":[{"iso":"eng"}]},{"file_date_updated":"2020-07-14T12:44:55Z","abstract":[{"lang":"eng","text":"The accuracy of interdisciplinarity measurements is directly related to the quality of the underlying bibliographic data. Existing indicators of interdisciplinarity are not capable of reflecting the inaccuracies introduced by incorrect and incomplete records because correct and complete bibliographic data can rarely be obtained. This is the case for the Rao–Stirling index, which cannot handle references that are not categorized into disciplinary fields. We introduce a method that addresses this problem. It extends the Rao–Stirling index to acknowledge missing data by calculating its interval of uncertainty using computational optimization. The evaluation of our method indicates that the uncertainty interval is not only useful for estimating the inaccuracy of interdisciplinarity measurements, but it also delivers slightly more accurate aggregated interdisciplinarity measurements than the Rao–Stirling index."}],"related_material":{"link":[{"url":"https://doi.org/10.1007/s11192-016-1902-9","relation":"erratum"}]},"day":"01","issue":"1","oa_version":"Published Version","article_processing_charge":"No","month":"04","department":[{"_id":"BeBi"}],"publisher":"Springer","citation":{"apa":"Calatrava Moreno, M., Auzinger, T., &#38; Werthner, H. (2016). On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. Springer. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>","ieee":"M. Calatrava Moreno, T. Auzinger, and H. Werthner, “On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data,” <i>Scientometrics</i>, vol. 107, no. 1. Springer, pp. 213–232, 2016.","mla":"Calatrava Moreno, Maria, et al. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>, vol. 107, no. 1, Springer, 2016, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>.","ama":"Calatrava Moreno M, Auzinger T, Werthner H. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. 2016;107(1):213-232. doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>","chicago":"Calatrava Moreno, Maria, Thomas Auzinger, and Hannes Werthner. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>.","ista":"Calatrava Moreno M, Auzinger T, Werthner H. 2016. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. Scientometrics. 107(1), 213–232.","short":"M. Calatrava Moreno, T. Auzinger, H. Werthner, Scientometrics 107 (2016) 213–232."},"file":[{"date_updated":"2020-07-14T12:44:55Z","content_type":"application/pdf","file_name":"IST-2016-530-v1+1_s11192-016-1842-4.pdf","date_created":"2018-12-12T10:10:56Z","file_size":806035,"access_level":"open_access","file_id":"4848","creator":"system","checksum":"32d46268588b87d9b686492018e6a2b2","relation":"main_file"}],"publist_id":"5750","intvolume":"       107","oa":1,"publication_status":"published","ddc":["000"],"year":"2016","quality_controlled":"1","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"volume":107,"_id":"1446","type":"journal_article","date_updated":"2021-11-16T08:29:11Z","language":[{"iso":"eng"}],"author":[{"first_name":"Maria","full_name":"Calatrava Moreno, Maria","last_name":"Calatrava Moreno"},{"full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","first_name":"Thomas","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Werthner, Hannes","first_name":"Hannes","last_name":"Werthner"}],"scopus_import":"1","pubrep_id":"530","date_published":"2016-04-01T00:00:00Z","has_accepted_license":"1","publication":"Scientometrics","date_created":"2018-12-11T11:52:04Z","page":"213 - 232","title":"On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data","doi":"10.1007/s11192-016-1842-4","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"intvolume":"        26","publist_id":"5748","citation":{"short":"M. Fathi, J. Maas, The Annals of Applied Probability 26 (2016) 1774–1806.","ista":"Fathi M, Maas J. 2016. Entropic Ricci curvature bounds for discrete interacting systems. The Annals of Applied Probability. 26(3), 1774–1806.","ama":"Fathi M, Maas J. Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. 2016;26(3):1774-1806. doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>","chicago":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2016. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>.","mla":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>, vol. 26, no. 3, Institute of Mathematical Statistics, 2016, pp. 1774–806, doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>.","ieee":"M. Fathi and J. Maas, “Entropic Ricci curvature bounds for discrete interacting systems,” <i>The Annals of Applied Probability</i>, vol. 26, no. 3. Institute of Mathematical Statistics, pp. 1774–1806, 2016.","apa":"Fathi, M., &#38; Maas, J. (2016). Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>"},"publisher":"Institute of Mathematical Statistics","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.00562"}],"year":"2016","publication_status":"published","oa":1,"department":[{"_id":"JaMa"}],"month":"06","oa_version":"Preprint","day":"01","issue":"3","abstract":[{"lang":"eng","text":"We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli–Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities."}],"doi":"10.1214/15-AAP1133","title":"Entropic Ricci curvature bounds for discrete interacting systems","page":"1774 - 1806","publication":"The Annals of Applied Probability","date_created":"2018-12-11T11:52:05Z","acknowledgement":"Supported by the German Research Foundation through the Collaborative Research Center 1060\r\nThe Mathematics of Emergent Effects and the Hausdorff Center for Mathematics. Part of this work has been done while M. Fathi visited J. Maas at the University of Bonn in July 2014.We would like to thank the referees for their careful reading of the manuscript. ","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:50:49Z","type":"journal_article","_id":"1448","volume":26,"status":"public","quality_controlled":"1","date_published":"2016-06-01T00:00:00Z","scopus_import":1,"author":[{"last_name":"Fathi","full_name":"Fathi, Max","first_name":"Max"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"date_published":"2016-02-25T00:00:00Z","pubrep_id":"529","scopus_import":1,"author":[{"full_name":"Toshima, Junko","first_name":"Junko","last_name":"Toshima"},{"last_name":"Furuya","first_name":"Eri","full_name":"Furuya, Eri"},{"last_name":"Nagano","first_name":"Makoto","full_name":"Nagano, Makoto"},{"last_name":"Kanno","full_name":"Kanno, Chisa","first_name":"Chisa"},{"last_name":"Sakamoto","full_name":"Sakamoto, Yuta","first_name":"Yuta"},{"last_name":"Ebihara","full_name":"Ebihara, Masashi","first_name":"Masashi"},{"full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","first_name":"Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Toshima","first_name":"Jiro","full_name":"Toshima, Jiro"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","quality_controlled":"1","_id":"1475","date_updated":"2021-01-12T06:50:59Z","type":"journal_article","volume":5,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077","name":"Investigating the role of transporters in invasive migration through junctions","call_identifier":"FP7"}],"publication":"eLife","date_created":"2018-12-11T11:52:14Z","has_accepted_license":"1","article_number":"e10276","doi":"10.7554/eLife.10276","title":"Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton","ec_funded":1,"oa_version":"Published Version","issue":"February 2016","day":"25","abstract":[{"text":"The actin cytoskeleton plays important roles in the formation and internalization of endocytic vesicles. In yeast, endocytic vesicles move towards early endosomes along actin cables, however, the molecular machinery regulating interaction between endocytic vesicles and actin cables is poorly understood. The Eps15-like protein Pan1p plays a key role in actin-mediated endocytosis and is negatively regulated by Ark1 and Prk1 kinases. Here we show that pan1 mutated to prevent phosphorylation at all 18 threonines, pan1-18TA, displayed almost the same endocytic defect as ark1Δ prk1Δ cells, and contained abnormal actin concentrations including several endocytic compartments. Early endosomes were highly localized in the actin concentrations and displayed movement along actin cables. The dephosphorylated form of Pan1p also caused stable associations between endocytic vesicles and actin cables, and between endocytic vesicles and endosomes. Thus Pan1 phosphorylation is part of a novel mechanism that regulates endocytic compartment interactions with each other and with actin cables.","lang":"eng"}],"month":"02","department":[{"_id":"DaSi"}],"file_date_updated":"2020-07-14T12:44:56Z","year":"2016","ddc":["570"],"oa":1,"publication_status":"published","file":[{"file_id":"4793","access_level":"open_access","checksum":"d1cc44870580756ba8badd8e41adfdb5","relation":"main_file","creator":"system","file_name":"IST-2016-529-v1+1_elife-10276-v1.pdf","date_updated":"2020-07-14T12:44:56Z","content_type":"application/pdf","date_created":"2018-12-12T10:10:08Z","file_size":5198001}],"citation":{"ieee":"J. Toshima <i>et al.</i>, “Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton,” <i>eLife</i>, vol. 5, no. February 2016. eLife Sciences Publications, 2016.","apa":"Toshima, J., Furuya, E., Nagano, M., Kanno, C., Sakamoto, Y., Ebihara, M., … Toshima, J. (2016). Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.10276\">https://doi.org/10.7554/eLife.10276</a>","chicago":"Toshima, Junko, Eri Furuya, Makoto Nagano, Chisa Kanno, Yuta Sakamoto, Masashi Ebihara, Daria E Siekhaus, and Jiro Toshima. “Yeast Eps15-like Endocytic Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.” <i>ELife</i>. eLife Sciences Publications, 2016. <a href=\"https://doi.org/10.7554/eLife.10276\">https://doi.org/10.7554/eLife.10276</a>.","ama":"Toshima J, Furuya E, Nagano M, et al. Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. <i>eLife</i>. 2016;5(February 2016). doi:<a href=\"https://doi.org/10.7554/eLife.10276\">10.7554/eLife.10276</a>","mla":"Toshima, Junko, et al. “Yeast Eps15-like Endocytic Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.” <i>ELife</i>, vol. 5, no. February 2016, e10276, eLife Sciences Publications, 2016, doi:<a href=\"https://doi.org/10.7554/eLife.10276\">10.7554/eLife.10276</a>.","short":"J. Toshima, E. Furuya, M. Nagano, C. Kanno, Y. Sakamoto, M. Ebihara, D.E. Siekhaus, J. Toshima, ELife 5 (2016).","ista":"Toshima J, Furuya E, Nagano M, Kanno C, Sakamoto Y, Ebihara M, Siekhaus DE, Toshima J. 2016. Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. eLife. 5(February 2016), e10276."},"publisher":"eLife Sciences Publications","intvolume":"         5","publist_id":"5721"},{"page":"367 - 379","has_accepted_license":"1","publication":"Journal of Cell Science","date_created":"2018-12-11T11:52:14Z","doi":"10.1242/jcs.176651","ec_funded":1,"title":"Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We are grateful to Anthony Bretscher (Cornell University, NY) for providing the bni1-12 bnr1Δ (Y4135) strain. J.Y.T. was supported by a Japan Society for the Promotion of Science (JSPS) KAKENHI grant [grant number 26440067]; the Takeda Science Foundation; and the Novartis Foundation (Japan). J.T. was supported by a JSPS KAKENHI grant [grant number 25440054]; the Takeda Science Foundation; and the Kurata Memorial Hitachi Science and Technology Foundation. D.E.S. was supported by the European Union [grant number PCIG12-GA-2012-334077].","project":[{"_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077","name":"Investigating the role of transporters in invasive migration through junctions","call_identifier":"FP7"}],"status":"public","quality_controlled":"1","type":"journal_article","_id":"1476","date_updated":"2021-01-12T06:51:00Z","volume":129,"language":[{"iso":"eng"}],"date_published":"2016-01-15T00:00:00Z","pubrep_id":"767","author":[{"last_name":"Toshima","full_name":"Toshima, Junko","first_name":"Junko"},{"last_name":"Horikomi","full_name":"Horikomi, Chika","first_name":"Chika"},{"full_name":"Okada, Asuka","first_name":"Asuka","last_name":"Okada"},{"last_name":"Hatori","full_name":"Hatori, Makiko","first_name":"Makiko"},{"last_name":"Nagano","first_name":"Makoto","full_name":"Nagano, Makoto"},{"first_name":"Atsushi","full_name":"Masuda, Atsushi","last_name":"Masuda"},{"first_name":"Wataru","full_name":"Yamamoto, Wataru","last_name":"Yamamoto"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","first_name":"Daria E","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E"},{"full_name":"Toshima, Jiro","first_name":"Jiro","last_name":"Toshima"}],"scopus_import":1,"citation":{"short":"J. Toshima, C. Horikomi, A. Okada, M. Hatori, M. Nagano, A. Masuda, W. Yamamoto, D.E. Siekhaus, J. Toshima, Journal of Cell Science 129 (2016) 367–379.","ista":"Toshima J, Horikomi C, Okada A, Hatori M, Nagano M, Masuda A, Yamamoto W, Siekhaus DE, Toshima J. 2016. Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis. Journal of Cell Science. 129(2), 367–379.","ama":"Toshima J, Horikomi C, Okada A, et al. Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis. <i>Journal of Cell Science</i>. 2016;129(2):367-379. doi:<a href=\"https://doi.org/10.1242/jcs.176651\">10.1242/jcs.176651</a>","chicago":"Toshima, Junko, Chika Horikomi, Asuka Okada, Makiko Hatori, Makoto Nagano, Atsushi Masuda, Wataru Yamamoto, Daria E Siekhaus, and Jiro Toshima. “Srv2/CAP Is Required for Polarized Actin Cable Assembly and Patch Internalization during Clathrin-Mediated Endocytosis.” <i>Journal of Cell Science</i>. Company of Biologists, 2016. <a href=\"https://doi.org/10.1242/jcs.176651\">https://doi.org/10.1242/jcs.176651</a>.","mla":"Toshima, Junko, et al. “Srv2/CAP Is Required for Polarized Actin Cable Assembly and Patch Internalization during Clathrin-Mediated Endocytosis.” <i>Journal of Cell Science</i>, vol. 129, no. 2, Company of Biologists, 2016, pp. 367–79, doi:<a href=\"https://doi.org/10.1242/jcs.176651\">10.1242/jcs.176651</a>.","ieee":"J. Toshima <i>et al.</i>, “Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis,” <i>Journal of Cell Science</i>, vol. 129, no. 2. Company of Biologists, pp. 367–379, 2016.","apa":"Toshima, J., Horikomi, C., Okada, A., Hatori, M., Nagano, M., Masuda, A., … Toshima, J. (2016). Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.176651\">https://doi.org/10.1242/jcs.176651</a>"},"file":[{"date_created":"2018-12-12T10:11:08Z","file_size":7176912,"file_name":"IST-2017-767-v1+1_367.full.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:56Z","relation":"main_file","checksum":"2da0a09149a9ed956cdf79a95c17f08a","creator":"system","access_level":"open_access","file_id":"4861"}],"publisher":"Company of Biologists","intvolume":"       129","publist_id":"5720","ddc":["570","576"],"year":"2016","oa":1,"publication_status":"published","file_date_updated":"2020-07-14T12:44:56Z","day":"15","issue":"2","oa_version":"Published Version","abstract":[{"text":"The dynamic assembly and disassembly of actin filaments is essential for the formation and transport of vesicles during endocytosis. In yeast, two types of actin structures, namely cortical patches and cytoplasmic cables, play a direct role in endocytosis, but how their interaction is regulated remains unclear. Here, we show that Srv2/CAP, an evolutionarily conserved actin regulator, is required for efficient endocytosis owing to its role in the formation of the actin patches that aid initial vesicle invagination and of the actin cables that these move along. Deletion of the SRV2 gene resulted in the appearance of aberrant fragmented actin cables that frequently moved past actin patches, the sites of endocytosis. We find that the C-terminal CARP domain of Srv2p is vitally important for the proper assembly of actin patches and cables; we also demonstrate that the N-terminal helical folded domain of Srv2 is required for its localization to actin patches, specifically to the ADP-actin rich region through an interaction with cofilin. These results demonstrate the in vivo roles of Srv2p in the regulation of the actin cytoskeleton during clathrin-mediated endocytosis","lang":"eng"}],"month":"01","department":[{"_id":"DaSi"}]},{"month":"08","department":[{"_id":"KrCh"}],"arxiv":1,"issue":"5","day":"01","oa_version":"Preprint","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages provides a robust specification language to express properties in verification, and parity objectives are canonical forms to express them. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are undecidable even for special cases of parity objectives, we establish decidability (with optimal complexity) for POMDPs with all parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. We also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of POMDP examples.","lang":"eng"}],"related_material":{"record":[{"id":"2295","relation":"earlier_version","status":"public"},{"id":"5400","relation":"earlier_version","status":"public"}]},"intvolume":"        82","publist_id":"5718","citation":{"short":"K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.","ista":"Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">https://doi.org/10.1016/j.jcss.2016.02.009</a>.","ama":"Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with ω-regular objectives. <i>Journal of Computer and System Sciences</i>. 2016;82(5):878-911. doi:<a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">10.1016/j.jcss.2016.02.009</a>","mla":"Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” <i>Journal of Computer and System Sciences</i>, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:<a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">10.1016/j.jcss.2016.02.009</a>.","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” <i>Journal of Computer and System Sciences</i>, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.","apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2016.02.009\">https://doi.org/10.1016/j.jcss.2016.02.009</a>"},"publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2802"}],"year":"2016","oa":1,"publication_status":"published","type":"journal_article","_id":"1477","date_updated":"2023-02-23T12:24:38Z","volume":82,"status":"public","quality_controlled":"1","date_published":"2016-08-01T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu","full_name":"Tracol, Mathieu"}],"scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.jcss.2016.02.009","ec_funded":1,"title":"What is decidable about partially observable Markov decision processes with ω-regular objectives","page":"878 - 911","external_id":{"arxiv":["1309.2802"]},"publication":"Journal of Computer and System Sciences","date_created":"2018-12-11T11:52:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"language":[{"iso":"eng"}],"scopus_import":1,"author":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"},{"first_name":"Simone","full_name":"Warzel, Simone","last_name":"Warzel"}],"pubrep_id":"579","date_published":"2016-02-29T00:00:00Z","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","volume":18,"_id":"1478","date_updated":"2021-01-12T06:51:01Z","type":"journal_article","project":[{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:52:15Z","publication":"New Journal of Physics","article_number":"035002","has_accepted_license":"1","title":"Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas","doi":"10.1088/1367-2630/18/3/035002","abstract":[{"text":"We consider the Tonks-Girardeau gas subject to a random external potential. If the disorder is such that the underlying one-particle Hamiltonian displays localization (which is known to be generically the case), we show that there is exponential decay of correlations in the many-body eigenstates. Moreover, there is no Bose-Einstein condensation and no superfluidity, even at zero temperature.","lang":"eng"}],"oa_version":"Published Version","issue":"3","day":"29","month":"02","department":[{"_id":"RoSe"}],"file_date_updated":"2020-07-14T12:44:56Z","oa":1,"publication_status":"published","year":"2016","ddc":["510","530"],"publisher":"IOP Publishing Ltd.","citation":{"short":"R. Seiringer, S. Warzel, New Journal of Physics 18 (2016).","ista":"Seiringer R, Warzel S. 2016. Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas. New Journal of Physics. 18(3), 035002.","chicago":"Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence of Superfluidity in the Disordered Tonks-Girardeau Gas.” <i>New Journal of Physics</i>. IOP Publishing Ltd., 2016. <a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">https://doi.org/10.1088/1367-2630/18/3/035002</a>.","ama":"Seiringer R, Warzel S. Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas. <i>New Journal of Physics</i>. 2016;18(3). doi:<a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">10.1088/1367-2630/18/3/035002</a>","mla":"Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence of Superfluidity in the Disordered Tonks-Girardeau Gas.” <i>New Journal of Physics</i>, vol. 18, no. 3, 035002, IOP Publishing Ltd., 2016, doi:<a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">10.1088/1367-2630/18/3/035002</a>.","ieee":"R. Seiringer and S. Warzel, “Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas,” <i>New Journal of Physics</i>, vol. 18, no. 3. IOP Publishing Ltd., 2016.","apa":"Seiringer, R., &#38; Warzel, S. (2016). Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas. <i>New Journal of Physics</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1367-2630/18/3/035002\">https://doi.org/10.1088/1367-2630/18/3/035002</a>"},"file":[{"relation":"main_file","checksum":"4f959eabc19d2a2f518318a450a4d424","creator":"system","file_id":"5276","access_level":"open_access","file_size":965607,"date_created":"2018-12-12T10:17:22Z","file_name":"IST-2016-579-v1+1_njp_18_3_035002.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:56Z"}],"publist_id":"5716","intvolume":"        18"},{"file_date_updated":"2020-07-14T12:44:56Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2940"}]},"abstract":[{"text":"Most entropy notions H(.) like Shannon or min-entropy satisfy a chain rule stating that for random variables X,Z, and A we have H(X|Z,A)≥H(X|Z)−|A|. That is, by conditioning on A the entropy of X can decrease by at most the bitlength |A| of A. Such chain rules are known to hold for some computational entropy notions like Yao’s and unpredictability-entropy. For HILL entropy, the computational analogue of min-entropy, the chain rule is of special interest and has found many applications, including leakage-resilient cryptography, deterministic encryption, and memory delegation. These applications rely on restricted special cases of the chain rule. Whether the chain rule for conditional HILL entropy holds in general was an open problem for which we give a strong negative answer: we construct joint distributions (X,Z,A), where A is a distribution over a single bit, such that the HILL entropy H HILL (X|Z) is large but H HILL (X|Z,A) is basically zero.\r\n\r\nOur counterexample just makes the minimal assumption that NP⊈P/poly. Under the stronger assumption that injective one-way function exist, we can make all the distributions efficiently samplable.\r\n\r\nFinally, we show that some more sophisticated cryptographic objects like lossy functions can be used to sample a distribution constituting a counterexample to the chain rule making only a single invocation to the underlying object.","lang":"eng"}],"oa_version":"Submitted Version","day":"01","issue":"3","department":[{"_id":"KrPi"}],"month":"09","publisher":"Springer","citation":{"apa":"Krenn, S., Pietrzak, K. Z., Wadia, A., &#38; Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. <i>Computational Complexity</i>. Springer. <a href=\"https://doi.org/10.1007/s00037-015-0120-9\">https://doi.org/10.1007/s00037-015-0120-9</a>","ieee":"S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” <i>Computational Complexity</i>, vol. 25, no. 3. Springer, pp. 567–605, 2016.","ista":"Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.","short":"S. Krenn, K.Z. Pietrzak, A. Wadia, D. Wichs, Computational Complexity 25 (2016) 567–605.","mla":"Krenn, Stephan, et al. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” <i>Computational Complexity</i>, vol. 25, no. 3, Springer, 2016, pp. 567–605, doi:<a href=\"https://doi.org/10.1007/s00037-015-0120-9\">10.1007/s00037-015-0120-9</a>.","ama":"Krenn S, Pietrzak KZ, Wadia A, Wichs D. A counterexample to the chain rule for conditional HILL entropy. <i>Computational Complexity</i>. 2016;25(3):567-605. doi:<a href=\"https://doi.org/10.1007/s00037-015-0120-9\">10.1007/s00037-015-0120-9</a>","chicago":"Krenn, Stephan, Krzysztof Z Pietrzak, Akshay Wadia, and Daniel Wichs. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” <i>Computational Complexity</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00037-015-0120-9\">https://doi.org/10.1007/s00037-015-0120-9</a>."},"file":[{"access_level":"open_access","file_id":"5012","relation":"main_file","checksum":"7659296174fa75f5f0364f31f46f4bcf","creator":"system","file_name":"IST-2017-766-v1+1_678.pdf","date_updated":"2020-07-14T12:44:56Z","content_type":"application/pdf","file_size":483258,"date_created":"2018-12-12T10:13:29Z"}],"publist_id":"5715","intvolume":"        25","oa":1,"publication_status":"published","year":"2016","ddc":["004"],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","volume":25,"type":"journal_article","_id":"1479","date_updated":"2023-02-23T11:05:09Z","language":[{"iso":"eng"}],"scopus_import":1,"author":[{"last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","full_name":"Krenn, Stephan","orcid":"0000-0003-2835-9093"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"full_name":"Wadia, Akshay","first_name":"Akshay","last_name":"Wadia"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"pubrep_id":"766","date_published":"2016-09-01T00:00:00Z","publication":"Computational Complexity","date_created":"2018-12-11T11:52:16Z","has_accepted_license":"1","page":"567 - 605","ec_funded":1,"title":"A counterexample to the chain rule for conditional HILL entropy","doi":"10.1007/s00037-015-0120-9","project":[{"call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This work was partly funded by the European Research Council under ERC Starting Grant 259668-PSPC and ERC Advanced Grant 321310-PERCY.\r\n","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"oa_version":"Preprint","day":"07","issue":"1","language":[{"iso":"eng"}],"abstract":[{"text":"Exponential varieties arise from exponential families in statistics. These real algebraic varieties have strong positivity and convexity properties, familiar from toric varieties and their moment maps. Among them are varieties of inverses of symmetric matrices satisfying linear constraints. This class includes Gaussian graphical models. We develop a general theory of exponential varieties. These are derived from hyperbolic polynomials and their integral representations. We compare the multidegrees and ML degrees of the gradient map for hyperbolic polynomials. ","lang":"eng"}],"department":[{"_id":"CaUh"}],"month":"01","date_published":"2016-01-07T00:00:00Z","scopus_import":1,"author":[{"first_name":"Mateusz","full_name":"Michałek, Mateusz","last_name":"Michałek"},{"last_name":"Sturmfels","first_name":"Bernd","full_name":"Sturmfels, Bernd"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","first_name":"Caroline","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline"},{"full_name":"Zwiernik, Piotr","first_name":"Piotr","last_name":"Zwiernik"}],"status":"public","quality_controlled":"1","date_updated":"2021-01-12T06:51:02Z","_id":"1480","type":"journal_article","volume":112,"year":"2016","oa":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1412.6185"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. Michałek, B. Sturmfels, C. Uhler, and P. Zwiernik, “Exponential varieties,” <i>Proceedings of the London Mathematical Society</i>, vol. 112, no. 1. Oxford University Press, pp. 27–56, 2016.","apa":"Michałek, M., Sturmfels, B., Uhler, C., &#38; Zwiernik, P. (2016). Exponential varieties. <i>Proceedings of the London Mathematical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1112/plms/pdv066\">https://doi.org/10.1112/plms/pdv066</a>","chicago":"Michałek, Mateusz, Bernd Sturmfels, Caroline Uhler, and Piotr Zwiernik. “Exponential Varieties.” <i>Proceedings of the London Mathematical Society</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1112/plms/pdv066\">https://doi.org/10.1112/plms/pdv066</a>.","ama":"Michałek M, Sturmfels B, Uhler C, Zwiernik P. Exponential varieties. <i>Proceedings of the London Mathematical Society</i>. 2016;112(1):27-56. doi:<a href=\"https://doi.org/10.1112/plms/pdv066\">10.1112/plms/pdv066</a>","mla":"Michałek, Mateusz, et al. “Exponential Varieties.” <i>Proceedings of the London Mathematical Society</i>, vol. 112, no. 1, Oxford University Press, 2016, pp. 27–56, doi:<a href=\"https://doi.org/10.1112/plms/pdv066\">10.1112/plms/pdv066</a>.","short":"M. Michałek, B. Sturmfels, C. Uhler, P. Zwiernik, Proceedings of the London Mathematical Society 112 (2016) 27–56.","ista":"Michałek M, Sturmfels B, Uhler C, Zwiernik P. 2016. Exponential varieties. Proceedings of the London Mathematical Society. 112(1), 27–56."},"page":"27 - 56","date_created":"2018-12-11T11:52:16Z","publication":"Proceedings of the London Mathematical Society","publisher":"Oxford University Press","intvolume":"       112","doi":"10.1112/plms/pdv066","publist_id":"5714","title":"Exponential varieties"},{"file_date_updated":"2020-07-14T12:44:57Z","abstract":[{"text":"Plants have the ability to continously generate new organs by maintaining populations of stem cells throught their lives. The shoot apical meristem (SAM) provides a stable environment for the maintenance of stem cells. All cells inside the SAM divide, yet boundaries and patterns are maintained. Experimental evidence indicates that patterning is independent of cell lineage, thus a dynamic self-regulatory mechanism is required. A pivotal role in the organization of the SAM is played by the WUSCHEL gene (WUS). An important question in this regard is that how WUS expression is positioned in the SAM via a cell-lineage independent signaling mechanism. In this study we demonstrate via mathematical modeling that a combination of an inhibitor of the Cytokinin (CK) receptor, Arabidopsis histidine kinase 4 (AHK4) and two morphogens originating from the top cell layer, can plausibly account for the cell lineage-independent centering of WUS expression within SAM. Furthermore, our laser ablation and microsurgical experiments support the hypothesis that patterning in SAM occurs at the level of CK reception and signaling. The model suggests that the interplay between CK signaling, WUS/CLV feedback loop and boundary signals can account for positioning of the WUS expression, and provides directions for further experimental investigation.","lang":"eng"}],"day":"01","issue":"2","oa_version":"Published Version","department":[{"_id":"JiFr"}],"month":"02","publisher":"Public Library of Science","citation":{"mla":"Adibi, Milad, et al. “Centering the Organizing Center in the Arabidopsis Thaliana Shoot Apical Meristem by a Combination of Cytokinin Signaling and Self-Organization.” <i>PLoS One</i>, vol. 11, no. 2, e0147830, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pone.0147830\">10.1371/journal.pone.0147830</a>.","ama":"Adibi M, Yoshida S, Weijers D, Fleck C. Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization. <i>PLoS One</i>. 2016;11(2). doi:<a href=\"https://doi.org/10.1371/journal.pone.0147830\">10.1371/journal.pone.0147830</a>","chicago":"Adibi, Milad, Saiko Yoshida, Dolf Weijers, and Christian Fleck. “Centering the Organizing Center in the Arabidopsis Thaliana Shoot Apical Meristem by a Combination of Cytokinin Signaling and Self-Organization.” <i>PLoS One</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pone.0147830\">https://doi.org/10.1371/journal.pone.0147830</a>.","ista":"Adibi M, Yoshida S, Weijers D, Fleck C. 2016. Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization. PLoS One. 11(2), e0147830.","short":"M. Adibi, S. Yoshida, D. Weijers, C. Fleck, PLoS One 11 (2016).","apa":"Adibi, M., Yoshida, S., Weijers, D., &#38; Fleck, C. (2016). Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0147830\">https://doi.org/10.1371/journal.pone.0147830</a>","ieee":"M. Adibi, S. Yoshida, D. Weijers, and C. Fleck, “Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization,” <i>PLoS One</i>, vol. 11, no. 2. Public Library of Science, 2016."},"file":[{"relation":"main_file","checksum":"6066146e527335030f83aa5924ab72a6","creator":"system","access_level":"open_access","file_id":"5066","file_size":4297148,"date_created":"2018-12-12T10:14:16Z","file_name":"IST-2016-521-v1+1_journal.pone.0147830.PDF","date_updated":"2020-07-14T12:44:57Z","content_type":"application/pdf"}],"publist_id":"5711","intvolume":"        11","oa":1,"publication_status":"published","ddc":["570"],"year":"2016","quality_controlled":"1","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"volume":11,"_id":"1482","type":"journal_article","date_updated":"2021-01-12T06:51:03Z","language":[{"iso":"eng"}],"author":[{"last_name":"Adibi","full_name":"Adibi, Milad","first_name":"Milad"},{"id":"2E46069C-F248-11E8-B48F-1D18A9856A87","last_name":"Yoshida","first_name":"Saiko","full_name":"Yoshida, Saiko"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"full_name":"Fleck, Christian","first_name":"Christian","last_name":"Fleck"}],"scopus_import":1,"date_published":"2016-02-01T00:00:00Z","pubrep_id":"521","has_accepted_license":"1","article_number":"e0147830","date_created":"2018-12-11T11:52:17Z","publication":"PLoS One","title":"Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization","doi":"10.1371/journal.pone.0147830","acknowledgement":"We thank J. Traas, B. Müller and V. Reddy for providing seed materials and Y. Deb for advice regarding the laser ablation experiments. We specially thank Thomas Laux for stimulating discussions and support in the initial phase of this project.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2020-07-14T12:44:57Z","month":"06","department":[{"_id":"JiFr"}],"article_type":"review","oa_version":"Submitted Version","issue":"6","day":"01","publist_id":"5704","intvolume":"        26","publisher":"Cell Press","file":[{"date_updated":"2020-07-14T12:44:57Z","content_type":"application/pdf","file_name":"IST-2018-1002-v1+1_Chen_TICB_2016_proofs.pdf","file_size":2329117,"date_created":"2018-12-12T10:15:34Z","file_id":"5155","access_level":"open_access","creator":"system","relation":"main_file","checksum":"b229e5bb4676ec3e27b7b9ea603b3a63"}],"citation":{"ieee":"X. Chen, S. Wu, Z. Liu, and J. Friml, “Environmental and endogenous control of cortical microtubule orientation,” <i>Trends in Cell Biology</i>, vol. 26, no. 6. Cell Press, pp. 409–419, 2016.","apa":"Chen, X., Wu, S., Liu, Z., &#38; Friml, J. (2016). Environmental and endogenous control of cortical microtubule orientation. <i>Trends in Cell Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.tcb.2016.02.003\">https://doi.org/10.1016/j.tcb.2016.02.003</a>","chicago":"Chen, Xu, Shuang Wu, Zengyu Liu, and Jiří Friml. “Environmental and Endogenous Control of Cortical Microtubule Orientation.” <i>Trends in Cell Biology</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.tcb.2016.02.003\">https://doi.org/10.1016/j.tcb.2016.02.003</a>.","ama":"Chen X, Wu S, Liu Z, Friml J. Environmental and endogenous control of cortical microtubule orientation. <i>Trends in Cell Biology</i>. 2016;26(6):409-419. doi:<a href=\"https://doi.org/10.1016/j.tcb.2016.02.003\">10.1016/j.tcb.2016.02.003</a>","mla":"Chen, Xu, et al. “Environmental and Endogenous Control of Cortical Microtubule Orientation.” <i>Trends in Cell Biology</i>, vol. 26, no. 6, Cell Press, 2016, pp. 409–19, doi:<a href=\"https://doi.org/10.1016/j.tcb.2016.02.003\">10.1016/j.tcb.2016.02.003</a>.","short":"X. Chen, S. Wu, Z. Liu, J. Friml, Trends in Cell Biology 26 (2016) 409–419.","ista":"Chen X, Wu S, Liu Z, Friml J. 2016. Environmental and endogenous control of cortical microtubule orientation. Trends in Cell Biology. 26(6), 409–419."},"publication_status":"published","oa":1,"year":"2016","ddc":["581"],"volume":26,"date_updated":"2021-01-12T06:51:04Z","_id":"1484","type":"journal_article","quality_controlled":"1","status":"public","scopus_import":1,"author":[{"first_name":"Xu","full_name":"Chen, Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","last_name":"Chen"},{"last_name":"Wu","full_name":"Wu, Shuang","first_name":"Shuang"},{"last_name":"Liu","first_name":"Zengyu","full_name":"Liu, Zengyu"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiřĺ","full_name":"Friml, Jiřĺ","orcid":"0000-0002-8302-7596"}],"pubrep_id":"1002","date_published":"2016-06-01T00:00:00Z","language":[{"iso":"eng"}],"title":"Environmental and endogenous control of cortical microtubule orientation","doi":"10.1016/j.tcb.2016.02.003","date_created":"2018-12-11T11:52:17Z","publication":"Trends in Cell Biology","has_accepted_license":"1","page":"409 - 419","acknowledgement":"We thank Maciek Adamowski for helpful discussions and Qiang Zhu and Israel Ausin for critical reading of the manuscript. We sincerely apologize to colleagues whose work we could not include owing to space limitations.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"date_published":"2016-01-29T00:00:00Z","scopus_import":1,"author":[{"last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706"}],"language":[{"iso":"eng"}],"_id":"1485","type":"journal_article","date_updated":"2021-01-12T06:51:04Z","volume":13,"status":"public","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1088/1478-3975/13/1/016003","ec_funded":1,"title":"Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis","date_created":"2018-12-11T11:52:18Z","publication":"Physical Biology","article_number":"016003","month":"01","department":[{"_id":"GaTk"}],"oa_version":"Preprint","issue":"1","day":"29","abstract":[{"lang":"eng","text":"In this article the notion of metabolic turnover is revisited in the light of recent results of out-of-equilibrium thermodynamics. By means of Monte Carlo methods we perform an exact sampling of the enzymatic fluxes in a genome scale metabolic network of E. Coli in stationary growth conditions from which we infer the metabolites turnover times. However the latter are inferred from net fluxes, and we argue that this approximation is not valid for enzymes working nearby thermodynamic equilibrium. We recalculate turnover times from total fluxes by performing an energy balance analysis of the network and recurring to the fluctuation theorem. We find in many cases values one of order of magnitude lower, implying a faster picture of intermediate metabolism."}],"main_file_link":[{"url":"http://arxiv.org/abs/1505.04613","open_access":"1"}],"year":"2016","publication_status":"published","oa":1,"intvolume":"        13","publist_id":"5702","citation":{"apa":"De Martino, D. (2016). Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis. <i>Physical Biology</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1478-3975/13/1/016003\">https://doi.org/10.1088/1478-3975/13/1/016003</a>","ieee":"D. De Martino, “Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis,” <i>Physical Biology</i>, vol. 13, no. 1. IOP Publishing Ltd., 2016.","ista":"De Martino D. 2016. Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis. Physical Biology. 13(1), 016003.","short":"D. De Martino, Physical Biology 13 (2016).","mla":"De Martino, Daniele. “Genome-Scale Estimate of the Metabolic Turnover of E. Coli from the Energy Balance Analysis.” <i>Physical Biology</i>, vol. 13, no. 1, 016003, IOP Publishing Ltd., 2016, doi:<a href=\"https://doi.org/10.1088/1478-3975/13/1/016003\">10.1088/1478-3975/13/1/016003</a>.","ama":"De Martino D. Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis. <i>Physical Biology</i>. 2016;13(1). doi:<a href=\"https://doi.org/10.1088/1478-3975/13/1/016003\">10.1088/1478-3975/13/1/016003</a>","chicago":"De Martino, Daniele. “Genome-Scale Estimate of the Metabolic Turnover of E. Coli from the Energy Balance Analysis.” <i>Physical Biology</i>. IOP Publishing Ltd., 2016. <a href=\"https://doi.org/10.1088/1478-3975/13/1/016003\">https://doi.org/10.1088/1478-3975/13/1/016003</a>."},"publisher":"IOP Publishing Ltd."},{"scopus_import":1,"author":[{"last_name":"Hainzl","first_name":"Christian","full_name":"Hainzl, Christian"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"date_published":"2016-02-24T00:00:00Z","month":"02","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"abstract":[{"text":"We review recent results concerning the mathematical properties of the Bardeen-Cooper-Schrieffer (BCS) functional of superconductivity, which were obtained in a series of papers, partly in collaboration with R. Frank, E. Hamza, S. Naboko, and J. P. Solovej. Our discussion includes, in particular, an investigation of the critical temperature for a general class of interaction potentials, as well as a study of its dependence on external fields. We shall explain how the Ginzburg-Landau model can be derived from the BCS theory in a suitable parameter regime.","lang":"eng"}],"oa_version":"Preprint","day":"24","issue":"2","volume":57,"date_updated":"2021-01-12T06:51:04Z","_id":"1486","type":"journal_article","quality_controlled":"1","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1511.01995"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa":1,"year":"2016","title":"The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties","publist_id":"5701","intvolume":"        57","doi":"10.1063/1.4941723","date_created":"2018-12-11T11:52:18Z","publication":"Journal of Mathematical Physics","article_number":"021101","publisher":"American Institute of Physics","citation":{"ista":"Hainzl C, Seiringer R. 2016. The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties. Journal of Mathematical Physics. 57(2), 021101.","short":"C. Hainzl, R. Seiringer, Journal of Mathematical Physics 57 (2016).","mla":"Hainzl, Christian, and Robert Seiringer. “The Bardeen–Cooper–Schrieffer Functional of Superconductivity and Its Mathematical Properties.” <i>Journal of Mathematical Physics</i>, vol. 57, no. 2, 021101, American Institute of Physics, 2016, doi:<a href=\"https://doi.org/10.1063/1.4941723\">10.1063/1.4941723</a>.","ama":"Hainzl C, Seiringer R. The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties. <i>Journal of Mathematical Physics</i>. 2016;57(2). doi:<a href=\"https://doi.org/10.1063/1.4941723\">10.1063/1.4941723</a>","chicago":"Hainzl, Christian, and Robert Seiringer. “The Bardeen–Cooper–Schrieffer Functional of Superconductivity and Its Mathematical Properties.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2016. <a href=\"https://doi.org/10.1063/1.4941723\">https://doi.org/10.1063/1.4941723</a>.","apa":"Hainzl, C., &#38; Seiringer, R. (2016). The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4941723\">https://doi.org/10.1063/1.4941723</a>","ieee":"C. Hainzl and R. Seiringer, “The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties,” <i>Journal of Mathematical Physics</i>, vol. 57, no. 2. American Institute of Physics, 2016."}},{"language":[{"iso":"eng"}],"date_published":"2016-02-18T00:00:00Z","pubrep_id":"518","scopus_import":1,"author":[{"last_name":"Grion","full_name":"Grion, Natalia","first_name":"Natalia"},{"first_name":"Athena","full_name":"Akrami, Athena","last_name":"Akrami"},{"first_name":"Yangfang","full_name":"Zuo, Yangfang","last_name":"Zuo"},{"first_name":"Federico","orcid":"0000-0001-9439-3148","full_name":"Stella, Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","last_name":"Stella"},{"full_name":"Diamond, Mathew","first_name":"Mathew","last_name":"Diamond"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","quality_controlled":"1","date_updated":"2021-01-12T06:51:05Z","_id":"1487","type":"journal_article","volume":14,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Eric Maris, Demian Battaglia, and Rodrigo Quian Quiroga for useful discussions. We are grateful to Fabrizio Manzino and Marco Gigante for construction of the behavioral apparatus, Igor Perkon for developing custom whisker tracking software and to Francesca Pulecchi for animal care and histological processing.","date_created":"2018-12-11T11:52:18Z","publication":"PLoS Biology","has_accepted_license":"1","article_number":"e1002384","doi":"10.1371/journal.pbio.1002384","title":"Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination","oa_version":"Published Version","issue":"2","day":"18","abstract":[{"text":"Rhythms with time scales of multiple cycles per second permeate the mammalian brain, yet neuroscientists are not certain of their functional roles. One leading idea is that coherent oscillation between two brain regions facilitates the exchange of information between them. In rats, the hippocampus and the vibrissal sensorimotor system both are characterized by rhythmic oscillation in the theta range, 5–12 Hz. Previous work has been divided as to whether the two rhythms are independent or coherent. To resolve this question, we acquired three measures from rats—whisker motion, hippocampal local field potential (LFP), and barrel cortex unit firing—during a whisker-mediated texture discrimination task and during control conditions (not engaged in a whisker-mediated memory task). Compared to control conditions, the theta band of hippocampal LFP showed a marked increase in power as the rats approached and then palpated the texture. Phase synchronization between whisking and hippocampal LFP increased by almost 50% during approach and texture palpation. In addition, a greater proportion of barrel cortex neurons showed firing that was phase-locked to hippocampal theta while rats were engaged in the discrimination task. Consistent with a behavioral consequence of phase synchronization, the rats identified the texture more rapidly and with lower error likelihood on trials in which there was an increase in theta-whisking coherence at the moment of texture palpation. These results suggest that coherence between the whisking rhythm, barrel cortex firing, and hippocampal LFP is augmented selectively during epochs in which the rat collects sensory information and that such coherence enhances the efficiency of integration of stimulus information into memory and decision-making centers.","lang":"eng"}],"month":"02","department":[{"_id":"JoCs"}],"file_date_updated":"2020-07-14T12:44:57Z","year":"2016","ddc":["570"],"publication_status":"published","oa":1,"file":[{"file_id":"5129","access_level":"open_access","relation":"main_file","checksum":"3a5ce0d4e4e36bd6ceb4be761f85644a","creator":"system","file_name":"IST-2016-518-v1+1_journal.pbio.1002384.PDF","content_type":"application/pdf","date_updated":"2020-07-14T12:44:57Z","date_created":"2018-12-12T10:15:11Z","file_size":2879899}],"citation":{"ieee":"N. Grion, A. Akrami, Y. Zuo, F. Stella, and M. Diamond, “Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination,” <i>PLoS Biology</i>, vol. 14, no. 2. Public Library of Science, 2016.","apa":"Grion, N., Akrami, A., Zuo, Y., Stella, F., &#38; Diamond, M. (2016). Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002384\">https://doi.org/10.1371/journal.pbio.1002384</a>","short":"N. Grion, A. Akrami, Y. Zuo, F. Stella, M. Diamond, PLoS Biology 14 (2016).","ista":"Grion N, Akrami A, Zuo Y, Stella F, Diamond M. 2016. Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination. PLoS Biology. 14(2), e1002384.","chicago":"Grion, Natalia, Athena Akrami, Yangfang Zuo, Federico Stella, and Mathew Diamond. “Coherence between Rat Sensorimotor System and Hippocampus Is Enhanced during Tactile Discrimination.” <i>PLoS Biology</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pbio.1002384\">https://doi.org/10.1371/journal.pbio.1002384</a>.","ama":"Grion N, Akrami A, Zuo Y, Stella F, Diamond M. Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination. <i>PLoS Biology</i>. 2016;14(2). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002384\">10.1371/journal.pbio.1002384</a>","mla":"Grion, Natalia, et al. “Coherence between Rat Sensorimotor System and Hippocampus Is Enhanced during Tactile Discrimination.” <i>PLoS Biology</i>, vol. 14, no. 2, e1002384, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002384\">10.1371/journal.pbio.1002384</a>."},"publisher":"Public Library of Science","intvolume":"        14","publist_id":"5700"},{"publication":"PLoS Biology","date_created":"2018-12-11T11:52:19Z","has_accepted_license":"1","article_number":"e1002382","doi":"10.1371/journal.pbio.1002382","title":"Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis","acknowledgement":"We thank Silvia Arber, Thomas Jessell, Kenneth M. Murphy, Carlton Bates, Hideki Enomoto, Liqun Luo and Andrew McMahon for mouse strains; Thomas Jessell for antibodies; and Laura Martinez Prat for experimental assistance.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"status":"public","quality_controlled":"1","_id":"1488","type":"journal_article","date_updated":"2023-02-23T10:01:08Z","volume":14,"language":[{"iso":"eng"}],"date_published":"2016-02-19T00:00:00Z","pubrep_id":"517","scopus_import":1,"author":[{"last_name":"Riccio","full_name":"Riccio, Paul","first_name":"Paul"},{"full_name":"Cebrián, Cristina","first_name":"Cristina","last_name":"Cebrián"},{"first_name":"Hui","full_name":"Zong, Hui","last_name":"Zong"},{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"},{"last_name":"Costantini","first_name":"Frank","full_name":"Costantini, Frank"}],"citation":{"ieee":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis,” <i>PLoS Biology</i>, vol. 14, no. 2. Public Library of Science, 2016.","apa":"Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., &#38; Costantini, F. (2016). Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002382\">https://doi.org/10.1371/journal.pbio.1002382</a>","short":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, PLoS Biology 14 (2016).","ista":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2016. Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. PLoS Biology. 14(2), e1002382.","ama":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. <i>PLoS Biology</i>. 2016;14(2). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002382\">10.1371/journal.pbio.1002382</a>","chicago":"Riccio, Paul, Cristina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank Costantini. “Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis.” <i>PLoS Biology</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pbio.1002382\">https://doi.org/10.1371/journal.pbio.1002382</a>.","mla":"Riccio, Paul, et al. “Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis.” <i>PLoS Biology</i>, vol. 14, no. 2, e1002382, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002382\">10.1371/journal.pbio.1002382</a>."},"file":[{"file_name":"IST-2016-517-v1+1_journal.pbio.1002382_1_.PDF","content_type":"application/pdf","date_updated":"2020-07-14T12:44:57Z","file_size":5904773,"date_created":"2018-12-12T10:13:42Z","access_level":"open_access","file_id":"5027","relation":"main_file","checksum":"7f8fa1b3a29f94c0a14dd4465278cdbc","creator":"system"}],"publisher":"Public Library of Science","intvolume":"        14","publist_id":"5699","year":"2016","ddc":["570"],"oa":1,"publication_status":"published","file_date_updated":"2020-07-14T12:44:57Z","oa_version":"Published Version","issue":"2","day":"19","related_material":{"record":[{"id":"9703","relation":"research_data","status":"deleted"}]},"abstract":[{"lang":"eng","text":"Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis."}],"month":"02","department":[{"_id":"SiHi"}]},{"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"LaEr"}],"month":"04","day":"01","issue":"2","oa_version":"Published Version","abstract":[{"text":"We prove optimal local law, bulk universality and non-trivial decay for the off-diagonal elements of the resolvent for a class of translation invariant Gaussian random matrix ensembles with correlated entries. ","lang":"eng"}],"file_date_updated":"2020-07-14T12:44:57Z","ddc":["510"],"year":"2016","oa":1,"publication_status":"published","intvolume":"       163","publist_id":"5698","citation":{"short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Journal of Statistical Physics 163 (2016) 280–302.","ista":"Ajanki OH, Erdös L, Krüger TH. 2016. Local spectral statistics of Gaussian matrices with correlated entries. Journal of Statistical Physics. 163(2), 280–302.","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Spectral Statistics of Gaussian Matrices with Correlated Entries.” <i>Journal of Statistical Physics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s10955-016-1479-y\">https://doi.org/10.1007/s10955-016-1479-y</a>.","ama":"Ajanki OH, Erdös L, Krüger TH. Local spectral statistics of Gaussian matrices with correlated entries. <i>Journal of Statistical Physics</i>. 2016;163(2):280-302. doi:<a href=\"https://doi.org/10.1007/s10955-016-1479-y\">10.1007/s10955-016-1479-y</a>","mla":"Ajanki, Oskari H., et al. “Local Spectral Statistics of Gaussian Matrices with Correlated Entries.” <i>Journal of Statistical Physics</i>, vol. 163, no. 2, Springer, 2016, pp. 280–302, doi:<a href=\"https://doi.org/10.1007/s10955-016-1479-y\">10.1007/s10955-016-1479-y</a>.","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local spectral statistics of Gaussian matrices with correlated entries,” <i>Journal of Statistical Physics</i>, vol. 163, no. 2. Springer, pp. 280–302, 2016.","apa":"Ajanki, O. H., Erdös, L., &#38; Krüger, T. H. (2016). Local spectral statistics of Gaussian matrices with correlated entries. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-016-1479-y\">https://doi.org/10.1007/s10955-016-1479-y</a>"},"file":[{"file_id":"4869","access_level":"open_access","checksum":"7139598dcb1cafbe6866bd2bfd732b33","relation":"main_file","creator":"system","file_name":"IST-2016-516-v1+1_s10955-016-1479-y.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:57Z","file_size":660602,"date_created":"2018-12-12T10:11:16Z"}],"publisher":"Springer","pubrep_id":"516","date_published":"2016-04-01T00:00:00Z","author":[{"id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","last_name":"Ajanki","full_name":"Ajanki, Oskari H","first_name":"Oskari H"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","first_name":"Torben H","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H"}],"scopus_import":1,"language":[{"iso":"eng"}],"_id":"1489","date_updated":"2021-01-12T06:51:05Z","type":"journal_article","volume":163,"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). Oskari H. Ajanki was Partially supported by ERC Advanced Grant RANMAT No. 338804, and SFB-TR 12 Grant of the German Research Council. László Erdős was Partially supported by ERC Advanced Grant RANMAT No. 338804. Torben Krüger was Partially supported by ERC Advanced Grant RANMAT No. 338804, and SFB-TR 12 Grant of the German Research Council.","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"doi":"10.1007/s10955-016-1479-y","title":"Local spectral statistics of Gaussian matrices with correlated entries","ec_funded":1,"page":"280 - 302","has_accepted_license":"1","date_created":"2018-12-11T11:52:19Z","publication":"Journal of Statistical Physics"}]