[{"_id":"25","status":"public","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13"},"type":"conference","date_updated":"2023-09-19T14:44:59Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples."}],"month":"07","main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2018/662","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":"2018-July","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.","ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662","apa":"Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662"},"title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","article_processing_charge":"No","external_id":{"isi":["000764175404127"]},"author":[{"full_name":"Horák, Karel","last_name":"Horák","first_name":"Karel"},{"first_name":"Branislav","full_name":"Bošanský, Branislav","last_name":"Bošanský"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"publist_id":"8030","acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","oa":1,"publisher":"IJCAI","quality_controlled":"1","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","day":"01","year":"2018","isi":1,"date_created":"2018-12-11T11:44:13Z","doi":"10.24963/ijcai.2018/662","date_published":"2018-07-01T00:00:00Z","page":"4764 - 4770"},{"publisher":"IJCAI","quality_controlled":"1","oa":1,"acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","page":"4692 - 4699","doi":"10.24963/ijcai.2018/652","date_published":"2018-07-01T00:00:00Z","date_created":"2018-12-11T11:44:13Z","isi":1,"year":"2018","day":"01","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Elgyütt, Adrian","last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny"},{"full_name":"Rouillé, Owen","last_name":"Rouillé","first_name":"Owen"}],"publist_id":"8031","article_processing_charge":"No","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","citation":{"chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"month":"07","intvolume":" 2018","abstract":[{"lang":"eng","text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it."}],"oa_version":"Preprint","volume":2018,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"type":"conference","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13"},"status":"public","_id":"24","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-09-19T14:45:48Z"},{"ec_funded":1,"volume":2018,"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"alternative_title":["ICAPS"],"scopus_import":"1","intvolume":" 2018","month":"06","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies."}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"date_updated":"2023-09-19T14:44:14Z","conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","end_date":"2018-06-29","location":"Delft, Netherlands","start_date":"2018-06-24"},"type":"conference","status":"public","_id":"34","page":"47 - 55","date_created":"2018-12-11T11:44:16Z","date_published":"2018-06-01T00:00:00Z","year":"2018","isi":1,"day":"01","oa":1,"quality_controlled":"1","publisher":"AAAI Press","external_id":{"arxiv":["1710.00675"],"isi":["000492986200006"]},"article_processing_charge":"No","publist_id":"8021","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Martin","last_name":"Chemlík","full_name":"Chemlík, Martin"},{"last_name":"Topcu","full_name":"Topcu, Ufuk","first_name":"Ufuk"}],"title":"Sensor synthesis for POMDPs with reachability objectives","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.","mla":"Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55.","apa":"Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]},{"volume":141,"issue":"10","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0381-7032"]},"publication_status":"published","month":"10","intvolume":" 141","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1405.7828","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17].","lang":"eng"}],"department":[{"_id":"VlKo"}],"date_updated":"2023-09-19T14:46:18Z","status":"public","type":"journal_article","_id":"18","date_published":"2018-10-01T00:00:00Z","date_created":"2018-12-11T11:44:11Z","page":"269 - 304","day":"01","publication":"Ars Combinatoria","isi":1,"year":"2018","publisher":"Charles Babbage Research Centre","quality_controlled":"1","oa":1,"title":"Superconcentrators of density 25.3","author":[{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","full_name":"Rolinek, Michal"}],"publist_id":"8037","article_processing_charge":"No","external_id":{"isi":["000446809500022"],"arxiv":["1405.7828"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.","apa":"Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3. Ars Combinatoria. Charles Babbage Research Centre.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304."}},{"date_created":"2019-04-30T06:09:57Z","doi":"10.1017/fms.2018.7","date_published":"2018-05-31T00:00:00Z","publication":"Forum of Mathematics, Sigma","day":"31","year":"2018","has_accepted_license":"1","isi":1,"oa":1,"publisher":"Cambridge University Press","quality_controlled":"1","title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","article_processing_charge":"No","external_id":{"arxiv":["1712.10205"],"isi":["000433915500001"]},"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan"},{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma. Cambridge University Press, 2018. https://doi.org/10.1017/fms.2018.7.","ista":"Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7.","mla":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.","short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).","ieee":"A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge University Press, 2018.","apa":"Akopyan, A., & Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2018.7","ama":"Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7"},"project":[{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"article_number":"e7","ec_funded":1,"volume":6,"related_material":{"record":[{"status":"public","id":"8156","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"file":[{"file_name":"2018_ForumMahtematics_Akopyan.pdf","date_created":"2019-04-30T06:14:58Z","file_size":249246,"date_updated":"2020-07-14T12:47:28Z","creator":"dernst","file_id":"6356","checksum":"5a71b24ba712a3eb2e46165a38fbc30a","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"issn":["2050-5094"]},"intvolume":" 6","month":"05","oa_version":"Published Version","abstract":[{"text":"We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.","lang":"eng"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"file_date_updated":"2020-07-14T12:47:28Z","ddc":["510"],"date_updated":"2023-09-19T14:50:12Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"6355"},{"author":[{"last_name":"Pozzi","full_name":"Pozzi, Maria","first_name":"Maria"},{"first_name":"Eder","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5665-0430","full_name":"Miguel Villalba, Eder","last_name":"Miguel Villalba"},{"full_name":"Deimel, Raphael","last_name":"Deimel","first_name":"Raphael"},{"first_name":"Monica","full_name":"Malvezzi, Monica","last_name":"Malvezzi"},{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"last_name":"Brock","full_name":"Brock, Oliver","first_name":"Oliver"},{"first_name":"Domenico","full_name":"Prattichizzo, Domenico","last_name":"Prattichizzo"}],"article_processing_charge":"No","external_id":{"isi":["000446394503031"]},"title":"Efficient FEM-based simulation of soft robots modeled as kinematic chains","department":[{"_id":"BeBi"}],"date_updated":"2023-09-19T14:49:03Z","citation":{"short":"M. Pozzi, E. Miguel Villalba, R. Deimel, M. Malvezzi, B. Bickel, O. Brock, D. Prattichizzo, in:, IEEE, 2018.","ieee":"M. Pozzi et al., “Efficient FEM-based simulation of soft robots modeled as kinematic chains,” presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia, 2018.","apa":"Pozzi, M., Miguel Villalba, E., Deimel, R., Malvezzi, M., Bickel, B., Brock, O., & Prattichizzo, D. (2018). Efficient FEM-based simulation of soft robots modeled as kinematic chains. Presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia: IEEE. https://doi.org/10.1109/icra.2018.8461106","ama":"Pozzi M, Miguel Villalba E, Deimel R, et al. Efficient FEM-based simulation of soft robots modeled as kinematic chains. In: IEEE; 2018. doi:10.1109/icra.2018.8461106","mla":"Pozzi, Maria, et al. Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains. 8461106, IEEE, 2018, doi:10.1109/icra.2018.8461106.","ista":"Pozzi M, Miguel Villalba E, Deimel R, Malvezzi M, Bickel B, Brock O, Prattichizzo D. 2018. Efficient FEM-based simulation of soft robots modeled as kinematic chains. ICRA: International Conference on Robotics and Automation, 8461106.","chicago":"Pozzi, Maria, Eder Miguel Villalba, Raphael Deimel, Monica Malvezzi, Bernd Bickel, Oliver Brock, and Domenico Prattichizzo. “Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains.” IEEE, 2018. https://doi.org/10.1109/icra.2018.8461106."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2018-05-21","location":"Brisbane, Australia","end_date":"2018-05-25"},"status":"public","_id":"6195","article_number":"8461106","doi":"10.1109/icra.2018.8461106","date_published":"2018-09-10T00:00:00Z","date_created":"2019-04-04T09:50:38Z","publication_identifier":{"isbn":["9781538630815"]},"isi":1,"publication_status":"published","year":"2018","day":"10","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"IEEE","quality_controlled":"1","month":"09","abstract":[{"lang":"eng","text":"In the context of robotic manipulation and grasping, the shift from a view that is static (force closure of a single posture) and contact-deprived (only contact for force closure is allowed, everything else is obstacle) towards a view that is dynamic and contact-rich (soft manipulation) has led to an increased interest in soft hands. These hands can easily exploit environmental constraints and object surfaces without risk, and safely interact with humans, but present also some challenges. Designing them is difficult, as well as predicting, modelling, and “programming” their interactions with the objects and the environment. This paper tackles the problem of simulating them in a fast and effective way, leveraging on novel and existing simulation technologies. We present a triple-layered simulation framework where dynamic properties such as stiffness are determined from slow but accurate FEM simulation data once, and then condensed into a lumped parameter model that can be used to fast simulate soft fingers and soft hands. We apply our approach to the simulation of soft pneumatic fingers."}],"oa_version":"None"},{"intvolume":" 10957","month":"12","main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus."}],"ec_funded":1,"volume":10957,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783662583869","9783662583876"],"issn":["0302-9743"]},"status":"public","conference":{"name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","location":"Nieuwpoort, Curacao","start_date":"2018-02-26"},"type":"conference","_id":"6941","department":[{"_id":"KrPi"}],"date_updated":"2023-09-19T15:02:13Z","oa":1,"publisher":"Springer Nature","quality_controlled":"1","date_created":"2019-10-14T06:35:38Z","date_published":"2018-12-07T00:00:00Z","doi":"10.1007/978-3-662-58387-6_26","page":"480-499","publication":"22nd International Conference on Financial Cryptography and Data Security","day":"07","year":"2018","isi":1,"project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"title":"SpaceMint: A cryptocurrency based on proofs of space","article_processing_charge":"No","external_id":{"isi":["000540656400026"]},"author":[{"full_name":"Park, Sunoo","last_name":"Park","first_name":"Sunoo"},{"last_name":"Kwon","full_name":"Kwon, Albert","first_name":"Albert"},{"full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"last_name":"Gazi","full_name":"Gazi, Peter","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26."}},{"file":[{"creator":"kschuh","date_updated":"2020-07-14T12:47:32Z","file_size":3841660,"date_created":"2019-05-28T12:40:05Z","file_name":"2018_rupress_Moalli.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"6498","checksum":"86ae5331f9bfced9a6358a790a04bef4"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1540-9538"],"issn":["0022-1007"]},"publication_status":"published","volume":2015,"issue":"7","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","oa_version":"Published Version","abstract":[{"text":"T cells are actively scanning pMHC-presenting cells in lymphoid organs and nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the T cell actomyosin cytoskeleton facilitates this task in distinct environments is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface stiffness in primary T cells. Nonetheless, intravital imaging revealed robust motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and differentiation during immune responses. In contrast, accumulation of Myo9b−/− CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for T cell crossing of basement membranes, such as those which are present between dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell adaptation from lymphoid to NLT surveillance and the establishment of protective tissue–resident T cell populations.","lang":"eng"}],"month":"06","intvolume":" 2015","scopus_import":"1","ddc":["570"],"date_updated":"2023-09-19T14:52:08Z","department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:32Z","_id":"6497","status":"public","type":"journal_article","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"day":"06","publication":"The Journal of Experimental Medicine","isi":1,"has_accepted_license":"1","year":"2018","doi":"10.1084/jem.20170896","date_published":"2018-06-06T00:00:00Z","date_created":"2019-05-28T12:36:47Z","page":"1869–1890","publisher":"Rockefeller University Press","quality_controlled":"1","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Moalli F, Ficht X, Germann P, et al. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2018;2015(7):1869–1890. doi:10.1084/jem.20170896","apa":"Moalli, F., Ficht, X., Germann, P., Vladymyrov, M., Stolp, B., de Vries, I., … Stein, J. V. (2018). The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. Rockefeller University Press. https://doi.org/10.1084/jem.20170896","short":"F. Moalli, X. Ficht, P. Germann, M. Vladymyrov, B. Stolp, I. de Vries, R. Lyck, J. Balmer, A. Fiocchi, M. Kreutzfeldt, D. Merkler, M. Iannacone, A. Ariga, M.H. Stoffel, J. Sharpe, M. Bähler, M.K. Sixt, A. Diz-Muñoz, J.V. Stein, The Journal of Experimental Medicine 2015 (2018) 1869–1890.","ieee":"F. Moalli et al., “The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells,” The Journal of Experimental Medicine, vol. 2015, no. 7. Rockefeller University Press, pp. 1869–1890, 2018.","mla":"Moalli, Federica, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine, vol. 2015, no. 7, Rockefeller University Press, 2018, pp. 1869–1890, doi:10.1084/jem.20170896.","ista":"Moalli F, Ficht X, Germann P, Vladymyrov M, Stolp B, de Vries I, Lyck R, Balmer J, Fiocchi A, Kreutzfeldt M, Merkler D, Iannacone M, Ariga A, Stoffel MH, Sharpe J, Bähler M, Sixt MK, Diz-Muñoz A, Stein JV. 2018. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2015(7), 1869–1890.","chicago":"Moalli, Federica, Xenia Ficht, Philipp Germann, Mykhailo Vladymyrov, Bettina Stolp, Ingrid de Vries, Ruth Lyck, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20170896."},"title":"The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells","author":[{"first_name":"Federica","full_name":"Moalli, Federica","last_name":"Moalli"},{"full_name":"Ficht, Xenia","last_name":"Ficht","first_name":"Xenia"},{"first_name":"Philipp","full_name":"Germann, Philipp","last_name":"Germann"},{"last_name":"Vladymyrov","full_name":"Vladymyrov, Mykhailo","first_name":"Mykhailo"},{"last_name":"Stolp","full_name":"Stolp, Bettina","first_name":"Bettina"},{"id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid","full_name":"de Vries, Ingrid","last_name":"de Vries"},{"full_name":"Lyck, Ruth","last_name":"Lyck","first_name":"Ruth"},{"full_name":"Balmer, Jasmin","last_name":"Balmer","first_name":"Jasmin"},{"first_name":"Amleto","last_name":"Fiocchi","full_name":"Fiocchi, Amleto"},{"first_name":"Mario","full_name":"Kreutzfeldt, Mario","last_name":"Kreutzfeldt"},{"full_name":"Merkler, Doron","last_name":"Merkler","first_name":"Doron"},{"first_name":"Matteo","last_name":"Iannacone","full_name":"Iannacone, Matteo"},{"first_name":"Akitaka","last_name":"Ariga","full_name":"Ariga, Akitaka"},{"full_name":"Stoffel, Michael H.","last_name":"Stoffel","first_name":"Michael H."},{"first_name":"James","full_name":"Sharpe, James","last_name":"Sharpe"},{"full_name":"Bähler, Martin","last_name":"Bähler","first_name":"Martin"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Alba","full_name":"Diz-Muñoz, Alba","last_name":"Diz-Muñoz"},{"last_name":"Stein","full_name":"Stein, Jens V.","first_name":"Jens V."}],"external_id":{"isi":["000440822900011"]},"article_processing_charge":"No"},{"author":[{"id":"45812BD4-F248-11E8-B48F-1D18A9856A87","first_name":"Sven M","full_name":"Truckenbrodt, Sven M","last_name":"Truckenbrodt"},{"first_name":"Manuel","full_name":"Maidorn, Manuel","last_name":"Maidorn"},{"last_name":"Crzan","full_name":"Crzan, Dagmar","first_name":"Dagmar"},{"first_name":"Hanna","last_name":"Wildhagen","full_name":"Wildhagen, Hanna"},{"first_name":"Selda","last_name":"Kabatas","full_name":"Kabatas, Selda"},{"first_name":"Silvio O","last_name":"Rizzoli","full_name":"Rizzoli, Silvio O"}],"external_id":{"isi":["000443682200009"]},"article_processing_charge":"No","title":"X10 expansion microscopy enables 25‐nm resolution on conventional microscopes","citation":{"chicago":"Truckenbrodt, Sven M, Manuel Maidorn, Dagmar Crzan, Hanna Wildhagen, Selda Kabatas, and Silvio O Rizzoli. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” EMBO Reports. EMBO, 2018. https://doi.org/10.15252/embr.201845836.","ista":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. 2018. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 19(9), e45836.","mla":"Truckenbrodt, Sven M., et al. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” EMBO Reports, vol. 19, no. 9, e45836, EMBO, 2018, doi:10.15252/embr.201845836.","ama":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 2018;19(9). doi:10.15252/embr.201845836","apa":"Truckenbrodt, S. M., Maidorn, M., Crzan, D., Wildhagen, H., Kabatas, S., & Rizzoli, S. O. (2018). X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO Reports. EMBO. https://doi.org/10.15252/embr.201845836","ieee":"S. M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, and S. O. Rizzoli, “X10 expansion microscopy enables 25‐nm resolution on conventional microscopes,” EMBO reports, vol. 19, no. 9. EMBO, 2018.","short":"S.M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, S.O. Rizzoli, EMBO Reports 19 (2018)."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_number":"e45836","doi":"10.15252/embr.201845836","date_published":"2018-09-01T00:00:00Z","date_created":"2019-05-28T13:16:08Z","has_accepted_license":"1","isi":1,"year":"2018","day":"01","publication":"EMBO reports","publisher":"EMBO","quality_controlled":"1","oa":1,"department":[{"_id":"JoDa"}],"file_date_updated":"2020-07-14T12:47:32Z","date_updated":"2023-09-19T14:52:32Z","ddc":["580"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"6499","volume":19,"issue":"9","publication_identifier":{"issn":["1469-221X"],"eissn":["1469-3178"]},"publication_status":"published","file":[{"file_id":"6500","checksum":"6ec90abc637f09cca3a7b6424d7e7a26","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_embo_Truckenbrodt.pdf","date_created":"2019-05-28T13:17:19Z","file_size":2005572,"date_updated":"2020-07-14T12:47:32Z","creator":"kschuh"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"09","intvolume":" 19","abstract":[{"text":"Expansion microscopy is a recently introduced imaging technique that achieves super‐resolution through physically expanding the specimen by ~4×, after embedding into a swellable gel. The resolution attained is, correspondingly, approximately fourfold better than the diffraction limit, or ~70 nm. This is a major improvement over conventional microscopy, but still lags behind modern STED or STORM setups, whose resolution can reach 20–30 nm. We addressed this issue here by introducing an improved gel recipe that enables an expansion factor of ~10× in each dimension, which corresponds to an expansion of the sample volume by more than 1,000‐fold. Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm on conventional epifluorescence microscopes. X10 provides multi‐color images similar or even superior to those produced with more challenging methods, such as STED, STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest and easiest option for high‐quality super‐resolution imaging currently available. X10 should be usable in any laboratory, irrespective of the machinery owned or of the technical knowledge.","lang":"eng"}],"oa_version":"Published Version"},{"date_updated":"2023-09-19T15:03:16Z","citation":{"chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.","ista":"Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239.","mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.","short":"D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.","ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.","apa":"Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM. https://doi.org/10.1137/1.9781611975031.144","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"}],"external_id":{"arxiv":["1704.04947"],"isi":["000483921200145"]},"article_processing_charge":"No","title":"Space-optimal majority in population protocols","department":[{"_id":"DaAl"}],"_id":"7123","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"New Orleans, LA, United States","end_date":"2018-01-10","start_date":"2018-01-07"},"status":"public","publication_identifier":{"isbn":["9781611975031"]},"isi":1,"year":"2018","publication_status":"published","day":"30","publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"page":"2221-2239","date_published":"2018-01-30T00:00:00Z","doi":"10.1137/1.9781611975031.144","date_created":"2019-11-26T15:10:55Z","abstract":[{"text":"Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.\r\n\r\nOn the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time.","lang":"eng"}],"oa_version":"Preprint","publisher":"ACM","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.04947"}],"month":"01"},{"author":[{"last_name":"Westram","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marina","last_name":"Rafajlović","full_name":"Rafajlović, Marina"},{"last_name":"Chaube","full_name":"Chaube, Pragya","first_name":"Pragya"},{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"first_name":"Tomas","last_name":"Larsson","full_name":"Larsson, Tomas"},{"first_name":"Marina","full_name":"Panova, Marina","last_name":"Panova"},{"first_name":"Mark","last_name":"Ravinet","full_name":"Ravinet, Mark"},{"first_name":"Anders","last_name":"Blomberg","full_name":"Blomberg, Anders"},{"last_name":"Mehlig","full_name":"Mehlig, Bernhard","first_name":"Bernhard"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"},{"first_name":"Roger","full_name":"Butlin, Roger","last_name":"Butlin"}],"article_processing_charge":"Yes","external_id":{"isi":["000446774400004"],"pmid":["30283683"]},"title":"Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow","citation":{"ama":"Westram AM, Rafajlović M, Chaube P, et al. Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. 2018;2(4):297-309. doi:10.1002/evl3.74","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. Wiley. https://doi.org/10.1002/evl3.74","ieee":"A. M. Westram et al., “Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow,” Evolution Letters, vol. 2, no. 4. Wiley, pp. 297–309, 2018.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, Evolution Letters 2 (2018) 297–309.","mla":"Westram, Anja M., et al. “Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters, vol. 2, no. 4, Wiley, 2018, pp. 297–309, doi:10.1002/evl3.74.","ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. 2(4), 297–309.","chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters. Wiley, 2018. https://doi.org/10.1002/evl3.74."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"297-309","date_published":"2018-08-20T00:00:00Z","doi":"10.1002/evl3.74","date_created":"2021-08-16T07:45:38Z","has_accepted_license":"1","isi":1,"year":"2018","day":"20","publication":"Evolution Letters","publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"We are very grateful to people who helped with fieldwork, snail processing, and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot and Irena Senčić. We would also like to thank Magnus Alm Rosenblad and Mats Töpel for their contribution to assembling the Littorina saxatilis genome, Carl André, Pasi Rastas, and Romain Villoutreix for discussion, and two anonymous reviewers for their helpful comments on the manuscript. We are grateful to RapidGenomics for library preparation and sequencing. We thank the Natural Environment Research Council, the European Research Council and the Swedish Research Councils VR and Formas (Linnaeus grant to the Centre for Marine Evolutionary Biology and Tage Erlander Guest Professorship) for funding. P.C. was funded by the University of Sheffield Vice-chancellor's India scholarship. R.F. is funded by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 706376. M. Raf. was supported by the Adlerbert Research Foundation.","department":[{"_id":"BeVi"}],"file_date_updated":"2021-08-16T07:48:03Z","date_updated":"2023-09-19T15:08:25Z","ddc":["570"],"type":"journal_article","article_type":"letter_note","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"9917","related_material":{"record":[{"relation":"research_data","status":"public","id":"9930"}]},"issue":"4","volume":2,"publication_identifier":{"issn":["2056-3744"],"eissn":["2056-3744"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"8524e72507d521416be3f8ccfcd5e3f5","file_id":"9918","success":1,"date_updated":"2021-08-16T07:48:03Z","file_size":764299,"creator":"asandaue","date_created":"2021-08-16T07:48:03Z","file_name":"2018_EvolutionLetters_Westram.pdf"}],"language":[{"iso":"eng"}],"month":"08","intvolume":" 2","abstract":[{"lang":"eng","text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g., outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e., focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasizes that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems."}],"pmid":1,"oa_version":"Published Version"},{"intvolume":" 2","month":"12","abstract":[{"text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favor reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","related_material":{"record":[{"relation":"research_data","status":"public","id":"9929"}]},"issue":"6","volume":2,"publication_status":"published","publication_identifier":{"eissn":["2056-3744"],"issn":[" 2056-3744"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2018_EvolutionLetters_Hollander.pdf","date_created":"2021-08-16T07:37:28Z","file_size":584606,"date_updated":"2021-08-16T07:37:28Z","creator":"asandaue","success":1,"file_id":"9916","checksum":"997a78ac41c809975ca69cbdea441f88","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"letter_note","type":"journal_article","status":"public","_id":"9915","department":[{"_id":"BeVi"}],"file_date_updated":"2021-08-16T07:37:28Z","date_updated":"2023-09-19T15:08:53Z","ddc":["570"],"oa":1,"quality_controlled":"1","publisher":"Wiley","acknowledgement":"The authors express a special thanks to Dr Richard Willan at the Museum and Art Gallery of the Northern Territory for guidance and support in the field, and to Carole Smadja for reading and commenting on the manuscript. The authors thank the Government of Western Australia Department of Parks and Wildlife (license no. 009254) and Fishery Research Division (exemption no. 2262) for assistance with permits. Khalid Belkhir modified the coalescent sampler msnsam for the specific needs of this project and Martin Hirsch helped to set up the ABC pipeline and to modify the summary statistic calculator mscalc. The authors are grateful to the Crafoord Foundation for supporting this project. R.K.B., A.M.W., and L.D. were supported by grants from the Natural Environment Research Council, R.K.B. and A.M.W. were also supported by the European Research Council and R.K.B. and L.D. by the Leverhulme Trust. M.M.R. was supported by Consejo Nacional de Ciencia y Tecnología and Secretaría de Educación Pública, Mexico. G.B. was supported by the Centre for Animal Movement Research (CAnMove) financed by a Linnaeus grant (No. 349-2007-8690) from the Swedish Research Council and Lund University.","page":"557-566","date_created":"2021-08-16T07:30:00Z","doi":"10.1002/evl3.85","date_published":"2018-12-13T00:00:00Z","year":"2018","has_accepted_license":"1","isi":1,"publication":"Evolution Letters","day":"13","article_processing_charge":"Yes","external_id":{"pmid":["30564439"],"isi":["000452990000002"]},"author":[{"first_name":"Johan","last_name":"Hollander","full_name":"Hollander, Johan"},{"first_name":"Mauricio","full_name":"Montaño-Rendón, Mauricio","last_name":"Montaño-Rendón"},{"full_name":"Bianco, Giuseppe","last_name":"Bianco","first_name":"Giuseppe"},{"first_name":"Xi","last_name":"Yang","full_name":"Yang, Xi"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","last_name":"Westram"},{"last_name":"Duvaux","full_name":"Duvaux, Ludovic","first_name":"Ludovic"},{"first_name":"David G.","last_name":"Reid","full_name":"Reid, David G."},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."}],"title":"Are assortative mating and genital divergence driven by reinforcement?","citation":{"chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters. Wiley, 2018. https://doi.org/10.1002/evl3.85.","ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. 2(6), 557–566.","mla":"Hollander, Johan, et al. “Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters, vol. 2, no. 6, Wiley, 2018, pp. 557–66, doi:10.1002/evl3.85.","ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. 2018;2(6):557-566. doi:10.1002/evl3.85","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. Wiley. https://doi.org/10.1002/evl3.85","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, Evolution Letters 2 (2018) 557–566.","ieee":"J. Hollander et al., “Are assortative mating and genital divergence driven by reinforcement?,” Evolution Letters, vol. 2, no. 6. Wiley, pp. 557–566, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"_id":"8618","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","keyword":["Multidisciplinary"],"date_updated":"2023-09-19T15:04:49Z","ddc":["570"],"file_date_updated":"2020-10-06T16:35:16Z","department":[{"_id":"JoDa"}],"abstract":[{"lang":"eng","text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting."}],"oa_version":"Published Version","pmid":1,"month":"02","intvolume":" 8","publication_identifier":{"issn":["2045-2322"]},"publication_status":"published","file":[{"file_name":"2018_ScientificReports_Gregor.pdf","date_created":"2020-10-06T16:35:16Z","creator":"dernst","file_size":2818077,"date_updated":"2020-10-06T16:35:16Z","success":1,"checksum":"e642080fcbde9584c63544f587c74f03","file_id":"8619","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":8,"article_number":"2724","citation":{"chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” Scientific Reports. Springer Nature, 2018. https://doi.org/10.1038/s41598-018-19947-1.","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.","mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” Scientific Reports, vol. 8, 2724, Springer Nature, 2018, doi:10.1038/s41598-018-19947-1.","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” Scientific Reports, vol. 8. Springer Nature, 2018.","ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 2018;8. doi:10.1038/s41598-018-19947-1","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., & Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-19947-1"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Carola","full_name":"Gregor, Carola","last_name":"Gregor"},{"first_name":"Sven C.","full_name":"Sidenstein, Sven C.","last_name":"Sidenstein"},{"full_name":"Andresen, Martin","last_name":"Andresen","first_name":"Martin"},{"last_name":"Sahl","full_name":"Sahl, Steffen J.","first_name":"Steffen J."},{"full_name":"Danzl, Johann G","orcid":"0000-0001-8559-3973","last_name":"Danzl","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefan W.","last_name":"Hell","full_name":"Hell, Stefan W."}],"external_id":{"pmid":["29426833"],"isi":["000424630400037"]},"article_processing_charge":"No","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","publisher":"Springer Nature","quality_controlled":"1","oa":1,"isi":1,"has_accepted_license":"1","year":"2018","day":"09","publication":"Scientific Reports","doi":"10.1038/s41598-018-19947-1","date_published":"2018-02-09T00:00:00Z","date_created":"2020-10-06T16:33:37Z"},{"volume":69,"issue":"9","ec_funded":1,"publication_identifier":{"eissn":["1460-2431"],"issn":["0022-0957"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","month":"04","intvolume":" 69","abstract":[{"text":"Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants.","lang":"eng"}],"oa_version":"None","pmid":1,"department":[{"_id":"JiFr"}],"date_updated":"2023-09-19T15:10:43Z","article_type":"original","type":"journal_article","status":"public","keyword":["Plant Science","Physiology"],"_id":"10881","page":"2367-2378","date_published":"2018-04-13T00:00:00Z","doi":"10.1093/jxb/ery097","date_created":"2022-03-18T12:43:22Z","isi":1,"year":"2018","day":"13","publication":"Journal of Experimental Botany","publisher":"Oxford University Press","quality_controlled":"1","acknowledgement":"This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions and it is co-financed by the South Moravian Region under grant agreement No. 665860 (SS). Access to computing and storage facilities owned by parties and projects contributing to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects of Large Infrastructure for Research, Development, and Innovations’ (LM2010005) was greatly appreciated (RSV). The project was funded by The Ministry of Education, Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601) (TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG 20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly the authors’ views, and the EU is not responsible for any use that may be made of the information it contains. ","author":[{"first_name":"Taraka Ramji","full_name":"Moturu, Taraka Ramji","last_name":"Moturu"},{"first_name":"Sravankumar","full_name":"Thula, Sravankumar","last_name":"Thula"},{"first_name":"Ravi Kumar","full_name":"Singh, Ravi Kumar","last_name":"Singh"},{"full_name":"Nodzyński, Tomasz","last_name":"Nodzyński","first_name":"Tomasz"},{"last_name":"Vařeková","full_name":"Vařeková, Radka Svobodová","first_name":"Radka Svobodová"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"},{"first_name":"Sibu","full_name":"Simon, Sibu","last_name":"Simon"}],"article_processing_charge":"No","external_id":{"isi":["000430727000016"],"pmid":["29538714"]},"title":"Molecular evolution and diversification of the SMXL gene family","citation":{"mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the SMXL Gene Family.” Journal of Experimental Botany, vol. 69, no. 9, Oxford University Press, 2018, pp. 2367–78, doi:10.1093/jxb/ery097.","ieee":"T. R. Moturu et al., “Molecular evolution and diversification of the SMXL gene family,” Journal of Experimental Botany, vol. 69, no. 9. Oxford University Press, pp. 2367–2378, 2018.","short":"T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.","apa":"Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml, J., & Simon, S. (2018). Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery097","ama":"Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 2018;69(9):2367-2378. doi:10.1093/jxb/ery097","chicago":"Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of the SMXL Gene Family.” Journal of Experimental Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery097.","ista":"Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S. 2018. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 69(9), 2367–2378."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"}]},{"title":"Significance of whole-genome duplications on the emergence of evolutionary novelties","article_processing_charge":"No","external_id":{"isi":["000456054400004"],"pmid":["29579140"]},"author":[{"id":"4968E7C8-F248-11E8-B48F-1D18A9856A87","first_name":"Moriyama","full_name":"Yuuta, Moriyama","orcid":"0000-0002-2853-8051","last_name":"Yuuta"},{"full_name":"Koshiba-Takeuchi, Kazuko","last_name":"Koshiba-Takeuchi","first_name":"Kazuko"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional Genomics. Oxford University Press, 2018. https://doi.org/10.1093/bfgp/ely007.","ista":"Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 17(5), 329–338.","mla":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional Genomics, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:10.1093/bfgp/ely007.","apa":"Yuuta, M., & Koshiba-Takeuchi, K. (2018). Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. Oxford University Press. https://doi.org/10.1093/bfgp/ely007","ama":"Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 2018;17(5):329-338. doi:10.1093/bfgp/ely007","ieee":"M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications on the emergence of evolutionary novelties,” Briefings in Functional Genomics, vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.","short":"M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018) 329–338."},"date_created":"2022-03-18T12:40:35Z","doi":"10.1093/bfgp/ely007","date_published":"2018-09-01T00:00:00Z","page":"329-338","publication":"Briefings in Functional Genomics","day":"01","year":"2018","isi":1,"oa":1,"publisher":"Oxford University Press","quality_controlled":"1","acknowledgement":"This work was supported by JSPS overseas research fellowships (Y.M.) and SENSHIN Medical Research Foundation (K.K.T.).","department":[{"_id":"CaHe"}],"date_updated":"2023-09-19T15:11:22Z","keyword":["Genetics","Molecular Biology","Biochemistry","General Medicine"],"status":"public","article_type":"original","type":"journal_article","_id":"10880","volume":17,"issue":"5","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2041-2657"],"issn":["2041-2649"]},"intvolume":" 17","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/bfgp/ely007"}],"scopus_import":"1","pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation."}]},{"type":"research_data_reference","status":"public","_id":"9930","author":[{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram"},{"first_name":"Marina","full_name":"Rafajlović, Marina","last_name":"Rafajlović"},{"first_name":"Pragya","last_name":"Chaube","full_name":"Chaube, Pragya"},{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"first_name":"Tomas","full_name":"Larsson, Tomas","last_name":"Larsson"},{"first_name":"Marina","full_name":"Panova, Marina","last_name":"Panova"},{"first_name":"Mark","last_name":"Ravinet","full_name":"Ravinet, Mark"},{"first_name":"Anders","full_name":"Blomberg, Anders","last_name":"Blomberg"},{"last_name":"Mehlig","full_name":"Mehlig, Bernhard","first_name":"Bernhard"},{"last_name":"Johannesson","full_name":"Johannesson, Kerstin","first_name":"Kerstin"},{"last_name":"Butlin","full_name":"Butlin, Roger","first_name":"Roger"}],"article_processing_charge":"No","department":[{"_id":"BeVi"}],"title":"Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow","date_updated":"2023-09-19T15:08:24Z","citation":{"ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow, Dryad, 10.5061/dryad.bp25b65.","chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Dryad, 2018. https://doi.org/10.5061/dryad.bp25b65.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, (2018).","ieee":"A. M. Westram et al., “Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow.” Dryad, 2018.","ama":"Westram AM, Rafajlović M, Chaube P, et al. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. 2018. doi:10.5061/dryad.bp25b65","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. Dryad. https://doi.org/10.5061/dryad.bp25b65","mla":"Westram, Anja M., et al. Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow. Dryad, 2018, doi:10.5061/dryad.bp25b65."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publisher":"Dryad","main_file_link":[{"url":"https://doi.org/10.5061/dryad.bp25b65","open_access":"1"}],"oa":1,"month":"07","abstract":[{"text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g. outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e. focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally-suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasises that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems.","lang":"eng"}],"oa_version":"Published Version","date_published":"2018-07-23T00:00:00Z","doi":"10.5061/dryad.bp25b65","related_material":{"record":[{"id":"9917","status":"public","relation":"used_in_publication"}]},"date_created":"2021-08-17T08:58:47Z","year":"2018","day":"23"},{"date_updated":"2023-09-19T15:08:53Z","citation":{"chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Dryad, 2018. https://doi.org/10.5061/dryad.51sd2p5.","ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Data from: Are assortative mating and genital divergence driven by reinforcement?, Dryad, 10.5061/dryad.51sd2p5.","mla":"Hollander, Johan, et al. Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement? Dryad, 2018, doi:10.5061/dryad.51sd2p5.","ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Data from: Are assortative mating and genital divergence driven by reinforcement? 2018. doi:10.5061/dryad.51sd2p5","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Data from: Are assortative mating and genital divergence driven by reinforcement? Dryad. https://doi.org/10.5061/dryad.51sd2p5","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, (2018).","ieee":"J. Hollander et al., “Data from: Are assortative mating and genital divergence driven by reinforcement?” Dryad, 2018."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"No","author":[{"first_name":"Johan","full_name":"Hollander, Johan","last_name":"Hollander"},{"full_name":"Montaño-Rendón, Mauricio","last_name":"Montaño-Rendón","first_name":"Mauricio"},{"first_name":"Giuseppe","last_name":"Bianco","full_name":"Bianco, Giuseppe"},{"full_name":"Yang, Xi","last_name":"Yang","first_name":"Xi"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram"},{"first_name":"Ludovic","last_name":"Duvaux","full_name":"Duvaux, Ludovic"},{"last_name":"Reid","full_name":"Reid, David G.","first_name":"David G."},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."}],"title":"Data from: Are assortative mating and genital divergence driven by reinforcement?","department":[{"_id":"BeVi"}],"_id":"9929","type":"research_data_reference","status":"public","year":"2018","day":"17","date_created":"2021-08-17T08:51:06Z","date_published":"2018-10-17T00:00:00Z","doi":"10.5061/dryad.51sd2p5","related_material":{"record":[{"id":"9915","status":"public","relation":"used_in_publication"}]},"abstract":[{"lang":"eng","text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favour reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence."}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.51sd2p5"}],"oa":1,"publisher":"Dryad","month":"10"},{"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2575-7075"],"isbn":["9781538664209"]},"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger."}],"month":"12","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1712.08087","open_access":"1"}],"scopus_import":"1","date_updated":"2023-09-19T15:11:49Z","department":[{"_id":"ChLa"}],"_id":"10882","status":"public","conference":{"start_date":"2018-06-18","end_date":"2018-06-23","location":"Salt Lake City, UT, United States","name":"CVF: Conference on Computer Vision and Pattern Recognition"},"type":"conference","publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","day":"17","year":"2018","isi":1,"date_created":"2022-03-18T12:45:09Z","date_published":"2018-12-17T00:00:00Z","doi":"10.1109/cvpr.2018.00956","page":"9175-9184","oa":1,"quality_controlled":"1","publisher":"IEEE","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00956.","ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","apa":"Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956","ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956"},"title":"Learning intelligent dialogs for bounding box annotation","external_id":{"arxiv":["1712.08087"],"isi":["000457843609036"]},"article_processing_charge":"No","author":[{"full_name":"Uijlings, Jasper","last_name":"Uijlings","first_name":"Jasper"},{"full_name":"Konyushkova, Ksenia","last_name":"Konyushkova","first_name":"Ksenia"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"}]},{"title":"Byzantine stochastic gradient descent","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Allen-Zhu, Zeyuan","last_name":"Allen-Zhu","first_name":"Zeyuan"},{"first_name":"Jerry","last_name":"Li","full_name":"Li, Jerry"}],"article_processing_charge":"No","external_id":{"arxiv":["1803.08917"],"isi":["000461823304061"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.","apa":"Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: Advances in Neural Information Processing Systems. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.","short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.","ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623."},"publisher":"Neural Information Processing Systems Foundation","quality_controlled":"1","oa":1,"date_published":"2018-12-01T00:00:00Z","date_created":"2019-06-13T08:22:37Z","page":"4613-4623","day":"01","publication":"Advances in Neural Information Processing Systems","isi":1,"year":"2018","status":"public","type":"conference","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","start_date":"2018-12-02","location":"Montreal, Canada","end_date":"2018-12-08"},"_id":"6558","department":[{"_id":"DaAl"}],"date_updated":"2023-09-19T15:12:45Z","month":"12","intvolume":" 2018","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08917"}],"oa_version":"Published Version","abstract":[{"text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity.","lang":"eng"}],"volume":2018,"language":[{"iso":"eng"}],"publication_status":"published"},{"article_number":"22","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2. ACM, 2018.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649","apa":"Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3230649"},"title":"Even delta-matroids and the complexity of planar boolean CSPs","author":[{"last_name":"Kazda","full_name":"Kazda, Alexandr","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rolinek, Michal","last_name":"Rolinek"}],"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"article_processing_charge":"No","publisher":"ACM","quality_controlled":"1","oa":1,"day":"01","publication":"ACM Transactions on Algorithms","isi":1,"year":"2018","doi":"10.1145/3230649","date_published":"2018-12-01T00:00:00Z","date_created":"2019-02-17T22:59:25Z","_id":"6032","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-09-20T11:20:26Z","department":[{"_id":"VlKo"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids."}],"month":"12","intvolume":" 15","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":15,"issue":"2","related_material":{"record":[{"relation":"earlier_version","id":"1192","status":"public"}]},"ec_funded":1}]