[{"month":"11","has_accepted_license":"1","file":[{"relation":"main_file","success":1,"creator":"dernst","checksum":"94e0426856aad9a9bd0135d5436efbf1","file_id":"8660","file_size":1980851,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-10-14T08:54:49Z","date_created":"2020-10-14T08:54:49Z","file_name":"2019_NaturePlants_Skokan_accepted.pdf"}],"issue":"11","language":[{"iso":"eng"}],"volume":5,"article_processing_charge":"No","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"first_name":"Roman","last_name":"Skokan","full_name":"Skokan, Roman"},{"full_name":"Medvecká, Eva","last_name":"Medvecká","first_name":"Eva"},{"first_name":"Tom","last_name":"Viaene","full_name":"Viaene, Tom"},{"first_name":"Stanislav","last_name":"Vosolsobě","full_name":"Vosolsobě, Stanislav"},{"last_name":"Zwiewka","first_name":"Marta","full_name":"Zwiewka, Marta"},{"last_name":"Müller","first_name":"Karel","full_name":"Müller, Karel"},{"last_name":"Skůpa","first_name":"Petr","full_name":"Skůpa, Petr"},{"first_name":"Michal","last_name":"Karady","full_name":"Karady, Michal"},{"full_name":"Zhang, Yuzhou","last_name":"Zhang","first_name":"Yuzhou"},{"last_name":"Janacek","first_name":"Dorina P.","full_name":"Janacek, Dorina P."},{"full_name":"Hammes, Ulrich Z.","last_name":"Hammes","first_name":"Ulrich Z."},{"last_name":"Ljung","first_name":"Karin","full_name":"Ljung, Karin"},{"last_name":"Nodzyński","first_name":"Tomasz","full_name":"Nodzyński, Tomasz"},{"full_name":"Petrášek, Jan","first_name":"Jan","last_name":"Petrášek"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"ec_funded":1,"date_created":"2019-11-25T09:08:04Z","article_type":"original","type":"journal_article","_id":"7106","publication_identifier":{"issn":["2055-0278"]},"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"PIN-FORMED (PIN) transporters mediate directional, intercellular movement of the phytohormone auxin in land plants. To elucidate the evolutionary origins of this developmentally crucial mechanism, we analysed the single PIN homologue of a simple green alga Klebsormidium flaccidum. KfPIN functions as a plasma membrane-localized auxin exporter in land plants and heterologous models. While its role in algae remains unclear, PIN-driven auxin export is probably an ancient and conserved trait within streptophytes."}],"isi":1,"ddc":["580"],"pmid":1,"publisher":"Springer Nature","file_date_updated":"2020-10-14T08:54:49Z","date_published":"2019-11-01T00:00:00Z","title":"PIN-driven auxin transport emerged early in streptophyte evolution","department":[{"_id":"JiFr"}],"date_updated":"2023-09-06T11:09:49Z","citation":{"short":"R. Skokan, E. Medvecká, T. Viaene, S. Vosolsobě, M. Zwiewka, K. Müller, P. Skůpa, M. Karady, Y. Zhang, D.P. Janacek, U.Z. Hammes, K. Ljung, T. Nodzyński, J. Petrášek, J. Friml, Nature Plants 5 (2019) 1114–1119.","mla":"Skokan, Roman, et al. “PIN-Driven Auxin Transport Emerged Early in Streptophyte Evolution.” <i>Nature Plants</i>, vol. 5, no. 11, Springer Nature, 2019, pp. 1114–19, doi:<a href=\"https://doi.org/10.1038/s41477-019-0542-5\">10.1038/s41477-019-0542-5</a>.","ama":"Skokan R, Medvecká E, Viaene T, et al. PIN-driven auxin transport emerged early in streptophyte evolution. <i>Nature Plants</i>. 2019;5(11):1114-1119. doi:<a href=\"https://doi.org/10.1038/s41477-019-0542-5\">10.1038/s41477-019-0542-5</a>","ista":"Skokan R, Medvecká E, Viaene T, Vosolsobě S, Zwiewka M, Müller K, Skůpa P, Karady M, Zhang Y, Janacek DP, Hammes UZ, Ljung K, Nodzyński T, Petrášek J, Friml J. 2019. PIN-driven auxin transport emerged early in streptophyte evolution. Nature Plants. 5(11), 1114–1119.","chicago":"Skokan, Roman, Eva Medvecká, Tom Viaene, Stanislav Vosolsobě, Marta Zwiewka, Karel Müller, Petr Skůpa, et al. “PIN-Driven Auxin Transport Emerged Early in Streptophyte Evolution.” <i>Nature Plants</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41477-019-0542-5\">https://doi.org/10.1038/s41477-019-0542-5</a>.","apa":"Skokan, R., Medvecká, E., Viaene, T., Vosolsobě, S., Zwiewka, M., Müller, K., … Friml, J. (2019). PIN-driven auxin transport emerged early in streptophyte evolution. <i>Nature Plants</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41477-019-0542-5\">https://doi.org/10.1038/s41477-019-0542-5</a>","ieee":"R. Skokan <i>et al.</i>, “PIN-driven auxin transport emerged early in streptophyte evolution,” <i>Nature Plants</i>, vol. 5, no. 11. Springer Nature, pp. 1114–1119, 2019."},"external_id":{"pmid":["31712756"],"isi":["000496526100010"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","intvolume":"         5","publication":"Nature Plants","oa":1,"year":"2019","page":"1114-1119","doi":"10.1038/s41477-019-0542-5","day":"01"},{"status":"public","main_file_link":[{"url":"https://arxiv.org/pdf/1711.08436.pdf","open_access":"1"}],"publication_identifier":{"issn":["0004-5411"]},"date_created":"2019-11-26T10:13:59Z","article_type":"original","type":"journal_article","_id":"7108","language":[{"iso":"eng"}],"volume":66,"article_processing_charge":"No","month":"06","article_number":"21","issue":"3","author":[{"first_name":"Xavier","last_name":"Goaoc","full_name":"Goaoc, Xavier"},{"id":"B593B804-1035-11EA-B4F1-947645A5BB83","full_name":"Patak, Pavel","last_name":"Patak","first_name":"Pavel"},{"orcid":"0000-0002-3975-1683","first_name":"Zuzana","last_name":"Patakova","full_name":"Patakova, Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tancer","first_name":"Martin","full_name":"Tancer, Martin"},{"first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"quality_controlled":"1","oa_version":"Preprint","arxiv":1,"intvolume":"        66","publication":"Journal of the ACM","scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","id":"184","status":"public"}]},"doi":"10.1145/3314024","year":"2019","day":"01","oa":1,"date_published":"2019-06-01T00:00:00Z","publisher":"ACM","title":"Shellability is NP-complete","publication_status":"published","abstract":[{"text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes. Another simple corollary of our result is that it is NP-hard to decide whether a given poset is CL-shellable.","lang":"eng"}],"isi":1,"external_id":{"isi":["000495406300007"],"arxiv":["1711.08436"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"UlWa"}],"date_updated":"2023-09-06T11:10:58Z","citation":{"ieee":"X. Goaoc, P. Patak, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” <i>Journal of the ACM</i>, vol. 66, no. 3. ACM, 2019.","apa":"Goaoc, X., Patak, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2019). Shellability is NP-complete. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3314024\">https://doi.org/10.1145/3314024</a>","chicago":"Goaoc, Xavier, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete.” <i>Journal of the ACM</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3314024\">https://doi.org/10.1145/3314024</a>.","ista":"Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete. Journal of the ACM. 66(3), 21.","ama":"Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. <i>Journal of the ACM</i>. 2019;66(3). doi:<a href=\"https://doi.org/10.1145/3314024\">10.1145/3314024</a>","mla":"Goaoc, Xavier, et al. “Shellability Is NP-Complete.” <i>Journal of the ACM</i>, vol. 66, no. 3, 21, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3314024\">10.1145/3314024</a>.","short":"X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM 66 (2019)."}},{"publication_status":"published","abstract":[{"lang":"eng","text":"We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a “simple” formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended."}],"isi":1,"date_published":"2019-05-01T00:00:00Z","publisher":"ACM","title":"From real-time logic to timed automata","department":[{"_id":"ToHe"}],"date_updated":"2023-09-06T11:11:56Z","citation":{"short":"T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).","mla":"Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>, vol. 66, no. 3, 19, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>.","ieee":"T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to timed automata,” <i>Journal of the ACM</i>, vol. 66, no. 3. ACM, 2019.","chicago":"Ferrere, Thomas, Oded Maler, Dejan Ničković, and Amir Pnueli. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>.","ista":"Ferrere T, Maler O, Ničković D, Pnueli A. 2019. From real-time logic to timed automata. Journal of the ACM. 66(3), 19.","ama":"Ferrere T, Maler O, Ničković D, Pnueli A. From real-time logic to timed automata. <i>Journal of the ACM</i>. 2019;66(3). doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>","apa":"Ferrere, T., Maler, O., Ničković, D., &#38; Pnueli, A. (2019). From real-time logic to timed automata. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>"},"external_id":{"isi":["000495406300005"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","intvolume":"        66","publication":"Journal of the ACM","day":"01","doi":"10.1145/3286976","year":"2019","month":"05","article_number":"19","issue":"3","language":[{"iso":"eng"}],"volume":66,"article_processing_charge":"No","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"quality_controlled":"1","oa_version":"None","author":[{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas"},{"last_name":"Maler","first_name":"Oded","full_name":"Maler, Oded"},{"full_name":"Ničković, Dejan","last_name":"Ničković","first_name":"Dejan"},{"full_name":"Pnueli, Amir","last_name":"Pnueli","first_name":"Amir"}],"date_created":"2019-11-26T10:22:32Z","article_type":"original","_id":"7109","type":"journal_article","status":"public","publication_identifier":{"issn":["0004-5411"]}},{"date_published":"2019-11-06T00:00:00Z","publisher":"ACM","file_date_updated":"2020-07-14T12:47:49Z","title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","abstract":[{"lang":"eng","text":"We propose a novel generic shape optimization method for CAD models based on the eXtended Finite Element Method (XFEM). Our method works directly on the intersection between the model and a regular simulation grid, without the need to mesh or remesh, thus removing a bottleneck of classical shape optimization strategies. This is made possible by a novel hierarchical integration scheme that accurately integrates finite element quantities with sub-element precision. For optimization, we efficiently compute analytical shape derivatives of the entire framework, from model intersection to integration rule generation and XFEM simulation. Moreover, we describe a differentiable projection of shape parameters onto a constraint manifold spanned by user-specified shape preservation, consistency, and manufacturability constraints. We demonstrate the utility of our approach by optimizing mass distribution, strength-to-weight ratio, and inverse elastic shape design objectives directly on parameterized 3D CAD models."}],"publication_status":"published","ddc":["000"],"isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000498397300007"]},"date_updated":"2024-03-25T23:30:26Z","department":[{"_id":"BeBi"}],"citation":{"short":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM Transactions on Graphics 38 (2019).","mla":"Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” <i>ACM Transactions on Graphics</i>, vol. 38, no. 6, 157, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3355089.3356576\">10.1145/3355089.3356576</a>.","ieee":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer, “X-CAD: Optimizing CAD Models with Extended Finite Elements,” <i>ACM Transactions on Graphics</i>, vol. 38, no. 6. ACM, 2019.","chicago":"Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger, Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” <i>ACM Transactions on Graphics</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3355089.3356576\">https://doi.org/10.1145/3355089.3356576</a>.","ista":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 38(6), 157.","ama":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing CAD Models with Extended Finite Elements. <i>ACM Transactions on Graphics</i>. 2019;38(6). doi:<a href=\"https://doi.org/10.1145/3355089.3356576\">10.1145/3355089.3356576</a>","apa":"Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., &#38; Bächer, M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3355089.3356576\">https://doi.org/10.1145/3355089.3356576</a>"},"intvolume":"        38","publication":"ACM Transactions on Graphics","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"12897"}]},"scopus_import":"1","day":"06","year":"2019","doi":"10.1145/3355089.3356576","oa":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","volume":38,"month":"11","has_accepted_license":"1","issue":"6","article_number":"157","file":[{"date_created":"2019-11-26T14:24:26Z","date_updated":"2020-07-14T12:47:49Z","content_type":"application/pdf","file_name":"xcad_sup_mat_siga19.pdf","relation":"supplementary_material","access_level":"open_access","file_size":1673176,"checksum":"56a2fb019adcb556d2b022f5e5acb68c","title":"X-CAD Supplemental Material","file_id":"7119","creator":"bbickel"},{"relation":"main_file","access_level":"open_access","file_size":14563618,"title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","file_id":"7120","checksum":"5f29d76aceb5102e766cbab9b17d776e","creator":"bbickel","date_created":"2019-11-26T14:24:27Z","date_updated":"2020-07-14T12:47:49Z","content_type":"application/pdf","description":"This is the author's version of the work.","file_name":"XCAD_authors_version.pdf"},{"file_name":"XCAD_video.mp4","date_updated":"2020-07-14T12:47:49Z","date_created":"2019-11-26T14:27:37Z","content_type":"video/mp4","file_size":259979129,"access_level":"open_access","creator":"bbickel","checksum":"0d31e123286cbec9e28b2001c2bb0d55","file_id":"7121","relation":"main_file"}],"author":[{"last_name":"Hafner","first_name":"Christian","full_name":"Hafner, Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schumacher","first_name":"Christian","full_name":"Schumacher, Christian"},{"first_name":"Espen","last_name":"Knoop","full_name":"Knoop, Espen"},{"full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1546-3265","last_name":"Auzinger","first_name":"Thomas"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"first_name":"Moritz","last_name":"Bächer","full_name":"Bächer, Moritz"}],"quality_controlled":"1","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"oa_version":"Submitted Version","ec_funded":1,"status":"public","publication_identifier":{"issn":["0730-0301"]},"date_created":"2019-11-26T14:22:09Z","_id":"7117","type":"journal_article","article_type":"original"},{"article_number":"8619625","isi":1,"abstract":[{"text":"Data-rich applications in machine-learning and control have motivated an intense research on large-scale optimization. Novel algorithms have been proposed and shown to have optimal convergence rates in terms of iteration counts. However, their practical performance is severely degraded by the cost of exchanging high-dimensional gradient vectors between computing nodes. Several gradient compression heuristics have recently been proposed to reduce communications, but few theoretical results exist that quantify how they impact algorithm convergence. This paper establishes and strengthens the convergence guarantees for gradient descent under a family of gradient compression techniques. For convex optimization problems, we derive admissible step sizes and quantify both the number of iterations and the number of bits that need to be exchanged to reach a target accuracy. Finally, we validate the performance of different gradient compression techniques in simulations. The numerical results highlight the properties of different gradient compression algorithms and confirm that fast convergence with limited information exchange is possible.","lang":"eng"}],"publication_status":"published","month":"01","article_processing_charge":"No","title":"Gradient compression for communication-limited convex optimization","date_published":"2019-01-21T00:00:00Z","language":[{"iso":"eng"}],"publisher":"IEEE","oa_version":"None","citation":{"short":"S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.","mla":"Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.” <i>2018 IEEE Conference on Decision and Control</i>, 8619625, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/cdc.2018.8619625\">10.1109/cdc.2018.8619625</a>.","ieee":"S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in <i>2018 IEEE Conference on Decision and Control</i>, Miami Beach, FL, United States, 2019.","chicago":"Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression for Communication-Limited Convex Optimization.” In <i>2018 IEEE Conference on Decision and Control</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/cdc.2018.8619625\">https://doi.org/10.1109/cdc.2018.8619625</a>.","ama":"Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited convex optimization. In: <i>2018 IEEE Conference on Decision and Control</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/cdc.2018.8619625\">10.1109/cdc.2018.8619625</a>","ista":"Khirirat S, Johansson M, Alistarh D-A. 2019. Gradient compression for communication-limited convex optimization. 2018 IEEE Conference on Decision and Control. CDC: Conference on Decision and Control, 8619625.","apa":"Khirirat, S., Johansson, M., &#38; Alistarh, D.-A. (2019). Gradient compression for communication-limited convex optimization. In <i>2018 IEEE Conference on Decision and Control</i>. Miami Beach, FL, United States: IEEE. <a href=\"https://doi.org/10.1109/cdc.2018.8619625\">https://doi.org/10.1109/cdc.2018.8619625</a>"},"date_updated":"2023-09-06T11:14:55Z","department":[{"_id":"DaAl"}],"quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000458114800023"]},"author":[{"full_name":"Khirirat, Sarit","first_name":"Sarit","last_name":"Khirirat"},{"full_name":"Johansson, Mikael","first_name":"Mikael","last_name":"Johansson"},{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"scopus_import":"1","publication":"2018 IEEE Conference on Decision and Control","conference":{"end_date":"2018-12-19","start_date":"2018-12-17","location":"Miami Beach, FL, United States","name":"CDC: Conference on Decision and Control"},"_id":"7122","type":"conference","date_created":"2019-11-26T15:07:49Z","status":"public","doi":"10.1109/cdc.2018.8619625","year":"2019","day":"21","publication_identifier":{"isbn":["9781538613955"],"issn":["0743-1546"]}},{"publication_status":"published","abstract":[{"text":"Loss of functional cardiomyocytes is a major determinant of heart failure after myocardial infarction. Previous high throughput screening studies have identified a few microRNAs (miRNAs) that can induce cardiomyocyte proliferation and stimulate cardiac regeneration in mice. Here, we show that all of the most effective of these miRNAs activate nuclear localization of the master transcriptional cofactor Yes-associated protein (YAP) and induce expression of YAP-responsive genes. In particular, miR-199a-3p directly targets two mRNAs coding for proteins impinging on the Hippo pathway, the upstream YAP inhibitory kinase TAOK1, and the E3 ubiquitin ligase β-TrCP, which leads to YAP degradation. Several of the pro-proliferative miRNAs (including miR-199a-3p) also inhibit filamentous actin depolymerization by targeting Cofilin2, a process that by itself activates YAP nuclear translocation. Thus, activation of YAP and modulation of the actin cytoskeleton are major components of the pro-proliferative action of miR-199a-3p and other miRNAs that induce cardiomyocyte proliferation.","lang":"eng"}],"ddc":["576"],"pmid":1,"date_published":"2019-05-28T00:00:00Z","file_date_updated":"2020-07-14T12:47:50Z","publisher":"Elsevier","title":"Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation","extern":"1","date_updated":"2021-01-12T08:11:56Z","citation":{"mla":"Torrini, Consuelo, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” <i>Cell Reports</i>, vol. 27, no. 9, Elsevier, 2019, p. 2759–2771.e5, doi:<a href=\"https://doi.org/10.1016/j.celrep.2019.05.005\">10.1016/j.celrep.2019.05.005</a>.","short":"C. Torrini, R.J. Cubero, E. Dirkx, L. Braga, H. Ali, G. Prosdocimo, M.I. Gutierrez, C. Collesi, D. Licastro, L. Zentilin, M. Mano, S. Zacchigna, M. Vendruscolo, M. Marsili, A. Samal, M. Giacca, Cell Reports 27 (2019) 2759–2771.e5.","ieee":"C. Torrini <i>et al.</i>, “Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation,” <i>Cell Reports</i>, vol. 27, no. 9. Elsevier, p. 2759–2771.e5, 2019.","apa":"Torrini, C., Cubero, R. J., Dirkx, E., Braga, L., Ali, H., Prosdocimo, G., … Giacca, M. (2019). Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2019.05.005\">https://doi.org/10.1016/j.celrep.2019.05.005</a>","ama":"Torrini C, Cubero RJ, Dirkx E, et al. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. <i>Cell Reports</i>. 2019;27(9):2759-2771.e5. doi:<a href=\"https://doi.org/10.1016/j.celrep.2019.05.005\">10.1016/j.celrep.2019.05.005</a>","chicago":"Torrini, Consuelo, Ryan J Cubero, Ellen Dirkx, Luca Braga, Hashim Ali, Giulia Prosdocimo, Maria Ines Gutierrez, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” <i>Cell Reports</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.celrep.2019.05.005\">https://doi.org/10.1016/j.celrep.2019.05.005</a>.","ista":"Torrini C, Cubero RJ, Dirkx E, Braga L, Ali H, Prosdocimo G, Gutierrez MI, Collesi C, Licastro D, Zentilin L, Mano M, Zacchigna S, Vendruscolo M, Marsili M, Samal A, Giacca M. 2019. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 27(9), 2759–2771.e5."},"external_id":{"pmid":["31141697"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["cardiomyocyte","cell cycle","Cofilin2","cytoskeleton","Hippo","microRNA","regeneration","YAP"],"intvolume":"        27","publication":"Cell Reports","oa":1,"doi":"10.1016/j.celrep.2019.05.005","page":"2759-2771.e5","year":"2019","day":"28","has_accepted_license":"1","month":"05","file":[{"relation":"main_file","creator":"rcubero","checksum":"c5d855d07263bfec718673385d0ea2d7","file_id":"7129","file_size":4650750,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:50Z","date_created":"2019-11-26T22:30:43Z","file_name":"torrini_cellreports_2019.pdf"}],"issue":"9","language":[{"iso":"eng"}],"volume":27,"article_processing_charge":"Yes","quality_controlled":"1","oa_version":"Published Version","author":[{"first_name":"Consuelo","last_name":"Torrini","full_name":"Torrini, Consuelo"},{"full_name":"Cubero, Ryan J","id":"850B2E12-9CD4-11E9-837F-E719E6697425","orcid":"0000-0003-0002-1867","first_name":"Ryan J","last_name":"Cubero"},{"full_name":"Dirkx, Ellen","first_name":"Ellen","last_name":"Dirkx"},{"first_name":"Luca","last_name":"Braga","full_name":"Braga, Luca"},{"first_name":"Hashim","last_name":"Ali","full_name":"Ali, Hashim"},{"last_name":"Prosdocimo","first_name":"Giulia","full_name":"Prosdocimo, Giulia"},{"last_name":"Gutierrez","first_name":"Maria Ines","full_name":"Gutierrez, Maria Ines"},{"last_name":"Collesi","first_name":"Chiara","full_name":"Collesi, Chiara"},{"first_name":"Danilo","last_name":"Licastro","full_name":"Licastro, Danilo"},{"first_name":"Lorena","last_name":"Zentilin","full_name":"Zentilin, Lorena"},{"full_name":"Mano, Miguel","first_name":"Miguel","last_name":"Mano"},{"last_name":"Zacchigna","first_name":"Serena","full_name":"Zacchigna, Serena"},{"last_name":"Vendruscolo","first_name":"Michele","full_name":"Vendruscolo, Michele"},{"full_name":"Marsili, Matteo","first_name":"Matteo","last_name":"Marsili"},{"full_name":"Samal, Areejit","first_name":"Areejit","last_name":"Samal"},{"last_name":"Giacca","first_name":"Mauro","full_name":"Giacca, Mauro"}],"date_created":"2019-11-26T22:30:07Z","article_type":"original","_id":"7128","type":"journal_article","publication_identifier":{"issn":["2211-1247"]},"status":"public"},{"publication_identifier":{"issn":["1742-5468"]},"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.00249"}],"date_created":"2019-11-26T22:36:09Z","article_type":"original","_id":"7130","type":"journal_article","author":[{"orcid":"0000-0003-0002-1867","last_name":"Cubero","first_name":"Ryan J","full_name":"Cubero, Ryan J","id":"850B2E12-9CD4-11E9-837F-E719E6697425"},{"first_name":"Junghyo","last_name":"Jo","full_name":"Jo, Junghyo"},{"full_name":"Marsili, Matteo","last_name":"Marsili","first_name":"Matteo"},{"full_name":"Roudi, Yasser","first_name":"Yasser","last_name":"Roudi"},{"first_name":"Juyong","last_name":"Song","full_name":"Song, Juyong"}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"volume":2019,"article_processing_charge":"No","month":"06","article_number":"063402","issue":"6","acknowledgement":"We acknowledge interesting discussions with M Abbott, E Aurell, J Barbier, R Monasson, T Mora, I Nemenman, N Tishby and R Zecchina. This research was supported by the Kavli Foundation and the Centre of Excellence scheme of the Research Council of Norway (Centre for Neural Computation) (RJC and YR), by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education (2016R1D1A1B03932264) (JJ), and, in part, by the ICTP through the OEA-AC-98 (JS).","doi":"10.1088/1742-5468/ab16c8","day":"17","year":"2019","oa":1,"arxiv":1,"intvolume":"      2019","publication":"Journal of Statistical Mechanics: Theory and Experiment","keyword":["optimization under uncertainty","source coding","large deviation"],"external_id":{"arxiv":["1808.00249"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T08:11:57Z","citation":{"mla":"Cubero, Ryan J., et al. “Statistical Criticality Arises in Most Informative Representations.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2019, no. 6, 063402, IOP Publishing, 2019, doi:<a href=\"https://doi.org/10.1088/1742-5468/ab16c8\">10.1088/1742-5468/ab16c8</a>.","short":"R.J. Cubero, J. Jo, M. Marsili, Y. Roudi, J. Song, Journal of Statistical Mechanics: Theory and Experiment 2019 (2019).","ieee":"R. J. Cubero, J. Jo, M. Marsili, Y. Roudi, and J. Song, “Statistical criticality arises in most informative representations,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2019, no. 6. IOP Publishing, 2019.","apa":"Cubero, R. J., Jo, J., Marsili, M., Roudi, Y., &#38; Song, J. (2019). Statistical criticality arises in most informative representations. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/ab16c8\">https://doi.org/10.1088/1742-5468/ab16c8</a>","ama":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. Statistical criticality arises in most informative representations. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2019;2019(6). doi:<a href=\"https://doi.org/10.1088/1742-5468/ab16c8\">10.1088/1742-5468/ab16c8</a>","ista":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. 2019. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019(6), 063402.","chicago":"Cubero, Ryan J, Junghyo Jo, Matteo Marsili, Yasser Roudi, and Juyong Song. “Statistical Criticality Arises in Most Informative Representations.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2019. <a href=\"https://doi.org/10.1088/1742-5468/ab16c8\">https://doi.org/10.1088/1742-5468/ab16c8</a>."},"publisher":"IOP Publishing","date_published":"2019-06-17T00:00:00Z","title":"Statistical criticality arises in most informative representations","publication_status":"published","abstract":[{"text":"We show that statistical criticality, i.e. the occurrence of power law frequency distributions, arises in samples that are maximally informative about the underlying generating process. In order to reach this conclusion, we first identify the frequency with which different outcomes occur in a sample, as the variable carrying useful information on the generative process. The entropy of the frequency, that we call relevance, provides an upper bound to the number of informative bits. This differs from the entropy of the data, that we take as a measure of resolution. Samples that maximise relevance at a given resolution—that we call maximally informative samples—exhibit statistical criticality. In particular, Zipf's law arises at the optimal trade-off between resolution (i.e. compression) and relevance. As a byproduct, we derive a bound of the maximal number of parameters that can be estimated from a dataset, in the absence of prior knowledge on the generative model.\r\n\r\nFurthermore, we relate criticality to the statistical properties of the representation of the data generating process. We show that, as a consequence of the concentration property of the asymptotic equipartition property, representations that are maximally informative about the data generating process are characterised by an exponential distribution of energy levels. This arises from a principle of minimal entropy, that is conjugate of the maximum entropy principle in statistical mechanics. This explains why statistical criticality requires no parameter fine tuning in maximally informative samples.","lang":"eng"}]},{"type":"dissertation","_id":"7132","date_created":"2019-11-27T09:07:14Z","status":"public","publication_identifier":{"issn":["2663-337X"]},"file":[{"relation":"source_file","creator":"dernst","file_id":"7133","checksum":"34d0fe0f6e0af97b5937205a3e350423","file_size":5054633,"access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2020-07-14T12:47:50Z","date_created":"2019-11-27T09:06:10Z","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.docx"},{"file_id":"7134","checksum":"140dfb5e3df7edca34f4b6fcc55d876f","creator":"dernst","access_level":"open_access","file_size":3231837,"relation":"main_file","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.pdf","content_type":"application/pdf","date_created":"2019-11-27T09:06:10Z","date_updated":"2020-07-14T12:47:50Z"}],"has_accepted_license":"1","month":"06","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","author":[{"full_name":"Mckenzie, Catherine","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","first_name":"Catherine","last_name":"Mckenzie"}],"related_material":{"record":[{"status":"public","id":"6266","relation":"old_edition"}]},"supervisor":[{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315"}],"oa":1,"doi":"10.15479/at:ista:7132","year":"2019","page":"95","day":"27","ddc":["571","573"],"abstract":[{"lang":"eng","text":"A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing."}],"publication_status":"published","title":"Design and characterization of methods and biological components to realize synthetic neurotransmission","file_date_updated":"2020-07-14T12:47:50Z","publisher":"Institute of Science and Technology Austria","date_published":"2019-06-27T00:00:00Z","citation":{"short":"C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria, 2019.","mla":"Mckenzie, Catherine. <i>Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>.","chicago":"Mckenzie, Catherine. “Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>.","ama":"Mckenzie C. Design and characterization of methods and biological components to realize synthetic neurotransmission. 2019. doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>","ista":"Mckenzie C. 2019. Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria.","apa":"Mckenzie, C. (2019). <i>Design and characterization of methods and biological components to realize synthetic neurotransmission</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>","ieee":"C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission,” Institute of Science and Technology Austria, 2019."},"date_updated":"2024-03-25T23:30:11Z","department":[{"_id":"HaJa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD"},{"article_number":"8849240","month":"07","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skórski"}],"conference":{"start_date":"2019-07-07","end_date":"2019-07-12","name":"ISIT: International Symposium on Information Theory","location":"Paris, France"},"type":"conference","_id":"7136","date_created":"2019-11-28T10:19:21Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.08476"}],"status":"public","publication_identifier":{"isbn":["9781538692912"]},"isi":1,"publication_status":"published","abstract":[{"text":"It is well established that the notion of min-entropy fails to satisfy the \\emph{chain rule} of the form H(X,Y)=H(X|Y)+H(Y), known for Shannon Entropy. Such a property would help to analyze how min-entropy is split among smaller blocks. Problems of this kind arise for example when constructing extractors and dispersers.\r\nWe show that any sequence of variables exhibits a very strong strong block-source structure (conditional distributions of blocks are nearly flat) when we \\emph{spoil few correlated bits}. This implies, conditioned on the spoiled bits, that \\emph{splitting-recombination properties} hold. In particular, we have many nice properties that min-entropy doesn't obey in general, for example strong chain rules, \"information can't hurt\" inequalities, equivalences of average and worst-case conditional entropy definitions and others. Quantitatively, for any sequence X1,…,Xt of random variables over an alphabet X we prove that, when conditioned on m=t⋅O(loglog|X|+loglog(1/ϵ)+logt) bits of auxiliary information, all conditional distributions of the form Xi|X<i are ϵ-close to be nearly flat (only a constant factor away). The argument is combinatorial (based on simplex coverings).\r\nThis result may be used as a generic tool for \\emph{exhibiting block-source structures}. We demonstrate this by reproving the fundamental converter due to Nisan and Zuckermann (\\emph{J. Computer and System Sciences, 1996}), which shows that sampling blocks from a min-entropy source roughly preserves the entropy rate. Our bound implies, only by straightforward chain rules, an additive loss of o(1) (for sufficiently many samples), which qualitatively meets the first tighter analysis of this problem due to Vadhan (\\emph{CRYPTO'03}), obtained by large deviation techniques. ","lang":"eng"}],"title":"Strong chain rules for min-entropy under few bits spoiled","date_published":"2019-07-01T00:00:00Z","publisher":"IEEE","citation":{"short":"M. Skórski, in:, 2019 IEEE International Symposium on Information Theory, IEEE, 2019.","mla":"Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” <i>2019 IEEE International Symposium on Information Theory</i>, 8849240, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/isit.2019.8849240\">10.1109/isit.2019.8849240</a>.","ieee":"M. Skórski, “Strong chain rules for min-entropy under few bits spoiled,” in <i>2019 IEEE International Symposium on Information Theory</i>, Paris, France, 2019.","chicago":"Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” In <i>2019 IEEE International Symposium on Information Theory</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/isit.2019.8849240\">https://doi.org/10.1109/isit.2019.8849240</a>.","ista":"Skórski M. 2019. Strong chain rules for min-entropy under few bits spoiled. 2019 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8849240.","ama":"Skórski M. Strong chain rules for min-entropy under few bits spoiled. In: <i>2019 IEEE International Symposium on Information Theory</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/isit.2019.8849240\">10.1109/isit.2019.8849240</a>","apa":"Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. In <i>2019 IEEE International Symposium on Information Theory</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/isit.2019.8849240\">https://doi.org/10.1109/isit.2019.8849240</a>"},"department":[{"_id":"KrPi"}],"date_updated":"2023-09-06T11:15:41Z","external_id":{"isi":["000489100301043"],"arxiv":["1702.08476"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","publication":"2019 IEEE International Symposium on Information Theory","arxiv":1,"oa":1,"day":"01","doi":"10.1109/isit.2019.8849240","year":"2019"},{"title":"Defying gravity: a plant's quest for moisture","date_published":"2019-12-01T00:00:00Z","publisher":"Springer Nature","pmid":1,"isi":1,"abstract":[{"text":"Roots grow downwards parallel to the gravity vector, to anchor a plant in soil and acquire water and nutrients, using a gravitropic mechanism dependent on the asymmetric distribution of the phytohormone auxin. Recently, Chang et al. demonstrate that asymmetric distribution of another phytohormone, cytokinin, directs root growth towards higher water content.","lang":"eng"}],"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"pmid":["31745287"],"isi":["000500749600001"]},"citation":{"short":"S.A. Sinclair, J. Friml, Cell Research 29 (2019) 965–966.","mla":"Sinclair, Scott A., and Jiří Friml. “Defying Gravity: A Plant’s Quest for Moisture.” <i>Cell Research</i>, vol. 29, Springer Nature, 2019, pp. 965–66, doi:<a href=\"https://doi.org/10.1038/s41422-019-0254-4\">10.1038/s41422-019-0254-4</a>.","apa":"Sinclair, S. A., &#38; Friml, J. (2019). Defying gravity: a plant’s quest for moisture. <i>Cell Research</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41422-019-0254-4\">https://doi.org/10.1038/s41422-019-0254-4</a>","chicago":"Sinclair, Scott A, and Jiří Friml. “Defying Gravity: A Plant’s Quest for Moisture.” <i>Cell Research</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41422-019-0254-4\">https://doi.org/10.1038/s41422-019-0254-4</a>.","ama":"Sinclair SA, Friml J. Defying gravity: a plant’s quest for moisture. <i>Cell Research</i>. 2019;29:965-966. doi:<a href=\"https://doi.org/10.1038/s41422-019-0254-4\">10.1038/s41422-019-0254-4</a>","ista":"Sinclair SA, Friml J. 2019. Defying gravity: a plant’s quest for moisture. Cell Research. 29, 965–966.","ieee":"S. A. Sinclair and J. Friml, “Defying gravity: a plant’s quest for moisture,” <i>Cell Research</i>, vol. 29. Springer Nature, pp. 965–966, 2019."},"date_updated":"2023-09-06T11:20:58Z","department":[{"_id":"JiFr"}],"publication":"Cell Research","intvolume":"        29","scopus_import":"1","year":"2019","day":"01","doi":"10.1038/s41422-019-0254-4","page":"965-966","oa":1,"article_processing_charge":"No","volume":29,"language":[{"iso":"eng"}],"month":"12","author":[{"orcid":"0000-0002-4566-0593","last_name":"Sinclair","first_name":"Scott A","full_name":"Sinclair, Scott A","id":"2D99FE6A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"}],"oa_version":"Published Version","quality_controlled":"1","status":"public","main_file_link":[{"url":"https://doi.org/10.1038/s41422-019-0254-4","open_access":"1"}],"publication_identifier":{"issn":["1001-0602"],"eissn":["1748-7838"]},"type":"journal_article","_id":"7143","article_type":"original","date_created":"2019-12-02T12:30:48Z"},{"publication":"Physical Review B","arxiv":1,"intvolume":"       100","scopus_import":"1","doi":"10.1103/physrevb.100.205412","day":"15","year":"2019","oa":1,"title":"End-to-end correlated subgap states in hybrid nanowires","date_published":"2019-11-15T00:00:00Z","publisher":"American Physical Society","isi":1,"publication_status":"published","abstract":[{"text":"End-to-end correlated bound states are investigated in superconductor-semiconductor hybrid nanowires at zero magnetic field. Peaks in subgap conductance are independently identified from each wire end, and a cross-correlation function is computed that counts end-to-end coincidences, averaging over thousands of subgap features. Strong correlations in a short, 300-nm device are reduced by a factor of 4 in a long, 900-nm device. In addition, subgap conductance distributions are investigated, and correlations between the left and right distributions are identified based on their mutual information.","lang":"eng"}],"external_id":{"isi":["000495967500006"],"arxiv":["1908.05549"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Anselmetti, G. L. R., et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.” <i>Physical Review B</i>, vol. 100, no. 20, 205412, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/physrevb.100.205412\">10.1103/physrevb.100.205412</a>.","short":"G.L.R. Anselmetti, E.A. Martinez, G.C. Ménard, D. Puglia, F.K. Malinowski, J.S. Lee, S. Choi, M. Pendharkar, C.J. Palmstrøm, C.M. Marcus, L. Casparis, A.P. Higginbotham, Physical Review B 100 (2019).","ama":"Anselmetti GLR, Martinez EA, Ménard GC, et al. End-to-end correlated subgap states in hybrid nanowires. <i>Physical Review B</i>. 2019;100(20). doi:<a href=\"https://doi.org/10.1103/physrevb.100.205412\">10.1103/physrevb.100.205412</a>","ista":"Anselmetti GLR, Martinez EA, Ménard GC, Puglia D, Malinowski FK, Lee JS, Choi S, Pendharkar M, Palmstrøm CJ, Marcus CM, Casparis L, Higginbotham AP. 2019. End-to-end correlated subgap states in hybrid nanowires. Physical Review B. 100(20), 205412.","chicago":"Anselmetti, G. L. R., E. A. Martinez, G. C. Ménard, D. Puglia, F. K. Malinowski, J. S. Lee, S. Choi, et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.” <i>Physical Review B</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/physrevb.100.205412\">https://doi.org/10.1103/physrevb.100.205412</a>.","apa":"Anselmetti, G. L. R., Martinez, E. A., Ménard, G. C., Puglia, D., Malinowski, F. K., Lee, J. S., … Higginbotham, A. P. (2019). End-to-end correlated subgap states in hybrid nanowires. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.100.205412\">https://doi.org/10.1103/physrevb.100.205412</a>","ieee":"G. L. R. Anselmetti <i>et al.</i>, “End-to-end correlated subgap states in hybrid nanowires,” <i>Physical Review B</i>, vol. 100, no. 20. American Physical Society, 2019."},"department":[{"_id":"AnHi"}],"date_updated":"2024-02-28T13:13:51Z","status":"public","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.05549"}],"article_type":"original","type":"journal_article","_id":"7145","date_created":"2019-12-04T16:02:25Z","volume":100,"article_processing_charge":"No","language":[{"iso":"eng"}],"article_number":"205412","issue":"20","month":"11","author":[{"last_name":"Anselmetti","first_name":"G. L. R.","full_name":"Anselmetti, G. L. R."},{"last_name":"Martinez","first_name":"E. A.","full_name":"Martinez, E. A."},{"full_name":"Ménard, G. C.","last_name":"Ménard","first_name":"G. C."},{"first_name":"D.","last_name":"Puglia","full_name":"Puglia, D."},{"full_name":"Malinowski, F. K.","last_name":"Malinowski","first_name":"F. K."},{"full_name":"Lee, J. S.","first_name":"J. S.","last_name":"Lee"},{"first_name":"S.","last_name":"Choi","full_name":"Choi, S."},{"full_name":"Pendharkar, M.","last_name":"Pendharkar","first_name":"M."},{"full_name":"Palmstrøm, C. J.","first_name":"C. J.","last_name":"Palmstrøm"},{"first_name":"C. M.","last_name":"Marcus","full_name":"Marcus, C. M."},{"full_name":"Casparis, L.","last_name":"Casparis","first_name":"L."},{"full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2607-2363","last_name":"Higginbotham","first_name":"Andrew P"}],"oa_version":"Preprint","quality_controlled":"1"},{"ec_funded":1,"publication_identifier":{"issn":["2397-334X"]},"status":"public","date_created":"2019-12-04T16:05:25Z","article_type":"original","type":"journal_article","_id":"7146","language":[{"iso":"eng"}],"volume":3,"article_processing_charge":"No","month":"11","issue":"12","author":[{"orcid":"0000-0002-4579-8306","first_name":"Beatriz","last_name":"Vicoso","full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"250BDE62-B435-11E9-9278-68D0E5697425","grant_number":"715257","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution"}],"oa_version":"None","intvolume":"         3","publication":"Nature Ecology & Evolution","scopus_import":"1","page":"1632-1641","year":"2019","doi":"10.1038/s41559-019-1050-8","day":"25","date_published":"2019-11-25T00:00:00Z","publisher":"Springer Nature","title":"Molecular and evolutionary dynamics of animal sex-chromosome turnover","publication_status":"published","abstract":[{"text":"Prevailing models of sex-chromosome evolution were largely inspired by the stable and highly differentiated XY pairs of model organisms, such as those of mammals and flies. Recent work has uncovered an incredible diversity of sex-determining systems, bringing some of the assumptions of these traditional models into question. One particular question that has arisen is what drives some sex chromosomes to be maintained over millions of years and differentiate fully, while others are replaced by new sex-determining chromosomes before differentiation has occurred. Here, I review recent data on the variability of sex-determining genes and sex chromosomes in different non-model vertebrates and invertebrates, and discuss some theoretical models that have been put forward to account for this diversity.","lang":"eng"}],"isi":1,"external_id":{"isi":["000500728800009"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"BeVi"}],"date_updated":"2023-09-06T11:18:59Z","citation":{"chicago":"Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome Turnover.” <i>Nature Ecology &#38; Evolution</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41559-019-1050-8\">https://doi.org/10.1038/s41559-019-1050-8</a>.","ista":"Vicoso B. 2019. Molecular and evolutionary dynamics of animal sex-chromosome turnover. Nature Ecology &#38; Evolution. 3(12), 1632–1641.","ama":"Vicoso B. Molecular and evolutionary dynamics of animal sex-chromosome turnover. <i>Nature Ecology &#38; Evolution</i>. 2019;3(12):1632-1641. doi:<a href=\"https://doi.org/10.1038/s41559-019-1050-8\">10.1038/s41559-019-1050-8</a>","apa":"Vicoso, B. (2019). Molecular and evolutionary dynamics of animal sex-chromosome turnover. <i>Nature Ecology &#38; Evolution</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41559-019-1050-8\">https://doi.org/10.1038/s41559-019-1050-8</a>","ieee":"B. Vicoso, “Molecular and evolutionary dynamics of animal sex-chromosome turnover,” <i>Nature Ecology &#38; Evolution</i>, vol. 3, no. 12. Springer Nature, pp. 1632–1641, 2019.","short":"B. Vicoso, Nature Ecology &#38; Evolution 3 (2019) 1632–1641.","mla":"Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome Turnover.” <i>Nature Ecology &#38; Evolution</i>, vol. 3, no. 12, Springer Nature, 2019, pp. 1632–41, doi:<a href=\"https://doi.org/10.1038/s41559-019-1050-8\">10.1038/s41559-019-1050-8</a>."}},{"conference":{"start_date":"2019-09-18","end_date":"2019-09-20","location":"Trieste, Italy","name":"CMSB: Computational Methods in Systems Biology"},"status":"public","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030313036","9783030313043"]},"_id":"7147","type":"conference","date_created":"2019-12-04T16:07:50Z","volume":11773,"article_processing_charge":"No","language":[{"iso":"eng"}],"month":"09","author":[{"orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia","last_name":"Igler"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana","first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905"},{"full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","last_name":"Sezgin"}],"oa_version":"None","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture"}],"publication":"17th International Conference on Computational Methods in Systems Biology","intvolume":"     11773","scopus_import":"1","page":"155-187","doi":"10.1007/978-3-030-31304-3_9","year":"2019","day":"17","title":"Transient memory in gene regulation","date_published":"2019-09-17T00:00:00Z","publisher":"Springer Nature","isi":1,"publication_status":"published","abstract":[{"lang":"eng","text":"The expression of a gene is characterised by its transcription factors and the function processing them. If the transcription factors are not affected by gene products, the regulating function is often represented as a combinational logic circuit, where the outputs (product) are determined by current input values (transcription factors) only, and are hence independent on their relative arrival times. However, the simultaneous arrival of transcription factors (TFs) in genetic circuits is a strong assumption, given that the processes of transcription and translation of a gene into a protein introduce intrinsic time delays and that there is no global synchronisation among the arrival times of different molecular species at molecular targets.\r\n\r\nIn this paper, we construct an experimentally implementable genetic circuit with two inputs and a single output, such that, in presence of small delays in input arrival, the circuit exhibits qualitatively distinct observable phenotypes. In particular, these phenotypes are long lived transients: they all converge to a single value, but so slowly, that they seem stable for an extended time period, longer than typical experiment duration. We used rule-based language to prototype our circuit, and we implemented a search for finding the parameter combinations raising the phenotypes of interest.\r\n\r\nThe behaviour of our prototype circuit has wide implications. First, it suggests that GRNs can exploit event timing to create phenotypes. Second, it opens the possibility that GRNs are using event timing to react to stimuli and memorise events, without explicit feedback in regulation. From the modelling perspective, our prototype circuit demonstrates the critical importance of analysing the transient dynamics at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions."}],"external_id":{"isi":["000557875100009"]},"alternative_title":["LNCS"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in <i>17th International Conference on Computational Methods in Systems Biology</i>, Trieste, Italy, 2019, vol. 11773, pp. 155–187.","ista":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory in gene regulation. 17th International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773, 155–187.","chicago":"Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali Sezgin. “Transient Memory in Gene Regulation.” In <i>17th International Conference on Computational Methods in Systems Biology</i>, 11773:155–87. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">https://doi.org/10.1007/978-3-030-31304-3_9</a>.","ama":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. Transient memory in gene regulation. In: <i>17th International Conference on Computational Methods in Systems Biology</i>. Vol 11773. Springer Nature; 2019:155-187. doi:<a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">10.1007/978-3-030-31304-3_9</a>","apa":"Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., &#38; Sezgin, A. (2019). Transient memory in gene regulation. In <i>17th International Conference on Computational Methods in Systems Biology</i> (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">https://doi.org/10.1007/978-3-030-31304-3_9</a>","mla":"Guet, Calin C., et al. “Transient Memory in Gene Regulation.” <i>17th International Conference on Computational Methods in Systems Biology</i>, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:<a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">10.1007/978-3-030-31304-3_9</a>.","short":"C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187."},"department":[{"_id":"CaGu"},{"_id":"ToHe"}],"date_updated":"2023-09-06T11:18:08Z"},{"quality_controlled":"1","oa_version":"Preprint","author":[{"full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel","first_name":"Keren"},{"full_name":"Kaski, Petteri","last_name":"Kaski","first_name":"Petteri"},{"last_name":"Korhonen","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne"},{"first_name":"Christoph","last_name":"Lenzen","full_name":"Lenzen, Christoph"},{"full_name":"Paz, Ami","last_name":"Paz","first_name":"Ami"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"}],"month":"12","issue":"6","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":32,"date_created":"2019-12-05T09:49:49Z","_id":"7150","type":"journal_article","article_type":"original","main_file_link":[{"url":"https://arxiv.org/abs/1503.04963","open_access":"1"}],"status":"public","publication_identifier":{"issn":["0178-2770","1432-0452"]},"date_updated":"2021-01-12T08:12:05Z","extern":"1","citation":{"mla":"Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” <i>Distributed Computing</i>, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:<a href=\"https://doi.org/10.1007/s00446-016-0270-2\">10.1007/s00446-016-0270-2</a>.","short":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.","ieee":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” <i>Distributed Computing</i>, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019.","apa":"Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., &#38; Suomela, J. (2019). Algebraic methods in the congested clique. <i>Distributed Computing</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00446-016-0270-2\">https://doi.org/10.1007/s00446-016-0270-2</a>","ista":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. 2019. Algebraic methods in the congested clique. Distributed Computing. 32(6), 461–478.","chicago":"Censor-Hillel, Keren, Petteri Kaski, Janne Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. “Algebraic Methods in the Congested Clique.” <i>Distributed Computing</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00446-016-0270-2\">https://doi.org/10.1007/s00446-016-0270-2</a>.","ama":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. <i>Distributed Computing</i>. 2019;32(6):461-478. doi:<a href=\"https://doi.org/10.1007/s00446-016-0270-2\">10.1007/s00446-016-0270-2</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1503.04963"]},"abstract":[{"text":"In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n1−2/ω) round matrix multiplication algorithm, where ω<2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:\r\n\r\n1.    triangle and 4-cycle counting in O(n0.158) rounds, improving upon the O(n1/3) algorithm of Dolev et al. [DISC 2012],\r\n2. a (1+o(1))-approximation of all-pairs shortest paths in O(n0.158) rounds, improving upon the O~(n1/2)-round (2+o(1))-approximation algorithm given by Nanongkai [STOC 2014], and\r\n 3. computing the girth in O(n0.158) rounds, which is the first non-trivial solution in this model.\r\n   \r\nIn addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.","lang":"eng"}],"publication_status":"published","date_published":"2019-12-01T00:00:00Z","publisher":"Springer Nature","title":"Algebraic methods in the congested clique","oa":1,"doi":"10.1007/s00446-016-0270-2","day":"01","page":"461-478","year":"2019","intvolume":"        32","arxiv":1,"publication":"Distributed Computing"},{"ddc":["000"],"file":[{"checksum":"155133e6e188e85b3c0676a5e70b9341","file_id":"7155","creator":"dernst","access_level":"open_access","file_size":65307107,"relation":"main_file","file_name":"temporal_morphing_supp_data.zip","content_type":"application/x-zip-compressed","date_created":"2019-12-09T07:52:17Z","date_updated":"2020-07-14T12:47:50Z"}],"has_accepted_license":"1","month":"12","title":"Supplementary data for \"Programming temporal morphing of self-actuated shells\"","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:50Z","date_published":"2019-12-06T00:00:00Z","publisher":"Institute of Science and Technology Austria","contributor":[{"first_name":"Ruslan","last_name":"Guseinov","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"McMahan","first_name":"Connor"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus","last_name":"Perez Rodriguez"},{"last_name":"Daraio","first_name":"Chiara"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd"}],"oa_version":"Published Version","citation":{"ieee":"R. Guseinov, “Supplementary data for ‘Programming temporal morphing of self-actuated shells.’” Institute of Science and Technology Austria, 2019.","apa":"Guseinov, R. (2019). Supplementary data for “Programming temporal morphing of self-actuated shells.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">https://doi.org/10.15479/AT:ISTA:7154</a>","ista":"Guseinov R. 2019. Supplementary data for ‘Programming temporal morphing of self-actuated shells’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>.","ama":"Guseinov R. Supplementary data for “Programming temporal morphing of self-actuated shells.” 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Programming Temporal Morphing of Self-Actuated Shells.’” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">https://doi.org/10.15479/AT:ISTA:7154</a>.","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Programming Temporal Morphing of Self-Actuated Shells.”</i> Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>.","short":"R. Guseinov, (2019)."},"department":[{"_id":"BeBi"}],"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"date_updated":"2024-02-21T12:45:03Z","tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan","first_name":"Ruslan","last_name":"Guseinov","orcid":"0000-0001-9819-5077"}],"related_material":{"record":[{"status":"deleted","relation":"used_in_publication","id":"8433"},{"relation":"used_in_publication","id":"7262","status":"public"}]},"ec_funded":1,"_id":"7154","type":"research_data","date_created":"2019-12-09T07:52:46Z","oa":1,"license":"https://creativecommons.org/publicdomain/zero/1.0/","doi":"10.15479/AT:ISTA:7154","day":"06","year":"2019","status":"public"},{"oa":1,"doi":"10.1038/s41534-019-0220-5","year":"2019","day":"01","scopus_import":"1","publication":"npj Quantum Information","arxiv":1,"intvolume":"         5","citation":{"short":"A.R. Rueda Sanchez, W.J. Hease, S. Barzanjeh, J.M. Fink, Npj Quantum Information 5 (2019).","mla":"Rueda Sanchez, Alfredo R., et al. “Electro-Optic Entanglement Source for Microwave to Telecom Quantum State Transfer.” <i>Npj Quantum Information</i>, vol. 5, 108, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s41534-019-0220-5\">10.1038/s41534-019-0220-5</a>.","ieee":"A. R. Rueda Sanchez, W. J. Hease, S. Barzanjeh, and J. M. Fink, “Electro-optic entanglement source for microwave to telecom quantum state transfer,” <i>npj Quantum Information</i>, vol. 5. Springer Nature, 2019.","apa":"Rueda Sanchez, A. R., Hease, W. J., Barzanjeh, S., &#38; Fink, J. M. (2019). Electro-optic entanglement source for microwave to telecom quantum state transfer. <i>Npj Quantum Information</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41534-019-0220-5\">https://doi.org/10.1038/s41534-019-0220-5</a>","chicago":"Rueda Sanchez, Alfredo R, William J Hease, Shabir Barzanjeh, and Johannes M Fink. “Electro-Optic Entanglement Source for Microwave to Telecom Quantum State Transfer.” <i>Npj Quantum Information</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41534-019-0220-5\">https://doi.org/10.1038/s41534-019-0220-5</a>.","ista":"Rueda Sanchez AR, Hease WJ, Barzanjeh S, Fink JM. 2019. Electro-optic entanglement source for microwave to telecom quantum state transfer. npj Quantum Information. 5, 108.","ama":"Rueda Sanchez AR, Hease WJ, Barzanjeh S, Fink JM. Electro-optic entanglement source for microwave to telecom quantum state transfer. <i>npj Quantum Information</i>. 2019;5. doi:<a href=\"https://doi.org/10.1038/s41534-019-0220-5\">10.1038/s41534-019-0220-5</a>"},"department":[{"_id":"JoFi"}],"date_updated":"2024-08-07T07:11:55Z","external_id":{"arxiv":["1909.01470"],"isi":["000502996200003"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["530"],"isi":1,"publication_status":"published","abstract":[{"text":"We propose an efficient microwave-photonic modulator as a resource for stationary entangled microwave-optical fields and develop the theory for deterministic entanglement generation and quantum state transfer in multi-resonant electro-optic systems. The device is based on a single crystal whispering gallery mode resonator integrated into a 3D-microwave cavity. The specific design relies on a new combination of thin-film technology and conventional machining that is optimized for the lowest dissipation rates in the microwave, optical, and mechanical domains. We extract important device properties from finite-element simulations and predict continuous variable entanglement generation rates on the order of a Mebit/s for optical pump powers of only a few tens of microwatts. We compare the quantum state transfer fidelities of coherent, squeezed, and non-Gaussian cat states for both teleportation and direct conversion protocols under realistic conditions. Combining the unique capabilities of circuit quantum electrodynamics with the resilience of fiber optic communication could facilitate long-distance solid-state qubit networks, new methods for quantum signal synthesis, quantum key distribution, and quantum enhanced detection, as well as more power-efficient classical sensing and modulation.","lang":"eng"}],"title":"Electro-optic entanglement source for microwave to telecom quantum state transfer","publisher":"Springer Nature","date_published":"2019-12-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:50Z","article_type":"original","type":"journal_article","_id":"7156","date_created":"2019-12-09T08:18:56Z","publication_identifier":{"issn":["2056-6387"]},"status":"public","ec_funded":1,"oa_version":"Published Version","project":[{"call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425","grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits"},{"call_identifier":"H2020","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM","grant_number":"707438","_id":"258047B6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Hybrid Optomechanical Technologies","grant_number":"732894","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Integrating superconducting quantum circuits","_id":"26927A52-B435-11E9-9278-68D0E5697425","grant_number":"F07105"}],"quality_controlled":"1","author":[{"id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R","first_name":"Alfredo R","last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860"},{"full_name":"Hease, William J","id":"29705398-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9868-2166","last_name":"Hease","first_name":"William J"},{"orcid":"0000-0003-0415-1423","last_name":"Barzanjeh","first_name":"Shabir","full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8112-028X","first_name":"Johannes M","last_name":"Fink","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"article_number":"108","file":[{"relation":"main_file","access_level":"open_access","file_size":1580132,"checksum":"13e0ea1d4f9b5f5710780d9473364f58","file_id":"7157","creator":"dernst","date_created":"2019-12-09T08:25:06Z","date_updated":"2020-07-14T12:47:50Z","content_type":"application/pdf","file_name":"2019_NPJ_Rueda.pdf"}],"month":"12","has_accepted_license":"1","volume":5,"article_processing_charge":"No","language":[{"iso":"eng"}]},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000564108400004"]},"date_updated":"2024-03-25T23:30:19Z","department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>.","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 23, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>.","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019)."},"file_date_updated":"2020-10-08T12:58:10Z","publisher":"ACM","date_published":"2019-11-01T00:00:00Z","title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","abstract":[{"lang":"eng","text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n"}],"publication_status":"published","ddc":["000"],"isi":1,"doi":"10.1145/3363525","year":"2019","day":"01","oa":1,"intvolume":"        41","publication":"ACM Transactions on Programming Languages and Systems","related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"scopus_import":"1","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Goyal","first_name":"Prateesh","full_name":"Goyal, Prateesh"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":41,"month":"11","has_accepted_license":"1","issue":"4","file":[{"file_id":"8632","checksum":"291cc86a07bd010d4815e177dac57b70","creator":"dernst","access_level":"open_access","file_size":667357,"relation":"main_file","success":1,"file_name":"2019_ACMTransactions_Chatterjee.pdf","content_type":"application/pdf","date_created":"2020-10-08T12:58:10Z","date_updated":"2020-10-08T12:58:10Z"}],"article_number":"23","publication_identifier":{"issn":["0164-0925"]},"status":"public","date_created":"2019-12-09T08:33:33Z","type":"journal_article","_id":"7158","article_type":"original","ec_funded":1},{"conference":{"start_date":"2019-10-08","end_date":"2019-10-11","name":"RV: Runtime Verification","location":"Porto, Portugal"},"_id":"7159","type":"conference","date_created":"2019-12-09T08:47:55Z","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030320782","9783030320799"]},"status":"public","month":"10","volume":11757,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"None","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"}],"author":[{"full_name":"Ničković, Dejan","last_name":"Ničković","first_name":"Dejan"},{"full_name":"Qin, Xin","last_name":"Qin","first_name":"Xin"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mateis, Cristinel","first_name":"Cristinel","last_name":"Mateis"},{"full_name":"Deshmukh, Jyotirmoy","last_name":"Deshmukh","first_name":"Jyotirmoy"}],"scopus_import":"1","publication":"19th International Conference on Runtime Verification","intvolume":"     11757","day":"01","doi":"10.1007/978-3-030-32079-9_17","page":"292-309","year":"2019","isi":1,"publication_status":"published","abstract":[{"lang":"eng","text":"Cyber-physical systems (CPS) and the Internet-of-Things (IoT) result in a tremendous amount of generated, measured and recorded time-series data. Extracting temporal segments that encode patterns with useful information out of these huge amounts of data is an extremely difficult problem. We propose shape expressions as a declarative formalism for specifying, querying and extracting sophisticated temporal patterns from possibly noisy data. Shape expressions are regular expressions with arbitrary (linear, exponential, sinusoidal, etc.) shapes with parameters as atomic predicates and additional constraints on these parameters. We equip shape expressions with a novel noisy semantics that combines regular expression matching semantics with statistical regression. We characterize essential properties of the formalism and propose an efficient approximate shape expression matching procedure. We demonstrate the wide applicability of this technique on two case studies. "}],"title":"Shape expressions for specifying and extracting signal features","date_published":"2019-10-01T00:00:00Z","publisher":"Springer Nature","citation":{"short":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, J. Deshmukh, in:, 19th International Conference on Runtime Verification, Springer Nature, 2019, pp. 292–309.","mla":"Ničković, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.” <i>19th International Conference on Runtime Verification</i>, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:<a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">10.1007/978-3-030-32079-9_17</a>.","ieee":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, and J. Deshmukh, “Shape expressions for specifying and extracting signal features,” in <i>19th International Conference on Runtime Verification</i>, Porto, Portugal, 2019, vol. 11757, pp. 292–309.","chicago":"Ničković, Dejan, Xin Qin, Thomas Ferrere, Cristinel Mateis, and Jyotirmoy Deshmukh. “Shape Expressions for Specifying and Extracting Signal Features.” In <i>19th International Conference on Runtime Verification</i>, 11757:292–309. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">https://doi.org/10.1007/978-3-030-32079-9_17</a>.","ista":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. 2019. Shape expressions for specifying and extracting signal features. 19th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 11757, 292–309.","ama":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. Shape expressions for specifying and extracting signal features. In: <i>19th International Conference on Runtime Verification</i>. Vol 11757. Springer Nature; 2019:292-309. doi:<a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">10.1007/978-3-030-32079-9_17</a>","apa":"Ničković, D., Qin, X., Ferrere, T., Mateis, C., &#38; Deshmukh, J. (2019). Shape expressions for specifying and extracting signal features. In <i>19th International Conference on Runtime Verification</i> (Vol. 11757, pp. 292–309). Porto, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">https://doi.org/10.1007/978-3-030-32079-9_17</a>"},"department":[{"_id":"ToHe"}],"date_updated":"2023-09-06T11:24:10Z","external_id":{"isi":["000570006300017"]},"alternative_title":["LNCS"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"department":[{"_id":"AnKi"}],"date_updated":"2023-09-06T11:26:36Z","citation":{"ieee":"P. Guerrero <i>et al.</i>, “Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium,” <i>Development</i>, vol. 146, no. 23. The Company of Biologists, 2019.","apa":"Guerrero, P., Perez-Carrasco, R., Zagórski, M. P., Page, D., Kicheva, A., Briscoe, J., &#38; Page, K. M. (2019). Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. <i>Development</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/dev.176297\">https://doi.org/10.1242/dev.176297</a>","ista":"Guerrero P, Perez-Carrasco R, Zagórski MP, Page D, Kicheva A, Briscoe J, Page KM. 2019. Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. Development. 146(23), dev176297.","ama":"Guerrero P, Perez-Carrasco R, Zagórski MP, et al. Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. <i>Development</i>. 2019;146(23). doi:<a href=\"https://doi.org/10.1242/dev.176297\">10.1242/dev.176297</a>","chicago":"Guerrero, Pilar, Ruben Perez-Carrasco, Marcin P Zagórski, David Page, Anna Kicheva, James Briscoe, and Karen M. Page. “Neuronal Differentiation Influences Progenitor Arrangement in the Vertebrate Neuroepithelium.” <i>Development</i>. The Company of Biologists, 2019. <a href=\"https://doi.org/10.1242/dev.176297\">https://doi.org/10.1242/dev.176297</a>.","short":"P. Guerrero, R. Perez-Carrasco, M.P. Zagórski, D. Page, A. Kicheva, J. Briscoe, K.M. Page, Development 146 (2019).","mla":"Guerrero, Pilar, et al. “Neuronal Differentiation Influences Progenitor Arrangement in the Vertebrate Neuroepithelium.” <i>Development</i>, vol. 146, no. 23, dev176297, The Company of Biologists, 2019, doi:<a href=\"https://doi.org/10.1242/dev.176297\">10.1242/dev.176297</a>."},"external_id":{"isi":["000507575700004"],"pmid":["31784457"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","abstract":[{"lang":"eng","text":"Cell division, movement and differentiation contribute to pattern formation in developing tissues. This is the case in the vertebrate neural tube, in which neurons differentiate in a characteristic pattern from a highly dynamic proliferating pseudostratified epithelium. To investigate how progenitor proliferation and differentiation affect cell arrangement and growth of the neural tube, we used experimental measurements to develop a mechanical model of the apical surface of the neuroepithelium that incorporates the effect of interkinetic nuclear movement and spatially varying rates of neuronal differentiation. Simulations predict that tissue growth and the shape of lineage-related clones of cells differ with the rate of differentiation. Growth is isotropic in regions of high differentiation, but dorsoventrally biased in regions of low differentiation. This is consistent with experimental observations. The absence of directional signalling in the simulations indicates that global mechanical constraints are sufficient to explain the observed differences in anisotropy. This provides insight into how the tissue growth rate affects cell dynamics and growth anisotropy and opens up possibilities to study the coupling between mechanics, pattern formation and growth in the neural tube."}],"ddc":["570"],"isi":1,"pmid":1,"file_date_updated":"2020-07-14T12:47:50Z","date_published":"2019-12-04T00:00:00Z","publisher":"The Company of Biologists","title":"Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium","oa":1,"day":"04","year":"2019","doi":"10.1242/dev.176297","scopus_import":"1","intvolume":"       146","publication":"Development","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037"}],"oa_version":"Published Version","author":[{"last_name":"Guerrero","first_name":"Pilar","full_name":"Guerrero, Pilar"},{"last_name":"Perez-Carrasco","first_name":"Ruben","full_name":"Perez-Carrasco, Ruben"},{"full_name":"Zagórski, Marcin P","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7896-7762","last_name":"Zagórski","first_name":"Marcin P"},{"full_name":"Page, David","first_name":"David","last_name":"Page"},{"last_name":"Kicheva","first_name":"Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna"},{"full_name":"Briscoe, James","first_name":"James","last_name":"Briscoe"},{"full_name":"Page, Karen M.","first_name":"Karen M.","last_name":"Page"}],"has_accepted_license":"1","month":"12","file":[{"file_name":"2019_Development_Guerrero.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:50Z","date_created":"2019-12-13T07:34:06Z","creator":"dernst","checksum":"b6533c37dc8fbd803ffeca216e0a8b8a","file_id":"7177","file_size":7797881,"access_level":"open_access","relation":"main_file"}],"article_number":"dev176297","issue":"23","language":[{"iso":"eng"}],"volume":146,"article_processing_charge":"No","date_created":"2019-12-10T14:39:50Z","article_type":"original","type":"journal_article","_id":"7165","status":"public","publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"ec_funded":1},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","place":"Wiesbaden","oa_version":"None","citation":{"mla":"Kersting, Kristian, et al., editors. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed., Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>, 1st ed. Wiesbaden: Springer Nature, 2019.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>.","ama":"Kersting K, Lampert C, Rothkopf C, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.","apa":"Kersting, K., Lampert, C., &#38; Rothkopf, C. (Eds.). (2019). <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i> (1st ed.). Wiesbaden: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>"},"date_updated":"2021-12-22T14:40:58Z","department":[{"_id":"ChLa"}],"quality_controlled":"1","article_processing_charge":"No","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","publisher":"Springer Nature","date_published":"2019-10-30T00:00:00Z","language":[{"iso":"ger"}],"abstract":[{"lang":"ger","text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!"}],"publication_status":"published","month":"10","page":"XIV, 245","publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"year":"2019","doi":"10.1007/978-3-658-26763-6","status":"public","day":"30","type":"book_editor","_id":"7171","date_created":"2019-12-11T14:15:56Z","edition":"1","related_material":{"link":[{"description":"News on IST Website","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/","relation":"press_release"}]},"editor":[{"last_name":"Kersting","first_name":"Kristian","full_name":"Kersting, Kristian"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"},{"full_name":"Rothkopf, Constantin","last_name":"Rothkopf","first_name":"Constantin"}]}]