[{"date_published":"2019-09-01T00:00:00Z","article_type":"original","publication":"Journal of the ACM","citation":{"ieee":"C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.","apa":"Lenzen, C., & Rybicki, J. (2019). Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. ACM. https://doi.org/10.1145/3339471","ista":"Lenzen C, Rybicki J. 2019. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 66(5), 32.","ama":"Lenzen C, Rybicki J. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 2019;66(5). doi:10.1145/3339471","chicago":"Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3339471.","short":"C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).","mla":"Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471."},"day":"01","article_processing_charge":"Yes","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"checksum":"7e5d95c478e0e393f4927fcf7e48194e","date_created":"2019-10-25T12:58:38Z","date_updated":"2020-07-14T12:47:46Z","relation":"main_file","file_id":"6975","content_type":"application/pdf","file_size":2183085,"creator":"dernst","access_level":"open_access","file_name":"2019_JACM_Lenzen.pdf"}],"ddc":["000"],"status":"public","title":"Self-stabilising Byzantine clock synchronisation is almost as easy as consensus","intvolume":" 66","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6972","abstract":[{"lang":"eng","text":"We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of thennodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e.,the initial state of the system may be arbitrary, and there can be up to f16th International Conference on Quantitative Evaluation of Systems. Vol 11785. Springer Nature; 2019:109-128. doi:10.1007/978-3-030-30281-8_7","apa":"Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-30281-8_7","ieee":"P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128.","ista":"Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. 2019. Strategy representation by decision trees with linear classifiers. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128.","short":"P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman, in:, 16th International Conference on Quantitative Evaluation of Systems, Springer Nature, 2019, pp. 109–128.","mla":"Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” 16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.","chicago":"Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.” In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-30281-8_7."},"page":"109-128","day":"04","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6942","status":"public","title":"Strategy representation by decision trees with linear classifiers","intvolume":" 11785","abstract":[{"text":"Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of 𝜔 -regular winning conditions; e.g., safety, reachability, liveness, parity conditions; provides a robust and expressive specification formalism for properties that arise in analysis of reactive systems. The resolutions of nondeterminism in games and MDPs are represented as strategies, and we consider succinct representation of such strategies. The decision-tree data structure from machine learning retains the flavor of decisions of strategies and allows entropy-based minimization to obtain succinct trees. However, in contrast to traditional machine-learning problems where small errors are allowed, for winning strategies in graph games and MDPs no error is allowed, and the decision tree must represent the entire strategy. In this work we propose decision trees with linear classifiers for representation of strategies in graph games and MDPs. We have implemented strategy representation using this data structure and we present experimental results for problems on graph games and MDPs, which show that this new data structure presents a much more efficient strategy representation as compared to standard decision trees.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"date_published":"2019-11-10T00:00:00Z","citation":{"ama":"Schmickler CH, Hammer H-W, Volosniev A. Universal physics of bound states of a few charged particles. Physics Letters B. 2019;798. doi:10.1016/j.physletb.2019.135016","ista":"Schmickler CH, Hammer H-W, Volosniev A. 2019. Universal physics of bound states of a few charged particles. Physics Letters B. 798, 135016.","ieee":"C. H. Schmickler, H.-W. Hammer, and A. Volosniev, “Universal physics of bound states of a few charged particles,” Physics Letters B, vol. 798. Elsevier, 2019.","apa":"Schmickler, C. H., Hammer, H.-W., & Volosniev, A. (2019). Universal physics of bound states of a few charged particles. Physics Letters B. Elsevier. https://doi.org/10.1016/j.physletb.2019.135016","mla":"Schmickler, C. H., et al. “Universal Physics of Bound States of a Few Charged Particles.” Physics Letters B, vol. 798, 135016, Elsevier, 2019, doi:10.1016/j.physletb.2019.135016.","short":"C.H. Schmickler, H.-W. Hammer, A. Volosniev, Physics Letters B 798 (2019).","chicago":"Schmickler, C.H., H.-W. Hammer, and Artem Volosniev. “Universal Physics of Bound States of a Few Charged Particles.” Physics Letters B. Elsevier, 2019. https://doi.org/10.1016/j.physletb.2019.135016."},"publication":"Physics Letters B","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"10","scopus_import":"1","oa_version":"Published Version","file":[{"date_created":"2019-10-25T12:47:04Z","date_updated":"2020-07-14T12:47:46Z","checksum":"d27f983b34ea7dafdf356afbf9472fbf","file_id":"6974","relation":"main_file","creator":"dernst","file_size":528362,"content_type":"application/pdf","file_name":"2019_PhysicsLettersB_Schmickler.pdf","access_level":"open_access"}],"_id":"6955","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 798","title":"Universal physics of bound states of a few charged particles","ddc":["530"],"status":"public","abstract":[{"lang":"eng","text":"We study few-body bound states of charged particles subject to attractive zero-range/short-range plus repulsive Coulomb interparticle forces. The characteristic length scales of the system at zero energy are set by the Coulomb length scale D and the Coulomb-modified effective range r eff. We study shallow bound states of charged particles with D >> r eff and show that these systems obey universal scaling laws different from neutral particles. An accurate description of these states requires both the Coulomb-modified scattering length and the effective range unless the Coulomb interaction is very weak (D -> ). Our findings are relevant for bound states whose spatial extent is significantly larger than the range of the attractive potential. These states enjoy universality – their character is independent of the shape of the short-range potential."}],"type":"journal_article","doi":"10.1016/j.physletb.2019.135016","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1904.00913"],"isi":["000494939000086"]},"oa":1,"quality_controlled":"1","isi":1,"publication_identifier":{"issn":["0370-2693"]},"month":"11","author":[{"first_name":"C.H.","last_name":"Schmickler","full_name":"Schmickler, C.H."},{"first_name":"H.-W.","last_name":"Hammer","full_name":"Hammer, H.-W."},{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","first_name":"Artem"}],"volume":798,"date_updated":"2023-08-30T07:06:42Z","date_created":"2019-10-18T18:33:32Z","year":"2019","publisher":"Elsevier","department":[{"_id":"MiLe"}],"publication_status":"published","file_date_updated":"2020-07-14T12:47:46Z","article_number":"135016"},{"article_type":"original","page":"570-583","publication":"Journal of Neurochemistry","citation":{"chicago":"Cheung, Giselle T, and Michael A. Cousin. “Synaptic Vesicle Generation from Activity‐dependent Bulk Endosomes Requires a Dephosphorylation‐dependent Dynamin–Syndapin Interaction.” Journal of Neurochemistry. Wiley, 2019. https://doi.org/10.1111/jnc.14862.","mla":"Cheung, Giselle T., and Michael A. Cousin. “Synaptic Vesicle Generation from Activity‐dependent Bulk Endosomes Requires a Dephosphorylation‐dependent Dynamin–Syndapin Interaction.” Journal of Neurochemistry, vol. 151, no. 5, Wiley, 2019, pp. 570–83, doi:10.1111/jnc.14862.","short":"G.T. Cheung, M.A. Cousin, Journal of Neurochemistry 151 (2019) 570–583.","ista":"Cheung GT, Cousin MA. 2019. Synaptic vesicle generation from activity‐dependent bulk endosomes requires a dephosphorylation‐dependent dynamin–syndapin interaction. Journal of Neurochemistry. 151(5), 570–583.","apa":"Cheung, G. T., & Cousin, M. A. (2019). Synaptic vesicle generation from activity‐dependent bulk endosomes requires a dephosphorylation‐dependent dynamin–syndapin interaction. Journal of Neurochemistry. Wiley. https://doi.org/10.1111/jnc.14862","ieee":"G. T. Cheung and M. A. Cousin, “Synaptic vesicle generation from activity‐dependent bulk endosomes requires a dephosphorylation‐dependent dynamin–syndapin interaction,” Journal of Neurochemistry, vol. 151, no. 5. Wiley, pp. 570–583, 2019.","ama":"Cheung GT, Cousin MA. Synaptic vesicle generation from activity‐dependent bulk endosomes requires a dephosphorylation‐dependent dynamin–syndapin interaction. Journal of Neurochemistry. 2019;151(5):570-583. doi:10.1111/jnc.14862"},"date_published":"2019-12-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","ddc":["570"],"title":"Synaptic vesicle generation from activity‐dependent bulk endosomes requires a dephosphorylation‐dependent dynamin–syndapin interaction","status":"public","intvolume":" 151","_id":"7005","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:47Z","date_created":"2020-02-05T10:30:02Z","checksum":"ec1fb2aebb874009bc309adaada6e1d7","relation":"main_file","file_id":"7452","content_type":"application/pdf","file_size":4334962,"creator":"dernst","file_name":"2019_JournNeurochemistry_Cheung.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Activity-dependent bulk endocytosis generates synaptic vesicles (SVs) during intense neuronal activity via a two-step process. First, bulk endosomes are formed direct from the plasma membrane from which SVs are then generated. SV generation from bulk endosomes requires the efflux of previously accumulated calcium and activation of the protein phosphatase calcineurin. However, it is still unknown how calcineurin mediates SV generation. We addressed this question using a series of acute interventions that decoupled the generation of SVs from bulk endosomes in rat primary neuronal culture. This was achieved by either disruption of protein–protein interactions via delivery of competitive peptides, or inhibition of enzyme activity by known inhibitors. SV generation was monitored using either a morphological horseradish peroxidase assay or an optical assay that monitors the replenishment of the reserve SV pool. We found that SV generation was inhibited by, (i) peptides that disrupt calcineurin interactions, (ii) an inhibitor of dynamin I GTPase activity and (iii) peptides that disrupt the phosphorylation-dependent dynamin I–syndapin I interaction. Peptides that disrupted syndapin I interactions with eps15 homology domain-containing proteins had no effect. This revealed that (i) calcineurin must be localized at bulk endosomes to mediate its effect, (ii) dynamin I GTPase activity is essential for SV fission and (iii) the calcineurin-dependent interaction between dynamin I and syndapin I is essential for SV generation. We therefore propose that a calcineurin-dependent dephosphorylation cascade that requires both dynamin I GTPase and syndapin I lipid-deforming activity is essential for SV generation from bulk endosomes."}],"issue":"5","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["31479508"],"isi":["000490703100001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1111/jnc.14862","month":"12","publication_identifier":{"issn":["0022-3042"],"eissn":["1471-4159"]},"publication_status":"published","department":[{"_id":"SiHi"}],"publisher":"Wiley","year":"2019","pmid":1,"date_updated":"2023-08-30T07:21:50Z","date_created":"2019-11-12T14:37:08Z","volume":151,"author":[{"full_name":"Cheung, Giselle T","id":"471195F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8457-2572","first_name":"Giselle T","last_name":"Cheung"},{"last_name":"Cousin","first_name":"Michael A.","full_name":"Cousin, Michael A."}],"file_date_updated":"2020-07-14T12:47:47Z"},{"oa":1,"external_id":{"isi":["000488973100005"],"arxiv":["2101.09081"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s40314-019-0955-9"}],"quality_controlled":"1","isi":1,"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s40314-019-0955-9","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"eissn":["1807-0302"],"issn":["2238-3603"]},"year":"2019","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Springer Nature","author":[{"first_name":"Yekini","last_name":"Shehu","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini"},{"first_name":"Olaniyi S.","last_name":"Iyiola","full_name":"Iyiola, Olaniyi S."},{"last_name":"Li","first_name":"Xiao-Huan","full_name":"Li, Xiao-Huan"},{"full_name":"Dong, Qiao-Li","first_name":"Qiao-Li","last_name":"Dong"}],"date_updated":"2023-08-30T07:20:32Z","date_created":"2019-11-12T12:41:44Z","volume":38,"article_number":"161","ec_funded":1,"publication":"Computational and Applied Mathematics","citation":{"short":"Y. Shehu, O.S. Iyiola, X.-H. Li, Q.-L. Dong, Computational and Applied Mathematics 38 (2019).","mla":"Shehu, Yekini, et al. “Convergence Analysis of Projection Method for Variational Inequalities.” Computational and Applied Mathematics, vol. 38, no. 4, 161, Springer Nature, 2019, doi:10.1007/s40314-019-0955-9.","chicago":"Shehu, Yekini, Olaniyi S. Iyiola, Xiao-Huan Li, and Qiao-Li Dong. “Convergence Analysis of Projection Method for Variational Inequalities.” Computational and Applied Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40314-019-0955-9.","ama":"Shehu Y, Iyiola OS, Li X-H, Dong Q-L. Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics. 2019;38(4). doi:10.1007/s40314-019-0955-9","apa":"Shehu, Y., Iyiola, O. S., Li, X.-H., & Dong, Q.-L. (2019). Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics. Springer Nature. https://doi.org/10.1007/s40314-019-0955-9","ieee":"Y. Shehu, O. S. Iyiola, X.-H. Li, and Q.-L. Dong, “Convergence analysis of projection method for variational inequalities,” Computational and Applied Mathematics, vol. 38, no. 4. Springer Nature, 2019.","ista":"Shehu Y, Iyiola OS, Li X-H, Dong Q-L. 2019. Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics. 38(4), 161."},"article_type":"original","date_published":"2019-12-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","_id":"7000","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Convergence analysis of projection method for variational inequalities","ddc":["510","515","518"],"status":"public","intvolume":" 38","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is monotone and uniformly continuous. We carry out a unified analysis of the proposed method under very mild assumptions. In particular, weak convergence of the generated sequence is established and nonasymptotic O(1 / n) rate of convergence is established, where n denotes the iteration counter. We also present some experimental results to illustrate the profits gained by introducing the inertial extrapolation steps."}],"issue":"4"}]