[{"publication_status":"published","abstract":[{"lang":"eng","text":"Recently there has been significant interest in training machine-learning models at low precision: by reducing precision, one can reduce computation and communication by one order of magnitude. We examine training at reduced precision, both from a theoretical and practical perspective, and ask: is it possible to train models at end-to-end low precision with provable guarantees? Can this lead to consistent order-of-magnitude speedups? We mainly focus on linear models, and the answer is yes for linear models. We develop a simple framework called ZipML based on one simple but novel strategy called double sampling. Our ZipML framework is able to execute training at low precision with no bias, guaranteeing convergence, whereas naive quanti- zation would introduce significant bias. We val- idate our framework across a range of applica- tions, and show that it enables an FPGA proto- type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision. We further de- velop a variance-optimal stochastic quantization strategy and show that it can make a significant difference in a variety of settings. When applied to linear models together with double sampling, we save up to another 1.7 × in data movement compared with uniform quantization. When training deep networks with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. "}],"date_created":"2018-12-11T11:46:26Z","volume":" 70","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","day":"01","alternative_title":["PMLR Press"],"citation":{"ieee":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning,” in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol. 70, pp. 4035–4043.","apa":"Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., & Zhang, C. (2017). ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In Proceedings of Machine Learning Research (Vol. 70, pp. 4035–4043). Sydney, Australia: ML Research Press.","mla":"Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning Research, vol. 70, ML Research Press, 2017, pp. 4035–43.","chicago":"Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” In Proceedings of Machine Learning Research, 70:4035–43. ML Research Press, 2017.","short":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.","ista":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. Proceedings of Machine Learning Research. ICML: International Conference on Machine Learning, PMLR Press, vol. 70, 4035–4043.","ama":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In: Proceedings of Machine Learning Research. Vol 70. ML Research Press; 2017:4035-4043."},"department":[{"_id":"DaAl"}],"publication":"Proceedings of Machine Learning Research","oa":1,"article_processing_charge":"No","month":"01","_id":"432","publication_identifier":{"isbn":["978-151085514-4"]},"file":[{"date_created":"2019-01-22T08:23:58Z","file_id":"5869","creator":"dernst","file_size":849345,"date_updated":"2020-07-14T12:46:26Z","content_type":"application/pdf","file_name":"2017_ICML_Zhang.pdf","checksum":"86156ba7f4318e47cef3eb9092593c10","relation":"main_file","access_level":"open_access"}],"page":"4035 - 4043","date_updated":"2023-10-17T12:31:15Z","date_published":"2017-01-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"location":"Sydney, Australia","end_date":"2017-08-11","name":"ICML: International Conference on Machine Learning","start_date":"2017-08-06"},"type":"conference","author":[{"full_name":"Zhang, Hantian","first_name":"Hantian","last_name":"Zhang"},{"first_name":"Jerry","last_name":"Li","full_name":"Li, Jerry"},{"first_name":"Kaan","last_name":"Kara","full_name":"Kara, Kaan"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Ji","last_name":"Liu","full_name":"Liu, Ji"},{"full_name":"Zhang, Ce","last_name":"Zhang","first_name":"Ce"}],"file_date_updated":"2020-07-14T12:46:26Z","ddc":["000"],"publisher":"ML Research Press","status":"public","year":"2017","title":"ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"7391"},{"file_date_updated":"2020-07-14T12:46:29Z","author":[{"full_name":"Hardie, Rae","last_name":"Hardie","first_name":"Rae"},{"first_name":"Ellen","last_name":"Van Dam","full_name":"Van Dam, Ellen"},{"full_name":"Cowley, Mark","first_name":"Mark","last_name":"Cowley"},{"full_name":"Han, Ting","last_name":"Han","first_name":"Ting"},{"first_name":"Seher","last_name":"Balaban","full_name":"Balaban, Seher"},{"first_name":"Marina","last_name":"Pajic","full_name":"Pajic, Marina"},{"full_name":"Pinese, Mark","last_name":"Pinese","first_name":"Mark"},{"first_name":"Mary","last_name":"Iconomou","full_name":"Iconomou, Mary"},{"last_name":"Shearer","first_name":"Robert","full_name":"Shearer, Robert"},{"last_name":"Mckenna","first_name":"Jessie","full_name":"Mckenna, Jessie"},{"full_name":"Miller, David","first_name":"David","last_name":"Miller"},{"full_name":"Waddell, Nicola","first_name":"Nicola","last_name":"Waddell"},{"full_name":"Pearson, John","first_name":"John","last_name":"Pearson"},{"full_name":"Grimmond, Sean","first_name":"Sean","last_name":"Grimmond"},{"full_name":"Sazanov, Leonid A","first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989"},{"first_name":"Andrew","last_name":"Biankin","full_name":"Biankin, Andrew"},{"full_name":"Villas Boas, Silas","last_name":"Villas Boas","first_name":"Silas"},{"full_name":"Hoy, Andrew","first_name":"Andrew","last_name":"Hoy"},{"full_name":"Turner, Nigel","first_name":"Nigel","last_name":"Turner"},{"first_name":"Darren","last_name":"Saunders","full_name":"Saunders, Darren"}],"type":"journal_article","publist_id":"7380","has_accepted_license":"1","oa_version":"Published Version","status":"public","year":"2017","title":"Mitochondrial mutations and metabolic adaptation in pancreatic cancer","ddc":["570"],"publisher":"BioMed Central","doi":"10.1186/s40170-017-0164-1","_id":"443","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"01","language":[{"iso":"eng"}],"date_published":"2017-01-30T00:00:00Z","quality_controlled":"1","date_updated":"2021-01-12T07:56:55Z","file":[{"date_created":"2019-01-22T08:17:56Z","creator":"dernst","file_id":"5868","file_size":1609174,"date_updated":"2020-07-14T12:46:29Z","content_type":"application/pdf","file_name":"2017_Cancer_Hardie.pdf","checksum":"337a65786875f64a1fe9fc0ac24767dc","relation":"main_file","access_level":"open_access"}],"issue":"2","day":"30","oa":1,"publication":"Cancer & Metabolism","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. Cancer & Metabolism. BioMed Central. https://doi.org/10.1186/s40170-017-0164-1","ieee":"R. Hardie et al., “Mitochondrial mutations and metabolic adaptation in pancreatic cancer,” Cancer & Metabolism, vol. 5, no. 2. BioMed Central, 2017.","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.” Cancer & Metabolism. BioMed Central, 2017. https://doi.org/10.1186/s40170-017-0164-1.","mla":"Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism, vol. 5, no. 2, BioMed Central, 2017, doi:10.1186/s40170-017-0164-1.","ama":"Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 2017;5(2). doi:10.1186/s40170-017-0164-1","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 & Metabolism. 5(2).","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 & Metabolism 5 (2017)."},"publication_status":"published","abstract":[{"lang":"eng","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."}],"intvolume":" 5","volume":5,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:30Z","extern":"1"},{"author":[{"orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A","last_name":"Sazanov","first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"type":"book_chapter","day":"29","oa_version":"None","publist_id":"7379","citation":{"mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:10.1039/9781788010405-00025.","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025.","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction in biology , M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","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.","ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. Mechanisms of Primary Energy Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025"},"department":[{"_id":"LeSa"}],"doi":"10.1039/9781788010405-00025","publisher":"Royal Society of Chemistry","year":"2017","title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions","publication":"Mechanisms of primary energy transduction in biology ","status":"public","publication_identifier":{"isbn":["978-1-78262-865-1"]},"publication_status":"published","month":"11","editor":[{"first_name":"Mårten","last_name":"Wikström","full_name":"Wikström, Mårten"}],"abstract":[{"lang":"eng","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."}],"_id":"444","date_created":"2018-12-11T11:46:30Z","date_published":"2017-11-29T00:00:00Z","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"page":"25 - 59","series_title":"Mechanisms of Primary Energy Transduction in Biology ","date_updated":"2021-01-12T07:56:59Z"},{"date_published":"2017-07-12T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:46:31Z","volume":96,"intvolume":" 96","extern":1,"issue":"1","date_updated":"2021-01-12T07:57:03Z","publication_status":"published","month":"07","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"}],"_id":"445","oa":1,"publist_id":"7378","publisher":"American Physical Society","citation":{"ista":"Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 96(1).","ama":"Serbyn M, Abanin D. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 2017;96(1). doi:10.1103/PhysRevB.96.014202","short":"M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials Physics 96 (2017).","apa":"Serbyn, M., & Abanin, D. (2017). Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.96.014202","ieee":"M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1. American Physical Society, 2017.","chicago":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.014202.","mla":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1, American Physical Society, 2017, doi:10.1103/PhysRevB.96.014202."},"doi":"10.1103/PhysRevB.96.014202","status":"public","title":"Loschmidt echo in many body localized phases","year":"2017","publication":"Physical Review B - Condensed Matter and Materials Physics","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.","author":[{"orcid":"0000-0002-2399-5827","first_name":"Maksym","last_name":"Serbyn","full_name":"Maksym Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Abanin, Dimitry A","last_name":"Abanin","first_name":"Dimitry"}],"main_file_link":[{"url":"https://arxiv.org/abs/1701.07772","open_access":"1"}],"type":"journal_article","day":"12"},{"project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"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"}],"volume":9,"intvolume":" 9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:31Z","day":"23","scopus_import":"1","ec_funded":1,"oa":1,"publication":"Revista Latino-Americana de Probabilidade e Estatística","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"citation":{"ieee":"P. Ferrari and P. Nejjar, “Fluctuations of the competition interface in presence of shocks,” Revista Latino-Americana de Probabilidade e Estatística, vol. 9. Instituto Nacional de Matematica Pura e Aplicada, pp. 299–325, 2017.","apa":"Ferrari, P., & Nejjar, P. (2017). Fluctuations of the competition interface in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v14-17","mla":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” Revista Latino-Americana de Probabilidade e Estatística, vol. 9, Instituto Nacional de Matematica Pura e Aplicada, 2017, pp. 299–325, doi:10.30757/ALEA.v14-17.","chicago":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” Revista Latino-Americana de Probabilidade e Estatística. Instituto Nacional de Matematica Pura e Aplicada, 2017. https://doi.org/10.30757/ALEA.v14-17.","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.","ama":"Ferrari P, Nejjar P. Fluctuations of the competition interface in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística. 2017;9:299-325. doi:10.30757/ALEA.v14-17"},"_id":"447","article_processing_charge":"No","month":"03","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2017-03-23T00:00:00Z","date_updated":"2023-10-10T13:10:32Z","article_type":"original","page":"299 - 325","main_file_link":[{"open_access":"1","url":"http://alea.impa.br/articles/v14/14-17.pdf"}],"author":[{"full_name":"Ferrari, Patrik","last_name":"Ferrari","first_name":"Patrik"},{"id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter","last_name":"Nejjar","first_name":"Peter"}],"type":"journal_article","publist_id":"7376","oa_version":"Submitted Version","year":"2017","status":"public","title":"Fluctuations of the competition interface in presence of shocks","publisher":"Instituto Nacional de Matematica Pura e Aplicada","doi":"10.30757/ALEA.v14-17"},{"page":"92 - 99","extern":"1","issue":"8","date_updated":"2022-03-18T12:55:28Z","date_created":"2018-12-11T11:46:33Z","date_published":"2017-08-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":60,"language":[{"iso":"eng"}],"intvolume":" 60","month":"08","abstract":[{"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.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","_id":"452","citation":{"apa":"Bächer, M., Bickel, B., Whiting, E., & Sorkine Hornung, O. (2017). Spin it: Optimizing moment of inertia for spinnable objects. Communications of the ACM. ACM. https://doi.org/10.1145/3068766","ieee":"M. Bächer, B. Bickel, E. Whiting, and O. Sorkine Hornung, “Spin it: Optimizing moment of inertia for spinnable objects,” Communications of the ACM, vol. 60, no. 8. ACM, pp. 92–99, 2017.","chicago":"Bächer, Moritz, Bernd Bickel, Emily Whiting, and Olga Sorkine Hornung. “Spin It: Optimizing Moment of Inertia for Spinnable Objects.” Communications of the ACM. ACM, 2017. https://doi.org/10.1145/3068766.","mla":"Bächer, Moritz, et al. “Spin It: Optimizing Moment of Inertia for Spinnable Objects.” Communications of the ACM, vol. 60, no. 8, ACM, 2017, pp. 92–99, doi:10.1145/3068766.","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.","ama":"Bächer M, Bickel B, Whiting E, Sorkine Hornung O. Spin it: Optimizing moment of inertia for spinnable objects. Communications of the ACM. 2017;60(8):92-99. doi:10.1145/3068766","short":"M. Bächer, B. Bickel, E. Whiting, O. Sorkine Hornung, Communications of the ACM 60 (2017) 92–99."},"doi":"10.1145/3068766","publisher":"ACM","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. ","status":"public","title":"Spin it: Optimizing moment of inertia for spinnable objects","publication":"Communications of the ACM","year":"2017","publist_id":"7370","oa_version":"None","type":"journal_article","day":"01","scopus_import":"1","author":[{"last_name":"Bächer","first_name":"Moritz","full_name":"Bächer, Moritz"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"full_name":"Whiting, Emily","first_name":"Emily","last_name":"Whiting"},{"first_name":"Olga","last_name":"Sorkine Hornung","full_name":"Sorkine Hornung, Olga"}]},{"article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"11","_id":"453","date_published":"2017-11-07T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"creator":"system","file_id":"5052","date_created":"2018-12-12T10:14:03Z","date_updated":"2020-07-14T12:46:31Z","file_size":977192,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"99a2474088e20ac74b1882c4fbbb45b1","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf"}],"issue":"9","page":"2055 - 2067","date_updated":"2021-01-12T07:59:28Z","article_type":"original","author":[{"full_name":"Fallesen, Todd","first_name":"Todd","last_name":"Fallesen"},{"full_name":"Roostalu, Johanna","last_name":"Roostalu","first_name":"Johanna"},{"id":"459064DC-F248-11E8-B48F-1D18A9856A87","full_name":"Düllberg, Christian F","last_name":"Düllberg","first_name":"Christian F","orcid":"0000-0001-6335-9748"},{"last_name":"Pruessner","first_name":"Gunnar","full_name":"Pruessner, Gunnar"},{"first_name":"Thomas","last_name":"Surrey","full_name":"Surrey, Thomas"}],"file_date_updated":"2020-07-14T12:46:31Z","type":"journal_article","has_accepted_license":"1","publist_id":"7369","oa_version":"Published Version","publisher":"Biophysical Society","ddc":["570"],"doi":"10.1016/j.bpj.2017.09.006","status":"public","year":"2017","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","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). ","abstract":[{"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.","lang":"eng"}],"publication_status":"published","date_created":"2018-12-11T11:46:33Z","volume":113,"intvolume":" 113","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"965","day":"07","oa":1,"department":[{"_id":"MaLo"}],"citation":{"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. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","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.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","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.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.","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,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006"},"publication":"Biophysical Journal"},{"issue":"1","page":"61 - 84","extern":1,"date_updated":"2021-01-12T06:58:33Z","quality_controlled":0,"date_published":"2016-05-24T00:00:00Z","date_created":"2018-12-11T11:45:29Z","volume":94,"intvolume":" 94","month":"05","publication_status":"published","abstract":[{"lang":"eng","text":"Let G = SL(2, R) ⋉R2 and Γ = SL(2, Z) ⋉Z2. Building on recent work of Strömbergsson, we prove a rate of equidistribution for the orbits of a certain one-dimensional unipotent flow of Γ\\G, which projects to a closed horocycle in the unit tangent bundle to the modular surface. We use this to answer a question of Elkies and McMullen by making effective the convergence of the gap distribution of √n mod 1."}],"_id":"261","citation":{"short":"T.D. Browning, I. Vinogradov, Journal of the London Mathematical Society 94 (2016) 61–84.","ista":"Browning TD, Vinogradov I. 2016. Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. Journal of the London Mathematical Society. 94(1), 61–84.","ama":"Browning TD, Vinogradov I. Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. Journal of the London Mathematical Society. 2016;94(1):61-84. doi:10.1112/jlms/jdw025","mla":"Browning, Timothy D., and Ilya Vinogradov. “Effective Ratner Theorem for SL (2, R) ⋉R2 and Gaps in √n modulo 1.” Journal of the London Mathematical Society, vol. 94, no. 1, John Wiley and Sons Ltd, 2016, pp. 61–84, doi:10.1112/jlms/jdw025.","chicago":"Browning, Timothy D, and Ilya Vinogradov. “Effective Ratner Theorem for SL (2, R) ⋉R2 and Gaps in √n modulo 1.” Journal of the London Mathematical Society. John Wiley and Sons Ltd, 2016. https://doi.org/10.1112/jlms/jdw025.","apa":"Browning, T. D., & Vinogradov, I. (2016). Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. Journal of the London Mathematical Society. John Wiley and Sons Ltd. https://doi.org/10.1112/jlms/jdw025","ieee":"T. D. Browning and I. Vinogradov, “Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1,” Journal of the London Mathematical Society, vol. 94, no. 1. John Wiley and Sons Ltd, pp. 61–84, 2016."},"doi":"10.1112/jlms/jdw025","publisher":"John Wiley and Sons Ltd","acknowledgement":"The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007–2013)/ERC Grant Agreements 291147 and 306457.","title":"Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1","year":"2016","publication":"Journal of the London Mathematical Society","status":"public","publist_id":"7641","type":"journal_article","day":"24","author":[{"last_name":"Browning","first_name":"Timothy D","full_name":"Timothy Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"first_name":"Ilya","last_name":"Vinogradov","full_name":"Vinogradov, Ilya"}]},{"day":"22","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1411.7775","open_access":"1"}],"author":[{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","full_name":"Timothy Browning"},{"last_name":"Newton","first_name":"Rachel","full_name":"Newton, Rachel"}],"title":"The proportion of failures of the Hasse norm principle","status":"public","publication":"Mathematika","year":"2016","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457.","publisher":"Cambridge University Press","citation":{"short":"T.D. Browning, R. Newton, Mathematika 62 (2016) 337–347.","ista":"Browning TD, Newton R. 2016. The proportion of failures of the Hasse norm principle. Mathematika. 62(2), 337–347.","ama":"Browning TD, Newton R. The proportion of failures of the Hasse norm principle. Mathematika. 2016;62(2):337-347. doi:10.1112/S0025579315000261","ieee":"T. D. Browning and R. Newton, “The proportion of failures of the Hasse norm principle,” Mathematika, vol. 62, no. 2. Cambridge University Press, pp. 337–347, 2016.","apa":"Browning, T. D., & Newton, R. (2016). The proportion of failures of the Hasse norm principle. Mathematika. Cambridge University Press. https://doi.org/10.1112/S0025579315000261","mla":"Browning, Timothy D., and Rachel Newton. “The Proportion of Failures of the Hasse Norm Principle.” Mathematika, vol. 62, no. 2, Cambridge University Press, 2016, pp. 337–47, doi:10.1112/S0025579315000261.","chicago":"Browning, Timothy D, and Rachel Newton. “The Proportion of Failures of the Hasse Norm Principle.” Mathematika. Cambridge University Press, 2016. https://doi.org/10.1112/S0025579315000261."},"doi":"10.1112/S0025579315000261","publist_id":"7640","oa":1,"_id":"262","publication_status":"published","month":"01","abstract":[{"lang":"eng","text":"For any number field we calculate the exact proportion of rational numbers which are everywhere locally a norm but not globally a norm from the number field."}],"date_updated":"2021-01-12T06:58:37Z","issue":"2","page":"337 - 347","extern":1,"volume":62,"intvolume":" 62","quality_controlled":0,"date_created":"2018-12-11T11:45:29Z","date_published":"2016-01-22T00:00:00Z"},{"abstract":[{"text":"We count rational points of bounded height on the Cayley ruled cubic surface and interpret the result in the context of general conjectures due to Batyrev and Tschinkel.","lang":"eng"}],"publication_status":"published","month":"03","_id":"263","date_published":"2016-03-01T00:00:00Z","date_created":"2018-12-11T11:45:30Z","quality_controlled":0,"volume":2,"intvolume":" 2","issue":"1","extern":1,"page":"55 - 72","date_updated":"2021-01-12T06:58:41Z","author":[{"last_name":"De La Bretèche","first_name":"Régis","full_name":"de la Bretèche, Régis"},{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning","last_name":"Browning","first_name":"Timothy D"},{"first_name":"Per","last_name":"Salberger","full_name":"Salberger, Per"}],"main_file_link":[{"url":"https://arxiv.org/abs/1410.3855","open_access":"1"}],"type":"journal_article","day":"01","publist_id":"7639","oa":1,"citation":{"ama":"De La Bretèche R, Browning TD, Salberger P. Counting rational points on the Cayley ruled cubic. European Journal of Mathematics. 2016;2(1):55-72. doi:10.1007/s40879-015-0049-1","ista":"De La Bretèche R, Browning TD, Salberger P. 2016. Counting rational points on the Cayley ruled cubic. European Journal of Mathematics. 2(1), 55–72.","short":"R. De La Bretèche, T.D. Browning, P. Salberger, European Journal of Mathematics 2 (2016) 55–72.","chicago":"De La Bretèche, Régis, Timothy D Browning, and Per Salberger. “Counting Rational Points on the Cayley Ruled Cubic.” European Journal of Mathematics. Springer Nature, 2016. https://doi.org/10.1007/s40879-015-0049-1.","mla":"De La Bretèche, Régis, et al. “Counting Rational Points on the Cayley Ruled Cubic.” European Journal of Mathematics, vol. 2, no. 1, Springer Nature, 2016, pp. 55–72, doi:10.1007/s40879-015-0049-1.","apa":"De La Bretèche, R., Browning, T. D., & Salberger, P. (2016). Counting rational points on the Cayley ruled cubic. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-015-0049-1","ieee":"R. De La Bretèche, T. D. Browning, and P. Salberger, “Counting rational points on the Cayley ruled cubic,” European Journal of Mathematics, vol. 2, no. 1. Springer Nature, pp. 55–72, 2016."},"doi":"10.1007/s40879-015-0049-1","publisher":"Springer Nature","acknowledgement":"While working on this paper the first author was supported by an IUF Junior and the second author was supported by ERC grant 306457. ","year":"2016","status":"public","publication":"European Journal of Mathematics","title":"Counting rational points on the Cayley ruled cubic"},{"year":"2016","title":"Failures of weak approximation in families","status":"public","publication":"Compositio Mathematica","acknowledgement":"While working on this paper the second author was supported by ERC grant 306457.","publisher":"Cambridge University Press","citation":{"ista":"Bright M, Browning TD, Loughran D. 2016. Failures of weak approximation in families. Compositio Mathematica. 152(7), 1435–1475.","ama":"Bright M, Browning TD, Loughran D. Failures of weak approximation in families. Compositio Mathematica. 2016;152(7):1435-1475. doi:10.1112/S0010437X16007405","short":"M. Bright, T.D. Browning, D. Loughran, Compositio Mathematica 152 (2016) 1435–1475.","chicago":"Bright, Maritn, Timothy D Browning, and Daniel Loughran. “Failures of Weak Approximation in Families.” Compositio Mathematica. Cambridge University Press, 2016. https://doi.org/10.1112/S0010437X16007405.","mla":"Bright, Maritn, et al. “Failures of Weak Approximation in Families.” Compositio Mathematica, vol. 152, no. 7, Cambridge University Press, 2016, pp. 1435–75, doi:10.1112/S0010437X16007405.","ieee":"M. Bright, T. D. Browning, and D. Loughran, “Failures of weak approximation in families,” Compositio Mathematica, vol. 152, no. 7. Cambridge University Press, pp. 1435–1475, 2016.","apa":"Bright, M., Browning, T. D., & Loughran, D. (2016). Failures of weak approximation in families. Compositio Mathematica. Cambridge University Press. https://doi.org/10.1112/S0010437X16007405"},"doi":"10.1112/S0010437X16007405","oa":1,"publist_id":"7638","day":"01","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1506.01817","open_access":"1"}],"author":[{"first_name":"Maritn","last_name":"Bright","full_name":"Bright, Maritn J"},{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning","first_name":"Timothy D","last_name":"Browning"},{"full_name":"Loughran, Daniel","first_name":"Daniel","last_name":"Loughran"}],"date_updated":"2021-01-12T06:58:45Z","page":"1435 - 1475","extern":1,"issue":"7","intvolume":" 152","volume":152,"date_created":"2018-12-11T11:45:30Z","date_published":"2016-07-01T00:00:00Z","quality_controlled":0,"_id":"264","month":"07","abstract":[{"text":"Given a family of varieties over a number field, we determine conditions under which there is a Brauer-Manin obstruction to weak approximation for 100% of the fibres which are everywhere locally soluble.","lang":"eng"}],"publication_status":"published"},{"abstract":[{"lang":"eng","text":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m > n^{1.5}. "}],"publication_status":"published","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"article_number":"25","intvolume":" 58","volume":58,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:49:58Z","scopus_import":"1","day":"01","alternative_title":["LIPIcs"],"license":"https://creativecommons.org/licenses/by/3.0/","pubrep_id":"779","citation":{"ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 25.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.","mla":"Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.25.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58."},"department":[{"_id":"KrCh"}],"ec_funded":1,"oa":1,"_id":"1068","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"month":"08","date_updated":"2025-06-02T08:53:50Z","file":[{"date_created":"2018-12-12T10:16:02Z","creator":"system","file_id":"5187","file_size":632786,"date_updated":"2018-12-12T10:16:02Z","content_type":"application/pdf","file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-08-01T00:00:00Z","conference":{"end_date":"2016-08-26","name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2016-08-22","location":"Krakow, Poland"},"type":"conference","file_date_updated":"2018-12-12T10:16:02Z","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"year":"2016","status":"public","title":"Conditionally optimal algorithms for generalized Büchi Games","acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant (279307","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000","004","006"],"doi":"10.4230/LIPIcs.MFCS.2016.25","has_accepted_license":"1","oa_version":"Published Version","publist_id":"6317"},{"language":[{"iso":"eng"}],"date_published":"2016-08-01T00:00:00Z","quality_controlled":"1","date_updated":"2021-01-12T06:48:03Z","file":[{"relation":"main_file","access_level":"open_access","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","content_type":"application/pdf","date_updated":"2018-12-12T10:16:26Z","file_size":521415,"creator":"system","file_id":"5213","date_created":"2018-12-12T10:16:26Z"}],"_id":"1069","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"08","publist_id":"6314","oa_version":"Published Version","has_accepted_license":"1","status":"public","year":"2016","title":"On the skolem problem for continuous linear dynamical systems","acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC Advanced Grant (267989: QUAREM).","ddc":["004","006"],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","doi":"10.4230/LIPIcs.ICALP.2016.100","file_date_updated":"2018-12-12T10:16:26Z","author":[{"first_name":"Ventsislav K","last_name":"Chonev","full_name":"Chonev, Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}],"type":"conference","conference":{"location":"Rome, Italy","start_date":"2016-07-12","name":"ICALP: Automata, Languages and Programming","end_date":"2016-07-15"},"intvolume":" 55","volume":55,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:49:59Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"}],"article_number":"100","publication_status":"published","abstract":[{"lang":"eng","text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers."}],"oa":1,"ec_funded":1,"department":[{"_id":"KrCh"}],"citation":{"ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.100","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","apa":"Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.","mla":"Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.100."},"pubrep_id":"778","scopus_import":1,"alternative_title":["LIPIcs"],"day":"01"},{"intvolume":" 55","volume":55,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:49:59Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"article_number":"98","publication_status":"published","abstract":[{"lang":"eng","text":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We analogously consider quantifier exchange in extensions of CTL, and we present operators defined using basic operators of CTL* that express the occurrence of infinitely many synchronization points. We show that the model-checking problem remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide if the Next operator is allowed in the logics, thus the classical bisimulation quotient can be used for state-space reduction before model checking. "}],"ec_funded":1,"oa":1,"citation":{"short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.","ama":"Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98","ieee":"K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","apa":"Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.98.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98."},"department":[{"_id":"KrCh"}],"pubrep_id":"812","scopus_import":1,"day":"01","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"date_published":"2016-01-01T00:00:00Z","quality_controlled":"1","date_updated":"2021-01-12T06:48:03Z","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","creator":"system","file_id":"4714","date_created":"2018-12-12T10:08:52Z","date_updated":"2018-12-12T10:08:52Z","file_size":546133}],"_id":"1070","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"01","publist_id":"6313","has_accepted_license":"1","oa_version":"Published Version","year":"2016","title":"Computation tree logic for synchronization properties","status":"public","acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003, and European project Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for their insightful\r\ncomments and suggestions.\r\n","ddc":["005"],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","doi":"10.4230/LIPIcs.ICALP.2016.98","file_date_updated":"2018-12-12T10:08:52Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2016-07-15","start_date":"2016-07-12","location":"Rome, Italy"},"type":"conference"},{"day":"01","alternative_title":["LIPIcs"],"scopus_import":1,"related_material":{"record":[{"id":"821","relation":"dissertation_contains","status":"public"}]},"pubrep_id":"777","department":[{"_id":"KrCh"}],"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28","mla":"Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57."},"oa":1,"ec_funded":1,"abstract":[{"lang":"eng","text":"We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W=Theta(log n). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries. The data-structure uses at all times O(n) space. Our second contribution is a space-time tradeoff data-structure for distance queries. For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing time that allows pair queries in O(n^{1-\\epsilon} alpha(n)) time, where alpha is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space. The input graph G is not considered in the space complexity. "}],"publication_status":"published","article_number":"28","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:49:59Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":57,"intvolume":" 57","type":"conference","conference":{"location":"Aarhus, Denmark","start_date":"2016-08-22","name":"ESA: European Symposium on Algorithms","end_date":"2016-08-24"},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722"}],"file_date_updated":"2018-12-12T10:14:31Z","doi":"10.4230/LIPIcs.ESA.2016.28","ddc":["004","006"],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant (279307: Graph Games).","status":"public","year":"2016","title":"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs","oa_version":"Published Version","publist_id":"6312","has_accepted_license":"1","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"1071","file":[{"relation":"main_file","access_level":"open_access","file_name":"IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf","content_type":"application/pdf","date_updated":"2018-12-12T10:14:31Z","file_size":579225,"file_id":"5084","creator":"system","date_created":"2018-12-12T10:14:31Z"}],"date_updated":"2023-09-07T12:01:58Z","date_published":"2016-08-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}]},{"conference":{"start_date":"2016-03-14","name":"APS: American Physical Society","end_date":"2016-03-18","location":"Baltimore, MD, United States"},"type":"conference","author":[{"orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","last_name":"Polshyn","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"first_name":"Tyler","last_name":"Naibert","full_name":"Naibert, Tyler"},{"full_name":"Chua, Victor","first_name":"Victor","last_name":"Chua"},{"last_name":"Budakian","first_name":"Raffi","full_name":"Budakian, Raffi"}],"main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR16/Session/E25.7","open_access":"1"}],"publisher":"American Physical Society","year":"2016","title":"Study of vortex states and dynamics in mesoscopic superconducting samples with MFM","status":"public","oa_version":"Published Version","month":"03","article_processing_charge":"No","_id":"10746","publication_identifier":{"issn":["0003-0503"]},"issue":"2","date_updated":"2022-02-08T10:44:06Z","date_published":"2016-03-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","alternative_title":["Bulletin of the American Physical Society"],"citation":{"short":"H. Polshyn, T. Naibert, V. Chua, R. Budakian, in:, APS March Meeting 2016, American Physical Society, 2016.","ama":"Polshyn H, Naibert T, Chua V, Budakian R. Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. In: APS March Meeting 2016. Vol 61. American Physical Society; 2016.","ista":"Polshyn H, Naibert T, Chua V, Budakian R. 2016. Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. APS March Meeting 2016. APS: American Physical Society, Bulletin of the American Physical Society, vol. 61, E25.00007.","mla":"Polshyn, Hryhoriy, et al. “Study of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.” APS March Meeting 2016, vol. 61, no. 2, E25.00007, American Physical Society, 2016.","chicago":"Polshyn, Hryhoriy, Tyler Naibert, Victor Chua, and Raffi Budakian. “Study of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.” In APS March Meeting 2016, Vol. 61. American Physical Society, 2016.","ieee":"H. Polshyn, T. Naibert, V. Chua, and R. Budakian, “Study of vortex states and dynamics in mesoscopic superconducting samples with MFM,” in APS March Meeting 2016, Baltimore, MD, United States, 2016, vol. 61, no. 2.","apa":"Polshyn, H., Naibert, T., Chua, V., & Budakian, R. (2016). Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. In APS March Meeting 2016 (Vol. 61). Baltimore, MD, United States: American Physical Society."},"publication":"APS March Meeting 2016","oa":1,"abstract":[{"text":"Vortex states in superconducting (SC) structures, their dynamics and ways to manipulate them are topics of great interest. We report a new method of magnetic force microscopy (MFM) that allows the study of vortex states in mesoscopic SC samples. For the case of a SC ring, which is biased to a half-integer flux quantum, the flux modulation through the ring caused by the motion of the magnetic tip drives the ring between two consecutive fluxoid states. The corresponding current switching in the ring produces strong position-dependent forces on the cantilever. In the regime where the frequency of the thermally activated jumps between fluxoid states is close to the frequency of the cantilever, large changes in the cantilever frequency and dissipation are observed. This effect may be understood as a stochastic resonance (SR) process. These changes in the cantilever’s mechanical properties are used to “image” the barrier energies between fluxoid states. Additionally, SR imaging of the barrier energies are used to study the effect of the locally applied magnetic field from the MFM tip on the barrier heights. We report the results of measurements for Al rings. Further, the same imaging technique can be applied to more sophisticated SC structures such as arrays of Josephson junctions.","lang":"eng"}],"publication_status":"published","article_number":"E25.00007","extern":"1","date_created":"2022-02-08T09:55:09Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":61,"intvolume":" 61"},{"author":[{"full_name":"Naibert, Tyler","first_name":"Tyler","last_name":"Naibert"},{"orcid":"0000-0001-8223-8896","last_name":"Polshyn","first_name":"Hryhoriy","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"full_name":"Wolin, Brian","first_name":"Brian","last_name":"Wolin"},{"last_name":"Durkin","first_name":"Malcolm","full_name":"Durkin, Malcolm"},{"first_name":"Rita","last_name":"Garrido Menacho","full_name":"Garrido Menacho, Rita"},{"first_name":"Ian Mondragon","last_name":"Shem","full_name":"Shem, Ian Mondragon"},{"full_name":"Chua, Victor","first_name":"Victor","last_name":"Chua"},{"first_name":"Taylor","last_name":"Hughes","full_name":"Hughes, Taylor"},{"full_name":"Mason, Nadya","first_name":"Nadya","last_name":"Mason"},{"full_name":"Budakian, Raffi","last_name":"Budakian","first_name":"Raffi"}],"main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR16/Session/H25.6"}],"type":"conference","conference":{"location":"Baltimore, MD, United States","start_date":"2016-03-14","end_date":"2016-03-18","name":"APS: American Physical Society"},"oa_version":"Published Version","publisher":"American Physical Society","status":"public","title":"Stochastic resonance magnetic force microscopy imaging of Josephson arrays","year":"2016","publication_identifier":{"issn":["0003-0503"]},"month":"03","article_processing_charge":"No","_id":"10747","quality_controlled":"1","date_published":"2016-03-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"2","date_updated":"2022-02-08T10:43:33Z","alternative_title":["Bulletin of the American Physical Society"],"day":"01","oa":1,"citation":{"short":"T. Naibert, H. Polshyn, B. Wolin, M. Durkin, R. Garrido Menacho, I.M. Shem, V. Chua, T. Hughes, N. Mason, R. Budakian, in:, APS March Meeting 2016, American Physical Society, 2016.","ista":"Naibert T, Polshyn H, Wolin B, Durkin M, Garrido Menacho R, Shem IM, Chua V, Hughes T, Mason N, Budakian R. 2016. Stochastic resonance magnetic force microscopy imaging of Josephson arrays. APS March Meeting 2016. APS: American Physical Society, Bulletin of the American Physical Society, vol. 61, H25.00006.","ama":"Naibert T, Polshyn H, Wolin B, et al. Stochastic resonance magnetic force microscopy imaging of Josephson arrays. In: APS March Meeting 2016. Vol 61. American Physical Society; 2016.","ieee":"T. Naibert et al., “Stochastic resonance magnetic force microscopy imaging of Josephson arrays,” in APS March Meeting 2016, Baltimore, MD, United States, 2016, vol. 61, no. 2.","apa":"Naibert, T., Polshyn, H., Wolin, B., Durkin, M., Garrido Menacho, R., Shem, I. M., … Budakian, R. (2016). Stochastic resonance magnetic force microscopy imaging of Josephson arrays. In APS March Meeting 2016 (Vol. 61). Baltimore, MD, United States: American Physical Society.","mla":"Naibert, Tyler, et al. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson Arrays.” APS March Meeting 2016, vol. 61, no. 2, H25.00006, American Physical Society, 2016.","chicago":"Naibert, Tyler, Hryhoriy Polshyn, Brian Wolin, Malcolm Durkin, Rita Garrido Menacho, Ian Mondragon Shem, Victor Chua, Taylor Hughes, Nadya Mason, and Raffi Budakian. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson Arrays.” In APS March Meeting 2016, Vol. 61. American Physical Society, 2016."},"publication":"APS March Meeting 2016","article_number":"H25.00006","abstract":[{"lang":"eng","text":"Vortex interactions are key to explaining the behavior of many two dimensional superconducting systems. We report on the development of a technique to locally probe vortex interactions in a 2D array of Josephson junctions. Scanning a magnetic tip attached to an ultra-soft cantilever over the array produces changes in the frequency of the cantilever along certain lines, forming geometric patterns in the scans. Different tip-surface separations and external magnetic fields produce a number of different patterns. These patterns correspond to tip locations in which two configurations of vortices in the lattice have degenerate energies. By imaging the locations of these degeneracies, information on the local vortex interactions may be obtained."}],"publication_status":"published","date_created":"2022-02-08T10:10:39Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":61,"intvolume":" 61","extern":"1"},{"publist_id":"6299","has_accepted_license":"1","oa_version":"Published Version","doi":"10.1038/celldisc.2016.18","publisher":"Nature Publishing Group","ddc":["580"],"acknowledgement":"We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP); Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN.","year":"2016","status":"public","title":"Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells","author":[{"full_name":"Łangowski, Łukasz","first_name":"Łukasz","last_name":"Łangowski"},{"orcid":"0000-0001-7263-0560","first_name":"Krzysztof T","last_name":"Wabnik","full_name":"Wabnik, Krzysztof T","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","last_name":"Li","first_name":"Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"},{"last_name":"Naramoto","first_name":"Satoshi","full_name":"Naramoto, Satoshi"},{"full_name":"Tanaka, Hirokazu","first_name":"Hirokazu","last_name":"Tanaka"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2018-12-12T10:13:33Z","type":"journal_article","quality_controlled":"1","date_published":"2016-07-19T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_size":5261671,"date_updated":"2018-12-12T10:13:33Z","date_created":"2018-12-12T10:13:33Z","creator":"system","file_id":"5017","file_name":"IST-2017-757-v1+1_celldisc201618.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"date_updated":"2021-01-12T06:48:08Z","month":"07","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"1081","oa":1,"ec_funded":1,"citation":{"short":"Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J. Friml, Cell Discovery 2 (2016).","ama":"Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2016;2. doi:10.1038/celldisc.2016.18","ista":"Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2, 16018.","mla":"Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery, vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.","chicago":"Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste, Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.","ieee":"Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells,” Cell Discovery, vol. 2. Nature Publishing Group, 2016.","apa":"Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H., & Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. Nature Publishing Group. https://doi.org/10.1038/celldisc.2016.18"},"department":[{"_id":"EvBe"},{"_id":"JiFr"}],"publication":"Cell Discovery","pubrep_id":"757","scopus_import":1,"day":"19","date_created":"2018-12-11T11:50:02Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 2","volume":2,"article_number":"16018","project":[{"call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"The asymmetric localization of proteins in the plasma membrane domains of eukaryotic cells is a fundamental manifestation of cell polarity that is central to multicellular organization and developmental patterning. In plants, the mechanisms underlying the polar localization of cargo proteins are still largely unknown and appear to be fundamentally distinct from those operating in mammals. Here, we present a systematic, quantitative comparative analysis of the polar delivery and subcellular localization of proteins that characterize distinct polar plasma membrane domains in plant cells. The combination of microscopic analyses and computational modeling revealed a mechanistic framework common to diverse polar cargos and underlying the establishment and maintenance of apical, basal, and lateral polar domains in plant cells. This mechanism depends on the polar secretion, constitutive endocytic recycling, and restricted lateral diffusion of cargos within the plasma membrane. Moreover, our observations suggest that polar cargo distribution involves the individual protein potential to form clusters within the plasma membrane and interact with the extracellular matrix. Our observations provide insights into the shared cellular mechanisms of polar cargo delivery and polarity maintenance in plant cells.","lang":"eng"}],"publication_status":"published"},{"conference":{"start_date":"2016-09-11","end_date":"2016-09-14","name":"CinC: Computing in Cardiology","location":"Vancouver, Canada"},"type":"conference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.22489/cinc.2016.090-500"}],"author":[{"first_name":"Paul","last_name":"Rubel","full_name":"Rubel, Paul"},{"last_name":"Pani","first_name":"Danilo","full_name":"Pani, Danilo"},{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jocelyne","last_name":"Fayn","full_name":"Fayn, Jocelyne"},{"first_name":"Fabio","last_name":"Badilini","full_name":"Badilini, Fabio"},{"full_name":"Macfarlane, Peter","last_name":"Macfarlane","first_name":"Peter"},{"full_name":"Varri, Alpo","last_name":"Varri","first_name":"Alpo"}],"acknowledgement":"The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen Wagner for their in depth review and constructive comments.","title":"SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography","status":"public","year":"2016","doi":"10.22489/cinc.2016.090-500","publisher":"Computing in Cardiology","oa_version":"Published Version","_id":"10810","month":"03","article_processing_charge":"No","publication_identifier":{"issn":["2325-887X"]},"date_updated":"2022-03-04T07:34:45Z","page":"309-312","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2016-03-01T00:00:00Z","day":"01","scopus_import":"1","publication":"2016 Computing in Cardiology Conference","department":[{"_id":"CampIT"}],"citation":{"apa":"Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P., & Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In 2016 Computing in Cardiology Conference (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology. https://doi.org/10.22489/cinc.2016.090-500","ieee":"P. Rubel et al., “SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography,” in 2016 Computing in Cardiology Conference, Vancouver, Canada, 2016, vol. 43, pp. 309–312.","chicago":"Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini, Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” In 2016 Computing in Cardiology Conference, 43:309–12. Computing in Cardiology, 2016. https://doi.org/10.22489/cinc.2016.090-500.","mla":"Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” 2016 Computing in Cardiology Conference, vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:10.22489/cinc.2016.090-500.","ista":"Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing in Cardiology vol. 43, 309–312.","ama":"Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In: 2016 Computing in Cardiology Conference. Vol 43. Computing in Cardiology; 2016:309-312. doi:10.22489/cinc.2016.090-500","short":"P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri, in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp. 309–312."},"oa":1,"publication_status":"published","abstract":[{"text":"The main goal of the SCP-ECG standard is to address ECG data and related metadata structuring, semantics and syntax, with the objective of facilitating interoperability and thus supporting and promoting the exchange of the relevant information for unary and serial ECG diagnosis. Starting with version V3.0, the standard now also provides support for the storage of continuous, long-term ECG recordings and affords a repository for selected ECG sequences and the related metadata to accommodate stress tests, drug trials and protocol-based ECG recordings. The global and per-lead measurements sections have been extended and three new sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand annotations. The used terminology and the provided measurements and annotations have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis has also been put on harmonizing the Universal Statement Codes with the CDISC and the categorized AHA statement codes and similarly the drug and implanted devices codes with the ATC and NASPE/BPEG codes. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":43,"intvolume":" 43","date_created":"2022-03-03T10:43:10Z"},{"scopus_import":1,"alternative_title":["Advances in Neural Information Processing Systems"],"day":"01","type":"conference","conference":{"start_date":"2016-12-05","end_date":"2016-12-10","name":"NIPS: Neural Information Processing Systems","location":"Barcelona, Spain"},"main_file_link":[{"url":"https://arxiv.org/abs/1605.07332","open_access":"1"}],"author":[{"orcid":"0000-0001-7782-4436","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","full_name":"Chalk, Matthew J","first_name":"Matthew J","last_name":"Chalk"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455"}],"related_material":{"link":[{"url":"https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck","relation":"other"}]},"title":"Relevant sparse codes with variational information bottleneck","status":"public","year":"2016","citation":{"chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing Systems, 2016.","mla":"Chalk, Matthew J., et al. Relevant Sparse Codes with Variational Information Bottleneck. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73.","apa":"Chalk, M. J., Marre, O., & Tkačik, G. (2016). Relevant sparse codes with variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems.","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational information bottleneck,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.","ista":"Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational information bottleneck. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 1965–1973.","ama":"Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.","short":"M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 1965–1973."},"department":[{"_id":"GaTk"}],"publisher":"Neural Information Processing Systems","publist_id":"6298","oa_version":"Preprint","oa":1,"_id":"1082","month":"12","abstract":[{"text":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximises information about a relevance variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximising a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm to recover features that are both relevant and sparse. Finally, we demonstrate how kernelised versions of the algorithm can be used to address a broad range of problems with non-linear relation between X and Y.","lang":"eng"}],"publication_status":"published","date_updated":"2021-01-12T06:48:09Z","page":"1965-1973","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":29,"intvolume":" 29","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T11:50:03Z","date_published":"2016-12-01T00:00:00Z"}]