--- _id: '1521' abstract: - lang: eng text: Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation. It is the largest protein assembly of respiratory chains and one of the most elaborate redox membrane proteins known. Bacterial enzyme is about half the size of mitochondrial and thus provides its important "minimal" model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. We have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus, the membrane domain from Escherichia coli and recently of the intact, entire complex I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane helices). The 95. Å long electron transfer pathway through the enzyme proceeds from the primary electron acceptor flavin mononucleotide through seven conserved Fe-S clusters to the unusual elongated quinone-binding site at the interface with the membrane domain. Four putative proton translocation channels are found in the membrane domain, all linked by the central flexible axis containing charged residues. The redox energy of electron transfer is coupled to proton translocation by the as yet undefined mechanism proposed to involve long-range conformational changes. This article is part of a Special Issue entitled Respiratory complex I, edited by Volker Zickermann and Ulrich Brandt. acknowledgement: funded by the Medical Research Council (Grant number MC_U105674180) author: - first_name: John full_name: Berrisford, John last_name: Berrisford - first_name: Rozbeh full_name: Baradaran, Rozbeh last_name: Baradaran - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 citation: ama: Berrisford J, Baradaran R, Sazanov LA. Structure of bacterial respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. 2016;1857(7):892-901. doi:10.1016/j.bbabio.2016.01.012 apa: Berrisford, J., Baradaran, R., & Sazanov, L. A. (2016). Structure of bacterial respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. Elsevier. https://doi.org/10.1016/j.bbabio.2016.01.012 chicago: Berrisford, John, Rozbeh Baradaran, and Leonid A Sazanov. “Structure of Bacterial Respiratory Complex I.” Biochimica et Biophysica Acta - Bioenergetics. Elsevier, 2016. https://doi.org/10.1016/j.bbabio.2016.01.012. ieee: J. Berrisford, R. Baradaran, and L. A. Sazanov, “Structure of bacterial respiratory complex I,” Biochimica et Biophysica Acta - Bioenergetics, vol. 1857, no. 7. Elsevier, pp. 892–901, 2016. ista: Berrisford J, Baradaran R, Sazanov LA. 2016. Structure of bacterial respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. 1857(7), 892–901. mla: Berrisford, John, et al. “Structure of Bacterial Respiratory Complex I.” Biochimica et Biophysica Acta - Bioenergetics, vol. 1857, no. 7, Elsevier, 2016, pp. 892–901, doi:10.1016/j.bbabio.2016.01.012. short: J. Berrisford, R. Baradaran, L.A. Sazanov, Biochimica et Biophysica Acta - Bioenergetics 1857 (2016) 892–901. date_created: 2018-12-11T11:52:30Z date_published: 2016-07-01T00:00:00Z date_updated: 2021-01-12T06:51:21Z day: '01' department: - _id: LeSa doi: 10.1016/j.bbabio.2016.01.012 intvolume: ' 1857' issue: '7' language: - iso: eng month: '07' oa_version: None page: 892 - 901 publication: Biochimica et Biophysica Acta - Bioenergetics publication_status: published publisher: Elsevier publist_id: '5654' quality_controlled: '1' scopus_import: 1 status: public title: Structure of bacterial respiratory complex I type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 1857 year: '2016' ... --- _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 license: https://creativecommons.org/licenses/by/4.0/ 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: '1613' abstract: - lang: eng text: "In the last decade, induced pluripotent stem (iPS) cells have revolutionized the utility of human in vitro models of neurological disease. The iPS-derived and differentiated cells allow researchers to study the impact of a distinct cell type in health and disease as well as performing therapeutic drug screens on a human genetic background. In particular, clinical trials for Alzheimer's disease (AD) have been often failing. Two of the potential reasons are first, the species gap involved in proceeding from initial discoveries in rodent models to human studies, and second, an unsatisfying patient stratification, meaning subgrouping patients based on the disease severity due to the lack of phenotypic and genetic markers. iPS cells overcome this obstacles and will improve our understanding of disease subtypes in AD. They allow researchers conducting in depth characterization of neural cells from both familial and sporadic AD patients as well as preclinical screens on human cells.\r\n\r\nIn this review, we briefly outline the status quo of iPS cell research in neurological diseases along with the general advantages and pitfalls of these models. We summarize how genome-editing techniques such as CRISPR/Cas will allow researchers to reduce the problem of genomic variability inherent to human studies, followed by recent iPS cell studies relevant to AD. We then focus on current techniques for the differentiation of iPS cells into neural cell types that are relevant to AD research. Finally, we discuss how the generation of three-dimensional cell culture systems will be important for understanding AD phenotypes in a complex cellular milieu, and how both two- and three-dimensional iPS cell models can provide platforms for drug discovery and translational studies into the treatment of AD." acknowledgement: This work was supported by NIH grant R01-AG047661 to LHT. The art in Fig. 1 was created by Julian Wong. author: - first_name: Alison full_name: Mungenast, Alison last_name: Mungenast - first_name: Sandra full_name: Siegert, Sandra id: 36ACD32E-F248-11E8-B48F-1D18A9856A87 last_name: Siegert orcid: 0000-0001-8635-0877 - first_name: Li full_name: Tsai, Li last_name: Tsai citation: ama: Mungenast A, Siegert S, Tsai L. Modeling Alzheimer’s disease with human induced pluripotent stem (iPS) cells. Molecular and Cellular Neuroscience. 2016;73:13-31. doi:doi:10.1016/j.mcn.2015.11.010 apa: Mungenast, A., Siegert, S., & Tsai, L. (2016). Modeling Alzheimer’s disease with human induced pluripotent stem (iPS) cells. Molecular and Cellular Neuroscience. Academic Press. https://doi.org/doi:10.1016/j.mcn.2015.11.010 chicago: Mungenast, Alison, Sandra Siegert, and Li Tsai. “Modeling Alzheimer’s Disease with Human Induced Pluripotent Stem (IPS) Cells.” Molecular and Cellular Neuroscience. Academic Press, 2016. https://doi.org/doi:10.1016/j.mcn.2015.11.010. ieee: A. Mungenast, S. Siegert, and L. Tsai, “Modeling Alzheimer’s disease with human induced pluripotent stem (iPS) cells,” Molecular and Cellular Neuroscience, vol. 73. Academic Press, pp. 13–31, 2016. ista: Mungenast A, Siegert S, Tsai L. 2016. Modeling Alzheimer’s disease with human induced pluripotent stem (iPS) cells. Molecular and Cellular Neuroscience. 73, 13–31. mla: Mungenast, Alison, et al. “Modeling Alzheimer’s Disease with Human Induced Pluripotent Stem (IPS) Cells.” Molecular and Cellular Neuroscience, vol. 73, Academic Press, 2016, pp. 13–31, doi:doi:10.1016/j.mcn.2015.11.010. short: A. Mungenast, S. Siegert, L. Tsai, Molecular and Cellular Neuroscience 73 (2016) 13–31. date_created: 2018-12-11T11:53:02Z date_published: 2016-06-01T00:00:00Z date_updated: 2021-01-12T06:52:00Z day: '01' ddc: - '616' doi: doi:10.1016/j.mcn.2015.11.010 extern: '1' file: - access_level: open_access checksum: 620254114e04d5d6e7f37d15e4b8ace4 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:50Z date_updated: 2020-07-14T12:45:07Z file_id: '4970' file_name: IST-2018-979-v1+1_Mungenast_2015_acceptedManuscript.pdf file_size: 632915 relation: main_file file_date_updated: 2020-07-14T12:45:07Z has_accepted_license: '1' intvolume: ' 73' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '06' oa: 1 oa_version: Submitted Version page: 13 - 31 publication: Molecular and Cellular Neuroscience publication_status: published publisher: Academic Press publist_id: '5553' pubrep_id: '979' quality_controlled: '1' status: public title: Modeling Alzheimer's disease with human induced pluripotent stem (iPS) cells tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 73 year: '2016' ... --- _id: '1306' abstract: - lang: eng text: 'Resolving patterns of synaptic connectivity in neural circuits currently requires serial section electron microscopy. However, complete circuit reconstruction is prohibitively slow and may not be necessary for many purposes such as comparing neuronal structure and connectivity among multiple animals. Here, we present an alternative strategy, targeted reconstruction of specific neuronal types. We used viral vectors to deliver peroxidase derivatives, which catalyze production of an electron-dense tracer, to genetically identify neurons, and developed a protocol that enhances the electron-density of the labeled cells while retaining the quality of the ultrastructure. The high contrast of the marked neurons enabled two innovations that speed data acquisition: targeted high-resolution reimaging of regions selected from rapidly-acquired lower resolution reconstruction, and an unsupervised segmentation algorithm. This pipeline reduces imaging and reconstruction times by two orders of magnitude, facilitating directed inquiry of circuit motifs.' acknowledgement: 'This work was supported by NIH grant NS76467 to MM, JL and JRS, an HHMI Collaborative Innovation Award to JRS, an IARPA contract #D16PC00002 to WJS and by The International Human Frontier Science Program Organization fellowship to MJ.' author: - first_name: Maximilian A full_name: Maximilian Jösch id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 - first_name: David full_name: Mankus, David last_name: Mankus - first_name: Masahito full_name: Yamagata, Masahito last_name: Yamagata - first_name: Ali full_name: Shahbazi, Ali last_name: Shahbazi - first_name: Richard full_name: Schalek, Richard L last_name: Schalek - first_name: Adi full_name: Suissa-Peleg, Adi last_name: Suissa Peleg - first_name: Markus full_name: Meister, Markus last_name: Meister - first_name: Jeff full_name: Lichtman, Jeff W last_name: Lichtman - first_name: Walter full_name: Scheirer, Walter J last_name: Scheirer - first_name: Joshua full_name: Sanes, Joshua R last_name: Sanes citation: ama: Jösch MA, Mankus D, Yamagata M, et al. Reconstruction of genetically identified neurons imaged by serial-section electron microscopy. eLife. 2016;5(2016JULY). doi:10.7554/eLife.15015 apa: Jösch, M. A., Mankus, D., Yamagata, M., Shahbazi, A., Schalek, R., Suissa Peleg, A., … Sanes, J. (2016). Reconstruction of genetically identified neurons imaged by serial-section electron microscopy. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.15015 chicago: Jösch, Maximilian A, David Mankus, Masahito Yamagata, Ali Shahbazi, Richard Schalek, Adi Suissa Peleg, Markus Meister, Jeff Lichtman, Walter Scheirer, and Joshua Sanes. “Reconstruction of Genetically Identified Neurons Imaged by Serial-Section Electron Microscopy.” ELife. eLife Sciences Publications, 2016. https://doi.org/10.7554/eLife.15015. ieee: M. A. Jösch et al., “Reconstruction of genetically identified neurons imaged by serial-section electron microscopy,” eLife, vol. 5, no. 2016JULY. eLife Sciences Publications, 2016. ista: Jösch MA, Mankus D, Yamagata M, Shahbazi A, Schalek R, Suissa Peleg A, Meister M, Lichtman J, Scheirer W, Sanes J. 2016. Reconstruction of genetically identified neurons imaged by serial-section electron microscopy. eLife. 5(2016JULY). mla: Jösch, Maximilian A., et al. “Reconstruction of Genetically Identified Neurons Imaged by Serial-Section Electron Microscopy.” ELife, vol. 5, no. 2016JULY, eLife Sciences Publications, 2016, doi:10.7554/eLife.15015. short: M.A. Jösch, D. Mankus, M. Yamagata, A. Shahbazi, R. Schalek, A. Suissa Peleg, M. Meister, J. Lichtman, W. Scheirer, J. Sanes, ELife 5 (2016). date_created: 2018-12-11T11:51:16Z date_published: 2016-07-07T00:00:00Z date_updated: 2021-01-12T06:49:46Z day: '07' doi: 10.7554/eLife.15015 extern: 1 intvolume: ' 5' issue: 2016JULY month: '07' publication: eLife publication_status: published publisher: eLife Sciences Publications publist_id: '5965' quality_controlled: 0 status: public title: Reconstruction of genetically identified neurons imaged by serial-section electron microscopy 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 volume: 5 year: '2016' ... --- _id: '1315' abstract: - lang: eng text: We prove optimal second order convergence of a modified lowest-order Brezzi-Douglas-Marini (BDM1) mixed finite element scheme for advection-diffusion problems in divergence form. If advection is present, it is known that the total flux is approximated only with first-order accuracy by the classical BDM1 mixed method, which is suboptimal since the same order of convergence is obtained if the computationally less expensive Raviart-Thomas (RT0) element is used. The modification that was first proposed by Brunner et al. [Adv. Water Res., 35 (2012),pp. 163-171] is based on the hybrid problem formulation and consists in using the Lagrange multipliers for the discretization of the advective term instead of the cellwise constant approximation of the scalar unknown. author: - first_name: Fabian full_name: Brunner, Fabian last_name: Brunner - first_name: Julian L full_name: Julian Fischer id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X - first_name: Peter full_name: Knabner, Peter last_name: Knabner citation: ama: Brunner F, Fischer JL, Knabner P. Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form. SIAM Journal on Numerical Analysis. 2016;54(4):2359-2378. doi:10.1137/15M1035379 apa: Brunner, F., Fischer, J. L., & Knabner, P. (2016). Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form. SIAM Journal on Numerical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/15M1035379 chicago: Brunner, Fabian, Julian L Fischer, and Peter Knabner. “Analysis of a Modified Second-Order Mixed Hybrid BDM1 Finite Element Method for Transport Problems in Divergence Form.” SIAM Journal on Numerical Analysis. Society for Industrial and Applied Mathematics , 2016. https://doi.org/10.1137/15M1035379. ieee: F. Brunner, J. L. Fischer, and P. Knabner, “Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form,” SIAM Journal on Numerical Analysis, vol. 54, no. 4. Society for Industrial and Applied Mathematics , pp. 2359–2378, 2016. ista: Brunner F, Fischer JL, Knabner P. 2016. Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form. SIAM Journal on Numerical Analysis. 54(4), 2359–2378. mla: Brunner, Fabian, et al. “Analysis of a Modified Second-Order Mixed Hybrid BDM1 Finite Element Method for Transport Problems in Divergence Form.” SIAM Journal on Numerical Analysis, vol. 54, no. 4, Society for Industrial and Applied Mathematics , 2016, pp. 2359–78, doi:10.1137/15M1035379. short: F. Brunner, J.L. Fischer, P. Knabner, SIAM Journal on Numerical Analysis 54 (2016) 2359–2378. date_created: 2018-12-11T11:51:19Z date_published: 2016-01-01T00:00:00Z date_updated: 2021-01-12T06:49:49Z day: '01' doi: 10.1137/15M1035379 extern: 1 intvolume: ' 54' issue: '4' month: '01' page: 2359 - 2378 publication: SIAM Journal on Numerical Analysis publication_status: published publisher: 'Society for Industrial and Applied Mathematics ' publist_id: '5954' quality_controlled: 0 status: public title: Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form type: journal_article volume: 54 year: '2016' ... --- _id: '1317' abstract: - lang: eng text: We analyze the behaviour of free boundaries in thin-film flow in the regime of strong slippage n∈[1,2) and in the regime of very weak slippage n∈,3) qualitatively and quantitatively. In the regime of strong slippage, we construct initial data which are bounded from above by the steady state but for which nevertheless instantaneous forward motion of the free boundary occurs. This shows that the initial behaviour of the free boundary is not determined just by the growth of the initial data at the free boundary. Note that this is a new phenomenon for degenerate parabolic equations which is specific for higher-order equations. Furthermore, this result resolves a controversy in the literature over optimality of sufficient conditions for the occurrence of a waiting time phenomenon. In contrast, in the regime of very weak slippage we derive lower bounds on free boundary propagation which are optimal in the sense that they coincide up to a constant factor with the known upper bounds. In particular, in this regime the growth of the initial data at the free boundary fully determines the initial behaviour of the interface. acknowledgement: This research was partly supported by the Lithuanian–Swiss cooperation program under the project agreement No. CH-SMM-01/0. author: - first_name: Julian L full_name: Julian Fischer id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X citation: ama: 'Fischer JL. Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 2016;33(5):1301-1327. doi:10.1016/j.anihpc.2015.05.001' apa: 'Fischer, J. L. (2016). Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. Elsevier. https://doi.org/10.1016/j.anihpc.2015.05.001' chicago: 'Fischer, Julian L. “Behaviour of Free Boundaries in Thin-Film Flow: The Regime of Strong Slippage and the Regime of Very Weak Slippage.” Annales de l’Institut Henri Poincare (C) Non Linear Analysis. Elsevier, 2016. https://doi.org/10.1016/j.anihpc.2015.05.001.' ieee: 'J. L. Fischer, “Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage,” Annales de l’Institut Henri Poincare (C) Non Linear Analysis, vol. 33, no. 5. Elsevier, pp. 1301–1327, 2016.' ista: 'Fischer JL. 2016. Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 33(5), 1301–1327.' mla: 'Fischer, Julian L. “Behaviour of Free Boundaries in Thin-Film Flow: The Regime of Strong Slippage and the Regime of Very Weak Slippage.” Annales de l’Institut Henri Poincare (C) Non Linear Analysis, vol. 33, no. 5, Elsevier, 2016, pp. 1301–27, doi:10.1016/j.anihpc.2015.05.001.' short: J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non Linear Analysis 33 (2016) 1301–1327. date_created: 2018-12-11T11:51:20Z date_published: 2016-09-01T00:00:00Z date_updated: 2021-01-12T06:49:50Z day: '01' doi: 10.1016/j.anihpc.2015.05.001 extern: 1 intvolume: ' 33' issue: '5' month: '09' page: 1301 - 1327 publication: Annales de l'Institut Henri Poincare (C) Non Linear Analysis publication_status: published publisher: Elsevier publist_id: '5952' quality_controlled: 0 status: public title: 'Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage' type: journal_article volume: 33 year: '2016' ... --- _id: '1318' abstract: - lang: eng text: 'We develop a large-scale regularity theory of higher order for divergence-form elliptic equations with heterogeneous coefficient fields a in the context of stochastic homogenization. The large-scale regularity of a-harmonic functions is encoded by Liouville principles: The space of a-harmonic functions that grow at most like a polynomial of degree k has the same dimension as in the constant-coefficient case. This result can be seen as the qualitative side of a large-scale Ck,α-regularity theory, which in the present work is developed in the form of a corresponding Ck,α-“excess decay” estimate: For a given a-harmonic function u on a ball BR, its energy distance on some ball Br to the above space of a-harmonic functions that grow at most like a polynomial of degree k has the natural decay in the radius r above some minimal radius r0. Though motivated by stochastic homogenization, the contribution of this paper is of purely deterministic nature: We work under the assumption that for the given realization a of the coefficient field, the couple (φ, σ) of scalar and vector potentials of the harmonic coordinates, where φ is the usual corrector, grows sublinearly in a mildly quantified way. We then construct “kth-order correctors” and thereby the space of a-harmonic functions that grow at most like a polynomial of degree k, establish the above excess decay, and then the corresponding Liouville principle.' author: - first_name: Julian L full_name: Julian Fischer id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X - first_name: Felix full_name: Otto, Felix last_name: Otto citation: ama: Fischer JL, Otto F. A higher-order large scale regularity theory for random elliptic operators. Communications in Partial Differential Equations. 2016;41(7):1108-1148. doi:10.1080/03605302.2016.1179318 apa: Fischer, J. L., & Otto, F. (2016). A higher-order large scale regularity theory for random elliptic operators. Communications in Partial Differential Equations. Taylor & Francis. https://doi.org/10.1080/03605302.2016.1179318 chicago: Fischer, Julian L, and Felix Otto. “A Higher-Order Large Scale Regularity Theory for Random Elliptic Operators.” Communications in Partial Differential Equations. Taylor & Francis, 2016. https://doi.org/10.1080/03605302.2016.1179318. ieee: J. L. Fischer and F. Otto, “A higher-order large scale regularity theory for random elliptic operators,” Communications in Partial Differential Equations, vol. 41, no. 7. Taylor & Francis, pp. 1108–1148, 2016. ista: Fischer JL, Otto F. 2016. A higher-order large scale regularity theory for random elliptic operators. Communications in Partial Differential Equations. 41(7), 1108–1148. mla: Fischer, Julian L., and Felix Otto. “A Higher-Order Large Scale Regularity Theory for Random Elliptic Operators.” Communications in Partial Differential Equations, vol. 41, no. 7, Taylor & Francis, 2016, pp. 1108–48, doi:10.1080/03605302.2016.1179318. short: J.L. Fischer, F. Otto, Communications in Partial Differential Equations 41 (2016) 1108–1148. date_created: 2018-12-11T11:51:20Z date_published: 2016-07-02T00:00:00Z date_updated: 2021-01-12T06:49:50Z day: '02' doi: 10.1080/03605302.2016.1179318 extern: 1 intvolume: ' 41' issue: '7' main_file_link: - open_access: '1' url: https://arxiv.org/abs/1503.07578 month: '07' oa: 1 page: 1108 - 1148 publication: Communications in Partial Differential Equations publication_status: published publisher: Taylor & Francis publist_id: '5953' quality_controlled: 0 status: public title: A higher-order large scale regularity theory for random elliptic operators type: journal_article volume: 41 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' ...