[{"publication_status":"published","abstract":[{"text":"Pancreatic cancer has a five-year survival rate of ~8%, with characteristic molecular heterogeneity and restricted treatment options. Targeting metabolism has emerged as a potentially effective therapeutic strategy for cancers such as pancreatic cancer, which are driven by genetic alterations that are not tractable drug targets. Although somatic mitochondrial genome (mtDNA) mutations have been observed in various tumors types, understanding of metabolic genotype-phenotype relationships is limited.","lang":"eng"}],"ddc":["570"],"oa":1,"_id":"443","title":"Mitochondrial mutations and metabolic adaptation in pancreatic cancer","publication":"Cancer & Metabolism","year":"2017","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"extern":"1","quality_controlled":"1","author":[{"last_name":"Hardie","first_name":"Rae","full_name":"Hardie, Rae"},{"full_name":"Van Dam, Ellen","first_name":"Ellen","last_name":"Van Dam"},{"full_name":"Cowley, Mark","first_name":"Mark","last_name":"Cowley"},{"last_name":"Han","first_name":"Ting","full_name":"Han, Ting"},{"first_name":"Seher","last_name":"Balaban","full_name":"Balaban, Seher"},{"last_name":"Pajic","first_name":"Marina","full_name":"Pajic, Marina"},{"last_name":"Pinese","first_name":"Mark","full_name":"Pinese, Mark"},{"full_name":"Iconomou, Mary","first_name":"Mary","last_name":"Iconomou"},{"full_name":"Shearer, Robert","first_name":"Robert","last_name":"Shearer"},{"full_name":"Mckenna, Jessie","first_name":"Jessie","last_name":"Mckenna"},{"last_name":"Miller","first_name":"David","full_name":"Miller, David"},{"full_name":"Waddell, Nicola","last_name":"Waddell","first_name":"Nicola"},{"first_name":"John","last_name":"Pearson","full_name":"Pearson, John"},{"first_name":"Sean","last_name":"Grimmond","full_name":"Grimmond, Sean"},{"last_name":"Sazanov","first_name":"Leonid A","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andrew","last_name":"Biankin","full_name":"Biankin, Andrew"},{"last_name":"Villas Boas","first_name":"Silas","full_name":"Villas Boas, Silas"},{"full_name":"Hoy, Andrew","last_name":"Hoy","first_name":"Andrew"},{"last_name":"Turner","first_name":"Nigel","full_name":"Turner, Nigel"},{"full_name":"Saunders, Darren","first_name":"Darren","last_name":"Saunders"}],"citation":{"apa":"Hardie, R., Van Dam, E., Cowley, M., Han, T., Balaban, S., Pajic, M., … Saunders, D. (2017). Mitochondrial mutations and metabolic adaptation in pancreatic cancer. <i>Cancer &#38; Metabolism</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s40170-017-0164-1\">https://doi.org/10.1186/s40170-017-0164-1</a>","mla":"Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” <i>Cancer &#38; Metabolism</i>, vol. 5, no. 2, BioMed Central, 2017, doi:<a href=\"https://doi.org/10.1186/s40170-017-0164-1\">10.1186/s40170-017-0164-1</a>.","chicago":"Hardie, Rae, Ellen Van Dam, Mark Cowley, Ting Han, Seher Balaban, Marina Pajic, Mark Pinese, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” <i>Cancer &#38; Metabolism</i>. BioMed Central, 2017. <a href=\"https://doi.org/10.1186/s40170-017-0164-1\">https://doi.org/10.1186/s40170-017-0164-1</a>.","short":"R. Hardie, E. Van Dam, M. Cowley, T. Han, S. Balaban, M. Pajic, M. Pinese, M. Iconomou, R. Shearer, J. Mckenna, D. Miller, N. Waddell, J. Pearson, S. Grimmond, L.A. Sazanov, A. Biankin, S. Villas Boas, A. Hoy, N. Turner, D. Saunders, Cancer &#38; Metabolism 5 (2017).","ista":"Hardie R, Van Dam E, Cowley M, Han T, Balaban S, Pajic M, Pinese M, Iconomou M, Shearer R, Mckenna J, Miller D, Waddell N, Pearson J, Grimmond S, Sazanov LA, Biankin A, Villas Boas S, Hoy A, Turner N, Saunders D. 2017. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer &#38; Metabolism. 5(2).","ieee":"R. Hardie <i>et al.</i>, “Mitochondrial mutations and metabolic adaptation in pancreatic cancer,” <i>Cancer &#38; Metabolism</i>, vol. 5, no. 2. BioMed Central, 2017.","ama":"Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. <i>Cancer &#38; Metabolism</i>. 2017;5(2). doi:<a href=\"https://doi.org/10.1186/s40170-017-0164-1\">10.1186/s40170-017-0164-1</a>"},"status":"public","date_created":"2018-12-11T11:46:30Z","month":"01","publist_id":"7380","intvolume":"         5","publisher":"BioMed Central","file_date_updated":"2020-07-14T12:46:29Z","issue":"2","volume":5,"doi":"10.1186/s40170-017-0164-1","language":[{"iso":"eng"}],"has_accepted_license":"1","day":"30","type":"journal_article","date_updated":"2021-01-12T07:56:55Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-01-30T00:00:00Z","file":[{"relation":"main_file","date_created":"2019-01-22T08:17:56Z","file_size":1609174,"creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:46:29Z","file_id":"5868","checksum":"337a65786875f64a1fe9fc0ac24767dc","file_name":"2017_Cancer_Hardie.pdf","access_level":"open_access"}]},{"publisher":"Royal Society of Chemistry","editor":[{"full_name":"Wikström, Mårten","last_name":"Wikström","first_name":"Mårten"}],"page":"25 - 59","date_published":"2017-11-29T00:00:00Z","status":"public","date_created":"2018-12-11T11:46:30Z","month":"11","publication_identifier":{"isbn":["978-1-78262-865-1"]},"publist_id":"7379","day":"29","year":"2017","type":"book_chapter","date_updated":"2021-01-12T07:56:59Z","series_title":"Mechanisms of Primary Energy Transduction in Biology ","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","first_name":"Leonid A"}],"citation":{"apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), <i>Mechanisms of primary energy transduction in biology </i> (pp. 25–59). Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/9781788010405-00025\">https://doi.org/10.1039/9781788010405-00025</a>","mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” <i>Mechanisms of Primary Energy Transduction in Biology </i>, edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:<a href=\"https://doi.org/10.1039/9781788010405-00025\">10.1039/9781788010405-00025</a>.","ista":"Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction in biology . , 25–59.","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In <i>Mechanisms of Primary Energy Transduction in Biology </i>, edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/9781788010405-00025\">https://doi.org/10.1039/9781788010405-00025</a>.","ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. <i>Mechanisms of Primary Energy Transduction in Biology </i>. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:<a href=\"https://doi.org/10.1039/9781788010405-00025\">10.1039/9781788010405-00025</a>","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in <i>Mechanisms of primary energy transduction in biology </i>, M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59."},"publication_status":"published","abstract":[{"text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy generation, contributing to the proton motive force used to produce ATP. It couples the transfer of two electrons between NADH and quinone to translocation of four protons across the membrane. It is the largest protein assembly of bacterial and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size, providing the important “minimal” model of complex I. The l-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. Previously, we have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane domain from Escherichia coli, followed by the atomic structure of intact, entire complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are well conserved from the bacterial version, whilst supernumerary subunits form an interlinked, stabilizing shell around the core. Subunits containing additional cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The structure of mammalian enzyme provides many insights into complex I mechanism, assembly, maturation and dysfunction, allowing detailed molecular analysis of disease-causing mutations.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1039/9781788010405-00025","department":[{"_id":"LeSa"}],"_id":"444","title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions","publication":"Mechanisms of primary energy transduction in biology "},{"date_updated":"2021-01-12T07:57:03Z","type":"journal_article","year":"2017","day":"12","citation":{"ieee":"M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 96, no. 1. American Physical Society, 2017.","ama":"Serbyn M, Abanin D. Loschmidt echo in many body localized phases. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2017;96(1). doi:<a href=\"https://doi.org/10.1103/PhysRevB.96.014202\">10.1103/PhysRevB.96.014202</a>","ista":"Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 96(1).","chicago":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevB.96.014202\">https://doi.org/10.1103/PhysRevB.96.014202</a>.","short":"M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials Physics 96 (2017).","apa":"Serbyn, M., &#38; Abanin, D. (2017). Loschmidt echo in many body localized phases. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.96.014202\">https://doi.org/10.1103/PhysRevB.96.014202</a>","mla":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 96, no. 1, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevB.96.014202\">10.1103/PhysRevB.96.014202</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/1701.07772","open_access":"1"}],"extern":1,"author":[{"last_name":"Serbyn","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","full_name":"Maksym Serbyn","orcid":"0000-0002-2399-5827"},{"full_name":"Abanin, Dimitry A","first_name":"Dimitry","last_name":"Abanin"}],"quality_controlled":0,"acknowledgement":"This research was supported in part by the National\nScience Foundation under Grant No. NSF PHY11-25915.\nM.S. was supported by Gordon and Betty Moore Foundation’s\nEPiQS Initiative through Grant No. GBMF4307. D.A. also\nacknowledges support by Swiss National Science Foundation.","abstract":[{"text":"The Loschmidt echo, defined as the overlap between quantum wave function evolved with different Hamiltonians, quantifies the sensitivity of quantum dynamics to perturbations and is often used as a probe of quantum chaos. In this work we consider the behavior of the Loschmidt echo in the many-body localized phase, which is characterized by emergent local integrals of motion and provides a generic example of nonergodic dynamics. We demonstrate that the fluctuations of the Loschmidt echo decay as a power law in time in the many-body localized phase, in contrast to the exponential decay in few-body ergodic systems. We consider the spin-echo generalization of the Loschmidt echo and argue that the corresponding correlation function saturates to a finite value in localized systems. Slow, power-law decay of fluctuations of such spin-echo-type overlap is related to the operator spreading and is present only in the many-body localized phase, but not in a noninteracting Anderson insulator. While most of the previously considered probes of dephasing dynamics could be understood by approximating physical spin operators with local integrals of motion, the Loschmidt echo and its generalizations crucially depend on the full expansion of the physical operators via local integrals of motion operators, as well as operators which flip local integrals of motion. Hence these probes allow one to get insights into the relation between physical operators and local integrals of motion and access the operator spreading in the many-body localized phase.","lang":"eng"}],"publication_status":"published","title":"Loschmidt echo in many body localized phases","publication":"Physical Review B - Condensed Matter and Materials Physics","_id":"445","oa":1,"doi":"10.1103/PhysRevB.96.014202","publisher":"American Physical Society","date_published":"2017-07-12T00:00:00Z","volume":96,"issue":"1","month":"07","date_created":"2018-12-11T11:46:31Z","status":"public","intvolume":"        96","publist_id":"7378"},{"title":"Fluctuations of the competition interface in presence of shocks","publication":"Revista Latino-Americana de Probabilidade e Estatística","oa":1,"_id":"447","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","abstract":[{"text":"We consider last passage percolation (LPP) models with exponentially distributed random variables, which are linked to the totally asymmetric simple exclusion process (TASEP). The competition interface for LPP was introduced and studied in Ferrari and Pimentel (2005a) for cases where the corresponding exclusion process had a rarefaction fan. Here we consider situations with a shock and determine the law of the fluctuations of the competition interface around its deter- ministic law of large number position. We also study the multipoint distribution of the LPP around the shock, extending our one-point result of Ferrari and Nejjar (2015).","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://alea.impa.br/articles/v14/14-17.pdf"}],"citation":{"chicago":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” <i>Revista Latino-Americana de Probabilidade e Estatística</i>. Instituto Nacional de Matematica Pura e Aplicada, 2017. <a href=\"https://doi.org/10.30757/ALEA.v14-17\">https://doi.org/10.30757/ALEA.v14-17</a>.","short":"P. Ferrari, P. Nejjar, Revista Latino-Americana de Probabilidade e Estatística 9 (2017) 299–325.","ista":"Ferrari P, Nejjar P. 2017. Fluctuations of the competition interface in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística. 9, 299–325.","ieee":"P. Ferrari and P. Nejjar, “Fluctuations of the competition interface in presence of shocks,” <i>Revista Latino-Americana de Probabilidade e Estatística</i>, vol. 9. Instituto Nacional de Matematica Pura e Aplicada, pp. 299–325, 2017.","ama":"Ferrari P, Nejjar P. Fluctuations of the competition interface in presence of shocks. <i>Revista Latino-Americana de Probabilidade e Estatística</i>. 2017;9:299-325. doi:<a href=\"https://doi.org/10.30757/ALEA.v14-17\">10.30757/ALEA.v14-17</a>","apa":"Ferrari, P., &#38; Nejjar, P. (2017). Fluctuations of the competition interface in presence of shocks. <i>Revista Latino-Americana de Probabilidade e Estatística</i>. Instituto Nacional de Matematica Pura e Aplicada. <a href=\"https://doi.org/10.30757/ALEA.v14-17\">https://doi.org/10.30757/ALEA.v14-17</a>","mla":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” <i>Revista Latino-Americana de Probabilidade e Estatística</i>, vol. 9, Instituto Nacional de Matematica Pura e Aplicada, 2017, pp. 299–325, doi:<a href=\"https://doi.org/10.30757/ALEA.v14-17\">10.30757/ALEA.v14-17</a>."},"quality_controlled":"1","author":[{"full_name":"Ferrari, Patrik","last_name":"Ferrari","first_name":"Patrik"},{"last_name":"Nejjar","first_name":"Peter","full_name":"Nejjar, Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87"}],"year":"2017","intvolume":"         9","publist_id":"7376","date_created":"2018-12-11T11:46:31Z","month":"03","status":"public","volume":9,"article_type":"original","publisher":"Instituto Nacional de Matematica Pura e Aplicada","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.30757/ALEA.v14-17","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"journal_article","date_updated":"2023-10-10T13:10:32Z","oa_version":"Submitted Version","day":"23","scopus_import":"1","date_published":"2017-03-23T00:00:00Z","page":"299 - 325"},{"citation":{"mla":"Bächer, Moritz, et al. “Spin It: Optimizing Moment of Inertia for Spinnable Objects.” <i>Communications of the ACM</i>, vol. 60, no. 8, ACM, 2017, pp. 92–99, doi:<a href=\"https://doi.org/10.1145/3068766\">10.1145/3068766</a>.","apa":"Bächer, M., Bickel, B., Whiting, E., &#38; Sorkine Hornung, O. (2017). Spin it: Optimizing moment of inertia for spinnable objects. <i>Communications of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3068766\">https://doi.org/10.1145/3068766</a>","ista":"Bächer M, Bickel B, Whiting E, Sorkine Hornung O. 2017. Spin it: Optimizing moment of inertia for spinnable objects. Communications of the ACM. 60(8), 92–99.","chicago":"Bächer, Moritz, Bernd Bickel, Emily Whiting, and Olga Sorkine Hornung. “Spin It: Optimizing Moment of Inertia for Spinnable Objects.” <i>Communications of the ACM</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3068766\">https://doi.org/10.1145/3068766</a>.","short":"M. Bächer, B. Bickel, E. Whiting, O. Sorkine Hornung, Communications of the ACM 60 (2017) 92–99.","ama":"Bächer M, Bickel B, Whiting E, Sorkine Hornung O. Spin it: Optimizing moment of inertia for spinnable objects. <i>Communications of the ACM</i>. 2017;60(8):92-99. doi:<a href=\"https://doi.org/10.1145/3068766\">10.1145/3068766</a>","ieee":"M. Bächer, B. Bickel, E. Whiting, and O. Sorkine Hornung, “Spin it: Optimizing moment of inertia for spinnable objects,” <i>Communications of the ACM</i>, vol. 60, no. 8. ACM, pp. 92–99, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"first_name":"Moritz","last_name":"Bächer","full_name":"Bächer, Moritz"},{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel"},{"full_name":"Whiting, Emily","last_name":"Whiting","first_name":"Emily"},{"first_name":"Olga","last_name":"Sorkine Hornung","full_name":"Sorkine Hornung, Olga"}],"type":"journal_article","date_updated":"2022-03-18T12:55:28Z","oa_version":"None","day":"01","year":"2017","publication":"Communications of the ACM","title":"Spin it: Optimizing moment of inertia for spinnable objects","doi":"10.1145/3068766","language":[{"iso":"eng"}],"_id":"452","acknowledgement":"This project was supported in part by the ERC Starting Grant iModel (StG-2012-306877). Emily Whiting was supported by the ETH Zurich/Marie Curie COFUND Postdoctoral Fellowship. \r\nFirst and foremost, we would like to thank our editor Steve Marschner for his invaluable feedback. We were fortunate to get further help from Maurizio Nitti for model design, Romain Prévost for Make-It-Stand comparisons, Alexander Sorkine-Hornung, Kaan Yücer, and Changil Kim for video and photo assistance, Ronnie Gänsli for metal casting, Alec Jacobson for the posed Elephant and Armadillo models, and Romain Prévost and Amit Bermano for print preparation. Model sources include: Woven Ring: generated by “Sculpture Generator 1” by Carlo H. Séquin, UC Berkeley; Elephant: De Espona model library, courtesy of Robert Sumner; T-Rex: TurboSquid; Armadillo: Stanford Computer Graphics Laboratory; and Utah Teapot: Martin Newell, University of Utah. ","publication_status":"published","abstract":[{"lang":"eng","text":"Spinning tops and yo-yos have long fascinated cultures around the world with their unexpected, graceful motions that seemingly elude gravity. Yet, due to the exceeding difficulty of creating stably spinning objects of asymmetric shape in a manual trial-and-error process, there has been little departure from rotationally symmetric designs. With modern 3D printing technologies, however, we can manufacture shapes of almost unbounded complexity at the press of a button, shifting this design complexity toward computation. In this article, we describe an algorithm to generate designs for spinning objects by optimizing their mass distribution: as input, the user provides a solid 3D model and a desired axis of rotation. Our approach then modifies the interior mass distribution such that the principal directions of the moment of inertia align with the target rotation frame. To create voids inside the model, we represent its volume with an adaptive multiresolution voxelization and optimize the discrete voxel fill values using a continuous, nonlinear formulation. We further optimize for rotational stability by maximizing the dominant principal moment. Our method is well-suited for a variety of 3D printed models, ranging from characters to abstract shapes. We demonstrate tops and yo-yos that spin surprisingly stably despite their asymmetric appearance."}],"date_published":"2017-08-01T00:00:00Z","volume":60,"issue":"8","page":"92 - 99","publisher":"ACM","intvolume":"        60","publist_id":"7370","scopus_import":"1","date_created":"2018-12-11T11:46:33Z","month":"08","status":"public"},{"status":"public","month":"11","date_created":"2018-12-11T11:46:33Z","publist_id":"7369","intvolume":"       113","publisher":"Biophysical Society","article_type":"original","file_date_updated":"2020-07-14T12:46:31Z","pubrep_id":"965","issue":"9","volume":113,"abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"publication_status":"published","_id":"453","ddc":["570"],"oa":1,"title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","publication":"Biophysical Journal","year":"2017","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","author":[{"last_name":"Fallesen","first_name":"Todd","full_name":"Fallesen, Todd"},{"full_name":"Roostalu, Johanna","first_name":"Johanna","last_name":"Roostalu"},{"first_name":"Christian F","last_name":"Düllberg","orcid":"0000-0001-6335-9748","full_name":"Düllberg, Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gunnar","last_name":"Pruessner","full_name":"Pruessner, Gunnar"},{"first_name":"Thomas","last_name":"Surrey","full_name":"Surrey, Thomas"}],"citation":{"mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>.","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., &#38; Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>. Biophysical Society, 2017. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” <i>Biophysical Journal</i>, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. 2017;113(9):2055-2067. doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>"},"page":"2055 - 2067","file":[{"file_size":977192,"content_type":"application/pdf","creator":"system","relation":"main_file","date_created":"2018-12-12T10:14:03Z","checksum":"99a2474088e20ac74b1882c4fbbb45b1","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:31Z","file_id":"5052"}],"date_published":"2017-11-07T00:00:00Z","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","has_accepted_license":"1","department":[{"_id":"MaLo"}],"doi":"10.1016/j.bpj.2017.09.006","language":[{"iso":"eng"}],"day":"07","oa_version":"Published Version","type":"journal_article","date_updated":"2021-01-12T07:59:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No"},{"file":[{"file_name":"IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf","checksum":"4919baf9050415ca151fe22497379f78","access_level":"open_access","file_id":"5175","date_updated":"2020-07-14T12:46:32Z","content_type":"application/pdf","creator":"system","file_size":1711131,"relation":"main_file","date_created":"2018-12-12T10:15:52Z"}],"date_published":"2017-04-04T00:00:00Z","page":"105 - 116","publication_identifier":{"issn":["2366-2875"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","type":"journal_article","date_updated":"2023-10-17T12:28:13Z","day":"04","department":[{"_id":"SyCr"}],"has_accepted_license":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","language":[{"iso":"eng"}],"pubrep_id":"962","volume":46,"file_date_updated":"2020-07-14T12:46:32Z","publisher":"Verlag Dr. Friedrich Pfeil","intvolume":"        46","publist_id":"7362","month":"04","date_created":"2018-12-11T11:46:35Z","status":"public","citation":{"apa":"Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. <i>Rundgespräche Forum Ökologie</i>. Verlag Dr. Friedrich Pfeil.","mla":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” <i>Rundgespräche Forum Ökologie</i>, vol. 46, Verlag Dr. Friedrich Pfeil, 2017, pp. 105–16.","ama":"Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. <i>Rundgespräche Forum Ökologie</i>. 2017;46:105-116.","ieee":"S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern,” <i>Rundgespräche Forum Ökologie</i>, vol. 46. Verlag Dr. Friedrich Pfeil, pp. 105–116, 2017.","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.","short":"S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116.","chicago":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” <i>Rundgespräche Forum Ökologie</i>. Verlag Dr. Friedrich Pfeil, 2017."},"quality_controlled":"1","author":[{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","first_name":"Sylvia"}],"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"year":"2017","title":"Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern","publication":"Rundgespräche Forum Ökologie","_id":"459","ddc":["592"],"oa":1,"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."}],"publication_status":"published"},{"publist_id":"7358","intvolume":"        27","article_number":"113112","status":"public","date_created":"2018-12-11T11:46:37Z","month":"11","volume":27,"issue":"11","article_type":"original","publisher":"AIP Publishing","file_date_updated":"2020-07-14T12:46:32Z","oa":1,"ddc":["530"],"_id":"463","title":"Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow","publication":"Chaos","publication_status":"published","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."}],"quality_controlled":"1","author":[{"first_name":"Sebastian","last_name":"Altmeyer","full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Younghae","last_name":"Do","full_name":"Do, Younghae"},{"last_name":"Ryu","first_name":"Soorok","full_name":"Ryu, Soorok"}],"citation":{"short":"S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017).","chicago":"Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” <i>Chaos</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.5002771\">https://doi.org/10.1063/1.5002771</a>.","ista":"Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.","ama":"Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. <i>Chaos</i>. 2017;27(11). doi:<a href=\"https://doi.org/10.1063/1.5002771\">10.1063/1.5002771</a>","ieee":"S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow,” <i>Chaos</i>, vol. 27, no. 11. AIP Publishing, 2017.","mla":"Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” <i>Chaos</i>, vol. 27, no. 11, 113112, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.5002771\">10.1063/1.5002771</a>.","apa":"Altmeyer, S., Do, Y., &#38; Ryu, S. (2017). Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. <i>Chaos</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5002771\">https://doi.org/10.1063/1.5002771</a>"},"year":"2017","publication_identifier":{"issn":["10541500"]},"scopus_import":"1","date_published":"2017-11-01T00:00:00Z","file":[{"relation":"main_file","date_created":"2019-10-24T15:14:30Z","file_size":7714020,"content_type":"application/pdf","creator":"dernst","file_id":"6970","date_updated":"2020-07-14T12:46:32Z","checksum":"0731f9d416760c1062db258ca51f8bdc","file_name":"2017_Chaos_Altmeyer.pdf","access_level":"open_access"}],"language":[{"iso":"eng"}],"doi":"10.1063/1.5002771","department":[{"_id":"BjHo"}],"has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","type":"journal_article","date_updated":"2024-02-28T13:02:12Z","oa_version":"Published Version"},{"year":"2017","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>.","apa":"Chatterjee, K., Henzinger, M. H., &#38; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26."},"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."}],"publication_status":"published","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"_id":"464","related_material":{"record":[{"id":"1661","status":"public","relation":"earlier_version"}]},"oa":1,"ddc":["004"],"title":"Improved algorithms for parity and Streett objectives","publication":"Logical Methods in Computer Science","publisher":"International Federation of Computational Logic","file_date_updated":"2020-07-14T12:46:32Z","pubrep_id":"956","volume":13,"issue":"3","article_number":"26","status":"public","month":"09","date_created":"2018-12-11T11:46:37Z","publist_id":"7357","intvolume":"        13","day":"26","oa_version":"Published Version","type":"journal_article","date_updated":"2025-06-02T08:53:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(3:26)2017","ec_funded":1,"file":[{"file_size":582940,"creator":"system","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:13:27Z","checksum":"12d469ae69b80361333d7dead965cf5d","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","access_level":"open_access","file_id":"5010","date_updated":"2020-07-14T12:46:32Z"}],"external_id":{"arxiv":["1410.0833"]},"date_published":"2017-09-26T00:00:00Z","arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["1860-5974"]}},{"ec_funded":1,"doi":"10.23638/LMCS-13(3:23)2017","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"journal_article","date_updated":"2023-02-23T12:26:25Z","oa_version":"Published Version","day":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["18605974"]},"scopus_import":1,"date_published":"2017-09-13T00:00:00Z","file":[{"date_created":"2018-12-12T10:14:37Z","relation":"main_file","file_size":279071,"content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:33Z","file_id":"5090","access_level":"open_access","file_name":"IST-2015-321-v1+1_main.pdf","checksum":"08041379ba408d40664f449eb5907a8f"},{"file_id":"5091","date_updated":"2020-07-14T12:46:33Z","checksum":"08041379ba408d40664f449eb5907a8f","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:38Z","file_size":279071,"creator":"system","content_type":"application/pdf"}],"project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","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. "}],"publication":"Logical Methods in Computer Science","title":"Edit distance for pushdown automata","oa":1,"ddc":["004"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1610"},{"status":"public","relation":"earlier_version","id":"5438"}]},"_id":"465","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"year":"2017","citation":{"mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>.","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)."},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"quality_controlled":"1","date_created":"2018-12-11T11:46:37Z","month":"09","status":"public","intvolume":"        13","publist_id":"7356","file_date_updated":"2020-07-14T12:46:33Z","publisher":"International Federation of Computational Logic","issue":"3","volume":13,"pubrep_id":"955"},{"date_published":"2017-07-03T00:00:00Z","file":[{"content_type":"application/pdf","creator":"system","file_size":511832,"date_created":"2018-12-12T10:18:32Z","relation":"main_file","access_level":"open_access","checksum":"bfa405385ec6229ad5ead89ab5751639","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","file_id":"5354","date_updated":"2020-07-14T12:46:33Z"}],"publication_identifier":{"issn":["18605974"]},"scopus_import":1,"date_updated":"2023-02-23T12:26:16Z","type":"journal_article","oa_version":"Published Version","day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.23638/LMCS-13(2:15)2017","department":[{"_id":"KrCh"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:33Z","publisher":"International Federation of Computational Logic","volume":13,"issue":"2","pubrep_id":"957","date_created":"2018-12-11T11:46:38Z","month":"07","article_number":"15","status":"public","intvolume":"        13","publist_id":"7355","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"year":"2017","citation":{"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.","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. 2017;13(2). doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2. International Federation of Computational Logic, 2017.","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>.","apa":"Chatterjee, K., Křetínská, Z., &#38; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>"},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Křetínská, Zuzana","last_name":"Křetínská","first_name":"Zuzana"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publication_status":"published","abstract":[{"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. ","lang":"eng"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","publication":"Logical Methods in Computer Science","ddc":["004"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1657"},{"id":"5429","status":"public","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5435"}]},"oa":1,"_id":"466"},{"publication_status":"published","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"}],"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","name":"The Wittgenstein Prize","grant_number":"Z211"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"id":"1656","status":"public","relation":"earlier_version"},{"id":"5415","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5436"}]},"oa":1,"_id":"467","publication":"ACM Transactions on Computational Logic (TOCL)","title":"Nested weighted automata","year":"2017","quality_controlled":"1","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4, 31, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(4). doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4. ACM, 2017."},"article_number":"31","status":"public","date_created":"2018-12-11T11:46:38Z","month":"12","publist_id":"7354","intvolume":"        18","publisher":"ACM","volume":18,"issue":"4","language":[{"iso":"eng"}],"doi":"10.1145/3152769","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ec_funded":1,"day":"01","type":"journal_article","date_updated":"2023-02-23T12:26:19Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication_identifier":{"issn":["15293785"]},"scopus_import":1,"date_published":"2017-12-01T00:00:00Z","external_id":{"arxiv":["1606.03598"]}},{"ec_funded":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","department":[{"_id":"ChWo"}],"doi":"10.1145/3072959.3073678","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","date_updated":"2023-02-23T12:20:26Z","type":"journal_article","day":"01","scopus_import":1,"publication_identifier":{"issn":["07300301"]},"file":[{"creator":"wojtan","content_type":"application/pdf","file_size":13131683,"relation":"main_file","date_created":"2020-01-24T09:32:35Z","file_name":"wavepackets_final.pdf","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","access_level":"open_access","file_id":"7359","date_updated":"2020-07-14T12:46:34Z"}],"date_published":"2017-07-01T00:00:00Z","publication":"ACM Transactions on Graphics","title":"Water wave packets","_id":"470","ddc":["006"],"oa":1,"project":[{"call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176"}],"abstract":[{"lang":"eng","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."}],"publication_status":"published","citation":{"ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4. ACM, 2017.","ama":"Jeschke S, Wojtan C. Water wave packets. <i>ACM Transactions on Graphics</i>. 2017;36(4). doi:<a href=\"https://doi.org/10.1145/3072959.3073678\">10.1145/3072959.3073678</a>","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” <i>ACM Transactions on Graphics</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073678\">https://doi.org/10.1145/3072959.3073678</a>.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4, 103, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073678\">10.1145/3072959.3073678</a>.","apa":"Jeschke, S., &#38; Wojtan, C. (2017). Water wave packets. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3072959.3073678\">https://doi.org/10.1145/3072959.3073678</a>"},"author":[{"first_name":"Stefan","last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","last_name":"Wojtan"}],"quality_controlled":"1","year":"2017","intvolume":"        36","publist_id":"7350","month":"07","date_created":"2018-12-11T11:46:39Z","status":"public","article_number":"103","issue":"4","volume":36,"file_date_updated":"2020-07-14T12:46:34Z","article_type":"original","publisher":"ACM"},{"department":[{"_id":"ToHe"}],"doi":"10.1145/3060139","language":[{"iso":"eng"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Submitted Version","date_updated":"2023-02-21T16:48:11Z","type":"journal_article","scopus_import":1,"publication_identifier":{"issn":["15293785"]},"date_published":"2017-05-01T00:00:00Z","_id":"471","oa":1,"related_material":{"record":[{"id":"1234","relation":"earlier_version","status":"public"}]},"title":"Faster statistical model checking for unbounded temporal properties","publication":"ACM Transactions on Computational Logic (TOCL)","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"}],"publication_status":"published","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","author":[{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan"},{"first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"citation":{"short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3060139\">https://doi.org/10.1145/3060139</a>.","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.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 2. ACM, 2017.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(2). doi:<a href=\"https://doi.org/10.1145/3060139\">10.1145/3060139</a>","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 2, 12, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3060139\">10.1145/3060139</a>.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3060139\">https://doi.org/10.1145/3060139</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/1504.05739","open_access":"1"}],"year":"2017","publist_id":"7349","intvolume":"        18","article_number":"12","status":"public","month":"05","date_created":"2018-12-11T11:46:39Z","issue":"2","volume":18,"publisher":"ACM"},{"intvolume":"        37","publication_identifier":{"issn":["02706474"]},"publist_id":"7348","month":"06","date_created":"2018-12-11T11:46:40Z","status":"public","date_published":"2017-06-21T00:00:00Z","issue":"25","volume":37,"page":"6043 - 6052","publisher":"Wiley-Blackwell","title":"Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held","publication":"European Journal of Neuroscience","_id":"472","doi":"10.1523/JNEUROSCI.0179-17.2017","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"α-Synuclein is a presynaptic protein the function of which has yet to be identified, but its neuronal content increases in patients of synucleinopa-thies including Parkinson’s disease. Chronic overexpression of α-synuclein reportedly expresses various phenotypes of synaptic dysfunction, but the primary target of its toxicity has not been determined. To investigate this, we acutely loaded human recombinant α-synuclein or its pathological mutants in their monomeric forms into the calyces of Held presynaptic terminals in slices from auditorily mature and immature rats of either sex. Membrane capacitance measurements revealed significant and specific inhibitory effects of WT monomeric α-synuclein on vesicle endocytosis throughout development. However, the α-synuclein A53T mutant affected vesicle endocytosis only at immature calyces, where as the A30P mutant had no effect throughout. The endocytic impairment by WTα-synuclein was rescued by intraterminal coloading of the microtubule (MT) polymerization blocker nocodazole. Furthermore, it was reversibly rescued by presynaptically loaded photostatin-1, a pho-toswitcheable inhibitor of MT polymerization, inalight-wavelength-dependent manner. Incontrast, endocyticinhibition by the A53T mutant at immature calyces was not rescued by nocodazole. Functionally, presynaptically loaded WT α-synuclein had no effect on basal synaptic transmission evoked at a low frequency, but significantly attenuated exocytosis and impaired the fidelity of neurotransmission during prolonged high-frequency stimulation. We conclude that monomeric WTα-synuclein primarily inhibits vesicle endocytosis via MT overassembly, thereby impairing high-frequency neurotransmission."}],"publication_status":"published","citation":{"ista":"Eguchi K, Taoufiq Z, Thorn Seshold O, Trauner D, Hasegawa M, Takahashi T. 2017. Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. 37(25), 6043–6052.","short":"K. Eguchi, Z. Taoufiq, O. Thorn Seshold, D. Trauner, M. Hasegawa, T. Takahashi, European Journal of Neuroscience 37 (2017) 6043–6052.","chicago":"Eguchi, Kohgaku, Zachari Taoufiq, Oliver Thorn Seshold, Dirk Trauner, Masato Hasegawa, and Tomoyuki Takahashi. “Wild-Type Monomeric α-Synuclein Can Impair Vesicle Endocytosis and Synaptic Fidelity via Tubulin Polymerization at the Calyx of Held.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1523/JNEUROSCI.0179-17.2017\">https://doi.org/10.1523/JNEUROSCI.0179-17.2017</a>.","ama":"Eguchi K, Taoufiq Z, Thorn Seshold O, Trauner D, Hasegawa M, Takahashi T. Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. <i>European Journal of Neuroscience</i>. 2017;37(25):6043-6052. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0179-17.2017\">10.1523/JNEUROSCI.0179-17.2017</a>","ieee":"K. Eguchi, Z. Taoufiq, O. Thorn Seshold, D. Trauner, M. Hasegawa, and T. Takahashi, “Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held,” <i>European Journal of Neuroscience</i>, vol. 37, no. 25. Wiley-Blackwell, pp. 6043–6052, 2017.","apa":"Eguchi, K., Taoufiq, Z., Thorn Seshold, O., Trauner, D., Hasegawa, M., &#38; Takahashi, T. (2017). Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1523/JNEUROSCI.0179-17.2017\">https://doi.org/10.1523/JNEUROSCI.0179-17.2017</a>","mla":"Eguchi, Kohgaku, et al. “Wild-Type Monomeric α-Synuclein Can Impair Vesicle Endocytosis and Synaptic Fidelity via Tubulin Polymerization at the Calyx of Held.” <i>European Journal of Neuroscience</i>, vol. 37, no. 25, Wiley-Blackwell, 2017, pp. 6043–52, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0179-17.2017\">10.1523/JNEUROSCI.0179-17.2017</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","full_name":"Eguchi, Kohgaku","orcid":"0000-0002-6170-2546","first_name":"Kohgaku","last_name":"Eguchi"},{"full_name":"Taoufiq, Zachari","first_name":"Zachari","last_name":"Taoufiq"},{"full_name":"Thorn Seshold, Oliver","last_name":"Thorn Seshold","first_name":"Oliver"},{"first_name":"Dirk","last_name":"Trauner","full_name":"Trauner, Dirk"},{"full_name":"Hasegawa, Masato","first_name":"Masato","last_name":"Hasegawa"},{"last_name":"Takahashi","first_name":"Tomoyuki","full_name":"Takahashi, Tomoyuki"}],"extern":"1","quality_controlled":"1","oa_version":"None","date_updated":"2021-01-12T08:00:51Z","type":"journal_article","year":"2017","day":"21"},{"scopus_import":1,"page":"211 - 229","file":[{"checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","file_id":"4758","file_size":769296,"content_type":"application/pdf","creator":"system","relation":"main_file","date_created":"2018-12-12T10:09:34Z"}],"date_published":"2017-04-13T00:00:00Z","department":[{"_id":"HeEd"}],"has_accepted_license":"1","doi":"10.1142/S0218195916600050","language":[{"iso":"eng"}],"acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"13","oa_version":"Published Version","date_updated":"2023-02-21T16:06:22Z","type":"journal_article","publist_id":"7338","intvolume":"        26","status":"public","month":"04","date_created":"2018-12-11T11:46:43Z","pubrep_id":"949","issue":"3-4","volume":26,"publisher":"World Scientific Publishing","file_date_updated":"2020-07-14T12:46:35Z","_id":"481","oa":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10892"}]},"ddc":["004","514","516"],"publication":"International Journal of Computational Geometry and Applications","title":"Planar matchings for weighted straight skeletons","abstract":[{"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.","lang":"eng"}],"publication_status":"published","author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"last_name":"Huber","first_name":"Stefan","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"quality_controlled":"1","citation":{"ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. 2017;26(3-4):211-229. doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","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.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2017. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>.","apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2017). Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>"},"year":"2017","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"date_published":"2017-08-25T00:00:00Z","page":"739 - 800","publication_identifier":{"issn":["10950761"]},"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_updated":"2021-01-12T08:00:57Z","oa_version":"Submitted Version","day":"25","ec_funded":1,"doi":"10.4310/ATMP.2017.v21.n3.a5","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"issue":"3","volume":21,"publisher":"International Press","intvolume":"        21","publist_id":"7337","date_created":"2018-12-11T11:46:43Z","month":"08","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"citation":{"mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>.","apa":"Bourgade, P., Erdös, L., Yau, H., &#38; Yin, J. (2017). Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press, pp. 739–800, 2017.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):739-800. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>.","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."},"author":[{"last_name":"Bourgade","first_name":"Paul","full_name":"Bourgade, Paul"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"},{"full_name":"Yin, Jun","first_name":"Jun","last_name":"Yin"}],"quality_controlled":"1","year":"2017","title":"Universality for a class of random band matrices","publication":"Advances in Theoretical and Mathematical Physics","oa":1,"_id":"483","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"publication_status":"published","abstract":[{"lang":"eng","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."}]},{"issue":"3","volume":21,"publisher":"International Press","intvolume":"        21","publist_id":"7336","month":"01","date_created":"2018-12-11T11:46:43Z","status":"public","citation":{"ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” <i>Advances in Theoretical and Mathematical Physics</i>, 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. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):683-738. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>","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.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>.","apa":"Nam, P., &#38; Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"quality_controlled":"1","author":[{"full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam","first_name":"Phan"},{"full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","last_name":"Napiórkowski"}],"year":"2017","publication":"Advances in Theoretical and Mathematical Physics","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","_id":"484","oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"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 = β &lt; 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"}],"publication_status":"published","date_published":"2017-01-01T00:00:00Z","page":"683 - 738","scopus_import":1,"publication_identifier":{"issn":["10950761"]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","date_updated":"2021-01-12T08:00:58Z","type":"journal_article","day":"01","ec_funded":1,"department":[{"_id":"RoSe"}],"doi":"10.4310/ATMP.2017.v21.n3.a4","language":[{"iso":"eng"}]},{"year":"2017","day":"01","oa_version":"None","date_updated":"2023-10-17T12:15:38Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R","last_name":"Rueda Sanchez","first_name":"Alfredo R"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"first_name":"Michele","last_name":"Collodo","full_name":"Collodo, Michele"},{"first_name":"Ulrich","last_name":"Vogl","full_name":"Vogl, Ulrich"},{"first_name":"Birgit","last_name":"Stiller","full_name":"Stiller, Birgit"},{"full_name":"Schunk, Gerhard","last_name":"Schunk","first_name":"Gerhard"},{"full_name":"Strekalov, Dmitry","first_name":"Dmitry","last_name":"Strekalov"},{"full_name":"Marquardt, Christoph","last_name":"Marquardt","first_name":"Christoph"},{"first_name":"Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Painter","first_name":"Oskar","full_name":"Painter, Oskar"},{"full_name":"Leuchs, Gerd","first_name":"Gerd","last_name":"Leuchs"},{"full_name":"Schwefel, Harald","last_name":"Schwefel","first_name":"Harald"}],"article_processing_charge":"No","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 <i>Optics InfoBase Conference Papers</i>, Vol. F54. Optica  Publishing Group, 2017. <a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">https://doi.org/10.1364/NLO.2017.NM3A.1</a>.","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.","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.","ieee":"A. R. Rueda Sanchez <i>et al.</i>, “Single sideband microwave to optical photon conversion-an-electro-optic-realization,” in <i>Optics InfoBase Conference Papers</i>, Waikoloa, HI, United States, 2017, vol. F54.","ama":"Rueda Sanchez AR, Sedlmeir F, Collodo M, et al. Single sideband microwave to optical photon conversion-an-electro-optic-realization. In: <i>Optics InfoBase Conference Papers</i>. Vol F54. Optica  Publishing Group; 2017. doi:<a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">10.1364/NLO.2017.NM3A.1</a>","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 <i>Optics InfoBase Conference Papers</i> (Vol. F54). Waikoloa, HI, United States: Optica  Publishing Group. <a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">https://doi.org/10.1364/NLO.2017.NM3A.1</a>","mla":"Rueda Sanchez, Alfredo R., et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” <i>Optics InfoBase Conference Papers</i>, vol. F54, NM3A.1, Optica  Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1364/NLO.2017.NM3A.1\">10.1364/NLO.2017.NM3A.1</a>."},"abstract":[{"lang":"eng","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"}],"publication_status":"published","_id":"485","department":[{"_id":"JoFi"}],"doi":"10.1364/NLO.2017.NM3A.1","language":[{"iso":"eng"}],"title":"Single sideband microwave to optical photon conversion-an-electro-optic-realization","publication":"Optics InfoBase Conference Papers","publisher":"Optica  Publishing Group","volume":"F54","date_published":"2017-07-01T00:00:00Z","article_number":"NM3A.1","status":"public","conference":{"name":"NLO: Nonlinear Optics","end_date":"2017-07-21","start_date":"2017-07-17","location":"Waikoloa, HI, United States"},"month":"07","date_created":"2018-12-11T11:46:44Z","scopus_import":"1","publication_identifier":{"isbn":["978-155752820-9"]},"publist_id":"7335"},{"date_published":"2017-11-20T00:00:00Z","file":[{"content_type":"application/pdf","creator":"system","file_size":107349827,"relation":"main_file","date_created":"2018-12-12T10:10:46Z","file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","checksum":"48386fa6956c3645fc89594dc898b147","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","file_id":"4836"},{"creator":"bbickel","content_type":"application/pdf","file_size":4683145,"relation":"main_file","date_created":"2019-12-16T14:48:57Z","file_name":"ElekSumin2017SGA_reduced_file_size.pdf","checksum":"21c89c28fb8d70f6602f752bf997aa0f","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","file_id":"7189"}],"publication_identifier":{"issn":["07300301"]},"scopus_import":1,"day":"20","date_updated":"2023-09-07T13:11:15Z","type":"journal_article","oa_version":"Submitted Version","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.1145/3130800.3130890","has_accepted_license":"1","department":[{"_id":"BeBi"}],"ec_funded":1,"publisher":"ACM","article_type":"original","file_date_updated":"2020-07-14T12:46:35Z","volume":36,"issue":"6","pubrep_id":"1052","status":"public","article_number":"241","date_created":"2018-12-11T11:46:44Z","month":"11","publist_id":"7334","intvolume":"        36","year":"2017","author":[{"last_name":"Elek","first_name":"Oskar","full_name":"Elek, Oskar"},{"first_name":"Denis","last_name":"Sumin","full_name":"Sumin, Denis"},{"last_name":"Zhang","first_name":"Ran","full_name":"Zhang, Ran","orcid":"0000-0002-3808-281X","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Weyrich","first_name":"Tim","full_name":"Weyrich, Tim"},{"full_name":"Myszkowski, Karol","last_name":"Myszkowski","first_name":"Karol"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"last_name":"Wilkie","first_name":"Alexander","full_name":"Wilkie, Alexander"},{"full_name":"Krivanek, Jaroslav","first_name":"Jaroslav","last_name":"Krivanek"}],"quality_controlled":"1","citation":{"short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","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.” <i>ACM Transactions on Graphics</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3130800.3130890\">https://doi.org/10.1145/3130800.3130890</a>.","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.","ieee":"O. Elek <i>et al.</i>, “Scattering-aware texture reproduction for 3D printing,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 6. ACM, 2017.","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. <i>ACM Transactions on Graphics</i>. 2017;36(6). doi:<a href=\"https://doi.org/10.1145/3130800.3130890\">10.1145/3130800.3130890</a>","mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 6, 241, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3130800.3130890\">10.1145/3130800.3130890</a>.","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3130800.3130890\">https://doi.org/10.1145/3130800.3130890</a>"},"publication_status":"published","abstract":[{"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.","lang":"eng"}],"project":[{"name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"ddc":["003","000","005"],"related_material":{"record":[{"id":"8386","relation":"dissertation_contains","status":"public"}]},"oa":1,"_id":"486","publication":"ACM Transactions on Graphics","title":"Scattering-aware texture reproduction for 3D printing"}]