--- _id: '1522' abstract: - lang: eng text: 'We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.' acknowledgement: "I thank A. Skopenkov for telling me about the problem and for his useful remarks. I also thank A. Sossinsky,\r\nA. Zhubr, M. Skopenkov, P. Akhmetiev, and an anonymous referee for their feedback. Author was partially\r\nsupported by Dobrushin fellowship, 2013, and by RFBR grant 15-01-06302." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Serhii full_name: Avvakumov, Serhii id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov citation: ama: Avvakumov S. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 2016;16(1):1-25. doi:10.17323/1609-4514-2016-16-1-1-25 apa: Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. Independent University of Moscow. https://doi.org/10.17323/1609-4514-2016-16-1-1-25 chicago: Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.” Moscow Mathematical Journal. Independent University of Moscow, 2016. https://doi.org/10.17323/1609-4514-2016-16-1-1-25. ieee: S. Avvakumov, “The classification of certain linked 3-manifolds in 6-space,” Moscow Mathematical Journal, vol. 16, no. 1. Independent University of Moscow, pp. 1–25, 2016. ista: Avvakumov S. 2016. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 16(1), 1–25. mla: Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.” Moscow Mathematical Journal, vol. 16, no. 1, Independent University of Moscow, 2016, pp. 1–25, doi:10.17323/1609-4514-2016-16-1-1-25. short: S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25. date_created: 2018-12-11T11:52:30Z date_published: 2016-01-01T00:00:00Z date_updated: 2022-02-25T10:15:57Z day: '01' department: - _id: UlWa doi: 10.17323/1609-4514-2016-16-1-1-25 external_id: arxiv: - '1408.3918' intvolume: ' 16' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1408.3918 month: '01' oa: 1 oa_version: Preprint page: 1 - 25 publication: Moscow Mathematical Journal publication_identifier: eissn: - 1609-4514 publication_status: published publisher: Independent University of Moscow publist_id: '5652' quality_controlled: '1' scopus_import: '1' status: public title: The classification of certain linked 3-manifolds in 6-space type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2016' ... --- _id: '1523' abstract: - lang: eng text: For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k > 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex. acknowledgement: This research was supported by the Swiss National Science Foundation (SNF Projects 200021-125309 and 200020-138230 author: - first_name: Anna full_name: Gundert, Anna last_name: Gundert - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: Gundert A, Wagner U. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 2016;144(4):1815-1828. doi:10.1090/proc/12824 apa: Gundert, A., & Wagner, U. (2016). On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/12824 chicago: Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial Complexes.” Proceedings of the American Mathematical Society. American Mathematical Society, 2016. https://doi.org/10.1090/proc/12824. ieee: A. Gundert and U. Wagner, “On topological minors in random simplicial complexes,” Proceedings of the American Mathematical Society, vol. 144, no. 4. American Mathematical Society, pp. 1815–1828, 2016. ista: Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 144(4), 1815–1828. mla: Gundert, Anna, and Uli Wagner. “On Topological Minors in Random Simplicial Complexes.” Proceedings of the American Mathematical Society, vol. 144, no. 4, American Mathematical Society, 2016, pp. 1815–28, doi:10.1090/proc/12824. short: A. Gundert, U. Wagner, Proceedings of the American Mathematical Society 144 (2016) 1815–1828. date_created: 2018-12-11T11:52:30Z date_published: 2016-04-01T00:00:00Z date_updated: 2021-01-12T06:51:22Z day: '01' department: - _id: UlWa doi: 10.1090/proc/12824 intvolume: ' 144' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1404.2106 month: '04' oa: 1 oa_version: Preprint page: 1815 - 1828 publication: Proceedings of the American Mathematical Society publication_status: published publisher: American Mathematical Society publist_id: '5650' quality_controlled: '1' scopus_import: 1 status: public title: On topological minors in random simplicial complexes type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 144 year: '2016' ... --- _id: '1524' abstract: - lang: eng text: "When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations.\r\nOur algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude." acknowledgement: This research was supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734, and the SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2_148797. alternative_title: - LNCS author: - first_name: Andreea full_name: Beica, Andreea last_name: Beica - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Tatjana full_name: Petrov, Tatjana id: 3D5811FC-F248-11E8-B48F-1D18A9856A87 last_name: Petrov orcid: 0000-0002-9041-0905 citation: ama: 'Beica A, Guet CC, Petrov T. Efficient reduction of kappa models by static inspection of the rule-set. In: Vol 9271. Springer; 2016:173-191. doi:10.1007/978-3-319-26916-0_10' apa: 'Beica, A., Guet, C. C., & Petrov, T. (2016). Efficient reduction of kappa models by static inspection of the rule-set (Vol. 9271, pp. 173–191). Presented at the HSB: Hybrid Systems Biology, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-319-26916-0_10' chicago: Beica, Andreea, Calin C Guet, and Tatjana Petrov. “Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set,” 9271:173–91. Springer, 2016. https://doi.org/10.1007/978-3-319-26916-0_10. ieee: 'A. Beica, C. C. Guet, and T. Petrov, “Efficient reduction of kappa models by static inspection of the rule-set,” presented at the HSB: Hybrid Systems Biology, Madrid, Spain, 2016, vol. 9271, pp. 173–191.' ista: 'Beica A, Guet CC, Petrov T. 2016. Efficient reduction of kappa models by static inspection of the rule-set. HSB: Hybrid Systems Biology, LNCS, vol. 9271, 173–191.' mla: Beica, Andreea, et al. Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set. Vol. 9271, Springer, 2016, pp. 173–91, doi:10.1007/978-3-319-26916-0_10. short: A. Beica, C.C. Guet, T. Petrov, in:, Springer, 2016, pp. 173–191. conference: end_date: 2015-09-05 location: Madrid, Spain name: 'HSB: Hybrid Systems Biology' start_date: 2015-09-04 date_created: 2018-12-11T11:52:31Z date_published: 2016-01-10T00:00:00Z date_updated: 2021-01-12T06:51:22Z day: '10' department: - _id: CaGu - _id: ToHe doi: 10.1007/978-3-319-26916-0_10 ec_funded: 1 intvolume: ' 9271' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1501.00440 month: '01' oa: 1 oa_version: Preprint page: 173 - 191 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication_status: published publisher: Springer publist_id: '5649' quality_controlled: '1' scopus_import: 1 status: public title: Efficient reduction of kappa models by static inspection of the rule-set type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9271 year: '2016' ... --- _id: '1526' abstract: - lang: eng text: 'We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.' acknowledgement: This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543. alternative_title: - LNCS author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop - first_name: Roopsha full_name: Samanta, Roopsha id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87 last_name: Samanta citation: ama: 'Henzinger TA, Otop J, Samanta R. Lipschitz robustness of timed I/O systems. In: Vol 9583. Springer; 2016:250-267. doi:10.1007/978-3-662-49122-5_12' apa: 'Henzinger, T. A., Otop, J., & Samanta, R. (2016). Lipschitz robustness of timed I/O systems (Vol. 9583, pp. 250–267). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. https://doi.org/10.1007/978-3-662-49122-5_12' chicago: Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness of Timed I/O Systems,” 9583:250–67. Springer, 2016. https://doi.org/10.1007/978-3-662-49122-5_12. ieee: 'T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of timed I/O systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 250–267.' ista: 'Henzinger TA, Otop J, Samanta R. 2016. Lipschitz robustness of timed I/O systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583, 250–267.' mla: Henzinger, Thomas A., et al. Lipschitz Robustness of Timed I/O Systems. Vol. 9583, Springer, 2016, pp. 250–67, doi:10.1007/978-3-662-49122-5_12. short: T.A. Henzinger, J. Otop, R. Samanta, in:, Springer, 2016, pp. 250–267. conference: end_date: 2016-01-19 location: St. Petersburg, FL, USA name: 'VMCAI: Verification, Model Checking and Abstract Interpretation' start_date: 2016-01-17 date_created: 2018-12-11T11:52:32Z date_published: 2016-01-01T00:00:00Z date_updated: 2021-01-12T06:51:23Z day: '01' department: - _id: ToHe doi: 10.1007/978-3-662-49122-5_12 ec_funded: 1 intvolume: ' 9583' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1506.01233 month: '01' oa: 1 oa_version: Preprint page: 250 - 267 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '5647' quality_controlled: '1' scopus_import: 1 status: public title: Lipschitz robustness of timed I/O systems type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9583 year: '2016' ... --- _id: '1529' abstract: - lang: eng text: 'We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.' acknowledgement: 'We thank Blai Bonet for helping us with RTDP-Bel. The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.' article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik - first_name: Raghav full_name: Gupta, Raghav last_name: Gupta - first_name: Ayush full_name: Kanodia, Ayush last_name: Kanodia citation: ama: Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 2016;234:26-48. doi:10.1016/j.artint.2016.01.007 apa: Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2016.01.007 chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007. ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234. Elsevier, pp. 26–48, 2016. ista: Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48. mla: Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence, vol. 234, Elsevier, 2016, pp. 26–48, doi:10.1016/j.artint.2016.01.007. short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48. date_created: 2018-12-11T11:52:33Z date_published: 2016-05-01T00:00:00Z date_updated: 2023-02-23T12:25:49Z day: '01' department: - _id: KrCh doi: 10.1016/j.artint.2016.01.007 ec_funded: 1 external_id: arxiv: - '1411.3880' intvolume: ' 234' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1411.3880 month: '05' oa: 1 oa_version: Preprint page: 26 - 48 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Artificial Intelligence publication_status: published publisher: Elsevier publist_id: '5642' quality_controlled: '1' related_material: record: - id: '1820' relation: earlier_version status: public - id: '5425' relation: earlier_version status: public scopus_import: 1 status: public title: Optimal cost almost-sure reachability in POMDPs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 234 year: '2016' ... --- _id: '1545' abstract: - lang: eng text: We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our sufficient conditions are optimal in the sense that they become necessary when the relevant one-body operators commute. acknowledgement: We thank Jan Dereziński for several inspiring discussions and useful remarks. We thank the referee for helpful comments. J.P.S. thanks the Erwin Schrödinger Institute for the hospitality during the thematic programme “Quantum many-body systems, random matrices, and disorder”. We gratefully acknowledge the financial supports by the European Union's Seventh Framework Programme under the ERC Advanced Grant ERC-2012-AdG 321029 (J.P.S.) and the REA grant agreement No. 291734 (P.T.N.), as well as the support of the National Science Center (NCN) grant No. 2012/07/N/ST1/03185 and the Austrian Science Fund (FWF) project No. P 27533-N27 (M.N.). author: - first_name: Phan full_name: Nam, Phan id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Nam - first_name: Marcin M full_name: Napiórkowski, Marcin M id: 4197AD04-F248-11E8-B48F-1D18A9856A87 last_name: Napiórkowski - first_name: Jan full_name: Solovej, Jan last_name: Solovej citation: ama: Nam P, Napiórkowski MM, Solovej J. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. 2016;270(11):4340-4368. doi:10.1016/j.jfa.2015.12.007 apa: Nam, P., Napiórkowski, M. M., & Solovej, J. (2016). Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. Academic Press. https://doi.org/10.1016/j.jfa.2015.12.007 chicago: Nam, Phan, Marcin M Napiórkowski, and Jan Solovej. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” Journal of Functional Analysis. Academic Press, 2016. https://doi.org/10.1016/j.jfa.2015.12.007. ieee: P. Nam, M. M. Napiórkowski, and J. Solovej, “Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations,” Journal of Functional Analysis, vol. 270, no. 11. Academic Press, pp. 4340–4368, 2016. ista: Nam P, Napiórkowski MM, Solovej J. 2016. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. 270(11), 4340–4368. mla: Nam, Phan, et al. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” Journal of Functional Analysis, vol. 270, no. 11, Academic Press, 2016, pp. 4340–68, doi:10.1016/j.jfa.2015.12.007. short: P. Nam, M.M. Napiórkowski, J. Solovej, Journal of Functional Analysis 270 (2016) 4340–4368. date_created: 2018-12-11T11:52:38Z date_published: 2016-06-01T00:00:00Z date_updated: 2021-01-12T06:51:30Z day: '01' department: - _id: RoSe doi: 10.1016/j.jfa.2015.12.007 ec_funded: 1 intvolume: ' 270' issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1508.07321 month: '06' oa: 1 oa_version: Submitted Version page: 4340 - 4368 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems publication: Journal of Functional Analysis publication_status: published publisher: Academic Press publist_id: '5626' quality_controlled: '1' scopus_import: 1 status: public title: Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 270 year: '2016' ... --- _id: '1552' abstract: - lang: eng text: Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings. acknowledgement: "We thank the High-Throughput Genomics Group at the Wellcome Trust Centre for Human Genetics funded by Wellcome\r\nTrust grant reference 090532/Z/09/Z and Medical Research Council Hub grant no. G0900747 91070 for generation of the high-throughput sequencing data. We thank Wook Kim and two anonymous reviewers for their constructive feedback on previous versions of our manuscript." article_number: '20152452' author: - first_name: Qin full_name: Qi, Qin id: 3B22D412-F248-11E8-B48F-1D18A9856A87 last_name: Qi orcid: 0000-0002-6148-2416 - first_name: Macarena full_name: Toll Riera, Macarena last_name: Toll Riera - first_name: Karl full_name: Heilbron, Karl last_name: Heilbron - first_name: Gail full_name: Preston, Gail last_name: Preston - first_name: R Craig full_name: Maclean, R Craig last_name: Maclean citation: ama: Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. 2016;283(1822). doi:10.1098/rspb.2015.2452 apa: Qi, Q., Toll Riera, M., Heilbron, K., Preston, G., & Maclean, R. C. (2016). The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, The. https://doi.org/10.1098/rspb.2015.2452 chicago: Qi, Qin, Macarena Toll Riera, Karl Heilbron, Gail Preston, and R Craig Maclean. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance in Pseudomonas Aeruginosa.” Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, The, 2016. https://doi.org/10.1098/rspb.2015.2452. ieee: Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, and R. C. Maclean, “The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 283, no. 1822. Royal Society, The, 2016. ista: Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. 2016. The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. 283(1822), 20152452. mla: Qi, Qin, et al. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance in Pseudomonas Aeruginosa.” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 283, no. 1822, 20152452, Royal Society, The, 2016, doi:10.1098/rspb.2015.2452. short: Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, R.C. Maclean, Proceedings of the Royal Society of London Series B Biological Sciences 283 (2016). date_created: 2018-12-11T11:52:40Z date_published: 2016-01-13T00:00:00Z date_updated: 2021-01-12T06:51:33Z day: '13' ddc: - '570' department: - _id: ToBo doi: 10.1098/rspb.2015.2452 file: - access_level: open_access checksum: 78ffe70c1c88af3856d31ca6b7195a27 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:43Z date_updated: 2020-07-14T12:45:02Z file_id: '4899' file_name: IST-2016-488-v1+1_20152452.full.pdf file_size: 626804 relation: main_file file_date_updated: 2020-07-14T12:45:02Z has_accepted_license: '1' intvolume: ' 283' issue: '1822' language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: Proceedings of the Royal Society of London Series B Biological Sciences publication_status: published publisher: Royal Society, The publist_id: '5619' pubrep_id: '488' quality_controlled: '1' scopus_import: 1 status: public title: The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 283 year: '2016' ... --- _id: '1592' abstract: - lang: eng text: A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members. acknowledgement: The authors would like to thank the anonymous reviewers of this paper. We also would like to express our appreciation to the program committee and the anonymous reviewers for CRYPTO 2010. The first author thanks Sherman S. M. Chow for his comment on group signatures in Sect. 7.1. author: - first_name: Masayuki full_name: Abe, Masayuki last_name: Abe - first_name: Georg full_name: Fuchsbauer, Georg id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87 last_name: Fuchsbauer - first_name: Jens full_name: Groth, Jens last_name: Groth - first_name: Kristiyan full_name: Haralambiev, Kristiyan last_name: Haralambiev - first_name: Miyako full_name: Ohkubo, Miyako last_name: Ohkubo citation: ama: Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 2016;29(2):363-421. doi:10.1007/s00145-014-9196-7 apa: Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., & Ohkubo, M. (2016). Structure preserving signatures and commitments to group elements. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-014-9196-7 chicago: Abe, Masayuki, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. “Structure Preserving Signatures and Commitments to Group Elements.” Journal of Cryptology. Springer, 2016. https://doi.org/10.1007/s00145-014-9196-7. ieee: M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure preserving signatures and commitments to group elements,” Journal of Cryptology, vol. 29, no. 2. Springer, pp. 363–421, 2016. ista: Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. 2016. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 29(2), 363–421. mla: Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group Elements.” Journal of Cryptology, vol. 29, no. 2, Springer, 2016, pp. 363–421, doi:10.1007/s00145-014-9196-7. short: M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology 29 (2016) 363–421. date_created: 2018-12-11T11:52:54Z date_published: 2016-04-01T00:00:00Z date_updated: 2021-01-12T06:51:49Z day: '01' department: - _id: KrPi doi: 10.1007/s00145-014-9196-7 intvolume: ' 29' issue: '2' language: - iso: eng month: '04' oa_version: None page: 363 - 421 publication: Journal of Cryptology publication_status: published publisher: Springer publist_id: '5579' quality_controlled: '1' scopus_import: 1 status: public title: Structure preserving signatures and commitments to group elements type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2016' ... --- _id: '1597' abstract: - lang: eng text: Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions. acknowledged_ssus: - _id: Bio acknowledgement: This work was supported by the Boehringer Ingelheim Fonds, the European Research Council (ERC StG 281556), and a START Award of the Austrian Science Foundation (FWF). We thank Robert Hauschild, Anne Reversat, and Jack Merrin for valuable input and the Imaging Facility of IST Austria for excellent support. article_processing_charge: No article_type: original author: - first_name: Jan full_name: Schwarz, Jan id: 346C1EC6-F248-11E8-B48F-1D18A9856A87 last_name: Schwarz - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Schwarz J, Sixt MK. Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. 2016;570:567-581. doi:10.1016/bs.mie.2015.11.004 apa: Schwarz, J., & Sixt, M. K. (2016). Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. Elsevier. https://doi.org/10.1016/bs.mie.2015.11.004 chicago: Schwarz, Jan, and Michael K Sixt. “Quantitative Analysis of Dendritic Cell Haptotaxis.” Methods in Enzymology. Elsevier, 2016. https://doi.org/10.1016/bs.mie.2015.11.004. ieee: J. Schwarz and M. K. Sixt, “Quantitative analysis of dendritic cell haptotaxis,” Methods in Enzymology, vol. 570. Elsevier, pp. 567–581, 2016. ista: Schwarz J, Sixt MK. 2016. Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. 570, 567–581. mla: Schwarz, Jan, and Michael K. Sixt. “Quantitative Analysis of Dendritic Cell Haptotaxis.” Methods in Enzymology, vol. 570, Elsevier, 2016, pp. 567–81, doi:10.1016/bs.mie.2015.11.004. short: J. Schwarz, M.K. Sixt, Methods in Enzymology 570 (2016) 567–581. date_created: 2018-12-11T11:52:56Z date_published: 2016-01-01T00:00:00Z date_updated: 2021-01-12T06:51:51Z day: '01' department: - _id: MiSi doi: 10.1016/bs.mie.2015.11.004 ec_funded: 1 external_id: pmid: - '26921962' intvolume: ' 570' language: - iso: eng month: '01' oa_version: None page: 567 - 581 pmid: 1 project: - _id: 25A603A2-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '281556' name: Cytoskeletal force generation and force transduction of migrating leukocytes (EU) - _id: 25A8E5EA-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Y 564-B12 name: Cytoskeletal force generation and transduction of leukocytes (FWF) publication: Methods in Enzymology publication_status: published publisher: Elsevier publist_id: '5573' quality_controlled: '1' scopus_import: 1 status: public title: Quantitative analysis of dendritic cell haptotaxis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 570 year: '2016' ... --- _id: '1599' abstract: - lang: eng text: "The addition of polysialic acid to N- and/or O-linked glycans, referred to as polysialylation, is a rare posttranslational modification that is mainly known to control the developmental plasticity of the nervous system. Here we show that CCR7, the central chemokine receptor controlling immune cell trafficking to secondary lymphatic organs, carries polysialic acid. This modification is essential for the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited conformation, which is released upon interaction with polysialic acid. Thus, we describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic basis.\r\n" acknowledged_ssus: - _id: SSU acknowledgement: 'We thank S. Schüchner and E. Ogris for kindly providing the antibody to GFP, M. Helmbrecht and A. Huber for providing Nrp2−/− mice, the IST Scientific Support Facilities for excellent services, and J. Renkawitz and K. Vaahtomeri for critically reading the manuscript. ' article_processing_charge: No article_type: original author: - first_name: Eva full_name: Kiermaier, Eva id: 3EB04B78-F248-11E8-B48F-1D18A9856A87 last_name: Kiermaier orcid: 0000-0001-6165-5738 - first_name: Christine full_name: Moussion, Christine id: 3356F664-F248-11E8-B48F-1D18A9856A87 last_name: Moussion - first_name: Christopher full_name: Veldkamp, Christopher last_name: Veldkamp - first_name: Rita full_name: Gerardy Schahn, Rita last_name: Gerardy Schahn - first_name: Ingrid full_name: De Vries, Ingrid id: 4C7D837E-F248-11E8-B48F-1D18A9856A87 last_name: De Vries - first_name: Larry full_name: Williams, Larry last_name: Williams - first_name: Gary full_name: Chaffee, Gary last_name: Chaffee - first_name: Andrew full_name: Phillips, Andrew last_name: Phillips - first_name: Friedrich full_name: Freiberger, Friedrich last_name: Freiberger - first_name: Richard full_name: Imre, Richard last_name: Imre - first_name: Deni full_name: Taleski, Deni last_name: Taleski - first_name: Richard full_name: Payne, Richard last_name: Payne - first_name: Asolina full_name: Braun, Asolina last_name: Braun - first_name: Reinhold full_name: Förster, Reinhold last_name: Förster - first_name: Karl full_name: Mechtler, Karl last_name: Mechtler - first_name: Martina full_name: Mühlenhoff, Martina last_name: Mühlenhoff - first_name: Brian full_name: Volkman, Brian last_name: Volkman - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Kiermaier E, Moussion C, Veldkamp C, et al. Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. 2016;351(6269):186-190. doi:10.1126/science.aad0512 apa: Kiermaier, E., Moussion, C., Veldkamp, C., Gerardy  Schahn, R., de Vries, I., Williams, L., … Sixt, M. K. (2016). Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aad0512 chicago: Kiermaier, Eva, Christine Moussion, Christopher Veldkamp, Rita Gerardy  Schahn, Ingrid de Vries, Larry Williams, Gary Chaffee, et al. “Polysialylation Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” Science. American Association for the Advancement of Science, 2016. https://doi.org/10.1126/science.aad0512. ieee: E. Kiermaier et al., “Polysialylation controls dendritic cell trafficking by regulating chemokine recognition,” Science, vol. 351, no. 6269. American Association for the Advancement of Science, pp. 186–190, 2016. ista: Kiermaier E, Moussion C, Veldkamp C, Gerardy  Schahn R, de Vries I, Williams L, Chaffee G, Phillips A, Freiberger F, Imre R, Taleski D, Payne R, Braun A, Förster R, Mechtler K, Mühlenhoff M, Volkman B, Sixt MK. 2016. Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. 351(6269), 186–190. mla: Kiermaier, Eva, et al. “Polysialylation Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” Science, vol. 351, no. 6269, American Association for the Advancement of Science, 2016, pp. 186–90, doi:10.1126/science.aad0512. short: E. Kiermaier, C. Moussion, C. Veldkamp, R. Gerardy  Schahn, I. de Vries, L. Williams, G. Chaffee, A. Phillips, F. Freiberger, R. Imre, D. Taleski, R. Payne, A. Braun, R. Förster, K. Mechtler, M. Mühlenhoff, B. Volkman, M.K. Sixt, Science 351 (2016) 186–190. date_created: 2018-12-11T11:52:57Z date_published: 2016-01-08T00:00:00Z date_updated: 2021-01-12T06:51:52Z day: '08' department: - _id: MiSi doi: 10.1126/science.aad0512 ec_funded: 1 external_id: pmid: - '26657283' intvolume: ' 351' issue: '6269' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5583642/ month: '01' oa: 1 oa_version: Submitted Version page: 186 - 190 pmid: 1 project: - _id: 25A603A2-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '281556' name: Cytoskeletal force generation and force transduction of migrating leukocytes (EU) - _id: 25A76F58-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '289720' name: Stromal Cell-immune Cell Interactions in Health and Disease - _id: 25A8E5EA-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Y 564-B12 name: Cytoskeletal force generation and transduction of leukocytes (FWF) publication: Science publication_status: published publisher: American Association for the Advancement of Science publist_id: '5570' quality_controlled: '1' scopus_import: 1 status: public title: Polysialylation controls dendritic cell trafficking by regulating chemokine recognition type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 351 year: '2016' ... --- _id: '1608' abstract: - lang: eng text: 'We show that the Anderson model has a transition from localization to delocalization at exactly 2 dimensional growth rate on antitrees with normalized edge weights which are certain discrete graphs. The kinetic part has a one-dimensional structure allowing a description through transfer matrices which involve some Schur complement. For such operators we introduce the notion of having one propagating channel and extend theorems from the theory of one-dimensional Jacobi operators that relate the behavior of transfer matrices with the spectrum. These theorems are then applied to the considered model. In essence, in a certain energy region the kinetic part averages the random potentials along shells and the transfer matrices behave similar as for a one-dimensional operator with random potential of decaying variance. At d dimensional growth for d>2 this effective decay is strong enough to obtain absolutely continuous spectrum, whereas for some uniform d dimensional growth with d<2 one has pure point spectrum in this energy region. At exactly uniform 2 dimensional growth also some singular continuous spectrum appears, at least at small disorder. As a corollary we also obtain a change from singular spectrum (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete adjacency operator (Laplacian) on ℤd and λ a random potential. ' author: - first_name: Christian full_name: Sadel, Christian id: 4760E9F8-F248-11E8-B48F-1D18A9856A87 last_name: Sadel orcid: 0000-0001-8255-3968 citation: ama: Sadel C. Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. 2016;17(7):1631-1675. doi:10.1007/s00023-015-0456-3 apa: Sadel, C. (2016). Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-015-0456-3 chicago: Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees and Spectral Theory for Operators with One Propagating Channel.” Annales Henri Poincare. Birkhäuser, 2016. https://doi.org/10.1007/s00023-015-0456-3. ieee: C. Sadel, “Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel,” Annales Henri Poincare, vol. 17, no. 7. Birkhäuser, pp. 1631–1675, 2016. ista: Sadel C. 2016. Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. 17(7), 1631–1675. mla: Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees and Spectral Theory for Operators with One Propagating Channel.” Annales Henri Poincare, vol. 17, no. 7, Birkhäuser, 2016, pp. 1631–75, doi:10.1007/s00023-015-0456-3. short: C. Sadel, Annales Henri Poincare 17 (2016) 1631–1675. date_created: 2018-12-11T11:53:00Z date_published: 2016-07-01T00:00:00Z date_updated: 2021-01-12T06:51:58Z day: '01' department: - _id: LaEr doi: 10.1007/s00023-015-0456-3 ec_funded: 1 intvolume: ' 17' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1501.04287 month: '07' oa: 1 oa_version: Preprint page: 1631 - 1675 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Annales Henri Poincare publication_status: published publisher: Birkhäuser publist_id: '5558' quality_controlled: '1' scopus_import: 1 status: public title: Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2016' ... --- _id: '1612' abstract: - lang: eng text: We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width). author: - first_name: Alexandr full_name: Kazda, Alexandr id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87 last_name: Kazda citation: ama: Kazda A. CSP for binary conservative relational structures. Algebra Universalis. 2016;75(1):75-84. doi:10.1007/s00012-015-0358-8 apa: Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer. https://doi.org/10.1007/s00012-015-0358-8 chicago: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis. Springer, 2016. https://doi.org/10.1007/s00012-015-0358-8. ieee: A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016. ista: Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84. mla: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8. short: A. Kazda, Algebra Universalis 75 (2016) 75–84. date_created: 2018-12-11T11:53:01Z date_published: 2016-02-01T00:00:00Z date_updated: 2021-01-12T06:52:00Z day: '01' department: - _id: VlKo doi: 10.1007/s00012-015-0358-8 intvolume: ' 75' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1112.1099 month: '02' oa: 1 oa_version: Preprint page: 75 - 84 publication: Algebra Universalis publication_status: published publisher: Springer publist_id: '5554' quality_controlled: '1' scopus_import: 1 status: public title: CSP for binary conservative relational structures type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 75 year: '2016' ... --- _id: '1319' abstract: - lang: eng text: We present a novel optimization-based algorithm for the design and fabrication of customized, deformable input devices, capable of continuously sensing their deformation. We propose to embed piezoresistive sensing elements into flexible 3D printed objects. These sensing elements are then utilized to recover rich and natural user interactions at runtime. Designing such objects is a challenging and hard problem if attempted manually for all but the simplest geometries and deformations. Our method simultaneously optimizes the internal routing of the sensing elements and computes a mapping from low-level sensor readings to user-specified outputs in order to minimize reconstruction error. We demonstrate the power and flexibility of the approach by designing and fabricating a set of flexible input devices. Our results indicate that the optimization-based design greatly outperforms manual routings in terms of reconstruction accuracy and thus interaction fidelity. acknowledgement: "We thank Damian Karrer, Rocco Ghielmini and Jemin\r\nHwangbo for their help in our initial explorations. We would\r\nlike to thank Christian Schumacher for creating the video and\r\nC\r\n ́\r\necile Edwards-Rietmann for providing the voiceover. Mau-\r\nrizio Nitti helped us in designing our 3D characters. We thank\r\nChiara Daraio for insightful discussions on material proper-\r\nties and 3D printing. We also thank the CHI reviewers for\r\ntheir feedback and guidance. Fabrizio Pece was supported by\r\nan ETH/Marie Curie fellowship (FEL-3314-1)." author: - first_name: Moritz full_name: Bächer, Moritz last_name: Bächer - first_name: Benjamin full_name: Hepp, Benjamin last_name: Hepp - first_name: Fabrizio full_name: Pece, Fabrizio last_name: Pece - first_name: Paul full_name: Kry, Paul last_name: Kry - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Bernhard full_name: Thomaszewski, Bernhard last_name: Thomaszewski - first_name: Otmar full_name: Hilliges, Otmar last_name: Hilliges citation: ama: 'Bächer M, Hepp B, Pece F, et al. DefSense: computational design of customized deformable input devices. In: ACM; 2016:3806-3816. doi:10.1145/2858036.2858354' apa: 'Bächer, M., Hepp, B., Pece, F., Kry, P., Bickel, B., Thomaszewski, B., & Hilliges, O. (2016). DefSense: computational design of customized deformable input devices (pp. 3806–3816). Presented at the CHI: Conference on Human Factors in Computing Systems, San Jose, California, USA: ACM. https://doi.org/10.1145/2858036.2858354' chicago: 'Bächer, Moritz, Benjamin Hepp, Fabrizio Pece, Paul Kry, Bernd Bickel, Bernhard Thomaszewski, and Otmar Hilliges. “DefSense: Computational Design of Customized Deformable Input Devices,” 3806–16. ACM, 2016. https://doi.org/10.1145/2858036.2858354.' ieee: 'M. Bächer et al., “DefSense: computational design of customized deformable input devices,” presented at the CHI: Conference on Human Factors in Computing Systems, San Jose, California, USA, 2016, pp. 3806–3816.' ista: 'Bächer M, Hepp B, Pece F, Kry P, Bickel B, Thomaszewski B, Hilliges O. 2016. DefSense: computational design of customized deformable input devices. CHI: Conference on Human Factors in Computing Systems, 3806–3816.' mla: 'Bächer, Moritz, et al. DefSense: Computational Design of Customized Deformable Input Devices. ACM, 2016, pp. 3806–16, doi:10.1145/2858036.2858354.' short: M. Bächer, B. Hepp, F. Pece, P. Kry, B. Bickel, B. Thomaszewski, O. Hilliges, in:, ACM, 2016, pp. 3806–3816. conference: end_date: 2016-05-12 location: San Jose, California, USA name: 'CHI: Conference on Human Factors in Computing Systems' start_date: 2016-05-07 date_created: 2018-12-11T11:51:21Z date_published: 2016-05-07T00:00:00Z date_updated: 2021-01-12T06:49:51Z day: '07' department: - _id: BeBi doi: 10.1145/2858036.2858354 language: - iso: eng month: '05' oa_version: None page: 3806 - 3816 publication_status: published publisher: ACM publist_id: '5951' quality_controlled: '1' scopus_import: 1 status: public title: 'DefSense: computational design of customized deformable input devices' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '1320' abstract: - lang: eng text: 'In recent years, several biomolecular systems have been shown to be scale-invariant (SI), i.e. to show the same output dynamics when exposed to geometrically scaled input signals (u → pu, p > 0) after pre-adaptation to accordingly scaled constant inputs. In this article, we show that SI systems-as well as systems invariant with respect to other input transformations-can realize nonlinear differential operators: when excited by inputs obeying functional forms characteristic for a given class of invariant systems, the systems'' outputs converge to constant values directly quantifying the speed of the input.' acknowledgement: The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n° [291734]. Work supported in part by grants AFOSR FA9550-14-1-0060 and NIH 1R01GM100473. article_number: '7526722' author: - first_name: Moritz full_name: Lang, Moritz id: 29E0800A-F248-11E8-B48F-1D18A9856A87 last_name: Lang - first_name: Eduardo full_name: Sontag, Eduardo last_name: Sontag citation: ama: 'Lang M, Sontag E. Scale-invariant systems realize nonlinear differential operators. In: Vol 2016-July. IEEE; 2016. doi:10.1109/ACC.2016.7526722' apa: 'Lang, M., & Sontag, E. (2016). Scale-invariant systems realize nonlinear differential operators (Vol. 2016–July). Presented at the ACC: American Control Conference, Boston, MA, USA: IEEE. https://doi.org/10.1109/ACC.2016.7526722' chicago: Lang, Moritz, and Eduardo Sontag. “Scale-Invariant Systems Realize Nonlinear Differential Operators,” Vol. 2016–July. IEEE, 2016. https://doi.org/10.1109/ACC.2016.7526722. ieee: 'M. Lang and E. Sontag, “Scale-invariant systems realize nonlinear differential operators,” presented at the ACC: American Control Conference, Boston, MA, USA, 2016, vol. 2016–July.' ista: 'Lang M, Sontag E. 2016. Scale-invariant systems realize nonlinear differential operators. ACC: American Control Conference vol. 2016–July, 7526722.' mla: Lang, Moritz, and Eduardo Sontag. Scale-Invariant Systems Realize Nonlinear Differential Operators. Vol. 2016–July, 7526722, IEEE, 2016, doi:10.1109/ACC.2016.7526722. short: M. Lang, E. Sontag, in:, IEEE, 2016. conference: end_date: 2016-07-08 location: Boston, MA, USA name: 'ACC: American Control Conference' start_date: 2016-07-06 date_created: 2018-12-11T11:51:21Z date_published: 2016-07-28T00:00:00Z date_updated: 2021-01-12T06:49:51Z day: '28' ddc: - '003' - '621' department: - _id: CaGu - _id: GaTk doi: 10.1109/ACC.2016.7526722 ec_funded: 1 file: - access_level: local checksum: 7219432b43defc62a0d45f48d4ce6a19 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:17Z date_updated: 2020-07-14T12:44:43Z file_id: '5203' file_name: IST-2017-810-v1+1_root.pdf file_size: 539166 relation: main_file file_date_updated: 2020-07-14T12:44:43Z has_accepted_license: '1' language: - iso: eng month: '07' oa_version: Preprint project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication_status: published publisher: IEEE publist_id: '5950' pubrep_id: '810' quality_controlled: '1' scopus_import: 1 status: public title: Scale-invariant systems realize nonlinear differential operators type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 2016-July year: '2016' ... --- _id: '1321' abstract: - lang: eng text: Most migrating cells extrude their front by the force of actin polymerization. Polymerization requires an initial nucleation step, which is mediated by factors establishing either parallel filaments in the case of filopodia or branched filaments that form the branched lamellipodial network. Branches are considered essential for regular cell motility and are initiated by the Arp2/3 complex, which in turn is activated by nucleation-promoting factors of the WASP and WAVE families. Here we employed rapid amoeboid crawling leukocytes and found that deletion of the WAVE complex eliminated actin branching and thus lamellipodia formation. The cells were left with parallel filaments at the leading edge, which translated, depending on the differentiation status of the cell, into a unipolar pointed cell shape or cells with multiple filopodia. Remarkably, unipolar cells migrated with increased speed and enormous directional persistence, while they were unable to turn towards chemotactic gradients. Cells with multiple filopodia retained chemotactic activity but their migration was progressively impaired with increasing geometrical complexity of the extracellular environment. These findings establish that diversified leading edge protrusions serve as explorative structures while they slow down actual locomotion. acknowledged_ssus: - _id: SSU acknowledgement: "This work was supported by the German Research Foundation (DFG) Priority Program SP 1464 to T.E.B.S. and M.S., and European Research Council (ERC GA 281556) and Human Frontiers Program grants to M.S.\r\nService Units of IST Austria for excellent technical support." article_processing_charge: No article_type: original author: - first_name: Alexander F full_name: Leithner, Alexander F id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87 last_name: Leithner orcid: 0000-0002-1073-744X - first_name: Alexander full_name: Eichner, Alexander id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87 last_name: Eichner - first_name: Jan full_name: Müller, Jan id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D last_name: Müller - first_name: Anne full_name: Reversat, Anne id: 35B76592-F248-11E8-B48F-1D18A9856A87 last_name: Reversat orcid: 0000-0003-0666-8928 - first_name: Markus full_name: Brown, Markus id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Jan full_name: Schwarz, Jan id: 346C1EC6-F248-11E8-B48F-1D18A9856A87 last_name: Schwarz - first_name: Jack full_name: Merrin, Jack id: 4515C308-F248-11E8-B48F-1D18A9856A87 last_name: Merrin orcid: 0000-0001-5145-4609 - first_name: David full_name: De Gorter, David last_name: De Gorter - first_name: Florian full_name: Schur, Florian id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 - first_name: Jonathan full_name: Bayerl, Jonathan last_name: Bayerl - first_name: Ingrid full_name: De Vries, Ingrid id: 4C7D837E-F248-11E8-B48F-1D18A9856A87 last_name: De Vries - first_name: Stefan full_name: Wieser, Stefan id: 355AA5A0-F248-11E8-B48F-1D18A9856A87 last_name: Wieser orcid: 0000-0002-2670-2217 - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Frank full_name: Lai, Frank last_name: Lai - first_name: Markus full_name: Moser, Markus last_name: Moser - first_name: Dontscho full_name: Kerjaschki, Dontscho last_name: Kerjaschki - first_name: Klemens full_name: Rottner, Klemens last_name: Rottner - first_name: Victor full_name: Small, Victor last_name: Small - first_name: Theresia full_name: Stradal, Theresia last_name: Stradal - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Leithner AF, Eichner A, Müller J, et al. Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology. 2016;18:1253-1259. doi:10.1038/ncb3426 apa: Leithner, A. F., Eichner, A., Müller, J., Reversat, A., Brown, M., Schwarz, J., … Sixt, M. K. (2016). Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb3426 chicago: Leithner, Alexander F, Alexander Eichner, Jan Müller, Anne Reversat, Markus Brown, Jan Schwarz, Jack Merrin, et al. “Diversified Actin Protrusions Promote Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” Nature Cell Biology. Nature Publishing Group, 2016. https://doi.org/10.1038/ncb3426. ieee: A. F. Leithner et al., “Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes,” Nature Cell Biology, vol. 18. Nature Publishing Group, pp. 1253–1259, 2016. ista: Leithner AF, Eichner A, Müller J, Reversat A, Brown M, Schwarz J, Merrin J, De Gorter D, Schur FK, Bayerl J, de Vries I, Wieser S, Hauschild R, Lai F, Moser M, Kerjaschki D, Rottner K, Small V, Stradal T, Sixt MK. 2016. Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology. 18, 1253–1259. mla: Leithner, Alexander F., et al. “Diversified Actin Protrusions Promote Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” Nature Cell Biology, vol. 18, Nature Publishing Group, 2016, pp. 1253–59, doi:10.1038/ncb3426. short: A.F. Leithner, A. Eichner, J. Müller, A. Reversat, M. Brown, J. Schwarz, J. Merrin, D. De Gorter, F.K. Schur, J. Bayerl, I. de Vries, S. Wieser, R. Hauschild, F. Lai, M. Moser, D. Kerjaschki, K. Rottner, V. Small, T. Stradal, M.K. Sixt, Nature Cell Biology 18 (2016) 1253–1259. date_created: 2018-12-11T11:51:21Z date_published: 2016-10-24T00:00:00Z date_updated: 2024-03-25T23:30:09Z day: '24' ddc: - '570' department: - _id: MiSi - _id: NanoFab - _id: Bio doi: 10.1038/ncb3426 ec_funded: 1 file: - access_level: open_access checksum: e1411cb7c99a2d9089c178a6abef25e7 content_type: application/pdf creator: dernst date_created: 2020-05-14T16:33:46Z date_updated: 2020-07-14T12:44:43Z file_id: '7844' file_name: 2018_NatureCell_Leithner.pdf file_size: 4433280 relation: main_file file_date_updated: 2020-07-14T12:44:43Z has_accepted_license: '1' intvolume: ' 18' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 1253 - 1259 project: - _id: 25A603A2-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '281556' name: Cytoskeletal force generation and force transduction of migrating leukocytes (EU) publication: Nature Cell Biology publication_status: published publisher: Nature Publishing Group publist_id: '5949' quality_controlled: '1' related_material: record: - id: '323' relation: dissertation_contains status: public scopus_import: 1 status: public title: Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2016' ... --- _id: '1322' abstract: - lang: eng text: Direct reciprocity is a major mechanism for the evolution of cooperation. Several classical studies have suggested that humans should quickly learn to adopt reciprocal strategies to establish mutual cooperation in repeated interactions. On the other hand, the recently discovered theory of ZD strategies has found that subjects who use extortionate strategies are able to exploit and subdue cooperators. Although such extortioners have been predicted to succeed in any population of adaptive opponents, theoretical follow-up studies questioned whether extortion can evolve in reality. However, most of these studies presumed that individuals have similar strategic possibilities and comparable outside options, whereas asymmetries are ubiquitous in real world applications. Here we show with a model and an economic experiment that extortionate strategies readily emerge once subjects differ in their strategic power. Our experiment combines a repeated social dilemma with asymmetric partner choice. In our main treatment there is one randomly chosen group member who is unilaterally allowed to exchange one of the other group members after every ten rounds of the social dilemma. We find that this asymmetric replacement opportunity generally promotes cooperation, but often the resulting payoff distribution reflects the underlying power structure. Almost half of the subjects in a better strategic position turn into extortioners, who quickly proceed to exploit their peers. By adapting their cooperation probabilities consistent with ZD theory, extortioners force their co-players to cooperate without being similarly cooperative themselves. Comparison to non-extortionate players under the same conditions indicates a substantial net gain to extortion. Our results thus highlight how power asymmetries can endanger mutually beneficial interactions, and transform them into exploitative relationships. In particular, our results indicate that the extortionate strategies predicted from ZD theory could play a more prominent role in our daily interactions than previously thought. acknowledgement: 'CH was funded by the Schrödinger program of the Austrian Science Fund (FWF) J3475. ' article_number: e0163867 author: - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Kristin full_name: Hagel, Kristin last_name: Hagel - first_name: Manfred full_name: Milinski, Manfred last_name: Milinski citation: ama: Hilbe C, Hagel K, Milinski M. Asymmetric power boosts extortion in an economic experiment. PLoS One. 2016;11(10). doi:10.1371/journal.pone.0163867 apa: Hilbe, C., Hagel, K., & Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867 chicago: Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.” PLoS One. Public Library of Science, 2016. https://doi.org/10.1371/journal.pone.0163867. ieee: C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” PLoS One, vol. 11, no. 10. Public Library of Science, 2016. ista: Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867. mla: Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.” PLoS One, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:10.1371/journal.pone.0163867. short: C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016). date_created: 2018-12-11T11:51:22Z date_published: 2016-10-04T00:00:00Z date_updated: 2023-02-23T14:11:27Z day: '04' ddc: - '004' - '006' department: - _id: KrCh doi: 10.1371/journal.pone.0163867 file: - access_level: open_access checksum: 6b33e394003dfe8b4ca6be1858aaa8e3 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:08Z date_updated: 2020-07-14T12:44:44Z file_id: '4668' file_name: IST-2016-716-v1+1_journal.pone.0163867.PDF file_size: 2077905 relation: main_file file_date_updated: 2020-07-14T12:44:44Z has_accepted_license: '1' intvolume: ' 11' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '5948' pubrep_id: '716' quality_controlled: '1' related_material: record: - id: '9867' relation: research_data status: public - id: '9868' relation: research_data status: public scopus_import: 1 status: public title: Asymmetric power boosts extortion in an economic experiment tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2016' ... --- _id: '1323' abstract: - lang: eng text: Mossy fiber synapses on CA3 pyramidal cells are 'conditional detonators' that reliably discharge postsynaptic targets. The 'conditional' nature implies that burst activity in dentate gyrus granule cells is required for detonation. Whether single unitary excitatory postsynaptic potentials (EPSPs) trigger spikes in CA3 neurons remains unknown. Mossy fiber synapses exhibit both pronounced short-term facilitation and uniquely large post-tetanic potentiation (PTP). We tested whether PTP could convert mossy fiber synapses from subdetonator into detonator mode, using a recently developed method to selectively and noninvasively stimulate individual presynaptic terminals in rat brain slices. Unitary EPSPs failed to initiate a spike in CA3 neurons under control conditions, but reliably discharged them after induction of presynaptic short-term plasticity. Remarkably, PTP switched mossy fiber synapses into full detonators for tens of seconds. Plasticity-dependent detonation may be critical for efficient coding, storage, and recall of information in the granule cell–CA3 cell network. acknowledged_ssus: - _id: M-Shop - _id: PreCl article_number: e17977 author: - first_name: Nicholas full_name: Vyleta, Nicholas id: 36C4978E-F248-11E8-B48F-1D18A9856A87 last_name: Vyleta - first_name: Carolina full_name: Borges Merjane, Carolina id: 4305C450-F248-11E8-B48F-1D18A9856A87 last_name: Borges Merjane orcid: 0000-0003-0005-401X - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: Vyleta N, Borges Merjane C, Jonas PM. Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. eLife. 2016;5. doi:10.7554/eLife.17977 apa: Vyleta, N., Borges Merjane, C., & Jonas, P. M. (2016). Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.17977 chicago: Vyleta, Nicholas, Carolina Borges Merjane, and Peter M Jonas. “Plasticity-Dependent, Full Detonation at Hippocampal Mossy Fiber–CA3 Pyramidal Neuron Synapses.” ELife. eLife Sciences Publications, 2016. https://doi.org/10.7554/eLife.17977. ieee: N. Vyleta, C. Borges Merjane, and P. M. Jonas, “Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses,” eLife, vol. 5. eLife Sciences Publications, 2016. ista: Vyleta N, Borges Merjane C, Jonas PM. 2016. Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. eLife. 5, e17977. mla: Vyleta, Nicholas, et al. “Plasticity-Dependent, Full Detonation at Hippocampal Mossy Fiber–CA3 Pyramidal Neuron Synapses.” ELife, vol. 5, e17977, eLife Sciences Publications, 2016, doi:10.7554/eLife.17977. short: N. Vyleta, C. Borges Merjane, P.M. Jonas, ELife 5 (2016). date_created: 2018-12-11T11:51:22Z date_published: 2016-10-25T00:00:00Z date_updated: 2023-02-21T10:34:24Z day: '25' ddc: - '571' - '572' department: - _id: PeJo doi: 10.7554/eLife.17977 ec_funded: 1 file: - access_level: open_access checksum: a7201280c571bed88ebd459ce5ce6a47 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:05Z date_updated: 2020-07-14T12:44:44Z file_id: '5257' file_name: IST-2016-715-v1+1_e17977-download.pdf file_size: 1477891 relation: main_file file_date_updated: 2020-07-14T12:44:44Z has_accepted_license: '1' intvolume: ' 5' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 25C0F108-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '268548' name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons - _id: 25B7EB9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '692692' name: Biophysics and circuit function of a giant cortical glumatergic synapse publication: eLife publication_status: published publisher: eLife Sciences Publications publist_id: '5947' pubrep_id: '715' quality_controlled: '1' scopus_import: 1 status: public title: Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2016' ... --- _id: '1324' abstract: - lang: eng text: 'DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. Copyright ' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik citation: ama: 'Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. Vol 2016-January. AAAI Press; 2016:88-96.' apa: 'Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.' chicago: Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016. ieee: K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96. ista: 'Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January, 88–96.' mla: Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, vol. 2016–January, AAAI Press, 2016, pp. 88–96. short: K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96. conference: end_date: 2016-06-17 location: London, United Kingdom name: 'ICAPS: International Conference on Automated Planning and Scheduling' start_date: 2016-06-12 date_created: 2018-12-11T11:51:22Z date_published: 2016-01-01T00:00:00Z date_updated: 2021-01-12T06:49:53Z day: '01' department: - _id: KrCh ec_funded: 1 language: - iso: eng main_file_link: - url: http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12999 month: '01' oa_version: None page: 88 - 96 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF 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' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling publication_status: published publisher: AAAI Press publist_id: '5946' quality_controlled: '1' scopus_import: 1 status: public title: Indefinite-horizon reachability in Goal-DEC-POMDPs type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 2016-January year: '2016' ... --- _id: '1325' abstract: - lang: eng text: We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system. acknowledgement: "The work has been supported by the Czech Science Foundation, grant No. 15-17564S, by EPSRC grant\r\nEP/M023656/1, and by the People Programme (Marie Curie Actions) of the European Union’s Seventh\r\nFramework Programme (FP7/2007-2013) under REA grant agreement no [291734]" alternative_title: - LIPIcs article_number: '10' author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Vojtěch full_name: Forejt, Vojtěch last_name: Forejt - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny citation: ama: 'Brázdil T, Forejt V, Kučera A, Novotný P. Stability in graphs and games. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.10' apa: 'Brázdil, T., Forejt, V., Kučera, A., & Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.10' chicago: Brázdil, Tomáš, Vojtěch Forejt, Antonín Kučera, and Petr Novotný. “Stability in Graphs and Games,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.10. ieee: 'T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.' ista: 'Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10.' mla: Brázdil, Tomáš, et al. Stability in Graphs and Games. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.10. short: T. Brázdil, V. Forejt, A. Kučera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. conference: end_date: 2016-08-26 location: Quebec City, Canada name: 'CONCUR: Concurrency Theory' start_date: 2016-08-23 date_created: 2018-12-11T11:51:23Z date_published: 2016-08-01T00:00:00Z date_updated: 2021-01-12T06:49:53Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4230/LIPIcs.CONCUR.2016.10 ec_funded: 1 file: - access_level: open_access checksum: 3c2dc6ab0358f8aa8f7aa7d6c1293159 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:40Z date_updated: 2020-07-14T12:44:44Z file_id: '5229' file_name: IST-2016-665-v1+1_Forejt_et_al__Stability_in_graphs_and_games.pdf file_size: 553648 relation: main_file file_date_updated: 2020-07-14T12:44:44Z has_accepted_license: '1' intvolume: ' 59' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '5944' pubrep_id: '665' quality_controlled: '1' scopus_import: 1 status: public title: Stability in graphs and games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 59 year: '2016' ... --- _id: '1326' abstract: - lang: eng text: 'Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff. ' acknowledgement: The research was funded by the Czech Science Foundation Grant No. P202/12/G061 and by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734]. alternative_title: - LNCS author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny citation: ama: 'Brázdil T, Kučera A, Novotný P. Optimizing the expected mean payoff in Energy Markov Decision Processes. In: Vol 9938. Springer; 2016:32-49. doi:10.1007/978-3-319-46520-3_3' apa: 'Brázdil, T., Kučera, A., & Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. https://doi.org/10.1007/978-3-319-46520-3_3' chicago: Brázdil, Tomáš, Antonín Kučera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,” 9938:32–49. Springer, 2016. https://doi.org/10.1007/978-3-319-46520-3_3. ieee: 'T. Brázdil, A. Kučera, and P. Novotný, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.' ista: 'Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49.' mla: Brázdil, Tomáš, et al. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. Vol. 9938, Springer, 2016, pp. 32–49, doi:10.1007/978-3-319-46520-3_3. short: T. Brázdil, A. Kučera, P. Novotný, in:, Springer, 2016, pp. 32–49. conference: end_date: 2016-10-20 location: Chiba, Japan name: 'ATVA: Automated Technology for Verification and Analysis' start_date: 2016-10-17 date_created: 2018-12-11T11:51:23Z date_published: 2016-09-22T00:00:00Z date_updated: 2021-01-12T06:49:53Z day: '22' department: - _id: KrCh doi: 10.1007/978-3-319-46520-3_3 ec_funded: 1 intvolume: ' 9938' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1607.00678 month: '09' oa: 1 oa_version: Preprint page: 32 - 49 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication_status: published publisher: Springer publist_id: '5943' quality_controlled: '1' scopus_import: 1 status: public title: Optimizing the expected mean payoff in Energy Markov Decision Processes type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9938 year: '2016' ...