--- _id: '453' 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. 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). ' article_processing_charge: No article_type: original author: - first_name: Todd full_name: Fallesen, Todd last_name: Fallesen - first_name: Johanna full_name: Roostalu, Johanna last_name: Roostalu - first_name: Christian F full_name: Düllberg, Christian F id: 459064DC-F248-11E8-B48F-1D18A9856A87 last_name: Düllberg orcid: 0000-0001-6335-9748 - first_name: Gunnar full_name: Pruessner, Gunnar last_name: Pruessner - first_name: Thomas full_name: Surrey, Thomas last_name: Surrey 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 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 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. 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. 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. 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. short: T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067. date_created: 2018-12-11T11:46:33Z date_published: 2017-11-07T00:00:00Z date_updated: 2021-01-12T07:59:28Z day: '07' ddc: - '570' department: - _id: MaLo doi: 10.1016/j.bpj.2017.09.006 file: - access_level: open_access checksum: 99a2474088e20ac74b1882c4fbbb45b1 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:03Z date_updated: 2020-07-14T12:46:31Z file_id: '5052' file_name: IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf file_size: 977192 relation: main_file file_date_updated: 2020-07-14T12:46:31Z has_accepted_license: '1' intvolume: ' 113' issue: '9' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 2055 - 2067 publication: Biophysical Journal publication_status: published publisher: Biophysical Society publist_id: '7369' pubrep_id: '965' quality_controlled: '1' status: public title: Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 113 year: '2017' ... --- _id: '464' 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. article_number: '26' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer citation: ama: Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017 apa: Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017 chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017. ieee: K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017. ista: Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26. mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017. short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017). date_created: 2018-12-11T11:46:37Z date_published: 2017-09-26T00:00:00Z date_updated: 2023-02-23T10:08:55Z day: '26' ddc: - '004' department: - _id: KrCh doi: 10.23638/LMCS-13(3:26)2017 ec_funded: 1 external_id: arxiv: - '1410.0833' file: - access_level: open_access checksum: 12d469ae69b80361333d7dead965cf5d content_type: application/pdf creator: system date_created: 2018-12-12T10:13:27Z date_updated: 2020-07-14T12:46:32Z file_id: '5010' file_name: IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf file_size: 582940 relation: main_file file_date_updated: 2020-07-14T12:46:32Z has_accepted_license: '1' intvolume: ' 13' issue: '3' language: - iso: eng license: https://creativecommons.org/licenses/by-nd/4.0/ month: '09' oa: 1 oa_version: Published Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Logical Methods in Computer Science publication_identifier: issn: - 1860-5974 publication_status: published publisher: International Federation of Computational Logic publist_id: '7357' pubrep_id: '956' quality_controlled: '1' related_material: record: - id: '1661' relation: earlier_version status: public scopus_import: '1' status: public title: Improved algorithms for parity and Streett objectives tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '470' 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. acknowledged_ssus: - _id: ScienComp article_number: '103' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Stefan full_name: Jeschke, Stefan id: 44D6411A-F248-11E8-B48F-1D18A9856A87 last_name: Jeschke - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678 apa: Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678 chicago: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678. ieee: S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017. ista: Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103. mla: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678. short: S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017). date_created: 2018-12-11T11:46:39Z date_published: 2017-07-01T00:00:00Z date_updated: 2023-02-23T12:20:26Z day: '01' ddc: - '006' department: - _id: ChWo doi: 10.1145/3072959.3073678 ec_funded: 1 file: - access_level: open_access checksum: 82a3b2bfeee4ddef16ecc21675d1a48a content_type: application/pdf creator: wojtan date_created: 2020-01-24T09:32:35Z date_updated: 2020-07-14T12:46:34Z file_id: '7359' file_name: wavepackets_final.pdf file_size: 13131683 relation: main_file file_date_updated: 2020-07-14T12:46:34Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication: ACM Transactions on Graphics publication_identifier: issn: - '07300301' publication_status: published publisher: ACM publist_id: '7350' quality_controlled: '1' scopus_import: 1 status: public title: Water wave packets type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2017' ... --- _id: '471' abstract: - lang: eng 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. ' article_number: '12' author: - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Tatjana full_name: Petrov, Tatjana id: 3D5811FC-F248-11E8-B48F-1D18A9856A87 last_name: Petrov orcid: 0000-0002-9041-0905 citation: ama: Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139 apa: Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139 chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139. ieee: P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017. 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. mla: Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139. short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017). date_created: 2018-12-11T11:46:39Z date_published: 2017-05-01T00:00:00Z date_updated: 2023-02-21T16:48:11Z day: '01' department: - _id: ToHe doi: 10.1145/3060139 ec_funded: 1 intvolume: ' 18' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1504.05739 month: '05' oa: 1 oa_version: Submitted Version project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF 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 publication: ACM Transactions on Computational Logic (TOCL) publication_identifier: issn: - '15293785' publication_status: published publisher: ACM publist_id: '7349' quality_controlled: '1' related_material: record: - id: '1234' relation: earlier_version status: public scopus_import: 1 status: public title: Faster statistical model checking for unbounded temporal properties type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2017' ... --- _id: '481' abstract: - lang: eng text: We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings. acknowledgement: 'Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.' author: - first_name: Therese full_name: Biedl, Therese last_name: Biedl - first_name: Stefan full_name: Huber, Stefan id: 4700A070-F248-11E8-B48F-1D18A9856A87 last_name: Huber orcid: 0000-0002-8871-5814 - first_name: Peter full_name: Palfrader, Peter last_name: Palfrader citation: ama: Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050 apa: Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050 chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050. ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017. 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. mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050. short: T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229. date_created: 2018-12-11T11:46:43Z date_published: 2017-04-13T00:00:00Z date_updated: 2023-02-21T16:06:22Z day: '13' ddc: - '004' - '514' - '516' department: - _id: HeEd doi: 10.1142/S0218195916600050 file: - access_level: open_access checksum: f79e8558bfe4b368dfefeb8eec2e3a5e content_type: application/pdf creator: system date_created: 2018-12-12T10:09:34Z date_updated: 2020-07-14T12:46:35Z file_id: '4758' file_name: IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf file_size: 769296 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 26' issue: 3-4 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 211 - 229 publication: International Journal of Computational Geometry and Applications publication_status: published publisher: World Scientific Publishing publist_id: '7338' pubrep_id: '949' quality_controlled: '1' related_material: record: - id: '10892' relation: earlier_version status: public scopus_import: 1 status: public title: Planar matchings for weighted straight skeletons tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2017' ... --- _id: '484' abstract: - lang: eng text: We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory. author: - first_name: Phan full_name: Nam, Phan id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Nam - first_name: Marcin M full_name: Napiórkowski, Marcin M id: 4197AD04-F248-11E8-B48F-1D18A9856A87 last_name: Napiórkowski citation: ama: Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4 apa: Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4 chicago: Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4. ieee: P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017. 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. mla: Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4. short: P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738. date_created: 2018-12-11T11:46:43Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:00:58Z day: '01' department: - _id: RoSe doi: 10.4310/ATMP.2017.v21.n3.a4 ec_funded: 1 intvolume: ' 21' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1509.04631 month: '01' oa: 1 oa_version: Submitted Version page: 683 - 738 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems publication: Advances in Theoretical and Mathematical Physics publication_identifier: issn: - '10950761' publication_status: published publisher: International Press publist_id: '7336' quality_controlled: '1' scopus_import: 1 status: public title: Bogoliubov correction to the mean-field dynamics of interacting bosons type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2017' ... --- _id: '483' 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. author: - first_name: Paul full_name: Bourgade, Paul last_name: Bourgade - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Horng full_name: Yau, Horng last_name: Yau - first_name: Jun full_name: Yin, Jun last_name: Yin citation: ama: Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5 apa: Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5 chicago: Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5. ieee: P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017. ista: Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800. mla: Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5. short: P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800. date_created: 2018-12-11T11:46:43Z date_published: 2017-08-25T00:00:00Z date_updated: 2021-01-12T08:00:57Z day: '25' department: - _id: LaEr doi: 10.4310/ATMP.2017.v21.n3.a5 ec_funded: 1 intvolume: ' 21' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1602.02312 month: '08' oa: 1 oa_version: Submitted Version page: 739 - 800 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Advances in Theoretical and Mathematical Physics publication_identifier: issn: - '10950761' publication_status: published publisher: International Press publist_id: '7337' quality_controlled: '1' scopus_import: 1 status: public title: Universality for a class of random band matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2017' ... --- _id: '487' abstract: - lang: eng text: In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x. author: - first_name: Ghufran full_name: Baig, Ghufran last_name: Baig - first_name: Bozidar full_name: Radunovic, Bozidar last_name: Radunovic - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Matthew full_name: Balkwill, Matthew last_name: Balkwill - first_name: Thomas full_name: Karagiannis, Thomas last_name: Karagiannis - first_name: Lili full_name: Qiu, Lili last_name: Qiu citation: ama: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367' apa: 'Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367' chicago: Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367. ieee: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14. ista: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.' mla: Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367. short: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14. conference: end_date: 2017-12-15 location: Incheon, South Korea name: 'CoNEXT: Conference on emerging Networking EXperiments and Technologies' start_date: 2017-12-12 date_created: 2018-12-11T11:46:45Z date_published: 2017-11-28T00:00:00Z date_updated: 2023-02-23T12:21:11Z day: '28' department: - _id: DaAl doi: 10.1145/3143361.3143367 language: - iso: eng month: '11' oa_version: None page: 2 - 14 publication: Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies publication_identifier: isbn: - 978-145035422-6 publication_status: published publisher: ACM publist_id: '7333' quality_controlled: '1' scopus_import: 1 status: public title: Towards unlicensed cellular networks in TV white spaces type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '514' abstract: - lang: eng text: 'Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum.' article_number: '16032' author: - first_name: Jean full_name: Simonnet, Jean last_name: Simonnet - first_name: Mérie full_name: Nassar, Mérie last_name: Nassar - first_name: Federico full_name: Stella, Federico id: 39AF1E74-F248-11E8-B48F-1D18A9856A87 last_name: Stella orcid: 0000-0001-9439-3148 - first_name: Ivan full_name: Cohen, Ivan last_name: Cohen - first_name: Bertrand full_name: Mathon, Bertrand last_name: Mathon - first_name: Charlotte full_name: Boccara, Charlotte id: 3FC06552-F248-11E8-B48F-1D18A9856A87 last_name: Boccara orcid: 0000-0001-7237-5109 - first_name: Richard full_name: Miles, Richard last_name: Miles - first_name: Desdemona full_name: Fricker, Desdemona last_name: Fricker citation: ama: Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 2017;8. doi:10.1038/ncomms16032 apa: Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms16032 chicago: Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032. ieee: J. Simonnet et al., “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” Nature Communications, vol. 8. Nature Publishing Group, 2017. ista: Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032. mla: Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol. 8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032. short: J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017). date_created: 2018-12-11T11:46:54Z date_published: 2017-07-01T00:00:00Z date_updated: 2021-01-12T08:01:16Z day: '01' ddc: - '571' department: - _id: JoCs doi: 10.1038/ncomms16032 file: - access_level: open_access checksum: 76d8a2b72a58e56adb410ec37dfa7eee content_type: application/pdf creator: system date_created: 2018-12-12T10:14:31Z date_updated: 2020-07-14T12:46:36Z file_id: '5083' file_name: IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf file_size: 2948357 relation: main_file file_date_updated: 2020-07-14T12:46:36Z has_accepted_license: '1' intvolume: ' 8' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - '20411723' publication_status: published publisher: Nature Publishing Group publist_id: '7305' pubrep_id: '937' quality_controlled: '1' scopus_import: 1 status: public title: Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2017' ... --- _id: '515' abstract: - lang: eng text: 'The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.' article_type: original author: - first_name: James A full_name: Letts, James A id: 322DA418-F248-11E8-B48F-1D18A9856A87 last_name: Letts orcid: 0000-0002-9864-3586 - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 citation: ama: 'Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460' apa: 'Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460' chicago: 'Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.' ieee: 'J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.' ista: 'Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808.' mla: 'Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:10.1038/nsmb.3460.' short: J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808. date_created: 2018-12-11T11:46:54Z date_published: 2017-10-05T00:00:00Z date_updated: 2021-01-12T08:01:17Z day: '05' ddc: - '572' department: - _id: LeSa doi: 10.1038/nsmb.3460 ec_funded: 1 file: - access_level: open_access checksum: 9bc7e8c41b43636dd7566289e511f096 content_type: application/pdf creator: lsazanov date_created: 2019-11-07T12:51:07Z date_updated: 2020-07-14T12:46:36Z file_id: '6993' file_name: 29893_2_merged_1501257589_red.pdf file_size: 4118385 relation: main_file file_date_updated: 2020-07-14T12:46:36Z has_accepted_license: '1' intvolume: ' 24' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 800 - 808 project: - _id: 2590DB08-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '701309' name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020) publication: Nature Structural and Molecular Biology publication_identifier: issn: - '15459993' publication_status: published publisher: Nature Publishing Group publist_id: '7304' quality_controlled: '1' scopus_import: 1 status: public title: 'Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2017' ...