[{"oa":1,"year":"2017","date_updated":"2023-09-27T12:26:59Z","publication":"Neuroscience","page":"23 - 32","article_type":"original","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6911","department":[{"_id":"GaNo"}],"date_created":"2018-12-11T11:48:17Z","scopus_import":"1","external_id":{"isi":["000415966200003"],"pmid":["28951324"]},"date_published":"2017-12-04T00:00:00Z","publisher":"Elsevier","intvolume":" 365","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5798458","open_access":"1"}],"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"_id":"747","title":"Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus","author":[{"full_name":"Brǎiloiu, Eugen","last_name":"Brǎiloiu","first_name":"Eugen"},{"full_name":"Mcguire, Matthew","last_name":"Mcguire","first_name":"Matthew"},{"first_name":"Shadaria","last_name":"Shuler","full_name":"Shuler, Shadaria"},{"first_name":"Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","last_name":"Deliu","full_name":"Deliu, Elena","orcid":"0000-0002-7370-5293"},{"full_name":"Barr, Jeffrey","last_name":"Barr","first_name":"Jeffrey"},{"last_name":"Abood","full_name":"Abood, Mary","first_name":"Mary"},{"full_name":"Brailoiu, Gabriela","last_name":"Brailoiu","first_name":"Gabriela"}],"doi":"10.1016/j.neuroscience.2017.09.034","abstract":[{"lang":"eng","text":"Bradykinin (BK), a component of the kallikrein-kininogen-kinin system exerts multiple effects via B1 and B2 receptor activation. In the cardiovascular system, bradykinin has cardioprotective and vasodilator properties. We investigated the effect of BK on cardiac-projecting neurons of nucleus ambiguus, a key site for the parasympathetic cardiac regulation. BK produced a dose-dependent increase in cytosolic Ca2+ concentration. Pretreatment with HOE140, a B2 receptor antagonist, but not with R715, a B1 receptor antagonist, abolished the response to BK. A selective B2 receptor agonist, but not a B1 receptor agonist, elicited an increase in cytosolic Ca2+ similarly to BK. Inhibition of N-type voltage-gated Ca2+ channels with ω-conotoxin GVIA had no effect on the Ca2+ signal produced by BK, while pretreatment with ω-conotoxin MVIIC, a blocker of P/Q-type of Ca2+ channels, significantly diminished the effect of BK. Pretreatment with xestospongin C and 2-aminoethoxydiphenyl borate, antagonists of inositol 1,4,5-trisphosphate receptors, abolished the response to BK. Inhibition of ryanodine receptors reduced the BK-induced Ca2+ increase, while disruption of lysosomal Ca2+ stores with bafilomycin A1 did not affect the response. BK produced a dose-dependent depolarization of nucleus ambiguus neurons, which was prevented by the B2 receptor antagonist. In vivo studies indicate that microinjection of BK into nucleus ambiguus elicited bradycardia in conscious rats via B2 receptors. In summary, in cardiac vagal neurons of nucleus ambiguus, BK activates B2 receptors promoting Ca2+ influx and Ca2+ release from endoplasmic reticulum, and membrane depolarization; these effects are translated in vivo by bradycardia."}],"publication_identifier":{"issn":["03064522"]},"publication_status":"published","status":"public","month":"12","pmid":1,"citation":{"mla":"Brǎiloiu, Eugen, et al. “Modulation of Cardiac Vagal Tone by Bradykinin Acting on Nucleus Ambiguus.” Neuroscience, vol. 365, Elsevier, 2017, pp. 23–32, doi:10.1016/j.neuroscience.2017.09.034.","chicago":"Brǎiloiu, Eugen, Matthew Mcguire, Shadaria Shuler, Elena Deliu, Jeffrey Barr, Mary Abood, and Gabriela Brailoiu. “Modulation of Cardiac Vagal Tone by Bradykinin Acting on Nucleus Ambiguus.” Neuroscience. Elsevier, 2017. https://doi.org/10.1016/j.neuroscience.2017.09.034.","ama":"Brǎiloiu E, Mcguire M, Shuler S, et al. Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus. Neuroscience. 2017;365:23-32. doi:10.1016/j.neuroscience.2017.09.034","short":"E. Brǎiloiu, M. Mcguire, S. Shuler, E. Deliu, J. Barr, M. Abood, G. Brailoiu, Neuroscience 365 (2017) 23–32.","ista":"Brǎiloiu E, Mcguire M, Shuler S, Deliu E, Barr J, Abood M, Brailoiu G. 2017. Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus. Neuroscience. 365, 23–32.","ieee":"E. Brǎiloiu et al., “Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus,” Neuroscience, vol. 365. Elsevier, pp. 23–32, 2017.","apa":"Brǎiloiu, E., Mcguire, M., Shuler, S., Deliu, E., Barr, J., Abood, M., & Brailoiu, G. (2017). Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus. Neuroscience. Elsevier. https://doi.org/10.1016/j.neuroscience.2017.09.034"},"day":"04","oa_version":"Submitted Version","volume":365,"article_processing_charge":"No"},{"has_accepted_license":"1","article_processing_charge":"No","volume":21,"file":[{"content_type":"application/pdf","checksum":"a6afa3764909bf6edafa07982d8e1cee","access_level":"open_access","date_updated":"2020-07-14T12:47:59Z","creator":"system","relation":"main_file","file_size":2759195,"file_name":"IST-2017-874-v1+1_PIIS2211124717316029.pdf","date_created":"2018-12-12T10:09:14Z","file_id":"4737"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","day":"21","citation":{"chicago":"Chen, Chong, Rachel Satterfield, Samuel Young, and Peter M Jonas. “Triple Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission at Central GABAergic Synapses.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.10.122.","mla":"Chen, Chong, et al. “Triple Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission at Central GABAergic Synapses.” Cell Reports, vol. 21, no. 8, Cell Press, 2017, pp. 2082–89, doi:10.1016/j.celrep.2017.10.122.","ama":"Chen C, Satterfield R, Young S, Jonas PM. Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. 2017;21(8):2082-2089. doi:10.1016/j.celrep.2017.10.122","ista":"Chen C, Satterfield R, Young S, Jonas PM. 2017. Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. 21(8), 2082–2089.","short":"C. Chen, R. Satterfield, S. Young, P.M. Jonas, Cell Reports 21 (2017) 2082–2089.","apa":"Chen, C., Satterfield, R., Young, S., & Jonas, P. M. (2017). Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.10.122","ieee":"C. Chen, R. Satterfield, S. Young, and P. M. Jonas, “Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses,” Cell Reports, vol. 21, no. 8. Cell Press, pp. 2082–2089, 2017."},"pubrep_id":"874","ddc":["570","571"],"month":"11","file_date_updated":"2020-07-14T12:47:59Z","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["22111247"]},"project":[{"name":"Mechanisms of transmitter release at GABAergic synapses","call_identifier":"FWF","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","grant_number":"P24909-B24"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"}],"issue":"8","abstract":[{"text":"Synaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, Syt7 is strongly expressed in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. To resolve this apparent contradiction, we examined the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment, and facilitation. In combination, these three effects ensure efficient transmitter release during high-frequency activity and guarantee frequency independence of inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency of high-frequency inhibitory synaptic transmission","lang":"eng"}],"doi":"10.1016/j.celrep.2017.10.122","author":[{"last_name":"Chen","full_name":"Chen, Chong","first_name":"Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Satterfield, Rachel","last_name":"Satterfield","first_name":"Rachel"},{"first_name":"Samuel","full_name":"Young, Samuel","last_name":"Young"},{"last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"title":"Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses","_id":"749","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","intvolume":" 21","publisher":"Cell Press","date_published":"2017-11-21T00:00:00Z","external_id":{"isi":["000416216700007"]},"scopus_import":"1","acknowledged_ssus":[{"_id":"PreCl"}],"date_created":"2018-12-11T11:48:18Z","department":[{"_id":"PeJo"}],"publist_id":"6907","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"324"}]},"page":"2082 - 2089","publication":"Cell Reports","date_updated":"2023-09-27T12:26:04Z","year":"2017","oa":1},{"date_published":"2017-12-01T00:00:00Z","scopus_import":1,"conference":{"name":"Big Data","location":"Boston, MA, United States","start_date":"2017-12-11","end_date":"2017-12-14"},"date_created":"2018-12-11T11:48:18Z","oa_version":"None","department":[{"_id":"ChLa"}],"day":"01","citation":{"apa":"Pielorz, J., Prandtstetter, M., Straub, M., & Lampert, C. (2017). Optimal geospatial volunteer allocation needs realistic distances. In 2017 IEEE International Conference on Big Data (pp. 3760–3763). Boston, MA, United States: IEEE. https://doi.org/10.1109/BigData.2017.8258375","ieee":"J. Pielorz, M. Prandtstetter, M. Straub, and C. Lampert, “Optimal geospatial volunteer allocation needs realistic distances,” in 2017 IEEE International Conference on Big Data, Boston, MA, United States, 2017, pp. 3760–3763.","ista":"Pielorz J, Prandtstetter M, Straub M, Lampert C. 2017. Optimal geospatial volunteer allocation needs realistic distances. 2017 IEEE International Conference on Big Data. Big Data, 3760–3763.","ama":"Pielorz J, Prandtstetter M, Straub M, Lampert C. Optimal geospatial volunteer allocation needs realistic distances. In: 2017 IEEE International Conference on Big Data. IEEE; 2017:3760-3763. doi:10.1109/BigData.2017.8258375","short":"J. Pielorz, M. Prandtstetter, M. Straub, C. Lampert, in:, 2017 IEEE International Conference on Big Data, IEEE, 2017, pp. 3760–3763.","chicago":"Pielorz, Jasmin, Matthias Prandtstetter, Markus Straub, and Christoph Lampert. “Optimal Geospatial Volunteer Allocation Needs Realistic Distances.” In 2017 IEEE International Conference on Big Data, 3760–63. IEEE, 2017. https://doi.org/10.1109/BigData.2017.8258375.","mla":"Pielorz, Jasmin, et al. “Optimal Geospatial Volunteer Allocation Needs Realistic Distances.” 2017 IEEE International Conference on Big Data, IEEE, 2017, pp. 3760–63, doi:10.1109/BigData.2017.8258375."},"month":"12","publist_id":"6906","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","publisher":"IEEE","year":"2017","abstract":[{"lang":"eng","text":"Modern communication technologies allow first responders to contact thousands of potential volunteers simultaneously for support during a crisis or disaster event. However, such volunteer efforts must be well coordinated and monitored, in order to offer an effective relief to the professionals. In this paper we extend earlier work on optimally assigning volunteers to selected landmark locations. In particular, we emphasize the aspect that obtaining good assignments requires not only advanced computational tools, but also a realistic measure of distance between volunteers and landmarks. Specifically, we propose the use of the Open Street Map (OSM) driving distance instead of he previously used flight distance. We find the OSM driving distance to be better aligned with the interests of volunteers and first responders. Furthermore, we show that relying on the flying distance leads to a substantial underestimation of the number of required volunteers, causing negative side effects in case of an actual crisis situation."}],"doi":"10.1109/BigData.2017.8258375","author":[{"first_name":"Jasmin","id":"49BC895A-F248-11E8-B48F-1D18A9856A87","last_name":"Pielorz","full_name":"Pielorz, Jasmin"},{"first_name":"Matthias","full_name":"Prandtstetter, Matthias","last_name":"Prandtstetter"},{"last_name":"Straub","full_name":"Straub, Markus","first_name":"Markus"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph"}],"title":"Optimal geospatial volunteer allocation needs realistic distances","_id":"750","status":"public","publication_status":"published","page":"3760 - 3763","publication":"2017 IEEE International Conference on Big Data","publication_identifier":{"isbn":["978-153862714-3"]},"date_updated":"2021-01-12T08:13:55Z"},{"scopus_import":"1","date_created":"2018-12-11T11:48:18Z","date_published":"2017-11-09T00:00:00Z","external_id":{"isi":["000415815800031"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6905","department":[{"_id":"DaSi"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"intvolume":" 27","publisher":"Cell Press","year":"2017","oa":1,"page":"3526 - 3534e.4","date_updated":"2023-09-27T12:25:31Z","publication":"Current Biology","oa_version":"Published Version","month":"11","ddc":["570","576"],"file_date_updated":"2020-07-14T12:47:59Z","day":"09","pubrep_id":"875","citation":{"ieee":"Y. Matsubayashi et al., “A moving source of matrix components is essential for De Novo basement membrane formation,” Current Biology, vol. 27, no. 22. Cell Press, p. 3526–3534e.4, 2017.","apa":"Matsubayashi, Y., Louani, A., Dragu, A., Sanchez Sanchez, B., Serna Morales, E., Yolland, L., … Stramer, B. (2017). A moving source of matrix components is essential for De Novo basement membrane formation. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.10.001","ista":"Matsubayashi Y, Louani A, Dragu A, Sanchez Sanchez B, Serna Morales E, Yolland L, György A, Vizcay G, Fleck R, Heddleston J, Chew T, Siekhaus DE, Stramer B. 2017. A moving source of matrix components is essential for De Novo basement membrane formation. Current Biology. 27(22), 3526–3534e.4.","ama":"Matsubayashi Y, Louani A, Dragu A, et al. A moving source of matrix components is essential for De Novo basement membrane formation. Current Biology. 2017;27(22):3526-3534e.4. doi:10.1016/j.cub.2017.10.001","short":"Y. Matsubayashi, A. Louani, A. Dragu, B. Sanchez Sanchez, E. Serna Morales, L. Yolland, A. György, G. Vizcay, R. Fleck, J. Heddleston, T. Chew, D.E. Siekhaus, B. Stramer, Current Biology 27 (2017) 3526–3534e.4.","mla":"Matsubayashi, Yutaka, et al. “A Moving Source of Matrix Components Is Essential for De Novo Basement Membrane Formation.” Current Biology, vol. 27, no. 22, Cell Press, 2017, p. 3526–3534e.4, doi:10.1016/j.cub.2017.10.001.","chicago":"Matsubayashi, Yutaka, Adam Louani, Anca Dragu, Besaiz Sanchez Sanchez, Eduardo Serna Morales, Lawrence Yolland, Attila György, et al. “A Moving Source of Matrix Components Is Essential for De Novo Basement Membrane Formation.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.10.001."},"article_processing_charge":"No","volume":27,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2018-12-12T10:09:45Z","file_id":"4770","relation":"main_file","file_size":4770657,"creator":"system","file_name":"IST-2017-875-v1+1_1-s2.0-S0960982217312691-main.pdf","date_updated":"2020-07-14T12:47:59Z","content_type":"application/pdf","checksum":"264cf6c6c3551486ba5ea786850e000a","access_level":"open_access"}],"doi":"10.1016/j.cub.2017.10.001","issue":"22","abstract":[{"lang":"eng","text":"The basement membrane (BM) is a thin layer of extracellular matrix (ECM) beneath nearly all epithelial cell types that is critical for cellular and tissue function. It is composed of numerous components conserved among all bilaterians [1]; however, it is unknown how all of these components are generated and subsequently constructed to form a fully mature BM in the living animal. Although BM formation is thought to simply involve a process of self-assembly [2], this concept suffers from a number of logistical issues when considering its construction in vivo. First, incorporation of BM components appears to be hierarchical [3-5], yet it is unclear whether their production during embryogenesis must also be regulated in a temporal fashion. Second, many BM proteins are produced not only by the cells residing on the BM but also by surrounding cell types [6-9], and it is unclear how large, possibly insoluble protein complexes [10] are delivered into the matrix. Here we exploit our ability to live image and genetically dissect de novo BM formation during Drosophila development. This reveals that there is a temporal hierarchy of BM protein production that is essential for proper component incorporation. Furthermore, we show that BM components require secretion by migrating macrophages (hemocytes) during their developmental dispersal, which is critical for embryogenesis. Indeed, hemocyte migration is essential to deliver a subset of ECM components evenly throughout the embryo. This reveals that de novo BM construction requires a combination of both production and distribution logistics allowing for the timely delivery of core components."}],"_id":"751","author":[{"first_name":"Yutaka","last_name":"Matsubayashi","full_name":"Matsubayashi, Yutaka"},{"first_name":"Adam","full_name":"Louani, Adam","last_name":"Louani"},{"full_name":"Dragu, Anca","last_name":"Dragu","first_name":"Anca"},{"last_name":"Sanchez Sanchez","full_name":"Sanchez Sanchez, Besaiz","first_name":"Besaiz"},{"first_name":"Eduardo","full_name":"Serna Morales, Eduardo","last_name":"Serna Morales"},{"first_name":"Lawrence","full_name":"Yolland, Lawrence","last_name":"Yolland"},{"first_name":"Attila","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","last_name":"György","full_name":"György, Attila","orcid":"0000-0002-1819-198X"},{"full_name":"Vizcay, Gema","last_name":"Vizcay","first_name":"Gema"},{"first_name":"Roland","full_name":"Fleck, Roland","last_name":"Fleck"},{"first_name":"John","full_name":"Heddleston, John","last_name":"Heddleston"},{"full_name":"Chew, Teng","last_name":"Chew","first_name":"Teng"},{"orcid":"0000-0001-8323-8353","last_name":"Siekhaus","full_name":"Siekhaus, Daria E","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Stramer","full_name":"Stramer, Brian","first_name":"Brian"}],"title":"A moving source of matrix components is essential for De Novo basement membrane formation","publication_status":"published","status":"public","publication_identifier":{"issn":["09609822"]}},{"publication_status":"published","status":"public","publication_identifier":{"issn":["2366-2875"]},"abstract":[{"lang":"eng","text":"The social insects bees, wasps, ants, and termites are species-rich, occur in many habitats, and often constitute a large part of the biomass. Many are also invasive, including species of termites, the red imported fire ant, and the Argentine ant. While invasive social insects have been a problem in Southern Europe for some time, Central Europa was free of invasive ant species until recently because most ants are adapted to warmer climates. Only in the 1990s, did Lasius neglectus, a close relative of the common black garden ant, arrive in Germany. First described in 1990 based on individuals collected in Budapest, the species has since been detected for example in France, Germany, Spain, England, and Kyrgyzstan. The species is spread with soil during construction work or plantings, and L. neglectus therefore is often found in parks and botanical gardens. Another invasive ant now spreading in southern Germany is Formica fuscocinerea, which occurs along rivers, including in the sandy floodplains of the river Isar. As is typical of pioneer species, F. fuscocinerea quickly becomes extremely abundant and therefore causes problems for example on playgrounds in Munich. All invasive ant species are characterized by cooperation across nests, leading to strongly interconnected, very large super-colonies. The resulting dominance results in the extinction of native ant species as well as other arthropod species and thus in the reduction of biodiversity."}],"author":[{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868"}],"title":"Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern","_id":"459","has_accepted_license":"1","volume":46,"article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"file":[{"file_name":"IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf","relation":"main_file","file_size":1711131,"creator":"system","access_level":"open_access","checksum":"4919baf9050415ca151fe22497379f78","content_type":"application/pdf","date_updated":"2020-07-14T12:46:32Z","file_id":"5175","date_created":"2018-12-12T10:15:52Z"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","oa_version":"Published Version","day":"04","pubrep_id":"962","citation":{"short":"S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116.","ama":"Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. 2017;46:105-116.","ista":"Cremer S. 2017. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. 46, 105–116.","apa":"Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. Verlag Dr. Friedrich Pfeil.","ieee":"S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern,” Rundgespräche Forum Ökologie, vol. 46. Verlag Dr. Friedrich Pfeil, pp. 105–116, 2017.","mla":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” Rundgespräche Forum Ökologie, vol. 46, Verlag Dr. Friedrich Pfeil, 2017, pp. 105–16.","chicago":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” Rundgespräche Forum Ökologie. Verlag Dr. Friedrich Pfeil, 2017."},"file_date_updated":"2020-07-14T12:46:32Z","month":"04","ddc":["592"],"page":"105 - 116","publication":"Rundgespräche Forum Ökologie","date_updated":"2023-10-17T12:28:13Z","year":"2017","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 46","publisher":"Verlag Dr. Friedrich Pfeil","date_published":"2017-04-04T00:00:00Z","date_created":"2018-12-11T11:46:35Z","department":[{"_id":"SyCr"}],"publist_id":"7362","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"01","citation":{"chicago":"Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos. AIP Publishing, 2017. https://doi.org/10.1063/1.5002771.","mla":"Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos, vol. 27, no. 11, 113112, AIP Publishing, 2017, doi:10.1063/1.5002771.","short":"S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017).","ama":"Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 2017;27(11). doi:10.1063/1.5002771","ista":"Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.","apa":"Altmeyer, S., Do, Y., & Ryu, S. (2017). Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. AIP Publishing. https://doi.org/10.1063/1.5002771","ieee":"S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow,” Chaos, vol. 27, no. 11. AIP Publishing, 2017."},"month":"11","file_date_updated":"2020-07-14T12:46:32Z","ddc":["530"],"oa_version":"Published Version","file":[{"file_name":"2017_Chaos_Altmeyer.pdf","relation":"main_file","creator":"dernst","file_size":7714020,"date_updated":"2020-07-14T12:46:32Z","access_level":"open_access","checksum":"0731f9d416760c1062db258ca51f8bdc","content_type":"application/pdf","file_id":"6970","date_created":"2019-10-24T15:14:30Z"}],"has_accepted_license":"1","article_processing_charge":"No","volume":27,"author":[{"orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","full_name":"Altmeyer, Sebastian","last_name":"Altmeyer"},{"full_name":"Do, Younghae","last_name":"Do","first_name":"Younghae"},{"first_name":"Soorok","full_name":"Ryu, Soorok","last_name":"Ryu"}],"title":"Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow","_id":"463","issue":"11","abstract":[{"lang":"eng","text":"We investigate transient behaviors induced by magnetic fields on the dynamics of the flow of a ferrofluid in the gap between two concentric, independently rotating cylinders. Without applying any magnetic fields, we uncover emergence of flow states constituted by a combination of a localized spiral state (SPIl) in the top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v) with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl + SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented, we observe the transient behaviors between multi-cell states passing through two critical thresholds in a strength of an axial (transverse) magnetic field. Before the first critical threshold of a magnetic field strength, multi-stable states with different number of cells could be observed. After the first critical threshold, we find the transient behavior between the three- and two-cell flow states. For more strength of magnetic field or after the second critical threshold, we discover that multi-cell states are disappeared and a localized spiral state remains to be stimulated. The studied transient behavior could be understood by the investigation of various quantities including a modal kinetic energy, a mode amplitude of the radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence of new flow states and the transient behavior between their states in ferrofluidic flows indicate that richer and potentially controllable dynamics through magnetic fields could be possible in ferrofluic flow."}],"doi":"10.1063/1.5002771","publication_identifier":{"issn":["10541500"]},"publication_status":"published","status":"public","department":[{"_id":"BjHo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7358","date_published":"2017-11-01T00:00:00Z","scopus_import":"1","date_created":"2018-12-11T11:46:37Z","intvolume":" 27","publisher":"AIP Publishing","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"year":"2017","publication":"Chaos","date_updated":"2024-02-28T13:02:12Z","article_type":"original","article_number":"113112"},{"related_material":{"record":[{"id":"1661","status":"public","relation":"earlier_version"}]},"article_number":"26","publication":"Logical Methods in Computer Science","date_updated":"2025-06-02T08:53:41Z","year":"2017","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":" 13","publisher":"International Federation of Computational Logic","external_id":{"arxiv":["1410.0833"]},"date_published":"2017-09-26T00:00:00Z","scopus_import":"1","date_created":"2018-12-11T11:46:37Z","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7357","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["1860-5974"]},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"issue":"3","abstract":[{"lang":"eng","text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years."}],"doi":"10.23638/LMCS-13(3:26)2017","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"title":"Improved algorithms for parity and Streett objectives","_id":"464","has_accepted_license":"1","article_processing_charge":"No","volume":13,"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"arxiv":1,"file":[{"date_updated":"2020-07-14T12:46:32Z","content_type":"application/pdf","checksum":"12d469ae69b80361333d7dead965cf5d","access_level":"open_access","creator":"system","relation":"main_file","file_size":582940,"file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z","file_id":"5010"}],"oa_version":"Published Version","day":"26","pubrep_id":"956","citation":{"ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017."},"month":"09","file_date_updated":"2020-07-14T12:46:32Z","ddc":["004"]},{"year":"2017","oa":1,"related_material":{"record":[{"id":"1610","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5438"}]},"date_updated":"2023-02-23T12:26:25Z","publication":"Logical Methods in Computer Science","scopus_import":1,"date_created":"2018-12-11T11:46:37Z","date_published":"2017-09-13T00:00:00Z","publist_id":"7356","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":" 13","publisher":"International Federation of Computational Logic","doi":"10.23638/LMCS-13(3:23)2017","issue":"3","abstract":[{"lang":"eng","text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. "}],"_id":"465","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"title":"Edit distance for pushdown automata","ec_funded":1,"publication_status":"published","status":"public","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"publication_identifier":{"issn":["18605974"]},"oa_version":"Published Version","month":"09","ddc":["004"],"file_date_updated":"2020-07-14T12:46:33Z","day":"13","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017"},"pubrep_id":"955","volume":13,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"file":[{"file_id":"5090","date_created":"2018-12-12T10:14:37Z","file_name":"IST-2015-321-v1+1_main.pdf","creator":"system","file_size":279071,"relation":"main_file","date_updated":"2020-07-14T12:46:33Z","access_level":"open_access","content_type":"application/pdf","checksum":"08041379ba408d40664f449eb5907a8f"},{"file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","relation":"main_file","file_size":279071,"creator":"system","date_updated":"2020-07-14T12:46:33Z","access_level":"open_access","checksum":"08041379ba408d40664f449eb5907a8f","content_type":"application/pdf","file_id":"5091","date_created":"2018-12-12T10:14:38Z"}]},{"doi":"10.23638/LMCS-13(2:15)2017","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"issue":"2","_id":"466","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zuzana","full_name":"Křetínská, Zuzana","last_name":"Křetínská"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"}],"ec_funded":1,"publication_status":"published","status":"public","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020"}],"publication_identifier":{"issn":["18605974"]},"oa_version":"Published Version","month":"07","file_date_updated":"2020-07-14T12:46:33Z","ddc":["004"],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017."},"pubrep_id":"957","day":"03","volume":13,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"file":[{"content_type":"application/pdf","checksum":"bfa405385ec6229ad5ead89ab5751639","access_level":"open_access","date_updated":"2020-07-14T12:46:33Z","creator":"system","file_size":511832,"relation":"main_file","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","date_created":"2018-12-12T10:18:32Z","file_id":"5354"}],"year":"2017","oa":1,"article_number":"15","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1657"},{"status":"public","relation":"earlier_version","id":"5429"},{"id":"5435","status":"public","relation":"earlier_version"}]},"date_updated":"2023-02-23T12:26:16Z","publication":"Logical Methods in Computer Science","date_created":"2018-12-11T11:46:38Z","scopus_import":1,"date_published":"2017-07-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7355","department":[{"_id":"KrCh"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"International Federation of Computational Logic","intvolume":" 13"},{"publication_identifier":{"issn":["15293785"]},"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication_status":"published","status":"public","ec_funded":1,"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"title":"Nested weighted automata","_id":"467","issue":"4","abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"doi":"10.1145/3152769","arxiv":1,"volume":18,"day":"01","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769."},"month":"12","oa_version":"Preprint","publication":"ACM Transactions on Computational Logic (TOCL)","date_updated":"2023-02-23T12:26:19Z","related_material":{"record":[{"id":"1656","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"}]},"article_number":"31","oa":1,"year":"2017","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"intvolume":" 18","publisher":"ACM","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7354","date_published":"2017-12-01T00:00:00Z","external_id":{"arxiv":["1606.03598"]},"scopus_import":1,"date_created":"2018-12-11T11:46:38Z"},{"doi":"10.1145/3072959.3073678","issue":"4","abstract":[{"text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.","lang":"eng"}],"_id":"470","author":[{"full_name":"Jeschke, Stefan","last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"title":"Water wave packets","ec_funded":1,"status":"public","publication_status":"published","project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"}],"publication_identifier":{"issn":["07300301"]},"oa_version":"Published Version","ddc":["006"],"file_date_updated":"2020-07-14T12:46:34Z","month":"07","day":"01","citation":{"chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017."},"article_processing_charge":"Yes (in subscription journal)","volume":36,"has_accepted_license":"1","file":[{"access_level":"open_access","content_type":"application/pdf","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","date_updated":"2020-07-14T12:46:34Z","file_name":"wavepackets_final.pdf","creator":"wojtan","relation":"main_file","file_size":13131683,"file_id":"7359","date_created":"2020-01-24T09:32:35Z"}],"year":"2017","oa":1,"article_type":"original","article_number":"103","date_updated":"2023-02-23T12:20:26Z","publication":"ACM Transactions on Graphics","acknowledged_ssus":[{"_id":"ScienComp"}],"scopus_import":1,"date_created":"2018-12-11T11:46:39Z","date_published":"2017-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7350","department":[{"_id":"ChWo"}],"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":" 36","publisher":"ACM"},{"author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"full_name":"Petrov, Tatjana","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","orcid":"0000-0002-9041-0905"}],"title":"Faster statistical model checking for unbounded temporal properties","_id":"471","issue":"2","abstract":[{"text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. ","lang":"eng"}],"doi":"10.1145/3060139","publication_identifier":{"issn":["15293785"]},"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","status":"public","ec_funded":1,"day":"01","citation":{"ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139."},"month":"05","oa_version":"Submitted Version","volume":18,"oa":1,"year":"2017","publication":"ACM Transactions on Computational Logic (TOCL)","date_updated":"2023-02-21T16:48:11Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1234"}]},"article_number":"12","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7349","date_published":"2017-05-01T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:46:39Z","intvolume":" 18","main_file_link":[{"url":"https://arxiv.org/abs/1504.05739","open_access":"1"}],"publisher":"ACM","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1"},{"oa":1,"year":"2017","date_updated":"2023-02-21T16:06:22Z","publication":"International Journal of Computational Geometry and Applications","page":"211 - 229","related_material":{"record":[{"id":"10892","relation":"earlier_version","status":"public"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7338","department":[{"_id":"HeEd"}],"scopus_import":1,"date_created":"2018-12-11T11:46:43Z","date_published":"2017-04-13T00:00:00Z","intvolume":" 26","publisher":"World Scientific Publishing","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","_id":"481","author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","full_name":"Huber, Stefan"},{"first_name":"Peter","last_name":"Palfrader","full_name":"Palfrader, Peter"}],"title":"Planar matchings for weighted straight skeletons","doi":"10.1142/S0218195916600050","issue":"3-4","abstract":[{"lang":"eng","text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","status":"public","publication_status":"published","ddc":["004","514","516"],"month":"04","file_date_updated":"2020-07-14T12:46:35Z","day":"13","pubrep_id":"949","citation":{"apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050."},"oa_version":"Published Version","file":[{"creator":"system","relation":"main_file","file_size":769296,"file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","content_type":"application/pdf","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:09:34Z","file_id":"4758"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":26,"has_accepted_license":"1"},{"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["10950761"]},"ec_funded":1,"publication_status":"published","status":"public","_id":"483","author":[{"first_name":"Paul","full_name":"Bourgade, Paul","last_name":"Bourgade"},{"last_name":"Erdös","full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"},{"full_name":"Yin, Jun","last_name":"Yin","first_name":"Jun"}],"title":"Universality for a class of random band matrices","doi":"10.4310/ATMP.2017.v21.n3.a5","issue":"3","abstract":[{"text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.","lang":"eng"}],"volume":21,"month":"08","day":"25","citation":{"chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800."},"oa_version":"Submitted Version","date_updated":"2021-01-12T08:00:57Z","publication":"Advances in Theoretical and Mathematical Physics","page":"739 - 800","oa":1,"year":"2017","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"intvolume":" 21","publisher":"International Press","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","publist_id":"7337","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"scopus_import":1,"date_created":"2018-12-11T11:46:43Z","date_published":"2017-08-25T00:00:00Z"},{"oa_version":"Submitted Version","month":"01","citation":{"chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738."},"day":"01","volume":21,"doi":"10.4310/ATMP.2017.v21.n3.a4","abstract":[{"text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.","lang":"eng"}],"issue":"3","_id":"484","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","author":[{"first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam","full_name":"Nam, Phan"},{"last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"status":"public","publication_status":"published","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"publication_identifier":{"issn":["10950761"]},"date_created":"2018-12-11T11:46:43Z","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","publist_id":"7336","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"International Press","intvolume":" 21","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.04631"}],"year":"2017","oa":1,"page":"683 - 738","date_updated":"2021-01-12T08:00:58Z","publication":"Advances in Theoretical and Mathematical Physics"},{"publication":"Optics InfoBase Conference Papers","publication_identifier":{"isbn":["978-155752820-9"]},"date_updated":"2023-10-17T12:15:38Z","publication_status":"published","status":"public","article_number":"NM3A.1","title":"Single sideband microwave to optical photon conversion-an-electro-optic-realization","author":[{"orcid":"0000-0001-6249-5860","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","last_name":"Rueda Sanchez","full_name":"Rueda Sanchez, Alfredo R"},{"last_name":"Sedlmeir","full_name":"Sedlmeir, Florian","first_name":"Florian"},{"first_name":"Michele","full_name":"Collodo, Michele","last_name":"Collodo"},{"first_name":"Ulrich","last_name":"Vogl","full_name":"Vogl, Ulrich"},{"last_name":"Stiller","full_name":"Stiller, Birgit","first_name":"Birgit"},{"first_name":"Gerhard","full_name":"Schunk, Gerhard","last_name":"Schunk"},{"first_name":"Dmitry","full_name":"Strekalov, Dmitry","last_name":"Strekalov"},{"full_name":"Marquardt, Christoph","last_name":"Marquardt","first_name":"Christoph"},{"full_name":"Fink, Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","orcid":"0000-0001-8112-028X"},{"last_name":"Painter","full_name":"Painter, Oskar","first_name":"Oskar"},{"first_name":"Gerd","full_name":"Leuchs, Gerd","last_name":"Leuchs"},{"full_name":"Schwefel, Harald","last_name":"Schwefel","first_name":"Harald"}],"_id":"485","abstract":[{"text":"We present results on nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band with more than 0.1% photon number conversion efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator","lang":"eng"}],"year":"2017","doi":"10.1364/NLO.2017.NM3A.1","publisher":"Optica Publishing Group","volume":"F54","article_processing_charge":"No","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","citation":{"chicago":"Rueda Sanchez, Alfredo R, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” In Optics InfoBase Conference Papers, Vol. F54. Optica Publishing Group, 2017. https://doi.org/10.1364/NLO.2017.NM3A.1.","mla":"Rueda Sanchez, Alfredo R., et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” Optics InfoBase Conference Papers, vol. F54, NM3A.1, Optica Publishing Group, 2017, doi:10.1364/NLO.2017.NM3A.1.","ista":"Rueda Sanchez AR, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2017. Single sideband microwave to optical photon conversion-an-electro-optic-realization. Optics InfoBase Conference Papers. NLO: Nonlinear Optics vol. F54, NM3A.1.","ama":"Rueda Sanchez AR, Sedlmeir F, Collodo M, et al. Single sideband microwave to optical photon conversion-an-electro-optic-realization. In: Optics InfoBase Conference Papers. Vol F54. Optica Publishing Group; 2017. doi:10.1364/NLO.2017.NM3A.1","short":"A.R. Rueda Sanchez, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optics InfoBase Conference Papers, Optica Publishing Group, 2017.","apa":"Rueda Sanchez, A. R., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2017). Single sideband microwave to optical photon conversion-an-electro-optic-realization. In Optics InfoBase Conference Papers (Vol. F54). Waikoloa, HI, United States: Optica Publishing Group. https://doi.org/10.1364/NLO.2017.NM3A.1","ieee":"A. R. Rueda Sanchez et al., “Single sideband microwave to optical photon conversion-an-electro-optic-realization,” in Optics InfoBase Conference Papers, Waikoloa, HI, United States, 2017, vol. F54."},"department":[{"_id":"JoFi"}],"day":"01","publist_id":"7335","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-07-01T00:00:00Z","oa_version":"None","date_created":"2018-12-11T11:46:44Z","scopus_import":"1","conference":{"location":"Waikoloa, HI, United States","start_date":"2017-07-17","end_date":"2017-07-21","name":"NLO: Nonlinear Optics"}},{"volume":36,"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"4836","date_created":"2018-12-12T10:10:46Z","date_updated":"2020-07-14T12:46:35Z","access_level":"open_access","content_type":"application/pdf","checksum":"48386fa6956c3645fc89594dc898b147","file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","creator":"system","relation":"main_file","file_size":107349827},{"file_id":"7189","date_created":"2019-12-16T14:48:57Z","access_level":"open_access","checksum":"21c89c28fb8d70f6602f752bf997aa0f","content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","file_name":"ElekSumin2017SGA_reduced_file_size.pdf","creator":"bbickel","relation":"main_file","file_size":4683145}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:35Z","ddc":["003","000","005"],"month":"11","citation":{"ieee":"O. Elek et al., “Scattering-aware texture reproduction for 3D printing,” ACM Transactions on Graphics, vol. 36, no. 6. ACM, 2017.","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3130800.3130890","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 2017;36(6). doi:10.1145/3130800.3130890","short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","ista":"Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 36(6), 241.","mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics, vol. 36, no. 6, 241, ACM, 2017, doi:10.1145/3130800.3130890.","chicago":"Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3130800.3130890."},"pubrep_id":"1052","day":"20","ec_funded":1,"publication_status":"published","status":"public","project":[{"name":"Distributed 3D Object Design","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841"},{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"publication_identifier":{"issn":["07300301"]},"doi":"10.1145/3130800.3130890","abstract":[{"lang":"eng","text":"Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut."}],"issue":"6","_id":"486","title":"Scattering-aware texture reproduction for 3D printing","author":[{"full_name":"Elek, Oskar","last_name":"Elek","first_name":"Oskar"},{"full_name":"Sumin, Denis","last_name":"Sumin","first_name":"Denis"},{"full_name":"Zhang, Ran","last_name":"Zhang","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","first_name":"Ran","orcid":"0000-0002-3808-281X"},{"first_name":"Tim","full_name":"Weyrich, Tim","last_name":"Weyrich"},{"full_name":"Myszkowski, Karol","last_name":"Myszkowski","first_name":"Karol"},{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"full_name":"Wilkie, Alexander","last_name":"Wilkie","first_name":"Alexander"},{"full_name":"Krivanek, Jaroslav","last_name":"Krivanek","first_name":"Jaroslav"}],"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"ACM","intvolume":" 36","date_created":"2018-12-11T11:46:44Z","scopus_import":1,"date_published":"2017-11-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7334","department":[{"_id":"BeBi"}],"article_number":"241","article_type":"original","related_material":{"record":[{"id":"8386","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-09-07T13:11:15Z","publication":"ACM Transactions on Graphics","year":"2017","oa":1},{"conference":{"start_date":"2017-12-12","location":"Incheon, South Korea","end_date":"2017-12-15","name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies"},"scopus_import":1,"oa_version":"None","date_created":"2018-12-11T11:46:45Z","date_published":"2017-11-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","publist_id":"7333","department":[{"_id":"DaAl"}],"day":"28","citation":{"ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.","ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.","apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367","mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367."},"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"ACM","doi":"10.1145/3143361.3143367","year":"2017","abstract":[{"lang":"eng","text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x."}],"_id":"487","author":[{"first_name":"Ghufran","full_name":"Baig, Ghufran","last_name":"Baig"},{"first_name":"Bozidar","full_name":"Radunovic, Bozidar","last_name":"Radunovic"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Matthew","last_name":"Balkwill","full_name":"Balkwill, Matthew"},{"first_name":"Thomas","last_name":"Karagiannis","full_name":"Karagiannis, Thomas"},{"first_name":"Lili","full_name":"Qiu, Lili","last_name":"Qiu"}],"title":"Towards unlicensed cellular networks in TV white spaces","page":"2 - 14","status":"public","publication_status":"published","date_updated":"2023-02-23T12:21:11Z","publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","publication_identifier":{"isbn":["978-145035422-6"]}},{"year":"2017","oa":1,"related_material":{"record":[{"id":"5449","status":"public","relation":"earlier_version"}]},"article_number":"82","publication":"Scientific Reports","date_updated":"2023-02-23T12:26:57Z","date_published":"2017-03-06T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:46:53Z","department":[{"_id":"KrCh"}],"publist_id":"7307","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":" 7","publisher":"Nature Publishing Group","issue":"1","abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. ","lang":"eng"}],"doi":"10.1038/s41598-017-00107-w","author":[{"orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"},{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"title":"Amplification on undirected population structures: Comets beat stars","_id":"512","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["20452322"]},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"oa_version":"Published Version","day":"06","citation":{"ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w."},"pubrep_id":"938","ddc":["004"],"file_date_updated":"2020-07-14T12:46:36Z","month":"03","has_accepted_license":"1","volume":7,"article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","relation":"main_file","file_size":1536783,"creator":"system","access_level":"open_access","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","content_type":"application/pdf","date_updated":"2020-07-14T12:46:36Z","file_id":"5357","date_created":"2018-12-12T10:18:35Z"}]},{"author":[{"orcid":"0000-0003-1740-7635","last_name":"Klotz","full_name":"Klotz, Lukasz","first_name":"Lukasz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","last_name":"Lemoult","full_name":"Lemoult, Grégoire M"},{"last_name":"Frontczak","full_name":"Frontczak, Idalia","first_name":"Idalia"},{"first_name":"Laurette","full_name":"Tuckerman, Laurette","last_name":"Tuckerman"},{"first_name":"José","last_name":"Wesfreid","full_name":"Wesfreid, José"}],"title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","oa":1,"_id":"513","year":"2017","issue":"4","abstract":[{"text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction.","lang":"eng"}],"doi":"10.1103/PhysRevFluids.2.043904","publication":"Physical Review Fluids","date_updated":"2021-01-12T08:01:16Z","status":"public","publication_status":"published","article_number":"043904","day":"01","department":[{"_id":"BjHo"}],"citation":{"chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids. American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904.","apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","publist_id":"7306","date_published":"2017-04-01T00:00:00Z","scopus_import":1,"oa_version":"Preprint","date_created":"2018-12-11T11:46:54Z","main_file_link":[{"url":"https://arxiv.org/abs/1704.02619","open_access":"1"}],"intvolume":" 2","publisher":"American Physical Society","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","volume":2}]