--- _id: '641' abstract: - lang: eng text: 'We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches.' alternative_title: - LNCS author: - first_name: Vera full_name: Trajkovska, Vera last_name: Trajkovska - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Freddie full_name: Åström, Freddie last_name: Åström - first_name: Stefanie full_name: Petra, Stefanie last_name: Petra citation: ama: 'Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26' apa: 'Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26' chicago: Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26. ieee: 'V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.' ista: 'Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.' mla: Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26. short: V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334. conference: end_date: 2017-06-08 location: Kolding, Denmark name: 'SSVM: Scale Space and Variational Methods in Computer Vision' start_date: 2017-06-04 date_created: 2018-12-11T11:47:39Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:07:23Z day: '01' department: - _id: VlKo doi: 10.1007/978-3-319-58771-4_26 editor: - first_name: François full_name: Lauze, François last_name: Lauze - first_name: Yiqiu full_name: Dong, Yiqiu last_name: Dong - first_name: Anders full_name: Bjorholm Dahl, Anders last_name: Bjorholm Dahl intvolume: ' 10302' language: - iso: eng month: '01' oa_version: None page: 323 - 334 publication_identifier: isbn: - 978-331958770-7 publication_status: published publisher: Springer publist_id: '7147' quality_controlled: '1' scopus_import: 1 status: public title: Graphical model parameter learning by inverse linear programming type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10302 year: '2017' ... --- _id: '6426' abstract: - lang: eng text: Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs. alternative_title: - IST Austria Technical Report 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: Bernhard full_name: Kragl, Bernhard id: 320FC952-F248-11E8-B48F-1D18A9856A87 last_name: Kragl orcid: 0000-0001-7745-9117 - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer citation: ama: Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2 apa: Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2 chicago: Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2. ieee: T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017. ista: Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p. mla: Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2. short: T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017. date_created: 2019-05-13T08:15:55Z date_published: 2017-08-04T00:00:00Z date_updated: 2023-02-21T16:59:21Z day: '04' ddc: - '000' department: - _id: ToHe doi: 10.15479/AT:IST-2018-853-v2-2 file: - access_level: open_access checksum: b48d42725182d7ca10107a118815f4cf content_type: application/pdf creator: dernst date_created: 2019-05-13T08:14:44Z date_updated: 2020-07-14T12:47:30Z file_id: '6431' file_name: main(1).pdf file_size: 971347 relation: main_file file_date_updated: 2020-07-14T12:47:30Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '28' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria related_material: record: - id: '133' relation: later_version status: public status: public title: Synchronizing the asynchronous type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '643' abstract: - lang: eng text: It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance. article_processing_charge: No article_type: original author: - first_name: Wuping full_name: Sun, Wuping last_name: Sun - first_name: Ming-Zhu full_name: Zhai, Ming-Zhu id: 34009CFA-F248-11E8-B48F-1D18A9856A87 last_name: Zhai - first_name: Qian full_name: Zhou, Qian last_name: Zhou - first_name: Chengrui full_name: Qian, Chengrui last_name: Qian - first_name: Changyu full_name: Jiang, Changyu last_name: Jiang citation: ama: Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 2017;60(4):207-214. doi:10.4077/CJP.2017.BAF469 apa: Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., & Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. Chinese Physiological Society. https://doi.org/10.4077/CJP.2017.BAF469 chicago: Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology. Chinese Physiological Society, 2017. https://doi.org/10.4077/CJP.2017.BAF469. ieee: W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017. ista: Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214. mla: Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:10.4077/CJP.2017.BAF469. short: W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214. date_created: 2018-12-11T11:47:40Z date_published: 2017-08-31T00:00:00Z date_updated: 2021-01-12T08:07:28Z day: '31' ddc: - '570' department: - _id: RySh doi: 10.4077/CJP.2017.BAF469 external_id: pmid: - '28847140' intvolume: ' 60' issue: '4' language: - iso: eng month: '08' oa_version: Published Version page: 207 - 214 pmid: 1 publication: Chinese Journal of Physiology publication_identifier: issn: - '03044920' publication_status: published publisher: Chinese Physiological Society publist_id: '7142' quality_controlled: '1' scopus_import: 1 status: public title: Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 60 year: '2017' ... --- _id: '642' abstract: - lang: eng text: Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable. author: - first_name: Mate full_name: Gerencser, Mate id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87 last_name: Gerencser - first_name: István full_name: Gyöngy, István last_name: Gyöngy citation: ama: Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397. doi:10.1090/mcom/3201 apa: Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society. https://doi.org/10.1090/mcom/3201 chicago: Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation. American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201. ieee: M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” Mathematics of Computation, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017. ista: Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397. mla: Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201. short: M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397. date_created: 2018-12-11T11:47:40Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:07:26Z day: '01' department: - _id: JaMa doi: 10.1090/mcom/3201 intvolume: ' 86' issue: '307' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1508.05535 month: '01' oa: 1 oa_version: Submitted Version page: 2373 - 2397 publication: Mathematics of Computation publication_identifier: issn: - '00255718' publication_status: published publisher: American Mathematical Society publist_id: '7144' quality_controlled: '1' scopus_import: 1 status: public title: Localization errors in solving stochastic partial differential equations in the whole space type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 86 year: '2017' ... --- _id: '645' abstract: - lang: eng text: Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks. alternative_title: - LNCS author: - first_name: Pranav full_name: Ashok, Pranav last_name: Ashok - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Tobias full_name: Meggendorfer, Tobias last_name: Meggendorfer citation: ama: 'Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10' apa: 'Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10' chicago: Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10. ieee: 'P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.' ista: 'Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.' mla: Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10. short: P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221. conference: end_date: 2017-07-28 location: Heidelberg, Germany name: 'CAV: Computer Aided Verification' start_date: 2017-07-24 date_created: 2018-12-11T11:47:41Z date_published: 2017-07-13T00:00:00Z date_updated: 2021-01-12T08:07:32Z day: '13' department: - _id: KrCh doi: 10.1007/978-3-319-63387-9_10 ec_funded: 1 editor: - first_name: Rupak full_name: Majumdar, Rupak last_name: Majumdar - first_name: Viktor full_name: Kunčak, Viktor last_name: Kunčak intvolume: ' 10426' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1705.02326 month: '07' oa: 1 oa_version: Submitted Version page: 201 - 221 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication_identifier: isbn: - 978-331963386-2 publication_status: published publisher: Springer publist_id: '7135' quality_controlled: '1' scopus_import: 1 status: public title: Value iteration for long run average reward in markov decision processes type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10426 year: '2017' ... --- _id: '644' abstract: - lang: eng text: An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs. author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Andrei full_name: Krokhin, Andrei last_name: Krokhin - first_name: Michal full_name: Rolinek, Michal id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87 last_name: Rolinek citation: ama: Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836 apa: Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836 chicago: Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836. ieee: V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017. ista: Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110. mla: Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836. short: V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110. date_created: 2018-12-11T11:47:40Z date_published: 2017-06-29T00:00:00Z date_updated: 2023-02-23T10:07:49Z day: '29' department: - _id: VlKo doi: 10.1137/16M1091836 ec_funded: 1 intvolume: ' 46' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1502.07327 month: '06' oa: 1 oa_version: Preprint page: 1087 - 1110 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: SIAM Journal on Computing publication_status: published publisher: SIAM publist_id: '7138' quality_controlled: '1' related_material: record: - id: '1637' relation: other status: public scopus_import: 1 status: public title: The complexity of general-valued CSPs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 46 year: '2017' ... --- _id: '646' abstract: - lang: eng text: We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations. alternative_title: - LNCS author: - first_name: Jan full_name: Kuske, Jan last_name: Kuske - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Stefanie full_name: Petra, Stefanie last_name: Petra citation: ama: 'Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19' apa: 'Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19' chicago: Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19. ieee: 'J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.' ista: 'Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.' mla: Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19. short: J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246. conference: end_date: 2017-06-08 location: Kolding, Denmark name: 'SSVM: Scale Space and Variational Methods in Computer Vision' start_date: 2017-06-04 date_created: 2018-12-11T11:47:41Z date_published: 2017-06-01T00:00:00Z date_updated: 2021-01-12T08:07:34Z day: '01' department: - _id: VlKo doi: 10.1007/978-3-319-58771-4_19 ec_funded: 1 editor: - first_name: François full_name: Lauze, François last_name: Lauze - first_name: Yiqiu full_name: Dong, Yiqiu last_name: Dong - first_name: Anders full_name: Bjorholm Dahl, Anders last_name: Bjorholm Dahl intvolume: ' 10302' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.03769 month: '06' oa: 1 oa_version: Submitted Version page: 235 - 246 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_identifier: isbn: - 978-331958770-7 publication_status: published publisher: Springer publist_id: '7132' quality_controlled: '1' scopus_import: 1 status: public title: A novel convex relaxation for non binary discrete tomography type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10302 year: '2017' ... --- _id: '648' abstract: - lang: eng text: 'Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method.' alternative_title: - LNCS author: - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski citation: ama: 'Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43' apa: 'Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43' chicago: Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43. ieee: 'M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.' ista: 'Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.' mla: Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43. short: M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613. conference: end_date: 2017-04-22 location: Bern, Switzerland name: 'TAMC: Theory and Applications of Models of Computation' start_date: 2017-04-20 date_created: 2018-12-11T11:47:42Z date_published: 2017-04-01T00:00:00Z date_updated: 2021-01-12T08:07:39Z day: '01' department: - _id: KrPi doi: 10.1007/978-3-319-55911-7_43 editor: - first_name: Gerhard full_name: Jäger, Gerhard last_name: Jäger - first_name: Silvia full_name: Steila, Silvia last_name: Steila intvolume: ' 10185' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/1186.pdf month: '04' oa: 1 oa_version: Submitted Version page: 600 - 613 publication_identifier: isbn: - 978-331955910-0 publication_status: published publisher: Springer publist_id: '7125' quality_controlled: '1' scopus_import: 1 status: public title: On the complexity of breaking pseudoentropy type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10185 year: '2017' ... --- _id: '649' abstract: - lang: eng text: We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani. article_processing_charge: No author: - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 citation: ama: 'Maas J. Entropic Ricci curvature for discrete spaces. In: Najman L, Romon P, eds. Modern Approaches to Discrete Curvature. Vol 2184. Lecture Notes in Mathematics. Springer; 2017:159-174. doi:10.1007/978-3-319-58002-9_5' apa: Maas, J. (2017). Entropic Ricci curvature for discrete spaces. In L. Najman & P. Romon (Eds.), Modern Approaches to Discrete Curvature (Vol. 2184, pp. 159–174). Springer. https://doi.org/10.1007/978-3-319-58002-9_5 chicago: Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5. ieee: J. Maas, “Entropic Ricci curvature for discrete spaces,” in Modern Approaches to Discrete Curvature, vol. 2184, L. Najman and P. Romon, Eds. Springer, 2017, pp. 159–174. ista: 'Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.' mla: Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, vol. 2184, Springer, 2017, pp. 159–74, doi:10.1007/978-3-319-58002-9_5. short: J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174. date_created: 2018-12-11T11:47:42Z date_published: 2017-10-05T00:00:00Z date_updated: 2022-05-24T07:01:33Z day: '05' department: - _id: JaMa doi: 10.1007/978-3-319-58002-9_5 editor: - first_name: Laurent full_name: Najman, Laurent last_name: Najman - first_name: Pascal full_name: Romon, Pascal last_name: Romon intvolume: ' 2184' language: - iso: eng month: '10' oa_version: None page: 159 - 174 publication: Modern Approaches to Discrete Curvature publication_identifier: eissn: - 978-3-319-58002-9 isbn: - 978-3-319-58001-2 publication_status: published publisher: Springer publist_id: '7123' quality_controlled: '1' scopus_import: '1' series_title: Lecture Notes in Mathematics status: public title: Entropic Ricci curvature for discrete spaces type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2184 year: '2017' ... --- _id: '650' abstract: - lang: eng text: 'In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy.' alternative_title: - LNCS author: - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski citation: ama: 'Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:10.1007/978-3-319-55911-7_42' apa: 'Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42' chicago: 'Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.' ieee: 'M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.' ista: 'Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.' mla: 'Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.' short: M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599. conference: end_date: 2017-04-22 location: Bern, Switzerland name: 'TAMC: Theory and Applications of Models of Computation' start_date: 2017-04-20 date_created: 2018-12-11T11:47:42Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:07:46Z day: '01' department: - _id: KrPi doi: 10.1007/978-3-319-55911-7_42 editor: - first_name: Gerhard full_name: Jäger, Gerhard last_name: Jäger - first_name: Silvia full_name: Steila, Silvia last_name: Steila intvolume: ' 10185' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/965.pdf month: '01' oa: 1 oa_version: Submitted Version page: 586 - 599 publication_identifier: issn: - '03029743' publication_status: published publisher: Springer publist_id: '7119' quality_controlled: '1' scopus_import: 1 status: public title: 'A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10185 year: '2017' ... --- _id: '6519' abstract: - lang: eng text: 'Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ' article_number: '18' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer citation: ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18' apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18' chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18. ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.' ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.' mla: Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18. short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. conference: end_date: 2017-08-24 location: Stockholm, Sweden name: 'CSL: Conference on Computer Science Logic' start_date: 2017-08-20 date_created: 2019-06-04T12:42:43Z date_published: 2017-08-01T00:00:00Z date_updated: 2023-02-14T10:08:25Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4230/LIPICS.CSL.2017.18 ec_funded: 1 file: - access_level: open_access checksum: 7c2c9d09970af79026d7e37d9b632ef8 content_type: application/pdf creator: kschuh date_created: 2019-06-04T12:56:52Z date_updated: 2020-07-14T12:47:33Z file_id: '6520' file_name: 2017_LIPIcs-Chatterjee.pdf file_size: 710185 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 82' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '08' oa: 1 oa_version: Published Version project: - _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' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication_status: published publisher: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik quality_controlled: '1' scopus_import: '1' status: public title: Improved set-based symbolic algorithms for parity games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 82 year: '2017' ... --- _id: '6517' abstract: - lang: eng text: A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle. article_number: '34' author: - first_name: Radoslav full_name: Fulek, Radoslav id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87 last_name: Fulek orcid: 0000-0001-8485-1774 citation: ama: 'Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34' apa: 'Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34' chicago: Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34. ieee: 'R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.' ista: 'Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.' mla: Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34. short: R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-12-22 location: Phuket, Thailand name: 'ISAAC: International Symposium on Algorithms and Computation' start_date: 2017-12-09 date_created: 2019-06-04T12:11:52Z date_published: 2017-12-01T00:00:00Z date_updated: 2021-01-12T08:07:51Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPICS.ISAAC.2017.34 ec_funded: 1 file: - access_level: open_access checksum: fc7a643e29621c8bbe49d36b39081f31 content_type: application/pdf creator: kschuh date_created: 2019-06-04T12:20:35Z date_updated: 2020-07-14T12:47:33Z file_id: '6518' file_name: 2017_LIPIcs-Fulek.pdf file_size: 588982 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 92' language: - iso: eng month: '12' 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 - _id: 261FA626-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02281 name: Eliminating intersections in drawings of graphs publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Embedding graphs into embedded graphs 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: 92 year: '2017' ... --- _id: '652' abstract: - lang: eng text: 'We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed.' article_number: '7846789' author: - first_name: Ralf full_name: Der, Ralf last_name: Der - first_name: Georg S full_name: Martius, Georg S id: 3A276B68-F248-11E8-B48F-1D18A9856A87 last_name: Martius citation: ama: 'Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:10.1109/DEVLRN.2016.7846789' apa: 'Der, R., & Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. https://doi.org/10.1109/DEVLRN.2016.7846789' chicago: Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. https://doi.org/10.1109/DEVLRN.2016.7846789. ieee: 'R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.' ista: 'Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.' mla: Der, Ralf, and Georg S. Martius. Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots. 7846789, IEEE, 2017, doi:10.1109/DEVLRN.2016.7846789. short: R. Der, G.S. Martius, in:, IEEE, 2017. conference: end_date: 2016-09-22 location: Cergy-Pontoise, France name: 'ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics ' start_date: 2016-09-19 date_created: 2018-12-11T11:47:43Z date_published: 2017-02-07T00:00:00Z date_updated: 2021-01-12T08:07:51Z day: '07' department: - _id: ChLa - _id: GaTk doi: 10.1109/DEVLRN.2016.7846789 language: - iso: eng month: '02' oa_version: None publication_identifier: isbn: - 978-150905069-7 publication_status: published publisher: IEEE publist_id: '7100' quality_controlled: '1' scopus_import: 1 status: public title: Dynamical self consistency leads to behavioral development and emergent social interactions in robots type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '651' abstract: - lang: eng text: "Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n" author: - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: 'Hof B. Fluid dynamics: Water flows out of touch. Nature. 2017;541(7636):161-162. doi:10.1038/541161a' apa: 'Hof, B. (2017). Fluid dynamics: Water flows out of touch. Nature. Nature Publishing Group. https://doi.org/10.1038/541161a' chicago: 'Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature. Nature Publishing Group, 2017. https://doi.org/10.1038/541161a.' ieee: 'B. Hof, “Fluid dynamics: Water flows out of touch,” Nature, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017.' ista: 'Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.' mla: 'Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:10.1038/541161a.' short: B. Hof, Nature 541 (2017) 161–162. date_created: 2018-12-11T11:47:43Z date_published: 2017-01-11T00:00:00Z date_updated: 2021-01-12T08:07:49Z day: '11' department: - _id: BjHo doi: 10.1038/541161a intvolume: ' 541' issue: '7636' language: - iso: eng month: '01' oa_version: None page: 161 - 162 publication: Nature publication_identifier: issn: - '00280836' publication_status: published publisher: Nature Publishing Group publist_id: '7116' quality_controlled: '1' scopus_import: 1 status: public title: 'Fluid dynamics: Water flows out of touch' type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 541 year: '2017' ... --- _id: '653' abstract: - lang: eng text: The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease. acknowledgement: 'We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).' article_processing_charge: No article_type: original author: - first_name: Alvin full_name: Makohon Moore, Alvin last_name: Makohon Moore - first_name: Ming full_name: Zhang, Ming last_name: Zhang - first_name: Johannes full_name: Reiter, Johannes id: 4A918E98-F248-11E8-B48F-1D18A9856A87 last_name: Reiter orcid: 0000-0002-0170-7353 - first_name: Ivana full_name: Božić, Ivana last_name: Božić - first_name: Benjamin full_name: Allen, Benjamin last_name: Allen - first_name: Deepanjan full_name: Kundu, Deepanjan id: 1d4c0f4f-e8a3-11ec-a351-e36772758c45 last_name: Kundu - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Fay full_name: Wong, Fay last_name: Wong - first_name: Yuchen full_name: Jiao, Yuchen last_name: Jiao - first_name: Zachary full_name: Kohutek, Zachary last_name: Kohutek - first_name: Jungeui full_name: Hong, Jungeui last_name: Hong - first_name: Marc full_name: Attiyeh, Marc last_name: Attiyeh - first_name: Breanna full_name: Javier, Breanna last_name: Javier - first_name: Laura full_name: Wood, Laura last_name: Wood - first_name: Ralph full_name: Hruban, Ralph last_name: Hruban - first_name: Martin full_name: Nowak, Martin last_name: Nowak - first_name: Nickolas full_name: Papadopoulos, Nickolas last_name: Papadopoulos - first_name: Kenneth full_name: Kinzler, Kenneth last_name: Kinzler - first_name: Bert full_name: Vogelstein, Bert last_name: Vogelstein - first_name: Christine full_name: Iacobuzio Donahue, Christine last_name: Iacobuzio Donahue citation: ama: Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764 apa: Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764 chicago: Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764. ieee: A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017. ista: Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366. mla: Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764. short: A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366. date_created: 2018-12-11T11:47:43Z date_published: 2017-03-01T00:00:00Z date_updated: 2022-06-10T09:55:08Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1038/ng.3764 ec_funded: 1 external_id: pmid: - '28092682' file: - access_level: open_access checksum: e442dc3b7420a36ec805e9bb45cc1a2e content_type: application/pdf creator: dernst date_created: 2019-11-19T08:13:50Z date_updated: 2020-07-14T12:47:33Z file_id: '7050' file_name: 2017_NatureGenetics_Makohon.pdf file_size: 908099 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 49' issue: '3' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 358 - 366 pmid: 1 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Nature Genetics publication_identifier: issn: - '10614036' publication_status: published publisher: Nature Publishing Group publist_id: '7092' quality_controlled: '1' scopus_import: '1' status: public title: Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 49 year: '2017' ... --- _id: '6527' abstract: - lang: eng text: "A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n" author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Jeremiah full_name: Blocki, Jeremiah last_name: Blocki - first_name: Ben full_name: Harsha, Ben last_name: Harsha citation: ama: 'Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031' apa: 'Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031' chicago: Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031. ieee: J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017. ista: 'Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.' mla: Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031. short: J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017. conference: end_date: 2017-11-03 location: Dallas, TX, USA name: 'CCS: Conference on Computer and Communications Security' start_date: 2017-10-30 date_created: 2019-06-06T13:21:29Z date_published: 2017-10-30T00:00:00Z date_updated: 2021-01-12T08:07:53Z day: '30' department: - _id: KrPi doi: 10.1145/3133956.3134031 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2017/443 month: '10' oa: 1 oa_version: Submitted Version page: 1001-1017 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security publication_identifier: isbn: - '9781450349468' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: 1 status: public title: Practical graphs for optimal side-channel resistant memory-hard functions type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '654' abstract: - lang: eng text: In November 2016, developmental biologists, synthetic biologists and engineers gathered in Paris for a meeting called ‘Engineering the embryo’. The participants shared an interest in exploring how synthetic systems can reveal new principles of embryonic development, and how the in vitro manipulation and modeling of development using stem cells can be used to integrate ideas and expertise from physics, developmental biology and tissue engineering. As we review here, the conference pinpointed some of the challenges arising at the intersection of these fields, along with great enthusiasm for finding new approaches and collaborations. author: - first_name: Anna full_name: Kicheva, Anna id: 3959A2A0-F248-11E8-B48F-1D18A9856A87 last_name: Kicheva orcid: 0000-0003-4509-4998 - first_name: Nicolas full_name: Rivron, Nicolas last_name: Rivron citation: ama: Kicheva A, Rivron N. Creating to understand – developmental biology meets engineering in Paris. Development. 2017;144(5):733-736. doi:10.1242/dev.144915 apa: Kicheva, A., & Rivron, N. (2017). Creating to understand – developmental biology meets engineering in Paris. Development. Company of Biologists. https://doi.org/10.1242/dev.144915 chicago: Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development. Company of Biologists, 2017. https://doi.org/10.1242/dev.144915. ieee: A. Kicheva and N. Rivron, “Creating to understand – developmental biology meets engineering in Paris,” Development, vol. 144, no. 5. Company of Biologists, pp. 733–736, 2017. ista: Kicheva A, Rivron N. 2017. Creating to understand – developmental biology meets engineering in Paris. Development. 144(5), 733–736. mla: Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development, vol. 144, no. 5, Company of Biologists, 2017, pp. 733–36, doi:10.1242/dev.144915. short: A. Kicheva, N. Rivron, Development 144 (2017) 733–736. date_created: 2018-12-11T11:47:44Z date_published: 2017-03-01T00:00:00Z date_updated: 2021-01-12T08:07:54Z day: '01' ddc: - '571' department: - _id: AnKi doi: 10.1242/dev.144915 ec_funded: 1 file: - access_level: open_access checksum: eef22a0f42a55b232cb2d1188a2322cb content_type: application/pdf creator: system date_created: 2018-12-12T10:15:20Z date_updated: 2020-07-14T12:47:33Z file_id: '5139' file_name: IST-2018-987-v1+1_2017_KichevaRivron__Creating_to.pdf file_size: 228206 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 144' issue: '5' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 733 - 736 project: - _id: B6FC0238-B512-11E9-945C-1524E6697425 call_identifier: H2020 grant_number: '680037' name: Coordination of Patterning And Growth In the Spinal Cord publication: Development publication_identifier: issn: - '09501991' publication_status: published publisher: Company of Biologists publist_id: '7089' pubrep_id: '987' quality_controlled: '1' scopus_import: 1 status: public title: Creating to understand – developmental biology meets engineering in Paris type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 144 year: '2017' ... --- _id: '6526' abstract: - lang: eng text: 'This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA''15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.' article_number: '8006529' author: - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski citation: ama: 'Skórski M. On the complexity of estimating Rènyi divergences. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE; 2017. doi:10.1109/isit.2017.8006529' apa: 'Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE. https://doi.org/10.1109/isit.2017.8006529' chicago: Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. https://doi.org/10.1109/isit.2017.8006529. ieee: M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017. ista: 'Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.' mla: Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529. short: M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017. conference: end_date: 2017-06-30 location: Aachen, Germany name: 'ISIT: International Symposium on Information Theory' start_date: 2017-06-25 date_created: 2019-06-06T12:53:09Z date_published: 2017-08-09T00:00:00Z date_updated: 2021-01-12T08:07:53Z day: '09' department: - _id: KrPi doi: 10.1109/isit.2017.8006529 ec_funded: 1 external_id: arxiv: - '1702.01666' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1702.01666 month: '08' oa: 1 oa_version: Preprint project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 2017 IEEE International Symposium on Information Theory (ISIT) publication_identifier: isbn: - '9781509040964' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: 1 status: public title: On the complexity of estimating Rènyi divergences type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '655' abstract: - lang: eng text: 'The bacterial flagellum is a self-assembling nanomachine. The external flagellar filament, several times longer than a bacterial cell body, is made of a few tens of thousands subunits of a single protein: flagellin. A fundamental problem concerns the molecular mechanism of how the flagellum grows outside the cell, where no discernible energy source is available. Here, we monitored the dynamic assembly of individual flagella using in situ labelling and real-time immunostaining of elongating flagellar filaments. We report that the rate of flagellum growth, initially ~1,700 amino acids per second, decreases with length and that the previously proposed chain mechanism does not contribute to the filament elongation dynamics. Inhibition of the proton motive force-dependent export apparatus revealed a major contribution of substrate injection in driving filament elongation. The combination of experimental and mathematical evidence demonstrates that a simple, injection-diffusion mechanism controls bacterial flagella growth outside the cell.' article_number: e23136 author: - first_name: Thibaud full_name: Renault, Thibaud last_name: Renault - first_name: Anthony full_name: Abraham, Anthony last_name: Abraham - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Guillaume full_name: Paradis, Guillaume last_name: Paradis - first_name: Simon full_name: Rainville, Simon last_name: Rainville - first_name: Emmanuelle full_name: Charpentier, Emmanuelle last_name: Charpentier - 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: Yuhai full_name: Tu, Yuhai last_name: Tu - first_name: Keiichi full_name: Namba, Keiichi last_name: Namba - first_name: James full_name: Keener, James last_name: Keener - first_name: Tohru full_name: Minamino, Tohru last_name: Minamino - first_name: Marc full_name: Erhardt, Marc last_name: Erhardt citation: ama: Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through an injection diffusion mechanism. eLife. 2017;6. doi:10.7554/eLife.23136 apa: Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier, E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion mechanism. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.23136 chicago: Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis, Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.23136. ieee: T. Renault et al., “Bacterial flagella grow through an injection diffusion mechanism,” eLife, vol. 6. eLife Sciences Publications, 2017. ista: Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E, Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella grow through an injection diffusion mechanism. eLife. 6, e23136. mla: Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife, vol. 6, e23136, eLife Sciences Publications, 2017, doi:10.7554/eLife.23136. short: T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier, C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017). date_created: 2018-12-11T11:47:44Z date_published: 2017-03-06T00:00:00Z date_updated: 2021-01-12T08:07:55Z day: '06' ddc: - '579' department: - _id: CaGu doi: 10.7554/eLife.23136 file: - access_level: open_access checksum: 39e1c3e82ddac83a30422fa72fa1a383 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:53Z date_updated: 2020-07-14T12:47:33Z file_id: '4716' file_name: IST-2017-904-v1+1_elife-23136-v2.pdf file_size: 5520359 relation: main_file - access_level: open_access checksum: a6d542253028f52e00aa29739ddffe8f content_type: application/pdf creator: system date_created: 2018-12-12T10:08:54Z date_updated: 2020-07-14T12:47:33Z file_id: '4717' file_name: IST-2017-904-v1+2_elife-23136-figures-v2.pdf file_size: 11242920 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: eLife publication_identifier: issn: - 2050084X publication_status: published publisher: eLife Sciences Publications publist_id: '7082' pubrep_id: '904' quality_controlled: '1' scopus_import: 1 status: public title: Bacterial flagella grow through an injection diffusion mechanism tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2017' ... --- _id: '657' abstract: - lang: eng text: Plant organs are typically organized into three main tissue layers. The middle ground tissue layer comprises the majority of the plant body and serves a wide range of functions, including photosynthesis, selective nutrient uptake and storage, and gravity sensing. Ground tissue patterning and maintenance in Arabidopsis are controlled by a well-established gene network revolving around the key regulator SHORT-ROOT (SHR). In contrast, it is completely unknown how ground tissue identity is first specified from totipotent precursor cells in the embryo. The plant signaling molecule auxin, acting through AUXIN RESPONSE FACTOR (ARF) transcription factors, is critical for embryo patterning. The auxin effector ARF5/MONOPTEROS (MP) acts both cell-autonomously and noncell-autonomously to control embryonic vascular tissue formation and root initiation, respectively. Here we show that auxin response and ARF activity cell-autonomously control the asymmetric division of the first ground tissue cells. By identifying embryonic target genes, we show that MP transcriptionally initiates the ground tissue lineage and acts upstream of the regulatory network that controls ground tissue patterning and maintenance. Strikingly, whereas the SHR network depends on MP, this MP function is, at least in part, SHR independent. Our study therefore identifies auxin response as a regulator of ground tissue specification in the embryonic root, and reveals that ground tissue initiation and maintenance use different regulators and mechanisms. Moreover, our data provide a framework for the simultaneous formation of multiple cell types by the same transcriptional regulator. author: - first_name: Barbara full_name: Möller, Barbara last_name: Möller - first_name: Colette full_name: Ten Hove, Colette last_name: Ten Hove - first_name: Daoquan full_name: Xiang, Daoquan last_name: Xiang - first_name: Nerys full_name: Williams, Nerys last_name: Williams - first_name: Lorena full_name: López, Lorena last_name: López - first_name: Saiko full_name: Yoshida, Saiko id: 2E46069C-F248-11E8-B48F-1D18A9856A87 last_name: Yoshida - first_name: Margot full_name: Smit, Margot last_name: Smit - first_name: Raju full_name: Datla, Raju last_name: Datla - first_name: Dolf full_name: Weijers, Dolf last_name: Weijers citation: ama: Möller B, Ten Hove C, Xiang D, et al. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 2017;114(12):E2533-E2539. doi:10.1073/pnas.1616493114 apa: Möller, B., Ten Hove, C., Xiang, D., Williams, N., López, L., Yoshida, S., … Weijers, D. (2017). Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1616493114 chicago: Möller, Barbara, Colette Ten Hove, Daoquan Xiang, Nerys Williams, Lorena López, Saiko Yoshida, Margot Smit, Raju Datla, and Dolf Weijers. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1616493114. ieee: B. Möller et al., “Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo,” PNAS, vol. 114, no. 12. National Academy of Sciences, pp. E2533–E2539, 2017. ista: Möller B, Ten Hove C, Xiang D, Williams N, López L, Yoshida S, Smit M, Datla R, Weijers D. 2017. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 114(12), E2533–E2539. mla: Möller, Barbara, et al. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS, vol. 114, no. 12, National Academy of Sciences, 2017, pp. E2533–39, doi:10.1073/pnas.1616493114. short: B. Möller, C. Ten Hove, D. Xiang, N. Williams, L. López, S. Yoshida, M. Smit, R. Datla, D. Weijers, PNAS 114 (2017) E2533–E2539. date_created: 2018-12-11T11:47:45Z date_published: 2017-03-21T00:00:00Z date_updated: 2021-01-12T08:08:02Z day: '21' department: - _id: JiFr doi: 10.1073/pnas.1616493114 external_id: pmid: - '28265057' intvolume: ' 114' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5373392/ month: '03' oa: 1 oa_version: Submitted Version page: E2533 - E2539 pmid: 1 publication: PNAS publication_identifier: issn: - '00278424' publication_status: published publisher: National Academy of Sciences publist_id: '7076' quality_controlled: '1' scopus_import: 1 status: public title: Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2017' ... --- _id: '656' abstract: - lang: eng text: Human neurons transplanted into a mouse model for Alzheimer’s disease show human-specific vulnerability to β-amyloid plaques and may help to identify new therapeutic targets. article_number: eaam9867 author: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: Novarino G. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 2017;9(381). doi:10.1126/scitranslmed.aam9867 apa: Novarino, G. (2017). Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aam9867 chicago: Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aam9867. ieee: G. Novarino, “Modeling Alzheimer’s disease in mice with human neurons,” Science Translational Medicine, vol. 9, no. 381. American Association for the Advancement of Science, 2017. ista: Novarino G. 2017. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 9(381), eaam9867. mla: Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” Science Translational Medicine, vol. 9, no. 381, eaam9867, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aam9867. short: G. Novarino, Science Translational Medicine 9 (2017). date_created: 2018-12-11T11:47:45Z date_published: 2017-03-15T00:00:00Z date_updated: 2021-01-12T08:07:59Z day: '15' department: - _id: GaNo doi: 10.1126/scitranslmed.aam9867 intvolume: ' 9' issue: '381' language: - iso: eng month: '03' oa_version: None publication: Science Translational Medicine publication_identifier: issn: - '19466234' publication_status: published publisher: American Association for the Advancement of Science publist_id: '7079' quality_controlled: '1' scopus_import: 1 status: public title: Modeling Alzheimer's disease in mice with human neurons type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2017' ... --- _id: '658' abstract: - lang: eng text: 'With the accelerated development of robot technologies, control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of specific objectives for the task at hand. While very successful in many applications, self-organized control schemes seem to be favored in large complex systems with unknown dynamics or which are difficult to model. Reasons are the expected scalability, robustness, and resilience of self-organizing systems. The paper presents a self-learning neurocontroller based on extrinsic differential plasticity introduced recently, applying it to an anthropomorphic musculoskeletal robot arm with attached objects of unknown physical dynamics. The central finding of the paper is the following effect: by the mere feedback through the internal dynamics of the object, the robot is learning to relate each of the objects with a very specific sensorimotor pattern. Specifically, an attached pendulum pilots the arm into a circular motion, a half-filled bottle produces axis oriented shaking behavior, a wheel is getting rotated, and wiping patterns emerge automatically in a table-plus-brush setting. By these object-specific dynamical patterns, the robot may be said to recognize the object''s identity, or in other words, it discovers dynamical affordances of objects. Furthermore, when including hand coordinates obtained from a camera, a dedicated hand-eye coordination self-organizes spontaneously. These phenomena are discussed from a specific dynamical system perspective. Central is the dedicated working regime at the border to instability with its potentially infinite reservoir of (limit cycle) attractors "waiting" to be excited. Besides converging toward one of these attractors, variate behavior is also arising from a self-induced attractor morphing driven by the learning rule. We claim that experimental investigations with this anthropomorphic, self-learning robot not only generate interesting and potentially useful behaviors, but may also help to better understand what subjective human muscle feelings are, how they can be rooted in sensorimotor patterns, and how these concepts may feed back on robotics.' article_number: '00008' article_processing_charge: Yes author: - first_name: Ralf full_name: Der, Ralf last_name: Der - first_name: Georg S full_name: Martius, Georg S id: 3A276B68-F248-11E8-B48F-1D18A9856A87 last_name: Martius citation: ama: Der R, Martius GS. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 2017;11(MAR). doi:10.3389/fnbot.2017.00008 apa: Der, R., & Martius, G. S. (2017). Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. Frontiers Research Foundation. https://doi.org/10.3389/fnbot.2017.00008 chicago: Der, Ralf, and Georg S Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” Frontiers in Neurorobotics. Frontiers Research Foundation, 2017. https://doi.org/10.3389/fnbot.2017.00008. ieee: R. Der and G. S. Martius, “Self organized behavior generation for musculoskeletal robots,” Frontiers in Neurorobotics, vol. 11, no. MAR. Frontiers Research Foundation, 2017. ista: Der R, Martius GS. 2017. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 11(MAR), 00008. mla: Der, Ralf, and Georg S. Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” Frontiers in Neurorobotics, vol. 11, no. MAR, 00008, Frontiers Research Foundation, 2017, doi:10.3389/fnbot.2017.00008. short: R. Der, G.S. Martius, Frontiers in Neurorobotics 11 (2017). date_created: 2018-12-11T11:47:45Z date_published: 2017-03-16T00:00:00Z date_updated: 2021-01-12T08:08:04Z day: '16' ddc: - '006' department: - _id: ChLa - _id: GaTk doi: 10.3389/fnbot.2017.00008 ec_funded: 1 file: - access_level: open_access checksum: b1bc43f96d1df3313c03032c2a46388d content_type: application/pdf creator: system date_created: 2018-12-12T10:18:49Z date_updated: 2020-07-14T12:47:33Z file_id: '5371' file_name: IST-2017-903-v1+1_fnbot-11-00008.pdf file_size: 8439566 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 11' issue: MAR language: - iso: eng month: '03' 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: Frontiers in Neurorobotics publication_identifier: issn: - '16625218' publication_status: published publisher: Frontiers Research Foundation publist_id: '7078' pubrep_id: '903' quality_controlled: '1' scopus_import: 1 status: public title: Self organized behavior generation for musculoskeletal robots 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: 2EBD1598-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2017' ... --- _id: '659' abstract: - lang: eng text: Migration frequently involves Rac-mediated protrusion of lamellipodia, formed by Arp2/3 complex-dependent branching thought to be crucial for force generation and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors targeting to the lamellipodium tip and shown here to nucleate and elongate actin filaments with complementary activities in vitro. In migrating B16-F1 melanoma cells, both formins contribute to the velocity of lamellipodium protrusion. Loss of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width, actin filament density and -bundling, without changing patterns of Arp2/3 complex incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost completely abolishes protrusion forces exerted by lamellipodia and modifies their ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3 in fibroblasts reduces both migration and capability of cells to move against viscous media. Together, we conclude that force generation in lamellipodia strongly depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent filament branching. article_number: '14832' article_processing_charge: No author: - first_name: Frieda full_name: Kage, Frieda last_name: Kage - first_name: Moritz full_name: Winterhoff, Moritz last_name: Winterhoff - first_name: Vanessa full_name: Dimchev, Vanessa last_name: Dimchev - first_name: Jan full_name: Müller, Jan id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D last_name: Müller - first_name: Tobias full_name: Thalheim, Tobias last_name: Thalheim - first_name: Anika full_name: Freise, Anika last_name: Freise - first_name: Stefan full_name: Brühmann, Stefan last_name: Brühmann - first_name: Jana full_name: Kollasser, Jana last_name: Kollasser - first_name: Jennifer full_name: Block, Jennifer last_name: Block - first_name: Georgi A full_name: Dimchev, Georgi A last_name: Dimchev - first_name: Matthias full_name: Geyer, Matthias last_name: Geyer - first_name: Hams full_name: Schnittler, Hams last_name: Schnittler - first_name: Cord full_name: Brakebusch, Cord last_name: Brakebusch - first_name: Theresia full_name: Stradal, Theresia last_name: Stradal - first_name: Marie full_name: Carlier, Marie last_name: Carlier - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Josef full_name: Käs, Josef last_name: Käs - first_name: Jan full_name: Faix, Jan last_name: Faix - first_name: Klemens full_name: Rottner, Klemens last_name: Rottner citation: ama: Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force generation. Nature Communications. 2017;8. doi:10.1038/ncomms14832 apa: Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A., … Rottner, K. (2017). FMNL formins boost lamellipodial force generation. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14832 chicago: Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim, Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14832. ieee: F. Kage et al., “FMNL formins boost lamellipodial force generation,” Nature Communications, vol. 8. Nature Publishing Group, 2017. ista: Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial force generation. Nature Communications. 8, 14832. mla: Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications, vol. 8, 14832, Nature Publishing Group, 2017, doi:10.1038/ncomms14832. short: F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S. Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch, T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications 8 (2017). date_created: 2018-12-11T11:47:46Z date_published: 2017-03-22T00:00:00Z date_updated: 2021-01-12T08:08:06Z day: '22' ddc: - '570' department: - _id: MiSi doi: 10.1038/ncomms14832 file: - access_level: open_access checksum: dae30190291c3630e8102d8714a8d23e content_type: application/pdf creator: system date_created: 2018-12-12T10:14:21Z date_updated: 2020-07-14T12:47:34Z file_id: '5072' file_name: IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf file_size: 9523746 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' intvolume: ' 8' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - '20411723' publication_status: published publisher: Nature Publishing Group publist_id: '7075' pubrep_id: '902' quality_controlled: '1' scopus_import: 1 status: public title: FMNL formins boost lamellipodial force generation 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: 8 year: '2017' ... --- _id: '660' abstract: - lang: eng text: Growing microtubules are protected from depolymerization by the presence of a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing cap, allowing monitoring of its size in real time. The cap size has been shown to correlate with instantaneous microtubule stability. Here we have quantitatively characterized the properties of cap size fluctuations during steadystate growth and have developed a theory predicting their timescale and amplitude from the kinetics of microtubule growth and cap maturation. In contrast to growth speed fluctuations, cap size fluctuations show a characteristic timescale, which is defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude of cap size fluctuations; however, cap size does not affect growth speed, indicating that microtubules are far from instability during most of their time of growth. Our theory provides the basis for a quantitative understanding of microtubule stability fluctuations during steady-state growth. acknowledgement: We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner for data analysis advice. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK Grant FC001163, Medical Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was also supported by European Research Council Advanced Grant Project 323042 (to C.D. and T.S.). author: - first_name: Jamie full_name: Rickman, Jamie last_name: Rickman - first_name: Christian F full_name: Düllberg, Christian F id: 459064DC-F248-11E8-B48F-1D18A9856A87 last_name: Düllberg orcid: 0000-0001-6335-9748 - first_name: Nicholas full_name: Cade, Nicholas last_name: Cade - first_name: Lewis full_name: Griffin, Lewis last_name: Griffin - first_name: Thomas full_name: Surrey, Thomas last_name: Surrey citation: ama: Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 2017;114(13):3427-3432. doi:10.1073/pnas.1620274114 apa: Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., & Surrey, T. (2017). Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1620274114 chicago: Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1620274114. ieee: J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation,” PNAS, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017. ista: Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 114(13), 3427–3432. mla: Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” PNAS, vol. 114, no. 13, National Academy of Sciences, 2017, pp. 3427–32, doi:10.1073/pnas.1620274114. short: J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017) 3427–3432. date_created: 2018-12-11T11:47:46Z date_published: 2017-03-28T00:00:00Z date_updated: 2021-01-12T08:08:09Z day: '28' department: - _id: MaLo doi: 10.1073/pnas.1620274114 external_id: pmid: - '28280102' intvolume: ' 114' issue: '13' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/ month: '03' oa: 1 oa_version: Submitted Version page: 3427 - 3432 pmid: 1 publication: PNAS publication_identifier: issn: - '00278424' publication_status: published publisher: National Academy of Sciences publist_id: '7073' quality_controlled: '1' scopus_import: 1 status: public title: Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2017' ... --- _id: '662' abstract: - lang: eng text: 'We report a direct-numerical-simulation study of the Taylor-Couette flow in the quasi-Keplerian regime at shear Reynolds numbers up to (105). Quasi-Keplerian rotating flow has been investigated for decades as a simplified model system to study the origin of turbulence in accretion disks that is not fully understood. The flow in this study is axially periodic and thus the experimental end-wall effects on the stability of the flow are avoided. Using optimal linear perturbations as initial conditions, our simulations find no sustained turbulence: the strong initial perturbations distort the velocity profile and trigger turbulence that eventually decays.' article_number: '044107' author: - first_name: Liang full_name: Shi, Liang last_name: Shi - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 - first_name: Markus full_name: Rampp, Markus last_name: Rampp - first_name: Marc full_name: Avila, Marc last_name: Avila citation: ama: Shi L, Hof B, Rampp M, Avila M. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 2017;29(4). doi:10.1063/1.4981525 apa: Shi, L., Hof, B., Rampp, M., & Avila, M. (2017). Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. American Institute of Physics. https://doi.org/10.1063/1.4981525 chicago: Shi, Liang, Björn Hof, Markus Rampp, and Marc Avila. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” Physics of Fluids. American Institute of Physics, 2017. https://doi.org/10.1063/1.4981525. ieee: L. Shi, B. Hof, M. Rampp, and M. Avila, “Hydrodynamic turbulence in quasi Keplerian rotating flows,” Physics of Fluids, vol. 29, no. 4. American Institute of Physics, 2017. ista: Shi L, Hof B, Rampp M, Avila M. 2017. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 29(4), 044107. mla: Shi, Liang, et al. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” Physics of Fluids, vol. 29, no. 4, 044107, American Institute of Physics, 2017, doi:10.1063/1.4981525. short: L. Shi, B. Hof, M. Rampp, M. Avila, Physics of Fluids 29 (2017). date_created: 2018-12-11T11:47:47Z date_published: 2017-04-01T00:00:00Z date_updated: 2021-01-12T08:08:15Z day: '01' department: - _id: BjHo doi: 10.1063/1.4981525 intvolume: ' 29' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.01714 month: '04' oa: 1 oa_version: Submitted Version project: - _id: 2511D90C-B435-11E9-9278-68D0E5697425 grant_number: SFB 963 TP A8 name: Astrophysical instability of currents and turbulences publication: Physics of Fluids publication_identifier: issn: - '10706631' publication_status: published publisher: American Institute of Physics publist_id: '7072' quality_controlled: '1' scopus_import: 1 status: public title: Hydrodynamic turbulence in quasi Keplerian rotating flows type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2017' ... --- _id: '663' abstract: - lang: eng text: 'In this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete invariants by assigning different values to u→ so that every trajectory of the system can be overapproximated precisely by the intersection of a group of concrete invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant cluster can be obtained by first computing the remainder of the Lie derivative of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations obtained from the coefficients of the remainder. Based on invariant clusters and sum-of-squares (SOS) programming, we present a new method for the safety verification of hybrid systems. Experiments on nonlinear benchmark systems from biology and control theory show that our approach is efficient. ' author: - first_name: Hui full_name: Kong, Hui id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87 last_name: Kong orcid: 0000-0002-3066-6941 - first_name: Sergiy full_name: Bogomolov, Sergiy last_name: Bogomolov orcid: 0000-0002-0686-0365 - first_name: Christian full_name: Schilling, Christian last_name: Schilling - first_name: Yu full_name: Jiang, Yu last_name: Jiang - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: 'Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: Proceedings of the 20th International Conference on Hybrid Systems. ACM; 2017:163-172. doi:10.1145/3049797.3049814' apa: 'Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., & Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In Proceedings of the 20th International Conference on Hybrid Systems (pp. 163–172). Pittsburgh, PA, United States: ACM. https://doi.org/10.1145/3049797.3049814' chicago: Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In Proceedings of the 20th International Conference on Hybrid Systems, 163–72. ACM, 2017. https://doi.org/10.1145/3049797.3049814. ieee: H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in Proceedings of the 20th International Conference on Hybrid Systems, Pittsburgh, PA, United States, 2017, pp. 163–172. ista: 'Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th International Conference on Hybrid Systems. HSCC: Hybrid Systems Computation and Control , 163–172.' mla: Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814. short: H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172. conference: end_date: 2017-04-20 location: Pittsburgh, PA, United States name: 'HSCC: Hybrid Systems Computation and Control ' start_date: 2017-04-18 date_created: 2018-12-11T11:47:47Z date_published: 2017-04-01T00:00:00Z date_updated: 2021-01-12T08:08:17Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1145/3049797.3049814 file: - access_level: open_access checksum: b7667434cbf5b5f0ade3bea1dbe5bf63 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:20Z date_updated: 2020-07-14T12:47:34Z file_id: '4873' file_name: IST-2017-817-v1+1_p163-kong.pdf file_size: 1650530 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Submitted Version page: 163 - 172 publication: Proceedings of the 20th International Conference on Hybrid Systems publication_identifier: isbn: - 978-145034590-3 publication_status: published publisher: ACM publist_id: '7067' pubrep_id: '817' quality_controlled: '1' scopus_import: 1 status: public title: Safety verification of nonlinear hybrid systems based on invariant clusters type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '667' abstract: - lang: eng text: Perinatal exposure to penicillin may result in longlasting gut and behavioral changes. article_number: '2786' author: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: Novarino G. The antisocial side of antibiotics. Science Translational Medicine. 2017;9(387). doi:10.1126/scitranslmed.aan2786 apa: Novarino, G. (2017). The antisocial side of antibiotics. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aan2786 chicago: Novarino, Gaia. “The Antisocial Side of Antibiotics.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aan2786. ieee: G. Novarino, “The antisocial side of antibiotics,” Science Translational Medicine, vol. 9, no. 387. American Association for the Advancement of Science, 2017. ista: Novarino G. 2017. The antisocial side of antibiotics. Science Translational Medicine. 9(387), 2786. mla: Novarino, Gaia. “The Antisocial Side of Antibiotics.” Science Translational Medicine, vol. 9, no. 387, 2786, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aan2786. short: G. Novarino, Science Translational Medicine 9 (2017). date_created: 2018-12-11T11:47:48Z date_published: 2017-04-26T00:00:00Z date_updated: 2021-01-12T08:08:30Z day: '26' department: - _id: GaNo doi: 10.1126/scitranslmed.aan2786 intvolume: ' 9' issue: '387' language: - iso: eng month: '04' oa_version: None publication: Science Translational Medicine publication_identifier: issn: - '19466234' publication_status: published publisher: American Association for the Advancement of Science publist_id: '7060' quality_controlled: '1' scopus_import: 1 status: public title: The antisocial side of antibiotics type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2017' ... --- _id: '668' abstract: - lang: eng text: Macrophage filopodia, finger-like membrane protrusions, were first implicated in phagocytosis more than 100 years ago, but little is still known about the involvement of these actin-dependent structures in particle clearance. Using spinning disk confocal microscopy to image filopodial dynamics in mouse resident Lifeact-EGFP macrophages, we show that filopodia, or filopodia-like structures, support pathogen clearance by multiple means. Filopodia supported the phagocytic uptake of bacterial (Escherichia coli) particles by (i) capturing along the filopodial shaft and surfing toward the cell body, the most common mode of capture; (ii) capturing via the tip followed by retraction; (iii) combinations of surfing and retraction; or (iv) sweeping actions. In addition, filopodia supported the uptake of zymosan (Saccharomyces cerevisiae) particles by (i) providing fixation, (ii) capturing at the tip and filopodia-guided actin anterograde flow with phagocytic cup formation, and (iii) the rapid growth of new protrusions. To explore the role of filopodia-inducing Cdc42, we generated myeloid-restricted Cdc42 knock-out mice. Cdc42-deficient macrophages exhibited rapid phagocytic cup kinetics, but reduced particle clearance, which could be explained by the marked rounded-up morphology of these cells. Macrophages lacking Myo10, thought to act downstream of Cdc42, had normal morphology, motility, and phagocytic cup formation, but displayed markedly reduced filopodia formation. In conclusion, live-cell imaging revealed multiple mechanisms involving macrophage filopodia in particle capture and engulfment. Cdc42 is not critical for filopodia or phagocytic cup formation, but plays a key role in driving macrophage lamellipodial spreading. article_type: original author: - first_name: Markus full_name: Horsthemke, Markus last_name: Horsthemke - first_name: Anne full_name: Bachg, Anne last_name: Bachg - first_name: Katharina full_name: Groll, Katharina last_name: Groll - first_name: Sven full_name: Moyzio, Sven last_name: Moyzio - first_name: Barbara full_name: Müther, Barbara last_name: Müther - first_name: Sandra full_name: Hemkemeyer, Sandra last_name: Hemkemeyer - first_name: Roland full_name: Wedlich Söldner, Roland last_name: Wedlich Söldner - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Sebastian full_name: Tacke, Sebastian last_name: Tacke - first_name: Martin full_name: Bähler, Martin last_name: Bähler - first_name: Peter full_name: Hanley, Peter last_name: Hanley citation: ama: Horsthemke M, Bachg A, Groll K, et al. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 2017;292(17):7258-7273. doi:10.1074/jbc.M116.766923 apa: Horsthemke, M., Bachg, A., Groll, K., Moyzio, S., Müther, B., Hemkemeyer, S., … Hanley, P. (2017). Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M116.766923 chicago: Horsthemke, Markus, Anne Bachg, Katharina Groll, Sven Moyzio, Barbara Müther, Sandra Hemkemeyer, Roland Wedlich Söldner, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 2017. https://doi.org/10.1074/jbc.M116.766923. ieee: M. Horsthemke et al., “Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion,” Journal of Biological Chemistry, vol. 292, no. 17. American Society for Biochemistry and Molecular Biology, pp. 7258–7273, 2017. ista: Horsthemke M, Bachg A, Groll K, Moyzio S, Müther B, Hemkemeyer S, Wedlich Söldner R, Sixt MK, Tacke S, Bähler M, Hanley P. 2017. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 292(17), 7258–7273. mla: Horsthemke, Markus, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal of Biological Chemistry, vol. 292, no. 17, American Society for Biochemistry and Molecular Biology, 2017, pp. 7258–73, doi:10.1074/jbc.M116.766923. short: M. Horsthemke, A. Bachg, K. Groll, S. Moyzio, B. Müther, S. Hemkemeyer, R. Wedlich Söldner, M.K. Sixt, S. Tacke, M. Bähler, P. Hanley, Journal of Biological Chemistry 292 (2017) 7258–7273. date_created: 2018-12-11T11:47:49Z date_published: 2017-04-28T00:00:00Z date_updated: 2021-01-12T08:08:34Z day: '28' ddc: - '570' department: - _id: MiSi doi: 10.1074/jbc.M116.766923 file: - access_level: open_access checksum: d488162874326a4bb056065fa549dc4a content_type: application/pdf creator: dernst date_created: 2019-10-24T15:25:42Z date_updated: 2020-07-14T12:47:37Z file_id: '6971' file_name: 2017_JBC_Horsthemke.pdf file_size: 5647880 relation: main_file file_date_updated: 2020-07-14T12:47:37Z has_accepted_license: '1' intvolume: ' 292' issue: '17' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 7258 - 7273 publication: Journal of Biological Chemistry publication_identifier: issn: - '00219258' publication_status: published publisher: American Society for Biochemistry and Molecular Biology publist_id: '7059' quality_controlled: '1' scopus_import: 1 status: public title: Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 292 year: '2017' ... --- _id: '669' abstract: - lang: eng text: 'The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis as an effector of small GTPases in polarized cell growth. In land plants, several exocyst subunits are encoded by double or triple paralogs, culminating in tens of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed seven isoforms expressed in pollen. Genetic and microscopic analyses of single mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes revealed that only a loss-of-function EXO70C2 allele resulted in a significant male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2 pollen tubes could frequently recover and restart their speedy elongation, resulting in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background, resulted in a complete pollen-specific transmission defect, suggesting redundant functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed under the control of their native promoters, localized in the cytoplasm of pollen grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization, and genetic effect suggest an unconventional EXO70 function possibly as a regulator of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes. ' article_processing_charge: No article_type: original author: - first_name: Lukáš full_name: Synek, Lukáš last_name: Synek - first_name: Nemanja full_name: Vukašinović, Nemanja last_name: Vukašinović - first_name: Ivan full_name: Kulich, Ivan last_name: Kulich - first_name: Michal full_name: Hála, Michal last_name: Hála - first_name: Klára full_name: Aldorfová, Klára last_name: Aldorfová - first_name: Matyas full_name: Fendrych, Matyas id: 43905548-F248-11E8-B48F-1D18A9856A87 last_name: Fendrych orcid: 0000-0002-9767-8699 - first_name: Viktor full_name: Žárský, Viktor last_name: Žárský citation: ama: Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 2017;174(1):223-240. doi:10.1104/pp.16.01282 apa: Synek, L., Vukašinović, N., Kulich, I., Hála, M., Aldorfová, K., Fendrych, M., & Žárský, V. (2017). EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.16.01282 chicago: Synek, Lukáš, Nemanja Vukašinović, Ivan Kulich, Michal Hála, Klára Aldorfová, Matyas Fendrych, and Viktor Žárský. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” Plant Physiology. American Society of Plant Biologists, 2017. https://doi.org/10.1104/pp.16.01282. ieee: L. Synek et al., “EXO70C2 is a key regulatory factor for optimal tip growth of pollen,” Plant Physiology, vol. 174, no. 1. American Society of Plant Biologists, pp. 223–240, 2017. ista: Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 174(1), 223–240. mla: Synek, Lukáš, et al. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” Plant Physiology, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 223–40, doi:10.1104/pp.16.01282. short: L. Synek, N. Vukašinović, I. Kulich, M. Hála, K. Aldorfová, M. Fendrych, V. Žárský, Plant Physiology 174 (2017) 223–240. date_created: 2018-12-11T11:47:49Z date_published: 2017-05-01T00:00:00Z date_updated: 2021-01-12T08:08:35Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.1104/pp.16.01282 external_id: pmid: - '28356503' file: - access_level: open_access checksum: 97155acc6aa5f0d0a78e0589a932fe02 content_type: application/pdf creator: dernst date_created: 2019-11-18T16:16:18Z date_updated: 2020-07-14T12:47:37Z file_id: '7041' file_name: 2017_PlantPhysio_Synek.pdf file_size: 2176903 relation: main_file file_date_updated: 2020-07-14T12:47:37Z has_accepted_license: '1' intvolume: ' 174' issue: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 223 - 240 pmid: 1 publication: Plant Physiology publication_identifier: issn: - '00320889' publication_status: published publisher: American Society of Plant Biologists publist_id: '7058' quality_controlled: '1' scopus_import: 1 status: public title: EXO70C2 is a key regulatory factor for optimal tip growth of pollen type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 174 year: '2017' ... --- _id: '671' abstract: - lang: eng text: Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation. article_processing_charge: Yes (in subscription journal) author: - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Vaquero full_name: Martinez, Vaquero last_name: Martinez - 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: Nowak, Martin last_name: Nowak citation: ama: Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. PNAS. 2017;114(18):4715-4720. doi:10.1073/pnas.1621239114 apa: Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1621239114 chicago: Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1621239114. ieee: C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017. ista: Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720. mla: Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” PNAS, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114. short: C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720. date_created: 2018-12-11T11:47:50Z date_published: 2017-05-02T00:00:00Z date_updated: 2021-01-12T08:08:37Z day: '02' department: - _id: KrCh doi: 10.1073/pnas.1621239114 ec_funded: 1 external_id: pmid: - '28420786' intvolume: ' 114' issue: '18' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/ month: '05' oa: 1 oa_version: Published Version page: 4715 - 4720 pmid: 1 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: PNAS publication_identifier: issn: - '00278424' publication_status: published publisher: National Academy of Sciences publist_id: '7053' quality_controlled: '1' scopus_import: 1 status: public title: Memory-n strategies of direct reciprocity type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2017' ... --- _id: '670' abstract: - lang: eng text: We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears. article_processing_charge: No article_type: original author: - first_name: Camille full_name: Schreck, Camille id: 2B14B676-F248-11E8-B48F-1D18A9856A87 last_name: Schreck - first_name: Damien full_name: Rohmer, Damien last_name: Rohmer - first_name: Stefanie full_name: Hahmann, Stefanie last_name: Hahmann citation: ama: Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. Computer Graphics Forum. 2017;36(2):95-106. doi:10.1111/cgf.13110 apa: Schreck, C., Rohmer, D., & Hahmann, S. (2017). Interactive paper tearing. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13110 chicago: Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper Tearing.” Computer Graphics Forum. Wiley, 2017. https://doi.org/10.1111/cgf.13110. ieee: C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” Computer Graphics Forum, vol. 36, no. 2. Wiley, pp. 95–106, 2017. ista: Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer Graphics Forum. 36(2), 95–106. mla: Schreck, Camille, et al. “Interactive Paper Tearing.” Computer Graphics Forum, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:10.1111/cgf.13110. short: C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106. date_created: 2018-12-11T11:47:49Z date_published: 2017-05-01T00:00:00Z date_updated: 2021-01-12T08:08:37Z day: '01' ddc: - '000' department: - _id: ChWo doi: 10.1111/cgf.13110 intvolume: ' 36' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf month: '05' oa: 1 oa_version: Published Version page: 95 - 106 project: - _id: 25357BD2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 24352-N23 name: 'Deep Pictures: Creating Visual and Haptic Vector Images' publication: Computer Graphics Forum publication_identifier: issn: - '01677055' publication_status: published publisher: Wiley publist_id: '7056' quality_controlled: '1' scopus_import: 1 status: public title: Interactive paper tearing type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2017' ... --- _id: '672' abstract: - lang: eng text: Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration. article_processing_charge: Yes author: - first_name: Kari full_name: Vaahtomeri, Kari id: 368EE576-F248-11E8-B48F-1D18A9856A87 last_name: Vaahtomeri orcid: 0000-0001-7829-3518 - first_name: Markus full_name: Brown, Markus id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Ingrid full_name: De Vries, Ingrid id: 4C7D837E-F248-11E8-B48F-1D18A9856A87 last_name: De Vries - first_name: Alexander F full_name: Leithner, Alexander F id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87 last_name: Leithner - first_name: Matthias full_name: Mehling, Matthias id: 3C23B994-F248-11E8-B48F-1D18A9856A87 last_name: Mehling orcid: 0000-0001-8599-1226 - first_name: Walter full_name: Kaufmann, Walter id: 3F99E422-F248-11E8-B48F-1D18A9856A87 last_name: Kaufmann orcid: 0000-0001-9735-5315 - 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: Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 2017;19(5):902-909. doi:10.1016/j.celrep.2017.04.027 apa: Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling, M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.027 chicago: Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.027. ieee: K. Vaahtomeri et al., “Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia,” Cell Reports, vol. 19, no. 5. Cell Press, pp. 902–909, 2017. ista: Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909. mla: Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports, vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:10.1016/j.celrep.2017.04.027. short: K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling, W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909. date_created: 2018-12-11T11:47:50Z date_published: 2017-05-02T00:00:00Z date_updated: 2023-02-23T12:50:09Z day: '02' ddc: - '570' department: - _id: MiSi - _id: Bio - _id: EM-Fac doi: 10.1016/j.celrep.2017.04.027 ec_funded: 1 file: - access_level: open_access checksum: 8fdddaab1f1d76a6ec9ca94dcb6b07a2 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:54Z date_updated: 2020-07-14T12:47:38Z file_id: '5109' file_name: IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf file_size: 2248814 relation: main_file file_date_updated: 2020-07-14T12:47:38Z has_accepted_license: '1' intvolume: ' 19' issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 902 - 909 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: Cell Reports publication_identifier: issn: - '22111247' publication_status: published publisher: Cell Press publist_id: '7052' pubrep_id: '900' quality_controlled: '1' scopus_import: 1 status: public title: Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia 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: 19 year: '2017' ... --- _id: '674' abstract: - lang: eng text: Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo. author: - first_name: Jan full_name: Schwarz, Jan id: 346C1EC6-F248-11E8-B48F-1D18A9856A87 last_name: Schwarz - first_name: Veronika full_name: Bierbaum, Veronika id: 3FD04378-F248-11E8-B48F-1D18A9856A87 last_name: Bierbaum - first_name: Kari full_name: Vaahtomeri, Kari id: 368EE576-F248-11E8-B48F-1D18A9856A87 last_name: Vaahtomeri orcid: 0000-0001-7829-3518 - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Markus full_name: Brown, Markus id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Ingrid full_name: De Vries, Ingrid id: 4C7D837E-F248-11E8-B48F-1D18A9856A87 last_name: De Vries - first_name: Alexander F full_name: Leithner, Alexander F id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87 last_name: Leithner - first_name: Anne full_name: Reversat, Anne id: 35B76592-F248-11E8-B48F-1D18A9856A87 last_name: Reversat orcid: 0000-0003-0666-8928 - first_name: Jack full_name: Merrin, Jack id: 4515C308-F248-11E8-B48F-1D18A9856A87 last_name: Merrin orcid: 0000-0001-5145-4609 - first_name: Teresa full_name: Tarrant, Teresa last_name: Tarrant - first_name: Tobias full_name: Bollenbach, Tobias id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87 last_name: Bollenbach orcid: 0000-0003-4398-476X - 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, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 2017;27(9):1314-1325. doi:10.1016/j.cub.2017.04.004 apa: Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries, I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.04.004 chicago: Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.04.004. ieee: J. Schwarz et al., “Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6,” Current Biology, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017. ista: Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325. mla: Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current Biology, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:10.1016/j.cub.2017.04.004. short: J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries, A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt, Current Biology 27 (2017) 1314–1325. date_created: 2018-12-11T11:47:51Z date_published: 2017-05-09T00:00:00Z date_updated: 2023-02-23T12:50:44Z day: '09' department: - _id: MiSi - _id: Bio - _id: NanoFab doi: 10.1016/j.cub.2017.04.004 ec_funded: 1 intvolume: ' 27' issue: '9' language: - iso: eng month: '05' oa_version: None page: 1314 - 1325 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25A8E5EA-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Y 564-B12 name: Cytoskeletal force generation and transduction of leukocytes (FWF) publication: Current Biology publication_identifier: issn: - '09609822' publication_status: published publisher: Cell Press publist_id: '7050' quality_controlled: '1' scopus_import: 1 status: public title: Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6 type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2017' ... --- _id: '677' abstract: - lang: eng text: The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR. author: - first_name: Claudio full_name: Lademann, Claudio last_name: Lademann - first_name: Jörg full_name: Renkawitz, Jörg id: 3F0587C8-F248-11E8-B48F-1D18A9856A87 last_name: Renkawitz orcid: 0000-0003-2856-3369 - first_name: Boris full_name: Pfander, Boris last_name: Pfander - first_name: Stefan full_name: Jentsch, Stefan last_name: Jentsch citation: ama: Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 2017;19(7):1294-1303. doi:10.1016/j.celrep.2017.04.051 apa: Lademann, C., Renkawitz, J., Pfander, B., & Jentsch, S. (2017). The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.051 chicago: Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.051. ieee: C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination,” Cell Reports, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017. ista: Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 19(7), 1294–1303. mla: Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” Cell Reports, vol. 19, no. 7, Cell Press, 2017, pp. 1294–303, doi:10.1016/j.celrep.2017.04.051. short: C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017) 1294–1303. date_created: 2018-12-11T11:47:52Z date_published: 2017-05-16T00:00:00Z date_updated: 2021-01-12T08:08:57Z day: '16' ddc: - '570' department: - _id: MiSi doi: 10.1016/j.celrep.2017.04.051 file: - access_level: open_access checksum: efc7287d9c6354983cb151880e9ad72a content_type: application/pdf creator: system date_created: 2018-12-12T10:15:48Z date_updated: 2020-07-14T12:47:40Z file_id: '5171' file_name: IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf file_size: 3005610 relation: main_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' intvolume: ' 19' issue: '7' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 1294 - 1303 publication: Cell Reports publication_identifier: issn: - '22111247' publication_status: published publisher: Cell Press publist_id: '7046' pubrep_id: '899' quality_controlled: '1' scopus_import: 1 status: public title: The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2017' ... --- _id: '678' abstract: - lang: eng text: The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development. author: - first_name: Nicoletta full_name: Petridou, Nicoletta id: 2A003F6C-F248-11E8-B48F-1D18A9856A87 last_name: Petridou orcid: 0000-0002-8451-1195 - first_name: Zoltan P full_name: Spiro, Zoltan P id: 426AD026-F248-11E8-B48F-1D18A9856A87 last_name: Spiro - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: Petridou N, Spiro ZP, Heisenberg C-PJ. Multiscale force sensing in development. Nature Cell Biology. 2017;19(6):581-588. doi:10.1038/ncb3524 apa: Petridou, N., Spiro, Z. P., & Heisenberg, C.-P. J. (2017). Multiscale force sensing in development. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb3524 chicago: Petridou, Nicoletta, Zoltan P Spiro, and Carl-Philipp J Heisenberg. “Multiscale Force Sensing in Development.” Nature Cell Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/ncb3524. ieee: N. Petridou, Z. P. Spiro, and C.-P. J. Heisenberg, “Multiscale force sensing in development,” Nature Cell Biology, vol. 19, no. 6. Nature Publishing Group, pp. 581–588, 2017. ista: Petridou N, Spiro ZP, Heisenberg C-PJ. 2017. Multiscale force sensing in development. Nature Cell Biology. 19(6), 581–588. mla: Petridou, Nicoletta, et al. “Multiscale Force Sensing in Development.” Nature Cell Biology, vol. 19, no. 6, Nature Publishing Group, 2017, pp. 581–88, doi:10.1038/ncb3524. short: N. Petridou, Z.P. Spiro, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017) 581–588. date_created: 2018-12-11T11:47:53Z date_published: 2017-05-31T00:00:00Z date_updated: 2021-01-12T08:08:59Z day: '31' department: - _id: CaHe doi: 10.1038/ncb3524 intvolume: ' 19' issue: '6' language: - iso: eng month: '05' oa_version: None page: 581 - 588 project: - _id: 25236028-B435-11E9-9278-68D0E5697425 grant_number: ALTF534-2016 name: The generation and function of anisotropic tissue tension in zebrafish epiboly (EMBO Fellowship) publication: Nature Cell Biology publication_identifier: issn: - '14657392' publication_status: published publisher: Nature Publishing Group publist_id: '7040' quality_controlled: '1' scopus_import: 1 status: public title: Multiscale force sensing in development type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2017' ... --- _id: '681' abstract: - lang: eng text: Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile where all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players' objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games. article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Emmanuel full_name: Filiot, Emmanuel last_name: Filiot - first_name: Jean full_name: Raskin, Jean last_name: Raskin citation: ama: Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular games. Information and Computation. 2017;254:296-315. doi:10.1016/j.ic.2016.10.012 apa: Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.012 chicago: Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012. ieee: K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254. Elsevier, pp. 296–315, 2017. ista: Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315. mla: Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012. short: K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation 254 (2017) 296–315. date_created: 2018-12-11T11:47:53Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-02-21T16:06:02Z day: '01' department: - _id: KrCh doi: 10.1016/j.ic.2016.10.012 ec_funded: 1 external_id: arxiv: - '1311.3238' intvolume: ' 254' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1311.3238 month: '06' oa: 1 oa_version: Submitted Version page: 296 - 315 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Information and Computation publication_identifier: issn: - '08905401' publication_status: published publisher: Elsevier publist_id: '7036' quality_controlled: '1' related_material: record: - id: '10885' relation: earlier_version status: public scopus_import: '1' status: public title: Doomsday equilibria for omega-regular games type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 254 year: '2017' ... --- _id: '6841' abstract: - lang: eng text: In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified. author: - first_name: Georg S full_name: Martius, Georg S id: 3A276B68-F248-11E8-B48F-1D18A9856A87 last_name: Martius - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Martius GS, Lampert C. Extrapolation and learning equations. In: 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. International Conference on Learning Representations; 2017.' apa: 'Martius, G. S., & Lampert, C. (2017). Extrapolation and learning equations. In 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. Toulon, France: International Conference on Learning Representations.' chicago: Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.” In 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. International Conference on Learning Representations, 2017. ieee: G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, Toulon, France, 2017. ista: 'Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. ICLR: International Conference on Learning Representations.' mla: Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.” 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017. short: G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017. conference: end_date: 2017-04-26 location: Toulon, France name: 'ICLR: International Conference on Learning Representations' start_date: 2017-04-24 date_created: 2019-09-01T22:01:00Z date_published: 2017-02-21T00:00:00Z date_updated: 2021-01-12T08:09:17Z day: '21' department: - _id: ChLa ec_funded: 1 external_id: arxiv: - '1610.02995' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1610.02995 month: '02' oa: 1 oa_version: Preprint project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication: 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings publication_status: published publisher: International Conference on Learning Representations quality_controlled: '1' scopus_import: 1 status: public title: Extrapolation and learning equations type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '684' abstract: - lang: eng text: We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic. article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nir full_name: Piterman, Nir last_name: Piterman citation: ama: Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71 apa: Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71 chicago: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017. https://doi.org/10.1017/jsl.2016.71. ieee: K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017. ista: Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452. mla: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:10.1017/jsl.2016.71. short: K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452. date_created: 2018-12-11T11:47:54Z date_published: 2017-06-01T00:00:00Z date_updated: 2021-04-16T12:10:53Z day: '01' department: - _id: KrCh doi: 10.1017/jsl.2016.71 intvolume: ' 82' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1206.5174 month: '06' oa: 1 oa_version: Submitted Version page: 420 - 452 publication: Journal of Symbolic Logic publication_identifier: eissn: - 1943-5886 issn: - 0022-4812 publication_status: published publisher: Cambridge University Press publist_id: '7026' quality_controlled: '1' scopus_import: '1' status: public title: Obligation blackwell games and p-automata type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 82 year: '2017' ... --- _id: '685' abstract: - lang: eng text: By applying methods and principles from the physical sciences to biological problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning reveals elegant, simple explanations for seemingly complex processes. This has had a profound influence on subsequent generations of developmental biologists. We discuss how this influence can be traced through twentieth century morphologists, embryologists and theoreticians to current research that explores the molecular and cellular mechanisms of tissue growth and patterning, including our own studies of the vertebrate neural tube. author: - first_name: James full_name: Briscoe, James last_name: Briscoe - first_name: Anna full_name: Kicheva, Anna id: 3959A2A0-F248-11E8-B48F-1D18A9856A87 last_name: Kicheva orcid: 0000-0003-4509-4998 citation: ama: Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development. 2017;145:26-31. doi:10.1016/j.mod.2017.03.005 apa: Briscoe, J., & Kicheva, A. (2017). The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development. Elsevier. https://doi.org/10.1016/j.mod.2017.03.005 chicago: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development. Elsevier, 2017. https://doi.org/10.1016/j.mod.2017.03.005. ieee: J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy Thompson’s ‘on growth and form,’” Mechanisms of Development, vol. 145. Elsevier, pp. 26–31, 2017. ista: Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31. mla: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development, vol. 145, Elsevier, 2017, pp. 26–31, doi:10.1016/j.mod.2017.03.005. short: J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31. date_created: 2018-12-11T11:47:55Z date_published: 2017-06-01T00:00:00Z date_updated: 2021-01-12T08:09:20Z day: '01' ddc: - '571' department: - _id: AnKi doi: 10.1016/j.mod.2017.03.005 ec_funded: 1 external_id: pmid: - '28366718' file: - access_level: open_access checksum: 727043d2e4199fbef6b3704e6d1ac105 content_type: application/pdf creator: dernst date_created: 2019-04-17T07:58:48Z date_updated: 2020-07-14T12:47:42Z file_id: '6335' file_name: 2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf file_size: 652313 relation: main_file file_date_updated: 2020-07-14T12:47:42Z has_accepted_license: '1' intvolume: ' 145' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 26 - 31 pmid: 1 project: - _id: B6FC0238-B512-11E9-945C-1524E6697425 call_identifier: H2020 grant_number: '680037' name: Coordination of Patterning And Growth In the Spinal Cord publication: Mechanisms of Development publication_identifier: issn: - '09254773' publication_status: published publisher: Elsevier publist_id: '7025' pubrep_id: '985' quality_controlled: '1' scopus_import: 1 status: public title: The physics of development 100 years after D'Arcy Thompson's “on growth and form” type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 145 year: '2017' ... --- _id: '688' abstract: - lang: eng text: 'We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. ' alternative_title: - LIPIcs author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: ama: 'Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:10.4230/LIPIcs.SoCG.2017.39' apa: 'Edelsbrunner, H., & Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.39' chicago: Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.39. ieee: H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,” presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia, 2017, vol. 77, pp. 391–3916. ista: Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916. mla: Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39. short: H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916. conference: end_date: 2017-07-07 location: Brisbane, Australia name: Symposium on Computational Geometry, SoCG start_date: 2017-07-04 date_created: 2018-12-11T11:47:56Z date_published: 2017-06-01T00:00:00Z date_updated: 2021-01-12T08:09:26Z day: '01' ddc: - '514' - '516' department: - _id: HeEd - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2017.39 file: - access_level: open_access checksum: 067ab0cb3f962bae6c3af6bf0094e0f3 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:03Z date_updated: 2020-07-14T12:47:42Z file_id: '4856' file_name: IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf file_size: 990546 relation: main_file file_date_updated: 2020-07-14T12:47:42Z has_accepted_license: '1' intvolume: ' 77' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 391-3916 publication_identifier: issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7021' pubrep_id: '895' quality_controlled: '1' scopus_import: 1 status: public title: Topological data analysis with Bregman divergences 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: 77 year: '2017' ... --- _id: '687' abstract: - lang: eng text: Pursuing the similarity between the Kontsevich-Soibelman construction of the cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of canonical bases for quantum enveloping algebras, and the similarity between the integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem for quantum enveloping algebras, we build a coproduct on the CoHA associated to a quiver with potential. We also prove a cohomological dimensional reduction theorem, further linking a special class of CoHAs with Yangians, and explaining how to connect the study of character varieties with the study of CoHAs. author: - first_name: Ben full_name: Davison, Ben id: 4634AB1E-F248-11E8-B48F-1D18A9856A87 last_name: Davison orcid: 0000-0002-8944-4390 citation: ama: Davison B. The critical CoHA of a quiver with potential. Quarterly Journal of Mathematics. 2017;68(2):635-703. doi:10.1093/qmath/haw053 apa: Davison, B. (2017). The critical CoHA of a quiver with potential. Quarterly Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qmath/haw053 chicago: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” Quarterly Journal of Mathematics. Oxford University Press, 2017. https://doi.org/10.1093/qmath/haw053. ieee: B. Davison, “The critical CoHA of a quiver with potential,” Quarterly Journal of Mathematics, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017. ista: Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal of Mathematics. 68(2), 635–703. mla: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” Quarterly Journal of Mathematics, vol. 68, no. 2, Oxford University Press, 2017, pp. 635–703, doi:10.1093/qmath/haw053. short: B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703. date_created: 2018-12-11T11:47:55Z date_published: 2017-06-01T00:00:00Z date_updated: 2021-01-12T08:09:24Z day: '01' department: - _id: TaHa doi: 10.1093/qmath/haw053 ec_funded: 1 intvolume: ' 68' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1311.7172 month: '06' oa: 1 oa_version: Submitted Version page: 635 - 703 project: - _id: 25E549F4-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '320593' name: Arithmetic and physics of Higgs moduli spaces publication: Quarterly Journal of Mathematics publication_identifier: issn: - '00335606' publication_status: published publisher: Oxford University Press publist_id: '7022' quality_controlled: '1' scopus_import: 1 status: public title: The critical CoHA of a quiver with potential type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 68 year: '2017' ... --- _id: '686' abstract: - lang: eng text: Tissues are thought to behave like fluids with a given surface tension. Differences in tissue surface tension (TST) have been proposed to trigger cell sorting and tissue envelopment. D'Arcy Thompson in his seminal book ‘On Growth and Form’ has introduced this concept of differential TST as a key physical mechanism dictating tissue formation and organization within the developing organism. Over the past century, many studies have picked up the concept of differential TST and analyzed the role and cell biological basis of TST in development, underlining the importance and influence of this concept in developmental biology. author: - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 citation: ama: 'Heisenberg C-PJ. D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization. Mechanisms of Development. 2017;145:32-37. doi:10.1016/j.mod.2017.03.006' apa: 'Heisenberg, C.-P. J. (2017). D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization. Mechanisms of Development. Elsevier. https://doi.org/10.1016/j.mod.2017.03.006' chicago: 'Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From Soap Bubbles to Tissue Self Organization.” Mechanisms of Development. Elsevier, 2017. https://doi.org/10.1016/j.mod.2017.03.006.' ieee: 'C.-P. J. Heisenberg, “D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization,” Mechanisms of Development, vol. 145. Elsevier, pp. 32–37, 2017.' ista: 'Heisenberg C-PJ. 2017. D’Arcy Thompson’s ‘on growth and form’: From soap bubbles to tissue self organization. Mechanisms of Development. 145, 32–37.' mla: 'Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From Soap Bubbles to Tissue Self Organization.” Mechanisms of Development, vol. 145, Elsevier, 2017, pp. 32–37, doi:10.1016/j.mod.2017.03.006.' short: C.-P.J. Heisenberg, Mechanisms of Development 145 (2017) 32–37. date_created: 2018-12-11T11:47:55Z date_published: 2017-06-01T00:00:00Z date_updated: 2021-01-12T08:09:23Z day: '01' department: - _id: CaHe doi: 10.1016/j.mod.2017.03.006 intvolume: ' 145' language: - iso: eng month: '06' oa_version: None page: 32 - 37 publication: Mechanisms of Development publication_identifier: issn: - '09254773' publication_status: published publisher: Elsevier publist_id: '7024' quality_controlled: '1' scopus_import: 1 status: public title: 'D''Arcy Thompson''s ‘on growth and form’: From soap bubbles to tissue self organization' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 145 year: '2017' ... --- _id: '689' abstract: - lang: eng text: Rett syndrome modeling in monkey mirrors the human disorder. article_number: eaan8196 author: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: Novarino G. Rett syndrome modeling goes simian. Science Translational Medicine. 2017;9(393). doi:10.1126/scitranslmed.aan8196 apa: Novarino, G. (2017). Rett syndrome modeling goes simian. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aan8196 chicago: Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aan8196. ieee: G. Novarino, “Rett syndrome modeling goes simian,” Science Translational Medicine, vol. 9, no. 393. American Association for the Advancement of Science, 2017. ista: Novarino G. 2017. Rett syndrome modeling goes simian. Science Translational Medicine. 9(393), eaan8196. mla: Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” Science Translational Medicine, vol. 9, no. 393, eaan8196, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aan8196. short: G. Novarino, Science Translational Medicine 9 (2017). date_created: 2018-12-11T11:47:56Z date_published: 2017-06-07T00:00:00Z date_updated: 2021-01-12T08:09:29Z day: '07' department: - _id: GaNo doi: 10.1126/scitranslmed.aan8196 intvolume: ' 9' issue: '393' language: - iso: eng month: '06' oa_version: None publication: Science Translational Medicine publication_identifier: issn: - '19466234' publication_status: published publisher: American Association for the Advancement of Science publist_id: '7019' quality_controlled: '1' scopus_import: 1 status: public title: Rett syndrome modeling goes simian type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2017' ... --- _id: '693' abstract: - lang: eng text: 'Many central synapses contain a single presynaptic active zone and a single postsynaptic density. Vesicular release statistics at such “simple synapses” indicate that they contain a small complement of docking sites where vesicles repetitively dock and fuse. In this work, we investigate functional and morphological aspects of docking sites at simple synapses made between cerebellar parallel fibers and molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture replicas, we find that Cav2.1 channels form several clusters per active zone with about nine channels per cluster. The mean value and range of intersynaptic variation are similar for Cav2.1 cluster numbers and for functional estimates of docking-site numbers obtained from the maximum numbers of released vesicles per action potential. Both numbers grow in relation with synaptic size and decrease by a similar extent with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range: 1–5). These changes were accompanied by decreases of miniature current amplitude (from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2), and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic transmission with development. Altogether, these results suggest a close correspondence between the number of functionally defined vesicular docking sites and that of clusters of voltage-gated calcium channels. ' article_processing_charge: Yes (in subscription journal) author: - first_name: Takafumi full_name: Miki, Takafumi last_name: Miki - first_name: Walter full_name: Kaufmann, Walter id: 3F99E422-F248-11E8-B48F-1D18A9856A87 last_name: Kaufmann orcid: 0000-0001-9735-5315 - first_name: Gerardo full_name: Malagon, Gerardo last_name: Malagon - first_name: Laura full_name: Gomez, Laura last_name: Gomez - first_name: Katsuhiko full_name: Tabuchi, Katsuhiko last_name: Tabuchi - first_name: Masahiko full_name: Watanabe, Masahiko last_name: Watanabe - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Alain full_name: Marty, Alain last_name: Marty citation: ama: Miki T, Kaufmann W, Malagon G, et al. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. PNAS. 2017;114(26):E5246-E5255. doi:10.1073/pnas.1704470114 apa: Miki, T., Kaufmann, W., Malagon, G., Gomez, L., Tabuchi, K., Watanabe, M., … Marty, A. (2017). Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1704470114 chicago: Miki, Takafumi, Walter Kaufmann, Gerardo Malagon, Laura Gomez, Katsuhiko Tabuchi, Masahiko Watanabe, Ryuichi Shigemoto, and Alain Marty. “Numbers of Presynaptic Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1704470114. ieee: T. Miki et al., “Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses,” PNAS, vol. 114, no. 26. National Academy of Sciences, pp. E5246–E5255, 2017. ista: Miki T, Kaufmann W, Malagon G, Gomez L, Tabuchi K, Watanabe M, Shigemoto R, Marty A. 2017. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. PNAS. 114(26), E5246–E5255. mla: Miki, Takafumi, et al. “Numbers of Presynaptic Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.” PNAS, vol. 114, no. 26, National Academy of Sciences, 2017, pp. E5246–55, doi:10.1073/pnas.1704470114. short: T. Miki, W. Kaufmann, G. Malagon, L. Gomez, K. Tabuchi, M. Watanabe, R. Shigemoto, A. Marty, PNAS 114 (2017) E5246–E5255. date_created: 2018-12-11T11:47:57Z date_published: 2017-06-27T00:00:00Z date_updated: 2023-02-23T12:54:57Z day: '27' ddc: - '570' department: - _id: EM-Fac - _id: RySh doi: 10.1073/pnas.1704470114 external_id: pmid: - '28607047' file: - access_level: open_access checksum: 2ab75d554f3df4a34d20fa8040589b7e content_type: application/pdf creator: kschuh date_created: 2020-01-03T13:27:29Z date_updated: 2020-07-14T12:47:44Z file_id: '7223' file_name: 2017_PNAS_Miki.pdf file_size: 2721544 relation: main_file file_date_updated: 2020-07-14T12:47:44Z has_accepted_license: '1' intvolume: ' 114' issue: '26' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: E5246 - E5255 pmid: 1 publication: PNAS publication_identifier: issn: - '00278424' publication_status: published publisher: National Academy of Sciences publist_id: '7013' quality_controlled: '1' scopus_import: 1 status: public title: Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2017' ... --- _id: '694' abstract: - lang: eng text: A change regarding the extent of adhesion - hereafter referred to as adhesion plasticity - between adhesive and less-adhesive states of mammalian cells is important for their behavior. To investigate adhesion plasticity, we have selected a stable isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension. These suspension cells are unable to re-adhere to various matrices or to contract three-dimensional collagen lattices. By using transcriptome analysis, we identified the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity. Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore, by transiently challenging breast cancer cells to grow under non-adherent conditions markedly reduces Tns3 protein expression, which is regained upon re-adhesion. Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion, spreading and migration. Tns3-knockdown cells display impaired structure and dynamics of focal adhesion complexes as determined by immunostaining. Restoration of Tns3 protein expression in suspension cells partially rescues adhesion and focal contact composition. Our work identifies Tns3 as a crucial focal adhesion component regulated by, and functionally contributing to, the switch between adhesive and non-adhesive states in MDA-MB-468 cancer cells. article_type: original author: - first_name: Astrid full_name: Veß, Astrid last_name: Veß - first_name: Ulrich full_name: Blache, Ulrich last_name: Blache - first_name: Laura full_name: Leitner, Laura last_name: Leitner - first_name: Angela full_name: Kurz, Angela last_name: Kurz - first_name: Anja full_name: Ehrenpfordt, Anja last_name: Ehrenpfordt - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Guido full_name: Posern, Guido last_name: Posern citation: ama: Veß A, Blache U, Leitner L, et al. A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell Science. 2017;130(13):2172-2184. doi:10.1242/jcs.200899 apa: Veß, A., Blache, U., Leitner, L., Kurz, A., Ehrenpfordt, A., Sixt, M. K., & Posern, G. (2017). A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.200899 chicago: Veß, Astrid, Ulrich Blache, Laura Leitner, Angela Kurz, Anja Ehrenpfordt, Michael K Sixt, and Guido Posern. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” Journal of Cell Science. Company of Biologists, 2017. https://doi.org/10.1242/jcs.200899. ieee: A. Veß et al., “A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity,” Journal of Cell Science, vol. 130, no. 13. Company of Biologists, pp. 2172–2184, 2017. ista: Veß A, Blache U, Leitner L, Kurz A, Ehrenpfordt A, Sixt MK, Posern G. 2017. A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell Science. 130(13), 2172–2184. mla: Veß, Astrid, et al. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” Journal of Cell Science, vol. 130, no. 13, Company of Biologists, 2017, pp. 2172–84, doi:10.1242/jcs.200899. short: A. Veß, U. Blache, L. Leitner, A. Kurz, A. Ehrenpfordt, M.K. Sixt, G. Posern, Journal of Cell Science 130 (2017) 2172–2184. date_created: 2018-12-11T11:47:58Z date_published: 2017-07-01T00:00:00Z date_updated: 2021-01-12T08:09:41Z day: '01' ddc: - '570' department: - _id: MiSi doi: 10.1242/jcs.200899 external_id: pmid: - '28515231' file: - access_level: open_access checksum: 42c81a0a4fc3128883b391c3af3f74bc content_type: application/pdf creator: dernst date_created: 2019-10-24T09:43:56Z date_updated: 2020-07-14T12:47:45Z file_id: '6966' file_name: 2017_CellScience_Vess.pdf file_size: 10847596 relation: main_file file_date_updated: 2020-07-14T12:47:45Z has_accepted_license: '1' intvolume: ' 130' issue: '13' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 2172 - 2184 pmid: 1 publication: Journal of Cell Science publication_identifier: issn: - '00219533' publication_status: published publisher: Company of Biologists publist_id: '7008' quality_controlled: '1' scopus_import: 1 status: public title: A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 130 year: '2017' ... --- _id: '697' abstract: - lang: eng text: 'De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over n-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping n-1 to n bit strings), can be distinguished from the uniform distribution with advantage epsilon by a circuit of size O( 2^n epsilon^2). We generalize this result, showing that a distribution which has less than k bits of min-entropy, can be distinguished from any distribution with k bits of delta-smooth min-entropy with advantage epsilon by a circuit of size O(2^k epsilon^2/delta^2). As a special case, this implies that any distribution with support at most 2^k (e.g., the output of a pseudoentropy generator mapping k to n bit strings) can be distinguished from any given distribution with min-entropy k+1 with advantage epsilon by a circuit of size O(2^k epsilon^2). Our result thus shows that pseudoentropy distributions face basically the same non-uniform attacks as pseudorandom distributions. ' alternative_title: - LIPIcs article_number: '39' author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski citation: ama: 'Pietrzak KZ, Skórski M. Non uniform attacks against pseudoentropy. In: Vol 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.ICALP.2017.39' apa: 'Pietrzak, K. Z., & Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2017.39' chicago: Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against Pseudoentropy,” Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.39. ieee: 'K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 2017, vol. 80.' ista: 'Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 80, 39.' mla: Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39. short: K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-07-14 location: Warsaw, Poland name: 'ICALP: International Colloquium on Automata, Languages, and Programming' start_date: 2017-07-10 date_created: 2018-12-11T11:47:59Z date_published: 2017-07-01T00:00:00Z date_updated: 2021-01-12T08:11:15Z day: '01' ddc: - '005' department: - _id: KrPi doi: 10.4230/LIPIcs.ICALP.2017.39 ec_funded: 1 file: - access_level: open_access checksum: e95618a001692f1af2d68f5fde43bc1f content_type: application/pdf creator: system date_created: 2018-12-12T10:08:40Z date_updated: 2020-07-14T12:47:46Z file_id: '4701' file_name: IST-2017-893-v1+1_LIPIcs-ICALP-2017-39.pdf file_size: 601004 relation: main_file file_date_updated: 2020-07-14T12:47:46Z has_accepted_license: '1' intvolume: ' 80' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7003' pubrep_id: '893' quality_controlled: '1' scopus_import: 1 status: public title: Non uniform attacks against pseudoentropy 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: 80 year: '2017' ... --- _id: '698' abstract: - lang: eng text: 'Extracellular matrix signals from the microenvironment regulate gene expression patterns and cell behavior. Using a combination of experiments and geometric models, we demonstrate correlations between cell geometry, three-dimensional (3D) organization of chromosome territories, and gene expression. Fluorescence in situ hybridization experiments showed that micropatterned fibroblasts cultured on anisotropic versus isotropic substrates resulted in repositioning of specific chromosomes, which contained genes that were differentially regulated by cell geometries. Experiments combined with ellipsoid packing models revealed that the mechanosensitivity of chromosomes was correlated with their orientation in the nucleus. Transcription inhibition experiments suggested that the intermingling degree was more sensitive to global changes in transcription than to chromosome radial positioning and its orientations. These results suggested that cell geometry modulated 3D chromosome arrangement, and their neighborhoods correlated with gene expression patterns in a predictable manner. This is central to understanding geometric control of genetic programs involved in cellular homeostasis and the associated diseases. ' author: - first_name: Yejun full_name: Wang, Yejun last_name: Wang - first_name: Mallika full_name: Nagarajan, Mallika last_name: Nagarajan - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Gv full_name: Shivashankar, Gv last_name: Shivashankar citation: ama: Wang Y, Nagarajan M, Uhler C, Shivashankar G. Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression. Molecular Biology of the Cell. 2017;28(14):1997-2009. doi:10.1091/mbc.E16-12-0825 apa: Wang, Y., Nagarajan, M., Uhler, C., & Shivashankar, G. (2017). Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression. Molecular Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.E16-12-0825 chicago: Wang, Yejun, Mallika Nagarajan, Caroline Uhler, and Gv Shivashankar. “Orientation and Repositioning of Chromosomes Correlate with Cell Geometry Dependent Gene Expression.” Molecular Biology of the Cell. American Society for Cell Biology, 2017. https://doi.org/10.1091/mbc.E16-12-0825. ieee: Y. Wang, M. Nagarajan, C. Uhler, and G. Shivashankar, “Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression,” Molecular Biology of the Cell, vol. 28, no. 14. American Society for Cell Biology, pp. 1997–2009, 2017. ista: Wang Y, Nagarajan M, Uhler C, Shivashankar G. 2017. Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression. Molecular Biology of the Cell. 28(14), 1997–2009. mla: Wang, Yejun, et al. “Orientation and Repositioning of Chromosomes Correlate with Cell Geometry Dependent Gene Expression.” Molecular Biology of the Cell, vol. 28, no. 14, American Society for Cell Biology, 2017, pp. 1997–2009, doi:10.1091/mbc.E16-12-0825. short: Y. Wang, M. Nagarajan, C. Uhler, G. Shivashankar, Molecular Biology of the Cell 28 (2017) 1997–2009. date_created: 2018-12-11T11:47:59Z date_published: 2017-07-07T00:00:00Z date_updated: 2021-01-12T08:11:17Z day: '07' ddc: - '519' department: - _id: CaUh doi: 10.1091/mbc.E16-12-0825 file: - access_level: open_access checksum: de01dac9e30970cfa6ae902480a4e04d content_type: application/pdf creator: system date_created: 2018-12-12T10:10:53Z date_updated: 2020-07-14T12:47:46Z file_id: '4844' file_name: IST-2017-892-v1+1_Mol._Biol._Cell-2017-Wang-1997-2009.pdf file_size: 1086097 relation: main_file file_date_updated: 2020-07-14T12:47:46Z has_accepted_license: '1' intvolume: ' 28' issue: '14' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '07' oa: 1 oa_version: Published Version page: 1997 - 2009 project: - _id: 2530CA10-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Y 903-N35 name: 'Gaussian Graphical Models: Theory and Applications' publication: Molecular Biology of the Cell publication_identifier: issn: - '10591524' publication_status: published publisher: American Society for Cell Biology publist_id: '7001' pubrep_id: '892' quality_controlled: '1' scopus_import: 1 status: public title: Orientation and repositioning of chromosomes correlate with cell geometry dependent gene expression 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: 28 year: '2017' ... --- _id: '699' abstract: - lang: eng text: 'In antagonistic symbioses, such as host–parasite interactions, one population’s success is the other’s loss. In mutualistic symbioses, such as division of labor, both parties can gain, but they might have different preferences over the possible mutualistic arrangements. The rates of evolution of the two populations in a symbiosis are important determinants of which population will be more successful: Faster evolution is thought to be favored in antagonistic symbioses (the “Red Queen effect”), but disfavored in certain mutualistic symbioses (the “Red King effect”). However, it remains unclear which biological parameters drive these effects. Here, we analyze the effects of the various determinants of evolutionary rate: generation time, mutation rate, population size, and the intensity of natural selection. Our main results hold for the case where mutation is infrequent. Slower evolution causes a long-term advantage in an important class of mutualistic interactions. Surprisingly, less intense selection is the strongest driver of this Red King effect, whereas relative mutation rates and generation times have little effect. In antagonistic interactions, faster evolution by any means is beneficial. Our results provide insight into the demographic evolution of symbionts. ' author: - first_name: Carl full_name: Veller, Carl last_name: Veller - first_name: Laura full_name: Hayward, Laura last_name: Hayward - first_name: Martin full_name: Nowak, Martin last_name: Nowak - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X citation: ama: Veller C, Hayward L, Nowak M, Hilbe C. The red queen and king in finite populations. PNAS. 2017;114(27):E5396-E5405. doi:10.1073/pnas.1702020114 apa: Veller, C., Hayward, L., Nowak, M., & Hilbe, C. (2017). The red queen and king in finite populations. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1702020114 chicago: Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red Queen and King in Finite Populations.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1702020114. ieee: C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in finite populations,” PNAS, vol. 114, no. 27. National Academy of Sciences, pp. E5396–E5405, 2017. ista: Veller C, Hayward L, Nowak M, Hilbe C. 2017. The red queen and king in finite populations. PNAS. 114(27), E5396–E5405. mla: Veller, Carl, et al. “The Red Queen and King in Finite Populations.” PNAS, vol. 114, no. 27, National Academy of Sciences, 2017, pp. E5396–405, doi:10.1073/pnas.1702020114. short: C. Veller, L. Hayward, M. Nowak, C. Hilbe, PNAS 114 (2017) E5396–E5405. date_created: 2018-12-11T11:48:00Z date_published: 2017-07-03T00:00:00Z date_updated: 2021-01-12T08:11:21Z day: '03' department: - _id: KrCh doi: 10.1073/pnas.1702020114 external_id: pmid: - '28630336' intvolume: ' 114' issue: '27' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5502615/ month: '07' oa: 1 oa_version: Submitted Version page: E5396 - E5405 pmid: 1 publication: PNAS publication_identifier: issn: - '00278424' publication_status: published publisher: National Academy of Sciences publist_id: '7002' quality_controlled: '1' scopus_import: 1 status: public title: The red queen and king in finite populations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2017' ... --- _id: '700' abstract: - lang: eng text: Microtubules provide the mechanical force required for chromosome separation during mitosis. However, little is known about the dynamic (high-frequency) mechanical properties of microtubules. Here, we theoretically propose to control the vibrations of a doubly clamped microtubule by tip electrodes and to detect its motion via the optomechanical coupling between the vibrational modes of the microtubule and an optical cavity. In the presence of a red-detuned strong pump laser, this coupling leads to optomechanical-induced transparency of an optical probe field, which can be detected with state-of-the art technology. The center frequency and line width of the transparency peak give the resonance frequency and damping rate of the microtubule, respectively, while the height of the peak reveals information about the microtubule-cavity field coupling. Our method opens the new possibilities to gain information about the physical properties of microtubules, which will enhance our capability to design physical cancer treatment protocols as alternatives to chemotherapeutic drugs. article_number: '012404' author: - first_name: Shabir full_name: Barzanjeh, Shabir id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87 last_name: Barzanjeh orcid: 0000-0003-0415-1423 - first_name: Vahid full_name: Salari, Vahid last_name: Salari - first_name: Jack full_name: Tuszynski, Jack last_name: Tuszynski - first_name: Michal full_name: Cifra, Michal last_name: Cifra - first_name: Christoph full_name: Simon, Christoph last_name: Simon citation: ama: Barzanjeh S, Salari V, Tuszynski J, Cifra M, Simon C. Optomechanical proposal for monitoring microtubule mechanical vibrations. Physical Review E Statistical Nonlinear and Soft Matter Physics . 2017;96(1). doi:10.1103/PhysRevE.96.012404 apa: Barzanjeh, S., Salari, V., Tuszynski, J., Cifra, M., & Simon, C. (2017). Optomechanical proposal for monitoring microtubule mechanical vibrations. Physical Review E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics. https://doi.org/10.1103/PhysRevE.96.012404 chicago: Barzanjeh, Shabir, Vahid Salari, Jack Tuszynski, Michal Cifra, and Christoph Simon. “Optomechanical Proposal for Monitoring Microtubule Mechanical Vibrations.” Physical Review E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics, 2017. https://doi.org/10.1103/PhysRevE.96.012404. ieee: S. Barzanjeh, V. Salari, J. Tuszynski, M. Cifra, and C. Simon, “Optomechanical proposal for monitoring microtubule mechanical vibrations,” Physical Review E Statistical Nonlinear and Soft Matter Physics , vol. 96, no. 1. American Institute of Physics, 2017. ista: Barzanjeh S, Salari V, Tuszynski J, Cifra M, Simon C. 2017. Optomechanical proposal for monitoring microtubule mechanical vibrations. Physical Review E Statistical Nonlinear and Soft Matter Physics . 96(1), 012404. mla: Barzanjeh, Shabir, et al. “Optomechanical Proposal for Monitoring Microtubule Mechanical Vibrations.” Physical Review E Statistical Nonlinear and Soft Matter Physics , vol. 96, no. 1, 012404, American Institute of Physics, 2017, doi:10.1103/PhysRevE.96.012404. short: S. Barzanjeh, V. Salari, J. Tuszynski, M. Cifra, C. Simon, Physical Review E Statistical Nonlinear and Soft Matter Physics 96 (2017). date_created: 2018-12-11T11:48:00Z date_published: 2017-07-12T00:00:00Z date_updated: 2023-02-23T12:56:35Z day: '12' department: - _id: JoFi doi: 10.1103/PhysRevE.96.012404 ec_funded: 1 intvolume: ' 96' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/pdf/1612.07061.pdf month: '07' oa: 1 oa_version: Submitted Version project: - _id: 258047B6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '707438' name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics' publication: ' Physical Review E Statistical Nonlinear and Soft Matter Physics ' publication_identifier: issn: - '24700045' publication_status: published publisher: American Institute of Physics publist_id: '6997' quality_controlled: '1' scopus_import: 1 status: public title: Optomechanical proposal for monitoring microtubule mechanical vibrations type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 96 year: '2017' ... --- _id: '701' abstract: - lang: eng text: A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled by k simplices with disjoint interiors that are all mutually congruent and similar to S. For d = 2, triangular k-reptiles exist for all k of the form a^2, 3a^2 or a^2+b^2 and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, the only k-reptile simplices that are known for d ≥ 3, have k = m^d, where m is a positive integer. We substantially simplify the proof by Matoušek and the second author that for d = 3, k-reptile tetrahedra can exist only for k = m^3. We then prove a weaker analogue of this result for d = 4 by showing that four-dimensional k-reptile simplices can exist only for k = m^2. author: - first_name: Jan full_name: Kynčl, Jan last_name: Kynčl - first_name: Zuzana full_name: Patakova, Zuzana id: 48B57058-F248-11E8-B48F-1D18A9856A87 last_name: Patakova orcid: 0000-0002-3975-1683 citation: ama: Kynčl J, Patakova Z. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. 2017;24(3):1-44. apa: Kynčl, J., & Patakova, Z. (2017). On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. International Press. chicago: Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics. International Press, 2017. ieee: J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4,” The Electronic Journal of Combinatorics, vol. 24, no. 3. International Press, pp. 1–44, 2017. ista: Kynčl J, Patakova Z. 2017. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. 24(3), 1–44. mla: Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics, vol. 24, no. 3, International Press, 2017, pp. 1–44. short: J. Kynčl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017) 1–44. date_created: 2018-12-11T11:48:00Z date_published: 2017-07-14T00:00:00Z date_updated: 2021-01-12T08:11:28Z day: '14' ddc: - '500' department: - _id: UlWa file: - access_level: open_access checksum: a431e573e31df13bc0f66de3061006ec content_type: application/pdf creator: system date_created: 2018-12-12T10:14:25Z date_updated: 2020-07-14T12:47:47Z file_id: '5077' file_name: IST-2018-984-v1+1_Patakova_on_the_nonexistence_of_k-reptile_simplices_in_R_3_and_R_4_2017.pdf file_size: 544042 relation: main_file file_date_updated: 2020-07-14T12:47:47Z has_accepted_license: '1' intvolume: ' 24' issue: '3' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 1-44 publication: The Electronic Journal of Combinatorics publication_identifier: issn: - '10778926' publication_status: published publisher: International Press publist_id: '6996' pubrep_id: '984' quality_controlled: '1' status: public title: On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2017' ... --- _id: '702' abstract: - lang: eng text: "Leading autism-associated mutation in mouse partially mimics human disorder.\r\n\r\n" author: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: Novarino G. The riddle of CHD8 haploinsufficiency in autism spectrum disorder. Science Translational Medicine. 2017;9(399):eaao0972. doi:10.1126/scitranslmed.aao0972 apa: Novarino, G. (2017). The riddle of CHD8 haploinsufficiency in autism spectrum disorder. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aao0972 chicago: Novarino, Gaia. “The Riddle of CHD8 Haploinsufficiency in Autism Spectrum Disorder.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aao0972. ieee: G. Novarino, “The riddle of CHD8 haploinsufficiency in autism spectrum disorder,” Science Translational Medicine, vol. 9, no. 399. American Association for the Advancement of Science, p. eaao0972, 2017. ista: Novarino G. 2017. The riddle of CHD8 haploinsufficiency in autism spectrum disorder. Science Translational Medicine. 9(399), eaao0972. mla: Novarino, Gaia. “The Riddle of CHD8 Haploinsufficiency in Autism Spectrum Disorder.” Science Translational Medicine, vol. 9, no. 399, American Association for the Advancement of Science, 2017, p. eaao0972, doi:10.1126/scitranslmed.aao0972. short: G. Novarino, Science Translational Medicine 9 (2017) eaao0972. date_created: 2018-12-11T11:48:01Z date_published: 2017-07-19T00:00:00Z date_updated: 2021-01-12T08:11:31Z day: '19' department: - _id: GaNo doi: 10.1126/scitranslmed.aao0972 intvolume: ' 9' issue: '399' language: - iso: eng month: '07' oa_version: None page: eaao0972 publication: Science Translational Medicine publication_identifier: issn: - '19466234' publication_status: published publisher: American Association for the Advancement of Science publist_id: '6993' quality_controlled: '1' scopus_import: 1 status: public title: The riddle of CHD8 haploinsufficiency in autism spectrum disorder type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2017' ... --- _id: '706' abstract: - lang: eng text: A hippocampal mossy fiber synapse has a complex structure and is implicated in learning and memory. In this synapse, the mossy fiber boutons attach to the dendritic shaft by puncta adherentia junctions and wrap around a multiply-branched spine, forming synaptic junctions. We have recently shown using transmission electron microscopy, immunoelectron microscopy and serial block face-scanning electron microscopy that atypical puncta adherentia junctions are formed in the afadin-deficient mossy fiber synapse and that the complexity of postsynaptic spines and mossy fiber boutons, the number of spine heads, the area of postsynaptic densities and the density of synaptic vesicles docked to active zones are decreased in the afadin-deficient synapse. We investigated here the roles of afadin in the functional differentiations of the mossy fiber synapse using the afadin-deficient mice. The electrophysiological studies showed that both the release probability of glutamate and the postsynaptic responsiveness to glutamate were markedly reduced, but not completely lost, in the afadin-deficient mossy fiber synapse, whereas neither long-term potentiation nor long-term depression was affected. These results indicate that afadin plays roles in the functional differentiations of the presynapse and the postsynapse of the hippocampal mossy fiber synapse. author: - first_name: Xiaoqi full_name: Geng, Xiaoqi id: 3395256A-F248-11E8-B48F-1D18A9856A87 last_name: Geng - first_name: Tomohiko full_name: Maruo, Tomohiko last_name: Maruo - first_name: Kenji full_name: Mandai, Kenji last_name: Mandai - first_name: Irwan full_name: Supriyanto, Irwan last_name: Supriyanto - first_name: Muneaki full_name: Miyata, Muneaki last_name: Miyata - first_name: Shotaro full_name: Sakakibara, Shotaro last_name: Sakakibara - first_name: Akira full_name: Mizoguchi, Akira last_name: Mizoguchi - first_name: Yoshimi full_name: Takai, Yoshimi last_name: Takai - first_name: Masahiro full_name: Mori, Masahiro last_name: Mori citation: ama: Geng X, Maruo T, Mandai K, et al. Roles of afadin in functional differentiations of hippocampal mossy fiber synapse. Genes to Cells. 2017;22(8):715-722. doi:10.1111/gtc.12508 apa: Geng, X., Maruo, T., Mandai, K., Supriyanto, I., Miyata, M., Sakakibara, S., … Mori, M. (2017). Roles of afadin in functional differentiations of hippocampal mossy fiber synapse. Genes to Cells. Wiley-Blackwell. https://doi.org/10.1111/gtc.12508 chicago: Geng, Xiaoqi, Tomohiko Maruo, Kenji Mandai, Irwan Supriyanto, Muneaki Miyata, Shotaro Sakakibara, Akira Mizoguchi, Yoshimi Takai, and Masahiro Mori. “Roles of Afadin in Functional Differentiations of Hippocampal Mossy Fiber Synapse.” Genes to Cells. Wiley-Blackwell, 2017. https://doi.org/10.1111/gtc.12508. ieee: X. Geng et al., “Roles of afadin in functional differentiations of hippocampal mossy fiber synapse,” Genes to Cells, vol. 22, no. 8. Wiley-Blackwell, pp. 715–722, 2017. ista: Geng X, Maruo T, Mandai K, Supriyanto I, Miyata M, Sakakibara S, Mizoguchi A, Takai Y, Mori M. 2017. Roles of afadin in functional differentiations of hippocampal mossy fiber synapse. Genes to Cells. 22(8), 715–722. mla: Geng, Xiaoqi, et al. “Roles of Afadin in Functional Differentiations of Hippocampal Mossy Fiber Synapse.” Genes to Cells, vol. 22, no. 8, Wiley-Blackwell, 2017, pp. 715–22, doi:10.1111/gtc.12508. short: X. Geng, T. Maruo, K. Mandai, I. Supriyanto, M. Miyata, S. Sakakibara, A. Mizoguchi, Y. Takai, M. Mori, Genes to Cells 22 (2017) 715–722. date_created: 2018-12-11T11:48:02Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:11:37Z day: '01' department: - _id: PeJo doi: 10.1111/gtc.12508 intvolume: ' 22' issue: '8' language: - iso: eng month: '08' oa_version: None page: 715 - 722 publication: Genes to Cells publication_identifier: issn: - '13569597' publication_status: published publisher: Wiley-Blackwell publist_id: '6987' quality_controlled: '1' scopus_import: 1 status: public title: Roles of afadin in functional differentiations of hippocampal mossy fiber synapse type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2017' ... --- _id: '707' abstract: - lang: eng text: We answer a question of M. Gromov on the waist of the unit ball. author: - first_name: Arseniy full_name: Akopyan, Arseniy id: 430D2C90-F248-11E8-B48F-1D18A9856A87 last_name: Akopyan orcid: 0000-0002-2548-617X - first_name: Roman full_name: Karasev, Roman last_name: Karasev citation: ama: Akopyan A, Karasev R. A tight estimate for the waist of the ball . Bulletin of the London Mathematical Society. 2017;49(4):690-693. doi:10.1112/blms.12062 apa: Akopyan, A., & Karasev, R. (2017). A tight estimate for the waist of the ball . Bulletin of the London Mathematical Society. Wiley-Blackwell. https://doi.org/10.1112/blms.12062 chicago: Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .” Bulletin of the London Mathematical Society. Wiley-Blackwell, 2017. https://doi.org/10.1112/blms.12062. ieee: A. Akopyan and R. Karasev, “A tight estimate for the waist of the ball ,” Bulletin of the London Mathematical Society, vol. 49, no. 4. Wiley-Blackwell, pp. 690–693, 2017. ista: Akopyan A, Karasev R. 2017. A tight estimate for the waist of the ball . Bulletin of the London Mathematical Society. 49(4), 690–693. mla: Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the Ball .” Bulletin of the London Mathematical Society, vol. 49, no. 4, Wiley-Blackwell, 2017, pp. 690–93, doi:10.1112/blms.12062. short: A. Akopyan, R. Karasev, Bulletin of the London Mathematical Society 49 (2017) 690–693. date_created: 2018-12-11T11:48:02Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:11:41Z day: '01' department: - _id: HeEd doi: 10.1112/blms.12062 ec_funded: 1 intvolume: ' 49' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1608.06279 month: '08' oa: 1 oa_version: Preprint page: 690 - 693 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Bulletin of the London Mathematical Society publication_identifier: issn: - '00246093' publication_status: published publisher: Wiley-Blackwell publist_id: '6982' quality_controlled: '1' scopus_import: 1 status: public title: 'A tight estimate for the waist of the ball ' type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 49 year: '2017' ... --- _id: '708' abstract: - lang: eng text: 'In the developing and adult brain, oligodendrocyte precursor cells (OPCs) are influenced by neuronal activity: they are involved in synaptic signaling with neurons, and their proliferation and differentiation into myelinating glia can be altered by transient changes in neuronal firing. An important question that has been unanswered is whether OPCs can discriminate different patterns of neuronal activity and respond to them in a distinct way. Here, we demonstrate in brain slices that the pattern of neuronal activity determines the functional changes triggered at synapses between axons and OPCs. Furthermore, we show that stimulation of the corpus callosum at different frequencies in vivo affects proliferation and differentiation of OPCs in a dissimilar way. Our findings suggest that neurons do not influence OPCs in “all-or-none” fashion but use their firing pattern to tune the response and behavior of these nonneuronal cells.' article_number: e2001993 author: - first_name: Balint full_name: Nagy, Balint id: 30F830CE-02D1-11E9-9BAA-DAF4881429F2 last_name: Nagy orcid: 0000-0002-4002-4686 - first_name: Anahit full_name: Hovhannisyan, Anahit last_name: Hovhannisyan - first_name: Ruxandra full_name: Barzan, Ruxandra last_name: Barzan - first_name: Ting full_name: Chen, Ting last_name: Chen - first_name: Maria full_name: Kukley, Maria last_name: Kukley citation: ama: Nagy B, Hovhannisyan A, Barzan R, Chen T, Kukley M. Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum. PLoS Biology. 2017;15(8). doi:10.1371/journal.pbio.2001993 apa: Nagy, B., Hovhannisyan, A., Barzan, R., Chen, T., & Kukley, M. (2017). Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2001993 chicago: Nagy, Balint, Anahit Hovhannisyan, Ruxandra Barzan, Ting Chen, and Maria Kukley. “Different Patterns of Neuronal Activity Trigger Distinct Responses of Oligodendrocyte Precursor Cells in the Corpus Callosum.” PLoS Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pbio.2001993. ieee: B. Nagy, A. Hovhannisyan, R. Barzan, T. Chen, and M. Kukley, “Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum,” PLoS Biology, vol. 15, no. 8. Public Library of Science, 2017. ista: Nagy B, Hovhannisyan A, Barzan R, Chen T, Kukley M. 2017. Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum. PLoS Biology. 15(8), e2001993. mla: Nagy, Balint, et al. “Different Patterns of Neuronal Activity Trigger Distinct Responses of Oligodendrocyte Precursor Cells in the Corpus Callosum.” PLoS Biology, vol. 15, no. 8, e2001993, Public Library of Science, 2017, doi:10.1371/journal.pbio.2001993. short: B. Nagy, A. Hovhannisyan, R. Barzan, T. Chen, M. Kukley, PLoS Biology 15 (2017). date_created: 2018-12-11T11:48:03Z date_published: 2017-08-22T00:00:00Z date_updated: 2021-01-12T08:11:45Z day: '22' ddc: - '576' - '610' department: - _id: SaSi doi: 10.1371/journal.pbio.2001993 file: - access_level: open_access checksum: 0c974f430682dc832ea7b27ab5a93124 content_type: application/pdf creator: system date_created: 2018-12-12T10:15:35Z date_updated: 2020-07-14T12:47:49Z file_id: '5156' file_name: IST-2017-889-v1+1_journal.pbio.2001993.pdf file_size: 18155365 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' intvolume: ' 15' issue: '8' language: - iso: eng month: '08' oa: 1 oa_version: Published Version publication: PLoS Biology publication_identifier: issn: - '15449173' publication_status: published publisher: Public Library of Science publist_id: '6983' pubrep_id: '889' quality_controlled: '1' scopus_import: 1 status: public title: Different patterns of neuronal activity trigger distinct responses of oligodendrocyte precursor cells in the corpus callosum tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2017' ... --- _id: '709' abstract: - lang: eng text: Adipose tissues play key roles in energy homeostasis. Brown adipocytes and beige adipocytes in white adipose tissue (WAT) share the similar characters of thermogenesis, both of them could be potential targets for obesity management. Several thermo-sensitive transient receptor potential channels (thermoTRPs) are shown to be involved in adipocyte biology. However, the expression pattern of thermoTRPs in adipose tissues from obese mice is still unknown. The mRNA expression of thermoTRPs in subcutaneous WAT (sWAT) and interscapular brown adipose tissue (iBAT) from lean and obese mice were measured using reverse transcriptase-quantitative PCRs (RT-qPCR). The results demonstrated that all 10 thermoTRPs are expressed in both iBAT and sWAT, and without significant difference in the mRNA expression level of thermoTRPs between these two tissues. Moreover, Trpv1 and Trpv3 mRNA expression levels in both iBAT and sWAT were significantly decreased in high fat diet (HFD)-induced obese mice and db/db (leptin receptor deficient) mice. Trpm2 mRNA expression level was significantly decreased only in sWAT from HFD-induced obese mice and db/db mice. On the other hand, Trpv2 and Trpv4 mRNA expression levels in iBAT and sWAT were significantly increased in HFD-induced obese mice and db/db mice. Taken together, we conclude that all 10 thermoTRPs are expressed in iBAT and sWAT. And several thermoTRPs differentially expressed in adipose tissues from HFD-induced obese mice and db/db mice, suggesting a potential involvement in anti-obesity regulations. author: - first_name: Wuping full_name: Sun, Wuping last_name: Sun - first_name: Chen full_name: Li, Chen last_name: Li - first_name: Yonghong full_name: Zhang, Yonghong last_name: Zhang - first_name: Changyu full_name: Jiang, Changyu last_name: Jiang - first_name: Ming-Zhu full_name: Zhai, Ming-Zhu id: 34009CFA-F248-11E8-B48F-1D18A9856A87 last_name: Zhai - first_name: Qian full_name: Zhou, Qian last_name: Zhou - first_name: Lizu full_name: Xiao, Lizu last_name: Xiao - first_name: Qiwen full_name: Deng, Qiwen last_name: Deng citation: ama: Sun W, Li C, Zhang Y, et al. Gene expression changes of thermo sensitive transient receptor potential channels in obese mice. Cell Biology International. 2017;41(8):908-913. doi:10.1002/cbin.10783 apa: Sun, W., Li, C., Zhang, Y., Jiang, C., Zhai, M.-Z., Zhou, Q., … Deng, Q. (2017). Gene expression changes of thermo sensitive transient receptor potential channels in obese mice. Cell Biology International. Wiley-Blackwell. https://doi.org/10.1002/cbin.10783 chicago: Sun, Wuping, Chen Li, Yonghong Zhang, Changyu Jiang, Ming-Zhu Zhai, Qian Zhou, Lizu Xiao, and Qiwen Deng. “Gene Expression Changes of Thermo Sensitive Transient Receptor Potential Channels in Obese Mice.” Cell Biology International. Wiley-Blackwell, 2017. https://doi.org/10.1002/cbin.10783. ieee: W. Sun et al., “Gene expression changes of thermo sensitive transient receptor potential channels in obese mice,” Cell Biology International, vol. 41, no. 8. Wiley-Blackwell, pp. 908–913, 2017. ista: Sun W, Li C, Zhang Y, Jiang C, Zhai M-Z, Zhou Q, Xiao L, Deng Q. 2017. Gene expression changes of thermo sensitive transient receptor potential channels in obese mice. Cell Biology International. 41(8), 908–913. mla: Sun, Wuping, et al. “Gene Expression Changes of Thermo Sensitive Transient Receptor Potential Channels in Obese Mice.” Cell Biology International, vol. 41, no. 8, Wiley-Blackwell, 2017, pp. 908–13, doi:10.1002/cbin.10783. short: W. Sun, C. Li, Y. Zhang, C. Jiang, M.-Z. Zhai, Q. Zhou, L. Xiao, Q. Deng, Cell Biology International 41 (2017) 908–913. date_created: 2018-12-11T11:48:04Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:11:47Z day: '01' department: - _id: RySh doi: 10.1002/cbin.10783 intvolume: ' 41' issue: '8' language: - iso: eng month: '08' oa_version: None page: 908 - 913 publication: Cell Biology International publication_identifier: issn: - '10656995' publication_status: published publisher: Wiley-Blackwell publist_id: '6981' quality_controlled: '1' scopus_import: 1 status: public title: Gene expression changes of thermo sensitive transient receptor potential channels in obese mice type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 41 year: '2017' ... --- _id: '710' abstract: - lang: eng text: 'We revisit the problem of estimating entropy of discrete distributions from independent samples, studied recently by Acharya, Orlitsky, Suresh and Tyagi (SODA 2015), improving their upper and lower bounds on the necessary sample size n. For estimating Renyi entropy of order alpha, up to constant accuracy and error probability, we show the following * Upper bounds n = O(1) 2^{(1-1/alpha)H_alpha} for integer alpha>1, as the worst case over distributions with Renyi entropy equal to H_alpha. * Lower bounds n = Omega(1) K^{1-1/alpha} for any real alpha>1, with the constant being an inverse polynomial of the accuracy, as the worst case over all distributions on K elements. Our upper bounds essentially replace the alphabet size by a factor exponential in the entropy, which offers improvements especially in low or medium entropy regimes (interesting for example in anomaly detection). As for the lower bounds, our proof explicitly shows how the complexity depends on both alphabet and accuracy, partially solving the open problem posted in previous works. The argument for upper bounds derives a clean identity for the variance of falling-power sum of a multinomial distribution. Our approach for lower bounds utilizes convex optimization to find a distribution with possibly worse estimation performance, and may be of independent interest as a tool to work with Le Cam’s two point method. ' alternative_title: - LIPIcs article_number: '20' author: - first_name: Maciej full_name: Obremski, Maciej last_name: Obremski - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski citation: ama: 'Obremski M, Skórski M. Renyi entropy estimation revisited. In: Vol 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20' apa: 'Obremski, M., & Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20' chicago: Obremski, Maciej, and Maciej Skórski. “Renyi Entropy Estimation Revisited,” Vol. 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20. ieee: M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81. ista: Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, LIPIcs, vol. 81, 20. mla: Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20. short: M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-08-18 location: Berkeley, USA name: 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX start_date: 2017-08-18 date_created: 2018-12-11T11:48:04Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:11:50Z day: '01' ddc: - '005' - '600' department: - _id: KrPi doi: 10.4230/LIPIcs.APPROX-RANDOM.2017.20 ec_funded: 1 file: - access_level: open_access checksum: 89225c7dcec2c93838458c9102858985 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:10Z date_updated: 2020-07-14T12:47:49Z file_id: '4991' file_name: IST-2017-888-v1+1_LIPIcs-APPROX-RANDOM-2017-20.pdf file_size: 604813 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' intvolume: ' 81' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '6979' pubrep_id: '888' quality_controlled: '1' scopus_import: 1 status: public title: Renyi entropy estimation revisited 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: 81 year: '2017' ... --- _id: '713' abstract: - lang: eng text: To determine the dynamics of allelic-specific expression during mouse development, we analyzed RNA-seq data from 23 F1 tissues from different developmental stages, including 19 female tissues allowing X chromosome inactivation (XCI) escapers to also be detected. We demonstrate that allelic expression arising from genetic or epigenetic differences is highly tissue-specific. We find that tissue-specific strain-biased gene expression may be regulated by tissue-specific enhancers or by post-transcriptional differences in stability between the alleles. We also find that escape from X-inactivation is tissue-specific, with leg muscle showing an unexpectedly high rate of XCI escapers. By surveying a range of tissues during development, and performing extensive validation, we are able to provide a high confidence list of mouse imprinted genes including 18 novel genes. This shows that cluster size varies dynamically during development and can be substantially larger than previously thought, with the Igf2r cluster extending over 10 Mb in placenta. article_number: e25125 author: - first_name: Daniel full_name: Andergassen, Daniel last_name: Andergassen - first_name: Christoph full_name: Dotter, Christoph id: 4C66542E-F248-11E8-B48F-1D18A9856A87 last_name: Dotter - first_name: Dyniel full_name: Wenzel, Dyniel last_name: Wenzel - first_name: Verena full_name: Sigl, Verena last_name: Sigl - first_name: Philipp full_name: Bammer, Philipp last_name: Bammer - first_name: Markus full_name: Muckenhuber, Markus last_name: Muckenhuber - first_name: Daniela full_name: Mayer, Daniela last_name: Mayer - first_name: Tomasz full_name: Kulinski, Tomasz last_name: Kulinski - first_name: Hans full_name: Theussl, Hans last_name: Theussl - first_name: Josef full_name: Penninger, Josef last_name: Penninger - first_name: Christoph full_name: Bock, Christoph last_name: Bock - first_name: Denise full_name: Barlow, Denise last_name: Barlow - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler - first_name: Quanah full_name: Hudson, Quanah last_name: Hudson citation: ama: Andergassen D, Dotter C, Wenzel D, et al. Mapping the mouse Allelome reveals tissue specific regulation of allelic expression. eLife. 2017;6. doi:10.7554/eLife.25125 apa: Andergassen, D., Dotter, C., Wenzel, D., Sigl, V., Bammer, P., Muckenhuber, M., … Hudson, Q. (2017). Mapping the mouse Allelome reveals tissue specific regulation of allelic expression. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.25125 chicago: Andergassen, Daniel, Christoph Dotter, Dyniel Wenzel, Verena Sigl, Philipp Bammer, Markus Muckenhuber, Daniela Mayer, et al. “Mapping the Mouse Allelome Reveals Tissue Specific Regulation of Allelic Expression.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.25125. ieee: D. Andergassen et al., “Mapping the mouse Allelome reveals tissue specific regulation of allelic expression,” eLife, vol. 6. eLife Sciences Publications, 2017. ista: Andergassen D, Dotter C, Wenzel D, Sigl V, Bammer P, Muckenhuber M, Mayer D, Kulinski T, Theussl H, Penninger J, Bock C, Barlow D, Pauler F, Hudson Q. 2017. Mapping the mouse Allelome reveals tissue specific regulation of allelic expression. eLife. 6, e25125. mla: Andergassen, Daniel, et al. “Mapping the Mouse Allelome Reveals Tissue Specific Regulation of Allelic Expression.” ELife, vol. 6, e25125, eLife Sciences Publications, 2017, doi:10.7554/eLife.25125. short: D. Andergassen, C. Dotter, D. Wenzel, V. Sigl, P. Bammer, M. Muckenhuber, D. Mayer, T. Kulinski, H. Theussl, J. Penninger, C. Bock, D. Barlow, F. Pauler, Q. Hudson, ELife 6 (2017). date_created: 2018-12-11T11:48:05Z date_published: 2017-08-14T00:00:00Z date_updated: 2021-01-12T08:11:57Z day: '14' ddc: - '576' department: - _id: GaNo - _id: SiHi doi: 10.7554/eLife.25125 file: - access_level: open_access checksum: 1ace3462e64a971b9ead896091829549 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:36Z date_updated: 2020-07-14T12:47:50Z file_id: '5020' file_name: IST-2017-885-v1+1_elife-25125-figures-v2.pdf file_size: 6399510 relation: main_file - access_level: open_access checksum: 6241dc31eeb87b03facadec3a53a6827 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:36Z date_updated: 2020-07-14T12:47:50Z file_id: '5021' file_name: IST-2017-885-v1+2_elife-25125-v2.pdf file_size: 4264398 relation: main_file file_date_updated: 2020-07-14T12:47:50Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25E9AF9E-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27201-B22 name: Revealing the mechanisms underlying drug interactions publication: eLife publication_identifier: issn: - 2050084X publication_status: published publisher: eLife Sciences Publications publist_id: '6971' pubrep_id: '885' quality_controlled: '1' scopus_import: 1 status: public title: Mapping the mouse Allelome reveals tissue specific regulation of allelic expression tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2017' ... --- _id: '711' abstract: - lang: eng text: Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow the automata to process input words backwards as well, for example, to measure the maximal or average time between a response and the preceding request. We therefore introduce and study bidirectional NWA that can process input words in both directions. First, we show that bidirectional NWA can express interesting quantitative properties that are not expressible by forward-only NWA. Second, for the fundamental decision problems of emptiness and universality, we establish decidability and complexity results for the new framework which match the best-known results for the special case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality is achieved at no additional computational complexity. This is in stark contrast to the unweighted case, where bidirectional finite automata are no more expressive but exponentially more succinct than their forward-only counterparts. alternative_title: - LIPIcs article_number: '5' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - 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 last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Bidirectional nested weighted automata. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.5' apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5. ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85. ista: Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 5. mla: Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-09-08 location: Berlin, Germany name: 28th International Conference on Concurrency Theory, CONCUR start_date: 2017-09-05 date_created: 2018-12-11T11:48:04Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:11:53Z day: '01' ddc: - '004' - '005' department: - _id: KrCh - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2017.5 file: - access_level: open_access checksum: d2bda4783821a6358333fe27f11f4737 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:02Z date_updated: 2020-07-14T12:47:49Z file_id: '4661' file_name: IST-2017-886-v1+1_LIPIcs-CONCUR-2017-5.pdf file_size: 570294 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' intvolume: ' 85' language: - iso: eng month: '08' oa: 1 oa_version: Published Version publication_identifier: issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '6976' pubrep_id: '886' quality_controlled: '1' scopus_import: 1 status: public title: Bidirectional nested weighted automata 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: 85 year: '2017' ... --- _id: '712' abstract: - lang: eng text: 'We establish a weak–strong uniqueness principle for solutions to entropy-dissipating reaction–diffusion equations: As long as a strong solution to the reaction–diffusion equation exists, any weak solution and even any renormalized solution must coincide with this strong solution. Our assumptions on the reaction rates are just the entropy condition and local Lipschitz continuity; in particular, we do not impose any growth restrictions on the reaction rates. Therefore, our result applies to any single reversible reaction with mass-action kinetics as well as to systems of reversible reactions with mass-action kinetics satisfying the detailed balance condition. Renormalized solutions are known to exist globally in time for reaction–diffusion equations with entropy-dissipating reaction rates; in contrast, the global-in-time existence of weak solutions is in general still an open problem–even for smooth data–, thereby motivating the study of renormalized solutions. The key ingredient of our result is a careful adjustment of the usual relative entropy functional, whose evolution cannot be controlled properly for weak solutions or renormalized solutions.' author: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X citation: ama: 'Fischer JL. Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations. Nonlinear Analysis: Theory, Methods and Applications. 2017;159:181-207. doi:10.1016/j.na.2017.03.001' apa: 'Fischer, J. L. (2017). Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations. Nonlinear Analysis: Theory, Methods and Applications. Elsevier. https://doi.org/10.1016/j.na.2017.03.001' chicago: 'Fischer, Julian L. “Weak–Strong Uniqueness of Solutions to Entropy Dissipating Reaction–Diffusion Equations.” Nonlinear Analysis: Theory, Methods and Applications. Elsevier, 2017. https://doi.org/10.1016/j.na.2017.03.001.' ieee: 'J. L. Fischer, “Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations,” Nonlinear Analysis: Theory, Methods and Applications, vol. 159. Elsevier, pp. 181–207, 2017.' ista: 'Fischer JL. 2017. Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations. Nonlinear Analysis: Theory, Methods and Applications. 159, 181–207.' mla: 'Fischer, Julian L. “Weak–Strong Uniqueness of Solutions to Entropy Dissipating Reaction–Diffusion Equations.” Nonlinear Analysis: Theory, Methods and Applications, vol. 159, Elsevier, 2017, pp. 181–207, doi:10.1016/j.na.2017.03.001.' short: 'J.L. Fischer, Nonlinear Analysis: Theory, Methods and Applications 159 (2017) 181–207.' date_created: 2018-12-11T11:48:05Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:11:55Z day: '01' department: - _id: JuFi doi: 10.1016/j.na.2017.03.001 intvolume: ' 159' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.00730 month: '08' oa: 1 oa_version: Submitted Version page: 181 - 207 publication: 'Nonlinear Analysis: Theory, Methods and Applications' publication_identifier: issn: - 0362546X publication_status: published publisher: Elsevier publist_id: '6975' quality_controlled: '1' scopus_import: 1 status: public title: Weak–strong uniqueness of solutions to entropy dissipating reaction–diffusion equations type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 159 year: '2017' ... --- _id: '714' abstract: - lang: eng text: Background HIV-1 infection and drug abuse are frequently co-morbid and their association greatly increases the severity of HIV-1-induced neuropathology. While nucleus accumbens (NAcc) function is severely perturbed by drugs of abuse, little is known about how HIV-1 infection affects NAcc. Methods We used calcium and voltage imaging to investigate the effect of HIV-1 trans-activator of transcription (Tat) on rat NAcc. Based on previous neuronal studies, we hypothesized that Tat modulates intracellular Ca2+ homeostasis of NAcc neurons. Results We provide evidence that Tat triggers a Ca2+ signaling cascade in NAcc medium spiny neurons (MSN) expressing D1-like dopamine receptors leading to neuronal depolarization. Firstly, Tat induced inositol 1,4,5-trisphsophate (IP3) receptor-mediated Ca2+ release from endoplasmic reticulum, followed by Ca2+ and Na+ influx via transient receptor potential canonical channels. The influx of cations depolarizes the membrane promoting additional Ca2+ entry through voltage-gated P/Q-type Ca2+ channels and opening of tetrodotoxin-sensitive Na+ channels. By activating this mechanism, Tat elicits a feed-forward depolarization increasing the excitability of D1-phosphatidylinositol-linked NAcc MSN. We previously found that cocaine targets NAcc neurons directly (independent of the inhibition of dopamine transporter) only when IP3-generating mechanisms are concomitantly initiated. When tested here, cocaine produced a dose-dependent potentiation of the effect of Tat on cytosolic Ca2+. Conclusion We describe for the first time a HIV-1 Tat-triggered Ca2+ signaling in MSN of NAcc involving TRPC and depolarization and a potentiation of the effect of Tat by cocaine, which may be relevant for the reward axis in cocaine-abusing HIV-1-positive patients. acknowledgement: This work was supported by the National Institutes of Health grants DA035926 (to MEA), and P30DA013429 (to EMU). article_processing_charge: No article_type: original author: - first_name: Gabriela full_name: Brailoiu, Gabriela last_name: Brailoiu - first_name: Elena full_name: Deliu, Elena id: 37A40D7E-F248-11E8-B48F-1D18A9856A87 last_name: Deliu orcid: 0000-0002-7370-5293 - first_name: Jeffrey full_name: Barr, Jeffrey last_name: Barr - first_name: Linda full_name: Console Bram, Linda last_name: Console Bram - first_name: Alexandra full_name: Ciuciu, Alexandra last_name: Ciuciu - first_name: Mary full_name: Abood, Mary last_name: Abood - first_name: Ellen full_name: Unterwald, Ellen last_name: Unterwald - first_name: Eugen full_name: Brǎiloiu, Eugen last_name: Brǎiloiu citation: ama: Brailoiu G, Deliu E, Barr J, et al. HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. Drug and Alcohol Dependence. 2017;178:7-14. doi:10.1016/j.drugalcdep.2017.04.015 apa: Brailoiu, G., Deliu, E., Barr, J., Console Bram, L., Ciuciu, A., Abood, M., … Brǎiloiu, E. (2017). HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. Drug and Alcohol Dependence. Elsevier. https://doi.org/10.1016/j.drugalcdep.2017.04.015 chicago: Brailoiu, Gabriela, Elena Deliu, Jeffrey Barr, Linda Console Bram, Alexandra Ciuciu, Mary Abood, Ellen Unterwald, and Eugen Brǎiloiu. “HIV Tat Excites D1 Receptor-like Expressing Neurons from Rat Nucleus Accumbens.” Drug and Alcohol Dependence. Elsevier, 2017. https://doi.org/10.1016/j.drugalcdep.2017.04.015. ieee: G. Brailoiu et al., “HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens,” Drug and Alcohol Dependence, vol. 178. Elsevier, pp. 7–14, 2017. ista: Brailoiu G, Deliu E, Barr J, Console Bram L, Ciuciu A, Abood M, Unterwald E, Brǎiloiu E. 2017. HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. Drug and Alcohol Dependence. 178, 7–14. mla: Brailoiu, Gabriela, et al. “HIV Tat Excites D1 Receptor-like Expressing Neurons from Rat Nucleus Accumbens.” Drug and Alcohol Dependence, vol. 178, Elsevier, 2017, pp. 7–14, doi:10.1016/j.drugalcdep.2017.04.015. short: G. Brailoiu, E. Deliu, J. Barr, L. Console Bram, A. Ciuciu, M. Abood, E. Unterwald, E. Brǎiloiu, Drug and Alcohol Dependence 178 (2017) 7–14. date_created: 2018-12-11T11:48:05Z date_published: 2017-09-01T00:00:00Z date_updated: 2021-01-12T08:12:00Z day: '01' department: - _id: GaNo doi: 10.1016/j.drugalcdep.2017.04.015 external_id: pmid: - '28623807' intvolume: ' 178' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5797705 month: '09' oa: 1 oa_version: Submitted Version page: 7 - 14 pmid: 1 publication: Drug and Alcohol Dependence publication_identifier: issn: - '03768716' publication_status: published publisher: Elsevier publist_id: '6967' quality_controlled: '1' scopus_import: 1 status: public title: HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 178 year: '2017' ... --- _id: '715' abstract: - lang: eng text: D-cycloserine ameliorates breathing abnormalities and survival rate in a mouse model of Rett syndrome. article_number: aao4218 author: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: Novarino G. More excitation for Rett syndrome. Science Translational Medicine. 2017;9(405). doi:10.1126/scitranslmed.aao4218 apa: Novarino, G. (2017). More excitation for Rett syndrome. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aao4218 chicago: Novarino, Gaia. “More Excitation for Rett Syndrome.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aao4218. ieee: G. Novarino, “More excitation for Rett syndrome,” Science Translational Medicine, vol. 9, no. 405. American Association for the Advancement of Science, 2017. ista: Novarino G. 2017. More excitation for Rett syndrome. Science Translational Medicine. 9(405), aao4218. mla: Novarino, Gaia. “More Excitation for Rett Syndrome.” Science Translational Medicine, vol. 9, no. 405, aao4218, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aao4218. short: G. Novarino, Science Translational Medicine 9 (2017). date_created: 2018-12-11T11:48:06Z date_published: 2017-08-30T00:00:00Z date_updated: 2021-01-12T08:12:04Z day: '30' department: - _id: GaNo doi: 10.1126/scitranslmed.aao4218 intvolume: ' 9' issue: '405' language: - iso: eng month: '08' oa_version: None publication: Science Translational Medicine publication_identifier: issn: - '19466234' publication_status: published publisher: American Association for the Advancement of Science publist_id: '6968' quality_controlled: '1' scopus_import: 1 status: public title: More excitation for Rett syndrome type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2017' ... --- _id: '716' abstract: - lang: eng text: 'Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion.While pushdown games have been studied before with qualitative objectives-such as reachability and ?-regular objectives- in this work, we study for the first time such games with the most well-studied quantitative objective, the mean-payoff objective. In pushdown games, two types of strategies are relevant: (1) global strategies, which depend on the entire global history; and (2) modular strategies, which have only local memory and thus do not depend on the context of invocation but rather only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity by showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games and memoryless modular strategies are sufficient in two-player pushdown games. Finally, we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.' article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Yaron full_name: Velner, Yaron last_name: Velner citation: ama: Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. Journal of the ACM. 2017;64(5):34. doi:10.1145/3121408 apa: Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408 chicago: Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408. ieee: K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017. ista: Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34. mla: Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM, vol. 64, no. 5, ACM, 2017, p. 34, doi:10.1145/3121408. short: K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34. date_created: 2018-12-11T11:48:06Z date_published: 2017-09-01T00:00:00Z date_updated: 2021-01-12T08:12:08Z day: '01' department: - _id: KrCh doi: 10.1145/3121408 ec_funded: 1 external_id: arxiv: - '1201.2829' intvolume: ' 64' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1201.2829 month: '09' oa: 1 oa_version: Preprint page: '34' project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Journal of the ACM publication_identifier: issn: - '00045411' publication_status: published publisher: ACM publist_id: '6964' quality_controlled: '1' scopus_import: 1 status: public title: The complexity of mean-payoff pushdown games type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 64 year: '2017' ... --- _id: '717' abstract: - lang: eng text: 'We consider finite-state and recursive game graphs with multidimensional mean-payoff objectives. In recursive games two types of strategies are relevant: global strategies and modular strategies. Our contributions are: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of weights are fixed; whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that one-player recursive games with multidimensional mean-payoff objectives can be solved in polynomial time. Both above algorithms are based on hyperplane separation technique. (3) For recursive games we show that under modular strategies the multidimensional problem is undecidable. We show that if the number of modules, exits, and the maximal absolute value of the weights are fixed, then one-dimensional recursive mean-payoff games under modular strategies can be solved in polynomial time, whereas for unbounded number of exits or modules the problem is NP-hard.' acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Yaron full_name: Velner, Yaron last_name: Velner citation: ama: Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 2017;88:236-259. doi:10.1016/j.jcss.2017.04.005 apa: Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press. https://doi.org/10.1016/j.jcss.2017.04.005 chicago: Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences. Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005. ieee: K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88. Academic Press, pp. 236–259, 2017. ista: Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259. mla: Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences, vol. 88, Academic Press, 2017, pp. 236–59, doi:10.1016/j.jcss.2017.04.005. short: K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259. date_created: 2018-12-11T11:48:07Z date_published: 2017-09-01T00:00:00Z date_updated: 2023-02-23T10:38:15Z day: '01' department: - _id: KrCh doi: 10.1016/j.jcss.2017.04.005 ec_funded: 1 intvolume: ' 88' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1210.3141 month: '09' oa: 1 oa_version: Preprint page: 236 - 259 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Journal of Computer and System Sciences publication_status: published publisher: Academic Press publist_id: '6963' quality_controlled: '1' related_material: record: - id: '2329' relation: earlier_version status: public scopus_import: 1 status: public title: Hyperplane separation technique for multidimensional mean-payoff games type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 88 year: '2017' ... --- _id: '719' abstract: - lang: eng text: 'The ubiquity of computation in modern machines and devices imposes a need to assert the correctness of their behavior. Especially in the case of safety-critical systems, their designers need to take measures that enforce their safe operation. Formal methods has emerged as a research field that addresses this challenge: by rigorously proving that all system executions adhere to their specifications, the correctness of an implementation under concern can be assured. To achieve this goal, a plethora of techniques are nowadays available, all of which are optimized for different system types and application domains.' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rüdiger full_name: Ehlers, Rüdiger last_name: Ehlers citation: ama: 'Chatterjee K, Ehlers R. Special issue: Synthesis and SYNT 2014. Acta Informatica. 2017;54(6):543-544. doi:10.1007/s00236-017-0299-0' apa: 'Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0' chicago: 'Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-017-0299-0.' ieee: 'K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6. Springer, pp. 543–544, 2017.' ista: 'Chatterjee K, Ehlers R. 2017. Special issue: Synthesis and SYNT 2014. Acta Informatica. 54(6), 543–544.' mla: 'Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica, vol. 54, no. 6, Springer, 2017, pp. 543–44, doi:10.1007/s00236-017-0299-0.' short: K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544. date_created: 2018-12-11T11:48:07Z date_published: 2017-09-01T00:00:00Z date_updated: 2021-01-12T08:12:18Z day: '01' department: - _id: KrCh doi: 10.1007/s00236-017-0299-0 intvolume: ' 54' issue: '6' language: - iso: eng month: '09' oa_version: None page: 543 - 544 publication: Acta Informatica publication_identifier: issn: - '00015903' publication_status: published publisher: Springer publist_id: '6961' quality_controlled: '1' scopus_import: 1 status: public title: 'Special issue: Synthesis and SYNT 2014' type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2017' ... --- _id: '720' abstract: - lang: eng text: 'Advances in multi-unit recordings pave the way for statistical modeling of activity patterns in large neural populations. Recent studies have shown that the summed activity of all neurons strongly shapes the population response. A separate recent finding has been that neural populations also exhibit criticality, an anomalously large dynamic range for the probabilities of different population activity patterns. Motivated by these two observations, we introduce a class of probabilistic models which takes into account the prior knowledge that the neural population could be globally coupled and close to critical. These models consist of an energy function which parametrizes interactions between small groups of neurons, and an arbitrary positive, strictly increasing, and twice differentiable function which maps the energy of a population pattern to its probability. We show that: 1) augmenting a pairwise Ising model with a nonlinearity yields an accurate description of the activity of retinal ganglion cells which outperforms previous models based on the summed activity of neurons; 2) prior knowledge that the population is critical translates to prior expectations about the shape of the nonlinearity; 3) the nonlinearity admits an interpretation in terms of a continuous latent variable globally coupling the system whose distribution we can infer from data. Our method is independent of the underlying system’s state space; hence, it can be applied to other systems such as natural scenes or amino acid sequences of proteins which are also known to exhibit criticality.' article_number: e1005763 article_processing_charge: Yes author: - first_name: Jan full_name: Humplik, Jan id: 2E9627A8-F248-11E8-B48F-1D18A9856A87 last_name: Humplik - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 citation: ama: Humplik J, Tkačik G. Probabilistic models for neural populations that naturally capture global coupling and criticality. PLoS Computational Biology. 2017;13(9). doi:10.1371/journal.pcbi.1005763 apa: Humplik, J., & Tkačik, G. (2017). Probabilistic models for neural populations that naturally capture global coupling and criticality. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005763 chicago: Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations That Naturally Capture Global Coupling and Criticality.” PLoS Computational Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005763. ieee: J. Humplik and G. Tkačik, “Probabilistic models for neural populations that naturally capture global coupling and criticality,” PLoS Computational Biology, vol. 13, no. 9. Public Library of Science, 2017. ista: Humplik J, Tkačik G. 2017. Probabilistic models for neural populations that naturally capture global coupling and criticality. PLoS Computational Biology. 13(9), e1005763. mla: Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations That Naturally Capture Global Coupling and Criticality.” PLoS Computational Biology, vol. 13, no. 9, e1005763, Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005763. short: J. Humplik, G. Tkačik, PLoS Computational Biology 13 (2017). date_created: 2018-12-11T11:48:08Z date_published: 2017-09-19T00:00:00Z date_updated: 2021-01-12T08:12:21Z day: '19' ddc: - '530' - '571' department: - _id: GaTk doi: 10.1371/journal.pcbi.1005763 file: - access_level: open_access checksum: 81107096c19771c36ddbe6f0282a3acb content_type: application/pdf creator: system date_created: 2018-12-12T10:18:30Z date_updated: 2020-07-14T12:47:53Z file_id: '5352' file_name: IST-2017-884-v1+1_journal.pcbi.1005763.pdf file_size: 14167050 relation: main_file file_date_updated: 2020-07-14T12:47:53Z has_accepted_license: '1' intvolume: ' 13' issue: '9' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 255008E4-B435-11E9-9278-68D0E5697425 grant_number: RGP0065/2012 name: Information processing and computation in fish groups - _id: 254D1A94-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 25651-N26 name: Sensitivity to higher-order statistics in natural scenes publication: PLoS Computational Biology publication_identifier: issn: - 1553734X publication_status: published publisher: Public Library of Science publist_id: '6960' pubrep_id: '884' quality_controlled: '1' scopus_import: 1 status: public title: Probabilistic models for neural populations that naturally capture global coupling and criticality 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: 13 year: '2017' ... --- _id: '721' abstract: - lang: eng text: 'Let S be a positivity-preserving symmetric linear operator acting on bounded functions. The nonlinear equation -1/m=z+Sm with a parameter z in the complex upper half-plane ℍ has a unique solution m with values in ℍ. We show that the z-dependence of this solution can be represented as the Stieltjes transforms of a family of probability measures v on ℝ. Under suitable conditions on S, we show that v has a real analytic density apart from finitely many algebraic singularities of degree at most 3. Our motivation comes from large random matrices. The solution m determines the density of eigenvalues of two prominent matrix ensembles: (i) matrices with centered independent entries whose variances are given by S and (ii) matrices with correlated entries with a translation-invariant correlation structure. Our analysis shows that the limiting eigenvalue density has only square root singularities or cubic root cusps; no other singularities occur.' author: - first_name: Oskari H full_name: Ajanki, Oskari H id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87 last_name: Ajanki - first_name: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 citation: ama: Ajanki OH, Krüger TH, Erdös L. Singularities of solutions to quadratic vector equations on the complex upper half plane. Communications on Pure and Applied Mathematics. 2017;70(9):1672-1705. doi:10.1002/cpa.21639 apa: Ajanki, O. H., Krüger, T. H., & Erdös, L. (2017). Singularities of solutions to quadratic vector equations on the complex upper half plane. Communications on Pure and Applied Mathematics. Wiley-Blackwell. https://doi.org/10.1002/cpa.21639 chicago: Ajanki, Oskari H, Torben H Krüger, and László Erdös. “Singularities of Solutions to Quadratic Vector Equations on the Complex Upper Half Plane.” Communications on Pure and Applied Mathematics. Wiley-Blackwell, 2017. https://doi.org/10.1002/cpa.21639. ieee: O. H. Ajanki, T. H. Krüger, and L. Erdös, “Singularities of solutions to quadratic vector equations on the complex upper half plane,” Communications on Pure and Applied Mathematics, vol. 70, no. 9. Wiley-Blackwell, pp. 1672–1705, 2017. ista: Ajanki OH, Krüger TH, Erdös L. 2017. Singularities of solutions to quadratic vector equations on the complex upper half plane. Communications on Pure and Applied Mathematics. 70(9), 1672–1705. mla: Ajanki, Oskari H., et al. “Singularities of Solutions to Quadratic Vector Equations on the Complex Upper Half Plane.” Communications on Pure and Applied Mathematics, vol. 70, no. 9, Wiley-Blackwell, 2017, pp. 1672–705, doi:10.1002/cpa.21639. short: O.H. Ajanki, T.H. Krüger, L. Erdös, Communications on Pure and Applied Mathematics 70 (2017) 1672–1705. date_created: 2018-12-11T11:48:08Z date_published: 2017-09-01T00:00:00Z date_updated: 2021-01-12T08:12:24Z day: '01' department: - _id: LaEr doi: 10.1002/cpa.21639 ec_funded: 1 intvolume: ' 70' issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1512.03703 month: '09' oa: 1 oa_version: Submitted Version page: 1672 - 1705 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Communications on Pure and Applied Mathematics publication_identifier: issn: - '00103640' publication_status: published publisher: Wiley-Blackwell publist_id: '6959' quality_controlled: '1' scopus_import: 1 status: public title: Singularities of solutions to quadratic vector equations on the complex upper half plane type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 70 year: '2017' ... --- _id: '722' abstract: - lang: eng text: Plants are sessile organisms rooted in one place. The soil resources that plants require are often distributed in a highly heterogeneous pattern. To aid foraging, plants have evolved roots whose growth and development are highly responsive to soil signals. As a result, 3D root architecture is shaped by myriad environmental signals to ensure resource capture is optimised and unfavourable environments are avoided. The first signals sensed by newly germinating seeds — gravity and light — direct root growth into the soil to aid seedling establishment. Heterogeneous soil resources, such as water, nitrogen and phosphate, also act as signals that shape 3D root growth to optimise uptake. Root architecture is also modified through biotic interactions that include soil fungi and neighbouring plants. This developmental plasticity results in a ‘custom-made’ 3D root system that is best adapted to forage for resources in each soil environment that a plant colonises. author: - first_name: Emily full_name: Morris, Emily last_name: Morris - first_name: Marcus full_name: Griffiths, Marcus last_name: Griffiths - first_name: Agata full_name: Golebiowska, Agata last_name: Golebiowska - first_name: Stefan full_name: Mairhofer, Stefan last_name: Mairhofer - first_name: Jasmine full_name: Burr Hersey, Jasmine last_name: Burr Hersey - first_name: Tatsuaki full_name: Goh, Tatsuaki last_name: Goh - first_name: Daniel full_name: Von Wangenheim, Daniel id: 49E91952-F248-11E8-B48F-1D18A9856A87 last_name: Von Wangenheim orcid: 0000-0002-6862-1247 - first_name: Brian full_name: Atkinson, Brian last_name: Atkinson - first_name: Craig full_name: Sturrock, Craig last_name: Sturrock - first_name: Jonathan full_name: Lynch, Jonathan last_name: Lynch - first_name: Kris full_name: Vissenberg, Kris last_name: Vissenberg - first_name: Karl full_name: Ritz, Karl last_name: Ritz - first_name: Darren full_name: Wells, Darren last_name: Wells - first_name: Sacha full_name: Mooney, Sacha last_name: Mooney - first_name: Malcolm full_name: Bennett, Malcolm last_name: Bennett citation: ama: Morris E, Griffiths M, Golebiowska A, et al. Shaping 3D root system architecture. Current Biology. 2017;27(17):R919-R930. doi:10.1016/j.cub.2017.06.043 apa: Morris, E., Griffiths, M., Golebiowska, A., Mairhofer, S., Burr Hersey, J., Goh, T., … Bennett, M. (2017). Shaping 3D root system architecture. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.06.043 chicago: Morris, Emily, Marcus Griffiths, Agata Golebiowska, Stefan Mairhofer, Jasmine Burr Hersey, Tatsuaki Goh, Daniel von Wangenheim, et al. “Shaping 3D Root System Architecture.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.06.043. ieee: E. Morris et al., “Shaping 3D root system architecture,” Current Biology, vol. 27, no. 17. Cell Press, pp. R919–R930, 2017. ista: Morris E, Griffiths M, Golebiowska A, Mairhofer S, Burr Hersey J, Goh T, von Wangenheim D, Atkinson B, Sturrock C, Lynch J, Vissenberg K, Ritz K, Wells D, Mooney S, Bennett M. 2017. Shaping 3D root system architecture. Current Biology. 27(17), R919–R930. mla: Morris, Emily, et al. “Shaping 3D Root System Architecture.” Current Biology, vol. 27, no. 17, Cell Press, 2017, pp. R919–30, doi:10.1016/j.cub.2017.06.043. short: E. Morris, M. Griffiths, A. Golebiowska, S. Mairhofer, J. Burr Hersey, T. Goh, D. von Wangenheim, B. Atkinson, C. Sturrock, J. Lynch, K. Vissenberg, K. Ritz, D. Wells, S. Mooney, M. Bennett, Current Biology 27 (2017) R919–R930. date_created: 2018-12-11T11:48:08Z date_published: 2017-09-11T00:00:00Z date_updated: 2021-01-12T08:12:29Z day: '11' ddc: - '581' department: - _id: JiFr doi: 10.1016/j.cub.2017.06.043 ec_funded: 1 external_id: pmid: - '28898665' file: - access_level: open_access checksum: e45588b21097b408da6276a3e5eedb2e content_type: application/pdf creator: dernst date_created: 2019-04-17T07:46:40Z date_updated: 2020-07-14T12:47:54Z file_id: '6332' file_name: 2017_CurrentBiology_Morris.pdf file_size: 1576593 relation: main_file file_date_updated: 2020-07-14T12:47:54Z has_accepted_license: '1' intvolume: ' 27' issue: '17' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: R919 - R930 pmid: 1 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Current Biology publication_identifier: issn: - '09609822' publication_status: published publisher: Cell Press publist_id: '6956' pubrep_id: '982' quality_controlled: '1' scopus_import: 1 status: public title: Shaping 3D root system architecture 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2017' ... --- _id: '725' abstract: - lang: eng text: Individual computations and social interactions underlying collective behavior in groups of animals are of great ethological, behavioral, and theoretical interest. While complex individual behaviors have successfully been parsed into small dictionaries of stereotyped behavioral modes, studies of collective behavior largely ignored these findings; instead, their focus was on inferring single, mode-independent social interaction rules that reproduced macroscopic and often qualitative features of group behavior. Here, we bring these two approaches together to predict individual swimming patterns of adult zebrafish in a group. We show that fish alternate between an “active” mode, in which they are sensitive to the swimming patterns of conspecifics, and a “passive” mode, where they ignore them. Using a model that accounts for these two modes explicitly, we predict behaviors of individual fish with high accuracy, outperforming previous approaches that assumed a single continuous computation by individuals and simple metric or topological weighing of neighbors’ behavior. At the group level, switching between active and passive modes is uncorrelated among fish, but correlated directional swimming behavior still emerges. Our quantitative approach for studying complex, multi-modal individual behavior jointly with emergent group behavior is readily extensible to additional behavioral modes and their neural correlates as well as to other species. author: - first_name: Roy full_name: Harpaz, Roy last_name: Harpaz - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Elad full_name: Schneidman, Elad last_name: Schneidman citation: ama: Harpaz R, Tkačik G, Schneidman E. Discrete modes of social information processing predict individual behavior of fish in a group. PNAS. 2017;114(38):10149-10154. doi:10.1073/pnas.1703817114 apa: Harpaz, R., Tkačik, G., & Schneidman, E. (2017). Discrete modes of social information processing predict individual behavior of fish in a group. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1703817114 chicago: Harpaz, Roy, Gašper Tkačik, and Elad Schneidman. “Discrete Modes of Social Information Processing Predict Individual Behavior of Fish in a Group.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1703817114. ieee: R. Harpaz, G. Tkačik, and E. Schneidman, “Discrete modes of social information processing predict individual behavior of fish in a group,” PNAS, vol. 114, no. 38. National Academy of Sciences, pp. 10149–10154, 2017. ista: Harpaz R, Tkačik G, Schneidman E. 2017. Discrete modes of social information processing predict individual behavior of fish in a group. PNAS. 114(38), 10149–10154. mla: Harpaz, Roy, et al. “Discrete Modes of Social Information Processing Predict Individual Behavior of Fish in a Group.” PNAS, vol. 114, no. 38, National Academy of Sciences, 2017, pp. 10149–54, doi:10.1073/pnas.1703817114. short: R. Harpaz, G. Tkačik, E. Schneidman, PNAS 114 (2017) 10149–10154. date_created: 2018-12-11T11:48:10Z date_published: 2017-09-19T00:00:00Z date_updated: 2021-01-12T08:12:36Z day: '19' department: - _id: GaTk doi: 10.1073/pnas.1703817114 external_id: pmid: - '28874581' intvolume: ' 114' issue: '38' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5617265/ month: '09' oa: 1 oa_version: Submitted Version page: 10149 - 10154 pmid: 1 publication: PNAS publication_identifier: issn: - '00278424' publication_status: published publisher: National Academy of Sciences publist_id: '6953' quality_controlled: '1' scopus_import: 1 status: public title: Discrete modes of social information processing predict individual behavior of fish in a group type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 114 year: '2017' ... --- _id: '724' abstract: - lang: eng text: We investigate the stationary and dynamical behavior of an Anderson localized chain coupled to a single central bound state. Although this coupling partially dilutes the Anderson localized peaks towards nearly resonant sites, the most weight of the original peaks remains unchanged. This leads to multifractal wave functions with a frozen spectrum of fractal dimensions, which is characteristic for localized phases in models with power-law hopping. Using a perturbative approach we identify two different dynamical regimes. At weak couplings to the central site, the transport of particles and information is logarithmic in time, a feature usually attributed to many-body localization. We connect such transport to the persistence of the Poisson statistics of level spacings in parts of the spectrum. In contrast, at stronger couplings the level repulsion is established in the entire spectrum, the problem can be mapped to the Fano resonance, and the transport is ballistic. acknowledgement: "We would like to thank Dmitry Abanin, Christophe De\r\nBeule, \ Joel Moore, Romain Vasseur, and Norman Yao for\r\nmany stimulating discussions. \ Financial support has been\r\nprovided by the Deutsche Forschungsgemeinschaft \ (DFG)\r\nvia Grant No. TR950/8-1, SFB 1170 “ToCoTronics” and the\r\nENB Graduate \ School on Topological Insulators. M.S. was\r\nsupported by Gordon and Betty Moore Foundation’s EPiQS\r\nInitiative through Grant No. GBMF4307. F.P. acknowledges\r\nsupport from the DFG Research Unit FOR 1807 through Grant\r\nNo. PO 1370/2-1." article_number: '104203' author: - first_name: Daniel full_name: Hetterich, Daniel last_name: Hetterich - first_name: Maksym full_name: Serbyn, Maksym id: 47809E7E-F248-11E8-B48F-1D18A9856A87 last_name: Serbyn orcid: 0000-0002-2399-5827 - first_name: Fernando full_name: Domínguez, Fernando last_name: Domínguez - first_name: Frank full_name: Pollmann, Frank last_name: Pollmann - first_name: Björn full_name: Trauzettel, Björn last_name: Trauzettel citation: ama: Hetterich D, Serbyn M, Domínguez F, Pollmann F, Trauzettel B. Noninteracting central site model localization and logarithmic entanglement growth. Physical Review B. 2017;96(10). doi:10.1103/PhysRevB.96.104203 apa: Hetterich, D., Serbyn, M., Domínguez, F., Pollmann, F., & Trauzettel, B. (2017). Noninteracting central site model localization and logarithmic entanglement growth. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.96.104203 chicago: Hetterich, Daniel, Maksym Serbyn, Fernando Domínguez, Frank Pollmann, and Björn Trauzettel. “Noninteracting Central Site Model Localization and Logarithmic Entanglement Growth.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.104203. ieee: D. Hetterich, M. Serbyn, F. Domínguez, F. Pollmann, and B. Trauzettel, “Noninteracting central site model localization and logarithmic entanglement growth,” Physical Review B, vol. 96, no. 10. American Physical Society, 2017. ista: Hetterich D, Serbyn M, Domínguez F, Pollmann F, Trauzettel B. 2017. Noninteracting central site model localization and logarithmic entanglement growth. Physical Review B. 96(10), 104203. mla: Hetterich, Daniel, et al. “Noninteracting Central Site Model Localization and Logarithmic Entanglement Growth.” Physical Review B, vol. 96, no. 10, 104203, American Physical Society, 2017, doi:10.1103/PhysRevB.96.104203. short: D. Hetterich, M. Serbyn, F. Domínguez, F. Pollmann, B. Trauzettel, Physical Review B 96 (2017). date_created: 2018-12-11T11:48:09Z date_published: 2017-09-13T00:00:00Z date_updated: 2021-01-12T08:12:35Z day: '13' department: - _id: MaSe doi: 10.1103/PhysRevB.96.104203 intvolume: ' 96' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1701.02744 month: '09' oa: 1 oa_version: Submitted Version publication: Physical Review B publication_identifier: issn: - '24699950' publication_status: published publisher: American Physical Society publist_id: '6955' quality_controlled: '1' scopus_import: 1 status: public title: Noninteracting central site model localization and logarithmic entanglement growth type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 96 year: '2017' ... --- _id: '731' abstract: - lang: eng text: Genetic variations in the oxytocin receptor gene affect patients with ASD and ADHD differently. article_number: eaap8168 author: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: Novarino G. The science of love in ASD and ADHD. Science Translational Medicine. 2017;9(411). doi:10.1126/scitranslmed.aap8168 apa: Novarino, G. (2017). The science of love in ASD and ADHD. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aap8168 chicago: Novarino, Gaia. “The Science of Love in ASD and ADHD.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aap8168. ieee: G. Novarino, “The science of love in ASD and ADHD,” Science Translational Medicine, vol. 9, no. 411. American Association for the Advancement of Science, 2017. ista: Novarino G. 2017. The science of love in ASD and ADHD. Science Translational Medicine. 9(411), eaap8168. mla: Novarino, Gaia. “The Science of Love in ASD and ADHD.” Science Translational Medicine, vol. 9, no. 411, eaap8168, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aap8168. short: G. Novarino, Science Translational Medicine 9 (2017). date_created: 2018-12-11T11:48:12Z date_published: 2017-10-11T00:00:00Z date_updated: 2021-01-12T08:12:57Z day: '11' department: - _id: GaNo doi: 10.1126/scitranslmed.aap8168 intvolume: ' 9' issue: '411' language: - iso: eng month: '10' oa_version: None publication: Science Translational Medicine publication_identifier: issn: - '19466234' publication_status: published publisher: American Association for the Advancement of Science publist_id: '6938' quality_controlled: '1' scopus_import: 1 status: public title: The science of love in ASD and ADHD type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2017' ... --- _id: '7360' abstract: - lang: eng text: Inflammation, which is a highly regulated host response against danger signals, may be harmful if it is excessive and deregulated. Ideally, anti-inflammatory therapy should autonomously commence as soon as possible after the onset of inflammation, should be controllable by a physician, and should not systemically block beneficial immune response in the long term. We describe a genetically encoded anti-inflammatory mammalian cell device based on a modular engineered genetic circuit comprising a sensor, an amplifier, a “thresholder” to restrict activation of a positive-feedback loop, a combination of advanced clinically used biopharmaceutical proteins, and orthogonal regulatory elements that linked modules into the functional device. This genetic circuit was autonomously activated by inflammatory signals, including endogenous cecal ligation and puncture (CLP)-induced inflammation in mice and serum from a systemic juvenile idiopathic arthritis (sIJA) patient, and could be reset externally by a chemical signal. The microencapsulated anti-inflammatory device significantly reduced the pathology in dextran sodium sulfate (DSS)-induced acute murine colitis, demonstrating a synthetic immunological approach for autonomous anti-inflammatory therapy. article_processing_charge: No article_type: original author: - first_name: Anže full_name: Smole, Anže last_name: Smole - first_name: Duško full_name: Lainšček, Duško last_name: Lainšček - first_name: Urban full_name: Bezeljak, Urban id: 2A58201A-F248-11E8-B48F-1D18A9856A87 last_name: Bezeljak orcid: 0000-0003-1365-5631 - first_name: Simon full_name: Horvat, Simon last_name: Horvat - first_name: Roman full_name: Jerala, Roman last_name: Jerala citation: ama: Smole A, Lainšček D, Bezeljak U, Horvat S, Jerala R. A synthetic mammalian therapeutic gene circuit for sensing and suppressing inflammation. Molecular Therapy. 2017;25(1):102-119. doi:10.1016/j.ymthe.2016.10.005 apa: Smole, A., Lainšček, D., Bezeljak, U., Horvat, S., & Jerala, R. (2017). A synthetic mammalian therapeutic gene circuit for sensing and suppressing inflammation. Molecular Therapy. Elsevier. https://doi.org/10.1016/j.ymthe.2016.10.005 chicago: Smole, Anže, Duško Lainšček, Urban Bezeljak, Simon Horvat, and Roman Jerala. “A Synthetic Mammalian Therapeutic Gene Circuit for Sensing and Suppressing Inflammation.” Molecular Therapy. Elsevier, 2017. https://doi.org/10.1016/j.ymthe.2016.10.005. ieee: A. Smole, D. Lainšček, U. Bezeljak, S. Horvat, and R. Jerala, “A synthetic mammalian therapeutic gene circuit for sensing and suppressing inflammation,” Molecular Therapy, vol. 25, no. 1. Elsevier, pp. 102–119, 2017. ista: Smole A, Lainšček D, Bezeljak U, Horvat S, Jerala R. 2017. A synthetic mammalian therapeutic gene circuit for sensing and suppressing inflammation. Molecular Therapy. 25(1), 102–119. mla: Smole, Anže, et al. “A Synthetic Mammalian Therapeutic Gene Circuit for Sensing and Suppressing Inflammation.” Molecular Therapy, vol. 25, no. 1, Elsevier, 2017, pp. 102–19, doi:10.1016/j.ymthe.2016.10.005. short: A. Smole, D. Lainšček, U. Bezeljak, S. Horvat, R. Jerala, Molecular Therapy 25 (2017) 102–119. date_created: 2020-01-25T15:55:39Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:13:14Z day: '01' ddc: - '570' department: - _id: MaLo doi: 10.1016/j.ymthe.2016.10.005 external_id: pmid: - '28129106' file: - access_level: open_access checksum: ea8b1b28606dd1edab7379ba4fa3641f content_type: application/pdf creator: dernst date_created: 2020-03-03T10:55:13Z date_updated: 2020-07-14T12:47:56Z file_id: '7561' file_name: 2017_MolecularTherapy_Smole.pdf file_size: 3404806 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 25' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 102-119 pmid: 1 publication: Molecular Therapy publication_identifier: issn: - 1525-0016 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: A synthetic mammalian therapeutic gene circuit for sensing and suppressing inflammation 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 25 year: '2017' ... --- _id: '750' abstract: - lang: eng text: Modern communication technologies allow first responders to contact thousands of potential volunteers simultaneously for support during a crisis or disaster event. However, such volunteer efforts must be well coordinated and monitored, in order to offer an effective relief to the professionals. In this paper we extend earlier work on optimally assigning volunteers to selected landmark locations. In particular, we emphasize the aspect that obtaining good assignments requires not only advanced computational tools, but also a realistic measure of distance between volunteers and landmarks. Specifically, we propose the use of the Open Street Map (OSM) driving distance instead of he previously used flight distance. We find the OSM driving distance to be better aligned with the interests of volunteers and first responders. Furthermore, we show that relying on the flying distance leads to a substantial underestimation of the number of required volunteers, causing negative side effects in case of an actual crisis situation. author: - first_name: Jasmin full_name: Pielorz, Jasmin id: 49BC895A-F248-11E8-B48F-1D18A9856A87 last_name: Pielorz - first_name: Matthias full_name: Prandtstetter, Matthias last_name: Prandtstetter - first_name: Markus full_name: Straub, Markus last_name: Straub - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Pielorz J, Prandtstetter M, Straub M, Lampert C. Optimal geospatial volunteer allocation needs realistic distances. In: 2017 IEEE International Conference on Big Data. IEEE; 2017:3760-3763. doi:10.1109/BigData.2017.8258375' apa: 'Pielorz, J., Prandtstetter, M., Straub, M., & Lampert, C. (2017). Optimal geospatial volunteer allocation needs realistic distances. In 2017 IEEE International Conference on Big Data (pp. 3760–3763). Boston, MA, United States: IEEE. https://doi.org/10.1109/BigData.2017.8258375' chicago: Pielorz, Jasmin, Matthias Prandtstetter, Markus Straub, and Christoph Lampert. “Optimal Geospatial Volunteer Allocation Needs Realistic Distances.” In 2017 IEEE International Conference on Big Data, 3760–63. IEEE, 2017. https://doi.org/10.1109/BigData.2017.8258375. ieee: J. Pielorz, M. Prandtstetter, M. Straub, and C. Lampert, “Optimal geospatial volunteer allocation needs realistic distances,” in 2017 IEEE International Conference on Big Data, Boston, MA, United States, 2017, pp. 3760–3763. ista: Pielorz J, Prandtstetter M, Straub M, Lampert C. 2017. Optimal geospatial volunteer allocation needs realistic distances. 2017 IEEE International Conference on Big Data. Big Data, 3760–3763. mla: Pielorz, Jasmin, et al. “Optimal Geospatial Volunteer Allocation Needs Realistic Distances.” 2017 IEEE International Conference on Big Data, IEEE, 2017, pp. 3760–63, doi:10.1109/BigData.2017.8258375. short: J. Pielorz, M. Prandtstetter, M. Straub, C. Lampert, in:, 2017 IEEE International Conference on Big Data, IEEE, 2017, pp. 3760–3763. conference: end_date: 2017-12-14 location: Boston, MA, United States name: Big Data start_date: 2017-12-11 date_created: 2018-12-11T11:48:18Z date_published: 2017-12-01T00:00:00Z date_updated: 2021-01-12T08:13:55Z day: '01' department: - _id: ChLa doi: 10.1109/BigData.2017.8258375 language: - iso: eng month: '12' oa_version: None page: 3760 - 3763 publication: 2017 IEEE International Conference on Big Data publication_identifier: isbn: - 978-153862714-3 publication_status: published publisher: IEEE publist_id: '6906' quality_controlled: '1' scopus_import: 1 status: public title: Optimal geospatial volunteer allocation needs realistic distances type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '795' abstract: - lang: eng text: 'We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.' article_number: P3.18 article_processing_charge: No article_type: original author: - first_name: Radoslav full_name: Fulek, Radoslav id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87 last_name: Fulek orcid: 0000-0001-8485-1774 - first_name: Jan full_name: Kynčl, Jan last_name: Kynčl - first_name: Dömötör full_name: Pálvölgyi, Dömötör last_name: Pálvölgyi citation: ama: Fulek R, Kynčl J, Pálvölgyi D. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 2017;24(3). doi:10.37236/6663 apa: Fulek, R., Kynčl, J., & Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. International Press. https://doi.org/10.37236/6663 chicago: Fulek, Radoslav, Jan Kynčl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.” Electronic Journal of Combinatorics. International Press, 2017. https://doi.org/10.37236/6663. ieee: R. Fulek, J. Kynčl, and D. Pálvölgyi, “Unified Hanani Tutte theorem,” Electronic Journal of Combinatorics, vol. 24, no. 3. International Press, 2017. ista: Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), P3.18. mla: Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.” Electronic Journal of Combinatorics, vol. 24, no. 3, P3.18, International Press, 2017, doi:10.37236/6663. short: R. Fulek, J. Kynčl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017). date_created: 2018-12-11T11:48:32Z date_published: 2017-07-28T00:00:00Z date_updated: 2022-03-18T12:58:53Z day: '28' ddc: - '000' department: - _id: UlWa doi: 10.37236/6663 ec_funded: 1 file: - access_level: open_access checksum: ef320cff0f062051e858f929be6a3581 content_type: application/pdf creator: dernst date_created: 2019-01-18T14:04:08Z date_updated: 2020-07-14T12:48:06Z file_id: '5853' file_name: 2017_ElectrCombi_Fulek.pdf file_size: 236944 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 24' issue: '3' language: - iso: eng month: '07' 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: Electronic Journal of Combinatorics publication_identifier: issn: - '10778926' publication_status: published publisher: International Press publist_id: '6859' quality_controlled: '1' scopus_import: '1' status: public title: Unified Hanani Tutte theorem type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2017' ... --- _id: '797' abstract: - lang: ger text: Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten [1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung von undurchsichtig zu transparent nachgewiesen werden. article_processing_charge: No article_type: original author: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: Fink JM. Photonenblockade aufgelöst. Physik in unserer Zeit. 2017;48(3):111-113. doi:10.1002/piuz.201770305 apa: Fink, J. M. (2017). Photonenblockade aufgelöst. Physik in Unserer Zeit. Wiley. https://doi.org/10.1002/piuz.201770305 chicago: Fink, Johannes M. “Photonenblockade Aufgelöst.” Physik in Unserer Zeit. Wiley, 2017. https://doi.org/10.1002/piuz.201770305. ieee: J. M. Fink, “Photonenblockade aufgelöst,” Physik in unserer Zeit, vol. 48, no. 3. Wiley, pp. 111–113, 2017. ista: Fink JM. 2017. Photonenblockade aufgelöst. Physik in unserer Zeit. 48(3), 111–113. mla: Fink, Johannes M. “Photonenblockade Aufgelöst.” Physik in Unserer Zeit, vol. 48, no. 3, Wiley, 2017, pp. 111–13, doi:10.1002/piuz.201770305. short: J.M. Fink, Physik in Unserer Zeit 48 (2017) 111–113. date_created: 2018-12-11T11:48:33Z date_published: 2017-05-01T00:00:00Z date_updated: 2022-03-24T09:16:20Z day: '01' department: - _id: JoFi doi: 10.1002/piuz.201770305 intvolume: ' 48' issue: '3' language: - iso: eng month: '05' oa_version: None page: 111 - 113 publication: Physik in unserer Zeit publication_status: published publisher: Wiley publist_id: '6856' quality_controlled: '1' status: public title: Photonenblockade aufgelöst type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2017' ... --- _id: '807' abstract: - lang: eng text: 'On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries and the publisher Springer took its effect: this deal covers accessing the licensed content on the one hand, and publishing open access on the other hand. More than 1000 papers by Austrian authors were published open access at Springer in the first year alone. The working group "Springer Compact Evaluierung" made the data for these articles available via the platform OpenAPC and would like to use this opportunity to give a short account of what this publishing agreement actually entails and the working group intends to do.' author: - first_name: Magdalena full_name: Andrae, Magdalena last_name: Andrae - first_name: Márton full_name: Villányi, Márton id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87 last_name: Villányi orcid: 0000-0001-8126-0426 citation: ama: Andrae M, Villányi M. Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2017;70(2):274-280. doi:10.31263/voebm.v70i2.1898 apa: Andrae, M., & Villányi, M. (2017). Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. VÖB. https://doi.org/10.31263/voebm.v70i2.1898 chicago: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. VÖB, 2017. https://doi.org/10.31263/voebm.v70i2.1898. ieee: M. Andrae and M. Villányi, “Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 70, no. 2. VÖB, pp. 274–280, 2017. ista: Andrae M, Villányi M. 2017. Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 70(2), 274–280. mla: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare, vol. 70, no. 2, VÖB, 2017, pp. 274–80, doi:10.31263/voebm.v70i2.1898. short: M. Andrae, M. Villányi, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 70 (2017) 274–280. date_created: 2018-12-11T11:48:36Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:16:45Z day: '01' ddc: - '020' department: - _id: E-Lib doi: 10.31263/voebm.v70i2.1898 file: - access_level: open_access checksum: 558c18bcf5580d87dd371ec626d52075 content_type: application/pdf creator: dernst date_created: 2019-01-18T13:39:26Z date_updated: 2020-07-14T12:48:09Z file_id: '5851' file_name: 2017_VOEB_Andrae.pdf file_size: 125065 relation: main_file file_date_updated: 2020-07-14T12:48:09Z has_accepted_license: '1' intvolume: ' 70' issue: '2' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 274 - 280 popular_science: '1' publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare publication_identifier: issn: - '10222588' publication_status: published publisher: VÖB publist_id: '6843' scopus_import: 1 status: public title: Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung 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: 70 year: '2017' ... --- _id: '825' abstract: - lang: eng text: What data is needed about data? Describing the process to answer this question for the institutional data repository IST DataRep. author: - first_name: Barbara full_name: Petritsch, Barbara id: 406048EC-F248-11E8-B48F-1D18A9856A87 last_name: Petritsch orcid: 0000-0003-2724-4614 citation: ama: Petritsch B. Metadata for research data in practice. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 2017;70(2):200-207. doi:10.31263/voebm.v70i2.1678 apa: Petritsch, B. (2017). Metadata for research data in practice. Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB. https://doi.org/10.31263/voebm.v70i2.1678 chicago: Petritsch, Barbara. “Metadata for Research Data in Practice.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB, 2017. https://doi.org/10.31263/voebm.v70i2.1678. ieee: B. Petritsch, “Metadata for research data in practice,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 70, no. 2. VÖB, pp. 200–207, 2017. ista: Petritsch B. 2017. Metadata for research data in practice. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 70(2), 200–207. mla: Petritsch, Barbara. “Metadata for Research Data in Practice.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 70, no. 2, VÖB, 2017, pp. 200–07, doi:10.31263/voebm.v70i2.1678. short: B. Petritsch, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare 70 (2017) 200–207. date_created: 2018-12-11T11:48:42Z date_published: 2017-08-01T00:00:00Z date_updated: 2021-01-12T08:17:44Z day: '01' ddc: - '020' department: - _id: E-Lib doi: 10.31263/voebm.v70i2.1678 file: - access_level: open_access checksum: 7c4544d07efa2c2add8612b489abb4e2 content_type: application/pdf creator: dernst date_created: 2019-01-18T13:32:17Z date_updated: 2020-07-14T12:48:11Z file_id: '5850' file_name: 2017_VOEB_Petritsch.pdf file_size: 7843975 relation: main_file file_date_updated: 2020-07-14T12:48:11Z has_accepted_license: '1' intvolume: ' 70' issue: '2' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 200 - 207 publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare publication_identifier: issn: - '10222588' publication_status: published publisher: VÖB publist_id: '6823' scopus_import: 1 status: public title: Metadata for research data in practice tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 70 year: '2017' ... --- _id: '957' abstract: - lang: eng text: Small molecule biosensors based on Forster resonance energy transfer (FRET) enable small molecule signaling to be monitored with high spatial and temporal resolution in complex cellular environments. FRET sensors can be constructed by fusing a pair of fluorescent proteins to a suitable recognition domain, such as a member of the solute-binding protein (SBP) superfamily. However, naturally occurring SBPs may be unsuitable for incorporation into FRET sensors due to their low thermostability, which may preclude imaging under physiological conditions, or because the positions of their N- and C-termini may be suboptimal for fusion of fluorescent proteins, which may limit the dynamic range of the resulting sensors. Here, we show how these problems can be overcome using ancestral protein reconstruction and circular permutation. Ancestral protein reconstruction, used as a protein engineering strategy, leverages phylogenetic information to improve the thermostability of proteins, while circular permutation enables the termini of an SBP to be repositioned to maximize the dynamic range of the resulting FRET sensor. We also provide a protocol for cloning the engineered SBPs into FRET sensor constructs using Golden Gate assembly and discuss considerations for in situ characterization of the FRET sensors. alternative_title: - Methods in Molecular Biology author: - first_name: Ben full_name: Clifton, Ben last_name: Clifton - first_name: Jason full_name: Whitfield, Jason last_name: Whitfield - first_name: Inmaculada full_name: Sanchez Romero, Inmaculada id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87 last_name: Sanchez Romero - first_name: Michel full_name: Herde, Michel last_name: Herde - first_name: Christian full_name: Henneberger, Christian last_name: Henneberger - first_name: Harald L full_name: Janovjak, Harald L id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 - first_name: Colin full_name: Jackson, Colin last_name: Jackson citation: ama: 'Clifton B, Whitfield J, Sanchez-Romero I, et al. Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors. In: Stein V, ed. Synthetic Protein Switches. Vol 1596. Synthetic Protein Switches. Springer; 2017:71-87. doi:10.1007/978-1-4939-6940-1_5' apa: Clifton, B., Whitfield, J., Sanchez-Romero, I., Herde, M., Henneberger, C., Janovjak, H. L., & Jackson, C. (2017). Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors. In V. Stein (Ed.), Synthetic Protein Switches (Vol. 1596, pp. 71–87). Springer. https://doi.org/10.1007/978-1-4939-6940-1_5 chicago: Clifton, Ben, Jason Whitfield, Inmaculada Sanchez-Romero, Michel Herde, Christian Henneberger, Harald L Janovjak, and Colin Jackson. “Ancestral Protein Reconstruction and Circular Permutation for Improving the Stability and Dynamic Range of FRET Sensors.” In Synthetic Protein Switches, edited by Viktor Stein, 1596:71–87. Synthetic Protein Switches. Springer, 2017. https://doi.org/10.1007/978-1-4939-6940-1_5. ieee: B. Clifton et al., “Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors,” in Synthetic Protein Switches, vol. 1596, V. Stein, Ed. Springer, 2017, pp. 71–87. ista: 'Clifton B, Whitfield J, Sanchez-Romero I, Herde M, Henneberger C, Janovjak HL, Jackson C. 2017.Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors. In: Synthetic Protein Switches. Methods in Molecular Biology, vol. 1596, 71–87.' mla: Clifton, Ben, et al. “Ancestral Protein Reconstruction and Circular Permutation for Improving the Stability and Dynamic Range of FRET Sensors.” Synthetic Protein Switches, edited by Viktor Stein, vol. 1596, Springer, 2017, pp. 71–87, doi:10.1007/978-1-4939-6940-1_5. short: B. Clifton, J. Whitfield, I. Sanchez-Romero, M. Herde, C. Henneberger, H.L. Janovjak, C. Jackson, in:, V. Stein (Ed.), Synthetic Protein Switches, Springer, 2017, pp. 71–87. date_created: 2018-12-11T11:49:24Z date_published: 2017-03-15T00:00:00Z date_updated: 2021-01-12T08:22:13Z day: '15' department: - _id: HaJa doi: 10.1007/978-1-4939-6940-1_5 editor: - first_name: Viktor full_name: Stein, Viktor last_name: Stein intvolume: ' 1596' language: - iso: eng month: '03' oa_version: None page: 71 - 87 project: - _id: 255BFFFA-B435-11E9-9278-68D0E5697425 grant_number: RGY0084/2012 name: In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator) publication: Synthetic Protein Switches publication_identifier: issn: - '10643745' publication_status: published publisher: Springer publist_id: '6451' quality_controlled: '1' scopus_import: 1 series_title: Synthetic Protein Switches status: public title: Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors type: book_chapter user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 1596 year: '2017' ... --- _id: '963' abstract: - lang: eng text: 'Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. ' alternative_title: - LIPIcs article_number: '37' author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Shibashis full_name: Guha, Shibashis last_name: Guha - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37' apa: 'Avni, G., Guha, S., & Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37' chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.37. ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark, 2017, vol. 83.' ista: 'Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 37.' mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37. short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-08-25 location: Aalborg, Denmark name: 'MFCS: Mathematical Foundations of Computer Science (SG)' start_date: 2017-08-21 date_created: 2018-12-11T11:49:26Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-02-23T12:35:50Z day: '01' ddc: - '004' department: - _id: ToHe doi: 10.4230/LIPIcs.MFCS.2017.37 file: - access_level: open_access checksum: f55eaf7f3c36ea07801112acfedd17d5 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:10Z date_updated: 2020-07-14T12:48:18Z file_id: '5059' file_name: IST-2017-829-v1+1_mfcs-cr.pdf file_size: 369730 relation: main_file file_date_updated: 2020-07-14T12:48:18Z has_accepted_license: '1' intvolume: ' 83' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication_identifier: issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '6438' pubrep_id: '829' quality_controlled: '1' related_material: record: - id: '6005' relation: later_version status: public scopus_import: 1 status: public title: Timed network games with clocks 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 83 year: '2017' ... --- _id: '9709' abstract: - lang: eng text: Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina. article_processing_charge: No author: - first_name: Jason full_name: Prentice, Jason last_name: Prentice - first_name: Olivier full_name: Marre, Olivier last_name: Marre - first_name: Mark full_name: Ioffe, Mark last_name: Ioffe - first_name: Adrianna full_name: Loback, Adrianna last_name: Loback - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: 0000-0002-6699-1455 - first_name: Michael full_name: Berry, Michael last_name: Berry citation: ama: 'Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Data from: Error-robust modes of the retinal population code. 2017. doi:10.5061/dryad.1f1rc' apa: 'Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., & Berry, M. (2017). Data from: Error-robust modes of the retinal population code. Dryad. https://doi.org/10.5061/dryad.1f1rc' chicago: 'Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Data from: Error-Robust Modes of the Retinal Population Code.” Dryad, 2017. https://doi.org/10.5061/dryad.1f1rc.' ieee: 'J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Data from: Error-robust modes of the retinal population code.” Dryad, 2017.' ista: 'Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2017. Data from: Error-robust modes of the retinal population code, Dryad, 10.5061/dryad.1f1rc.' mla: 'Prentice, Jason, et al. Data from: Error-Robust Modes of the Retinal Population Code. Dryad, 2017, doi:10.5061/dryad.1f1rc.' short: J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, (2017). date_created: 2021-07-23T11:34:34Z date_published: 2017-10-18T00:00:00Z date_updated: 2023-02-21T16:34:41Z day: '18' department: - _id: GaTk doi: 10.5061/dryad.1f1rc main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.1f1rc month: '10' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '1197' relation: used_in_publication status: public status: public title: 'Data from: Error-robust modes of the retinal population code' type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '541' abstract: - lang: eng text: 'While we have good understanding of bacterial metabolism at the population level, we know little about the metabolic behavior of individual cells: do single cells in clonal populations sometimes specialize on different metabolic pathways? Such metabolic specialization could be driven by stochastic gene expression and could provide individual cells with growth benefits of specialization. We measured the degree of phenotypic specialization in two parallel metabolic pathways, the assimilation of glucose and arabinose. We grew Escherichia coli in chemostats, and used isotope-labeled sugars in combination with nanometer-scale secondary ion mass spectrometry and mathematical modeling to quantify sugar assimilation at the single-cell level. We found large variation in metabolic activities between single cells, both in absolute assimilation and in the degree to which individual cells specialize in the assimilation of different sugars. Analysis of transcriptional reporters indicated that this variation was at least partially based on cell-to-cell variation in gene expression. Metabolic differences between cells in clonal populations could potentially reduce metabolic incompatibilities between different pathways, and increase the rate at which parallel reactions can be performed.' article_number: e1007122 author: - first_name: Nela full_name: Nikolic, Nela id: 42D9CABC-F248-11E8-B48F-1D18A9856A87 last_name: Nikolic orcid: 0000-0001-9068-6090 - first_name: Frank full_name: Schreiber, Frank last_name: Schreiber - first_name: Alma full_name: Dal Co, Alma last_name: Dal Co - first_name: Daniel full_name: Kiviet, Daniel last_name: Kiviet - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Sten full_name: Littmann, Sten last_name: Littmann - first_name: Marcel full_name: Kuypers, Marcel last_name: Kuypers - first_name: Martin full_name: Ackermann, Martin last_name: Ackermann citation: ama: Nikolic N, Schreiber F, Dal Co A, et al. Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations. PLoS Genetics. 2017;13(12). doi:10.1371/journal.pgen.1007122 apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007122 chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Cell-to-Cell Variation and Specialization in Sugar Metabolism in Clonal Bacterial Populations.” PLoS Genetics. Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122. ieee: N. Nikolic et al., “Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations,” PLoS Genetics, vol. 13, no. 12. Public Library of Science, 2017. ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations. PLoS Genetics. 13(12), e1007122. mla: Nikolic, Nela, et al. “Cell-to-Cell Variation and Specialization in Sugar Metabolism in Clonal Bacterial Populations.” PLoS Genetics, vol. 13, no. 12, e1007122, Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122. short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, PLoS Genetics 13 (2017). date_created: 2018-12-11T11:47:04Z date_published: 2017-12-18T00:00:00Z date_updated: 2023-02-23T14:10:34Z day: '18' ddc: - '576' - '579' department: - _id: CaGu doi: 10.1371/journal.pgen.1007122 ec_funded: 1 file: - access_level: open_access checksum: 22426d9382f21554bad5fa5967afcfd0 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:35Z date_updated: 2020-07-14T12:46:46Z file_id: '5088' file_name: IST-2018-959-v1+1_2017_Nikolic_Cell-to-cell.pdf file_size: 1308475 relation: main_file file_date_updated: 2020-07-14T12:46:46Z has_accepted_license: '1' intvolume: ' 13' issue: '12' language: - iso: eng month: '12' 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: PLoS Genetics publication_identifier: issn: - '15537390' publication_status: published publisher: Public Library of Science publist_id: '7275' pubrep_id: '959' quality_controlled: '1' related_material: record: - id: '9844' relation: research_data status: public - id: '9845' relation: research_data status: public - id: '9846' relation: research_data status: public scopus_import: 1 status: public title: Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '9847' abstract: - lang: eng text: information on culture conditions, phage mutagenesis, verification and lysate preparation; Raw data article_processing_charge: No author: - first_name: Maros full_name: Pleska, Maros id: 4569785E-F248-11E8-B48F-1D18A9856A87 last_name: Pleska orcid: 0000-0001-7460-7479 - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 citation: ama: Pleska M, Guet CC. Supplementary materials and methods; Full data set from effects of mutations in phage restriction sites during escape from restriction–modification. 2017. doi:10.6084/m9.figshare.5633917.v1 apa: Pleska, M., & Guet, C. C. (2017). Supplementary materials and methods; Full data set from effects of mutations in phage restriction sites during escape from restriction–modification. The Royal Society. https://doi.org/10.6084/m9.figshare.5633917.v1 chicago: Pleska, Maros, and Calin C Guet. “Supplementary Materials and Methods; Full Data Set from Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” The Royal Society, 2017. https://doi.org/10.6084/m9.figshare.5633917.v1. ieee: M. Pleska and C. C. Guet, “Supplementary materials and methods; Full data set from effects of mutations in phage restriction sites during escape from restriction–modification.” The Royal Society, 2017. ista: Pleska M, Guet CC. 2017. Supplementary materials and methods; Full data set from effects of mutations in phage restriction sites during escape from restriction–modification, The Royal Society, 10.6084/m9.figshare.5633917.v1. mla: Pleska, Maros, and Calin C. Guet. Supplementary Materials and Methods; Full Data Set from Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification. The Royal Society, 2017, doi:10.6084/m9.figshare.5633917.v1. short: M. Pleska, C.C. Guet, (2017). date_created: 2021-08-09T13:54:38Z date_published: 2017-11-27T00:00:00Z date_updated: 2023-02-23T12:29:44Z day: '27' department: - _id: CaGu doi: 10.6084/m9.figshare.5633917.v1 main_file_link: - open_access: '1' url: https://doi.org/10.6084/m9.figshare.5633917.v1 month: '11' oa: 1 oa_version: Published Version publisher: The Royal Society related_material: record: - id: '561' relation: used_in_publication status: public status: public title: Supplementary materials and methods; Full data set from effects of mutations in phage restriction sites during escape from restriction–modification type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9845' abstract: - lang: eng text: "Estimates of 13 C-arabinose and 2 H-glucose uptake from the fractions of heavy isotopes measured\tin single cells" article_processing_charge: No author: - first_name: Nela full_name: Nikolic, Nela id: 42D9CABC-F248-11E8-B48F-1D18A9856A87 last_name: Nikolic orcid: 0000-0001-9068-6090 - first_name: Frank full_name: Schreiber, Frank last_name: Schreiber - first_name: Alma full_name: Dal Co, Alma last_name: Dal Co - first_name: Daniel full_name: Kiviet, Daniel last_name: Kiviet - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Sten full_name: Littmann, Sten last_name: Littmann - first_name: Marcel full_name: Kuypers, Marcel last_name: Kuypers - first_name: Martin full_name: Ackermann, Martin last_name: Ackermann citation: ama: Nikolic N, Schreiber F, Dal Co A, et al. Mathematical model. 2017. doi:10.1371/journal.pgen.1007122.s017 apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Mathematical model. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007122.s017 chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Mathematical Model.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s017. ieee: N. Nikolic et al., “Mathematical model.” Public Library of Science, 2017. ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Mathematical model, Public Library of Science, 10.1371/journal.pgen.1007122.s017. mla: Nikolic, Nela, et al. Mathematical Model. Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122.s017. short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, (2017). date_created: 2021-08-09T13:31:51Z date_published: 2017-12-18T00:00:00Z date_updated: 2023-02-23T12:25:04Z day: '18' department: - _id: CaGu doi: 10.1371/journal.pgen.1007122.s017 month: '12' oa_version: None publisher: Public Library of Science related_material: record: - id: '541' relation: used_in_publication status: public status: public title: Mathematical model type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9849' abstract: - lang: eng text: This text provides additional information about the model, a derivation of the analytic results in Eq (4), and details about simulations of an additional parameter set. article_processing_charge: No author: - first_name: Marta full_name: Lukacisinova, Marta id: 4342E402-F248-11E8-B48F-1D18A9856A87 last_name: Lukacisinova orcid: 0000-0002-2519-8004 - first_name: Sebastian full_name: Novak, Sebastian id: 461468AE-F248-11E8-B48F-1D18A9856A87 last_name: Novak - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 citation: ama: Lukacisinova M, Novak S, Paixao T. Modelling and simulation details. 2017. doi:10.1371/journal.pcbi.1005609.s001 apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Modelling and simulation details. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s001 chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Modelling and Simulation Details.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s001. ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Modelling and simulation details.” Public Library of Science, 2017. ista: Lukacisinova M, Novak S, Paixao T. 2017. Modelling and simulation details, Public Library of Science, 10.1371/journal.pcbi.1005609.s001. mla: Lukacisinova, Marta, et al. Modelling and Simulation Details. Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s001. short: M. Lukacisinova, S. Novak, T. Paixao, (2017). date_created: 2021-08-09T14:02:34Z date_published: 2017-07-18T00:00:00Z date_updated: 2023-02-23T12:55:39Z day: '18' department: - _id: ToBo - _id: NiBa - _id: CaGu doi: 10.1371/journal.pcbi.1005609.s001 month: '07' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '696' relation: used_in_publication status: public status: public title: Modelling and simulation details type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9850' abstract: - lang: eng text: In this text, we discuss how a cost of resistance and the possibility of lethal mutations impact our model. article_processing_charge: No author: - first_name: Marta full_name: Lukacisinova, Marta id: 4342E402-F248-11E8-B48F-1D18A9856A87 last_name: Lukacisinova orcid: 0000-0002-2519-8004 - first_name: Sebastian full_name: Novak, Sebastian id: 461468AE-F248-11E8-B48F-1D18A9856A87 last_name: Novak - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 citation: ama: Lukacisinova M, Novak S, Paixao T. Extensions of the model. 2017. doi:10.1371/journal.pcbi.1005609.s002 apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Extensions of the model. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s002 chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Extensions of the Model.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s002. ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Extensions of the model.” Public Library of Science, 2017. ista: Lukacisinova M, Novak S, Paixao T. 2017. Extensions of the model, Public Library of Science, 10.1371/journal.pcbi.1005609.s002. mla: Lukacisinova, Marta, et al. Extensions of the Model. Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s002. short: M. Lukacisinova, S. Novak, T. Paixao, (2017). date_created: 2021-08-09T14:05:24Z date_published: 2017-07-18T00:00:00Z date_updated: 2023-02-23T12:55:39Z day: '18' department: - _id: ToBo - _id: CaGu - _id: NiBa doi: 10.1371/journal.pcbi.1005609.s002 month: '07' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '696' relation: used_in_publication status: public status: public title: Extensions of the model type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9846' article_processing_charge: No author: - first_name: Nela full_name: Nikolic, Nela id: 42D9CABC-F248-11E8-B48F-1D18A9856A87 last_name: Nikolic orcid: 0000-0001-9068-6090 - first_name: Frank full_name: Schreiber, Frank last_name: Schreiber - first_name: Alma full_name: Dal Co, Alma last_name: Dal Co - first_name: Daniel full_name: Kiviet, Daniel last_name: Kiviet - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Sten full_name: Littmann, Sten last_name: Littmann - first_name: Marcel full_name: Kuypers, Marcel last_name: Kuypers - first_name: Martin full_name: Ackermann, Martin last_name: Ackermann citation: ama: Nikolic N, Schreiber F, Dal Co A, et al. Supplementary methods. 2017. doi:10.1371/journal.pgen.1007122.s016 apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Supplementary methods. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007122.s016 chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Supplementary Methods.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s016. ieee: N. Nikolic et al., “Supplementary methods.” Public Library of Science, 2017. ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Supplementary methods, Public Library of Science, 10.1371/journal.pgen.1007122.s016. mla: Nikolic, Nela, et al. Supplementary Methods. Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122.s016. short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, (2017). date_created: 2021-08-09T13:35:17Z date_published: 2017-12-18T00:00:00Z date_updated: 2023-02-23T12:25:04Z day: '18' department: - _id: CaGu doi: 10.1371/journal.pgen.1007122.s016 month: '12' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '541' relation: used_in_publication status: public status: public title: Supplementary methods type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '680' abstract: - lang: eng text: In order to respond reliably to specific features of their environment, sensory neurons need to integrate multiple incoming noisy signals. Crucially, they also need to compete for the interpretation of those signals with other neurons representing similar features. The form that this competition should take depends critically on the noise corrupting these signals. In this study we show that for the type of noise commonly observed in sensory systems, whose variance scales with the mean signal, sensory neurons should selectively divide their input signals by their predictions, suppressing ambiguous cues while amplifying others. Any change in the stimulus context alters which inputs are suppressed, leading to a deep dynamic reshaping of neural receptive fields going far beyond simple surround suppression. Paradoxically, these highly variable receptive fields go alongside and are in fact required for an invariant representation of external sensory features. In addition to offering a normative account of context-dependent changes in sensory responses, perceptual inference in the presence of signal-dependent noise accounts for ubiquitous features of sensory neurons such as divisive normalization, gain control and contrast dependent temporal dynamics. article_number: e1005582 author: - first_name: Matthew J full_name: Chalk, Matthew J id: 2BAAC544-F248-11E8-B48F-1D18A9856A87 last_name: Chalk orcid: 0000-0001-7782-4436 - first_name: Paul full_name: Masset, Paul last_name: Masset - first_name: Boris full_name: Gutkin, Boris last_name: Gutkin - first_name: Sophie full_name: Denève, Sophie last_name: Denève citation: ama: Chalk MJ, Masset P, Gutkin B, Denève S. Sensory noise predicts divisive reshaping of receptive fields. PLoS Computational Biology. 2017;13(6). doi:10.1371/journal.pcbi.1005582 apa: Chalk, M. J., Masset, P., Gutkin, B., & Denève, S. (2017). Sensory noise predicts divisive reshaping of receptive fields. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005582 chicago: Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Sensory Noise Predicts Divisive Reshaping of Receptive Fields.” PLoS Computational Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005582. ieee: M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Sensory noise predicts divisive reshaping of receptive fields,” PLoS Computational Biology, vol. 13, no. 6. Public Library of Science, 2017. ista: Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Sensory noise predicts divisive reshaping of receptive fields. PLoS Computational Biology. 13(6), e1005582. mla: Chalk, Matthew J., et al. “Sensory Noise Predicts Divisive Reshaping of Receptive Fields.” PLoS Computational Biology, vol. 13, no. 6, e1005582, Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005582. short: M.J. Chalk, P. Masset, B. Gutkin, S. Denève, PLoS Computational Biology 13 (2017). date_created: 2018-12-11T11:47:53Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-02-23T14:10:54Z day: '01' ddc: - '571' department: - _id: GaTk doi: 10.1371/journal.pcbi.1005582 file: - access_level: open_access checksum: 796a1026076af6f4405a47d985bc7b68 content_type: application/pdf creator: system date_created: 2018-12-12T10:07:47Z date_updated: 2020-07-14T12:47:40Z file_id: '4645' file_name: IST-2017-898-v1+1_journal.pcbi.1005582.pdf file_size: 14555676 relation: main_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' intvolume: ' 13' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: PLoS Computational Biology publication_identifier: issn: - 1553734X publication_status: published publisher: Public Library of Science publist_id: '7035' pubrep_id: '898' quality_controlled: '1' related_material: record: - id: '9855' relation: research_data status: public scopus_import: 1 status: public title: Sensory noise predicts divisive reshaping of receptive fields tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '9851' abstract: - lang: eng text: Based on the intuitive derivation of the dynamics of SIM allele frequency pM in the main text, we present a heuristic prediction for the long-term SIM allele frequencies with χ > 1 stresses and compare it to numerical simulations. article_processing_charge: No author: - first_name: Marta full_name: Lukacisinova, Marta id: 4342E402-F248-11E8-B48F-1D18A9856A87 last_name: Lukacisinova orcid: 0000-0002-2519-8004 - first_name: Sebastian full_name: Novak, Sebastian id: 461468AE-F248-11E8-B48F-1D18A9856A87 last_name: Novak - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 citation: ama: Lukacisinova M, Novak S, Paixao T. Heuristic prediction for multiple stresses. 2017. doi:10.1371/journal.pcbi.1005609.s003 apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Heuristic prediction for multiple stresses. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s003 chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Heuristic Prediction for Multiple Stresses.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s003. ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Heuristic prediction for multiple stresses.” Public Library of Science, 2017. ista: Lukacisinova M, Novak S, Paixao T. 2017. Heuristic prediction for multiple stresses, Public Library of Science, 10.1371/journal.pcbi.1005609.s003. mla: Lukacisinova, Marta, et al. Heuristic Prediction for Multiple Stresses. Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s003. short: M. Lukacisinova, S. Novak, T. Paixao, (2017). date_created: 2021-08-09T14:08:14Z date_published: 2017-07-18T00:00:00Z date_updated: 2023-02-23T12:55:39Z day: '18' department: - _id: ToBo - _id: CaGu - _id: NiBa doi: 10.1371/journal.pcbi.1005609.s003 month: '07' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '696' relation: used_in_publication status: public status: public title: Heuristic prediction for multiple stresses type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9852' abstract: - lang: eng text: We show how different combination strategies affect the fraction of individuals that are multi-resistant. article_processing_charge: No author: - first_name: Marta full_name: Lukacisinova, Marta id: 4342E402-F248-11E8-B48F-1D18A9856A87 last_name: Lukacisinova orcid: 0000-0002-2519-8004 - first_name: Sebastian full_name: Novak, Sebastian id: 461468AE-F248-11E8-B48F-1D18A9856A87 last_name: Novak - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 citation: ama: Lukacisinova M, Novak S, Paixao T. Resistance frequencies for different combination strategies. 2017. doi:10.1371/journal.pcbi.1005609.s004 apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Resistance frequencies for different combination strategies. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s004 chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Resistance Frequencies for Different Combination Strategies.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s004. ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Resistance frequencies for different combination strategies.” Public Library of Science, 2017. ista: Lukacisinova M, Novak S, Paixao T. 2017. Resistance frequencies for different combination strategies, Public Library of Science, 10.1371/journal.pcbi.1005609.s004. mla: Lukacisinova, Marta, et al. Resistance Frequencies for Different Combination Strategies. Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s004. short: M. Lukacisinova, S. Novak, T. Paixao, (2017). date_created: 2021-08-09T14:11:40Z date_published: 2017-07-18T00:00:00Z date_updated: 2023-02-23T12:55:39Z day: '18' department: - _id: ToBo - _id: CaGu - _id: NiBa doi: 10.1371/journal.pcbi.1005609.s004 month: '07' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '696' relation: used_in_publication status: public status: public title: Resistance frequencies for different combination strategies type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9855' abstract: - lang: eng text: Includes derivation of optimal estimation algorithm, generalisation to non-poisson noise statistics, correlated input noise, and implementation of in a multi-layer neural network. article_processing_charge: No author: - first_name: Matthew J full_name: Chalk, Matthew J id: 2BAAC544-F248-11E8-B48F-1D18A9856A87 last_name: Chalk orcid: 0000-0001-7782-4436 - first_name: Paul full_name: Masset, Paul last_name: Masset - first_name: Boris full_name: Gutkin, Boris last_name: Gutkin - first_name: Sophie full_name: Denève, Sophie last_name: Denève citation: ama: Chalk MJ, Masset P, Gutkin B, Denève S. Supplementary appendix. 2017. doi:10.1371/journal.pcbi.1005582.s001 apa: Chalk, M. J., Masset, P., Gutkin, B., & Denève, S. (2017). Supplementary appendix. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005582.s001 chicago: Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Supplementary Appendix.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005582.s001. ieee: M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Supplementary appendix.” Public Library of Science, 2017. ista: Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Supplementary appendix, Public Library of Science, 10.1371/journal.pcbi.1005582.s001. mla: Chalk, Matthew J., et al. Supplementary Appendix. Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005582.s001. short: M.J. Chalk, P. Masset, B. Gutkin, S. Denève, (2017). date_created: 2021-08-10T07:05:10Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-02-23T12:52:17Z day: '01' department: - _id: GaTk doi: 10.1371/journal.pcbi.1005582.s001 month: '06' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '680' relation: used_in_publication status: public status: public title: Supplementary appendix type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '941' abstract: - lang: eng text: 'Recently there has been a proliferation of automated program repair (APR) techniques, targeting various programming languages. Such techniques can be generally classified into two families: syntactic- and semantics-based. Semantics-based APR, on which we focus, typically uses symbolic execution to infer semantic constraints and then program synthesis to construct repairs conforming to them. While syntactic-based APR techniques have been shown successful on bugs in real-world programs written in both C and Java, semantics-based APR techniques mostly target C programs. This leaves empirical comparisons of the APR families not fully explored, and developers without a Java-based semantics APR technique. We present JFix, a semantics-based APR framework that targets Java, and an associated Eclipse plugin. JFix is implemented atop Symbolic PathFinder, a well-known symbolic execution engine for Java programs. It extends one particular APR technique (Angelix), and is designed to be sufficiently generic to support a variety of such techniques. We demonstrate that semantics-based APR can indeed efficiently and effectively repair a variety of classes of bugs in large real-world Java programs. This supports our claim that the framework can both support developers seeking semantics-based repair of bugs in Java programs, as well as enable larger scale empirical studies comparing syntactic- and semantics-based APR targeting Java. The demonstration of our tool is available via the project website at: https://xuanbachle.github.io/semanticsrepair/ ' author: - first_name: Xuan full_name: Le, Xuan last_name: Le - first_name: Duc Hiep full_name: Chu, Duc Hiep id: 3598E630-F248-11E8-B48F-1D18A9856A87 last_name: Chu - first_name: David full_name: Lo, David last_name: Lo - first_name: Claire full_name: Le Goues, Claire last_name: Le Goues - first_name: Willem full_name: Visser, Willem last_name: Visser citation: ama: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In: Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis. ACM; 2017:376-379. doi:10.1145/3092703.3098225' apa: 'Le, X., Chu, D. H., Lo, D., Le Goues, C., & Visser, W. (2017). JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 376–379). Santa Barbara, CA, United States: ACM. https://doi.org/10.1145/3092703.3098225' chicago: 'Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.” In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, 376–79. ACM, 2017. https://doi.org/10.1145/3092703.3098225.' ieee: 'X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “JFIX: Semantics-based repair of Java programs via symbolic  PathFinder,” in Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa Barbara, CA, United States, 2017, pp. 376–379.' ista: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. 2017. JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis. ISSTA: International Symposium on Software Testing and Analysis, 376–379.' mla: 'Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.” Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.' short: X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–379. conference: end_date: 2017-07-14 location: Santa Barbara, CA, United States name: 'ISSTA: International Symposium on Software Testing and Analysis' start_date: 2017-07-10 date_created: 2018-12-11T11:49:19Z date_published: 2017-07-10T00:00:00Z date_updated: 2021-01-12T08:22:05Z day: '10' department: - _id: ToHe doi: 10.1145/3092703.3098225 language: - iso: eng month: '07' oa_version: None page: '376 - 379 ' project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis publication_status: published publisher: ACM publist_id: '6478' quality_controlled: '1' scopus_import: 1 status: public title: 'JFIX: Semantics-based repair of Java programs via symbolic PathFinder' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '958' abstract: - lang: eng text: Biosensors that exploit Forster resonance energy transfer (FRET) can be used to visualize biological and physiological processes and are capable of providing detailed information in both spatial and temporal dimensions. In a FRET-based biosensor, substrate binding is associated with a change in the relative positions of two fluorophores, leading to a change in FRET efficiency that may be observed in the fluorescence spectrum. As a result, their design requires a ligand-binding protein that exhibits a conformational change upon binding. However, not all ligand-binding proteins produce responsive sensors upon conjugation to fluorescent proteins or dyes, and identifying the optimum locations for the fluorophores often involves labor-intensive iterative design or high-throughput screening. Combining the genetic fusion of a fluorescent protein to the ligand-binding protein with site-specific covalent attachment of a fluorescent dye can allow fine control over the positions of the two fluorophores, allowing the construction of very sensitive sensors. This relies upon the accurate prediction of the locations of the two fluorophores in bound and unbound states. In this chapter, we describe a method for computational identification of dye-attachment sites that allows the use of cysteine modification to attach synthetic dyes that can be paired with a fluorescent protein for the purposes of creating FRET sensors. alternative_title: - Methods in Molecular Biology author: - first_name: Joshua full_name: Mitchell, Joshua last_name: Mitchell - first_name: William full_name: Zhang, William last_name: Zhang - first_name: Michel full_name: Herde, Michel last_name: Herde - first_name: Christian full_name: Henneberger, Christian last_name: Henneberger - first_name: Harald L full_name: Janovjak, Harald L id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 - first_name: Megan full_name: O'Mara, Megan last_name: O'Mara - first_name: Colin full_name: Jackson, Colin last_name: Jackson citation: ama: 'Mitchell J, Zhang W, Herde M, et al. Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment. In: Stein V, ed. Synthetic Protein Switches. Vol 1596. Synthetic Protein Switches. Springer; 2017:89-99. doi:10.1007/978-1-4939-6940-1_6' apa: Mitchell, J., Zhang, W., Herde, M., Henneberger, C., Janovjak, H. L., O’Mara, M., & Jackson, C. (2017). Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment. In V. Stein (Ed.), Synthetic Protein Switches (Vol. 1596, pp. 89–99). Springer. https://doi.org/10.1007/978-1-4939-6940-1_6 chicago: Mitchell, Joshua, William Zhang, Michel Herde, Christian Henneberger, Harald L Janovjak, Megan O’Mara, and Colin Jackson. “Method for Developing Optical Sensors Using a Synthetic Dye Fluorescent Protein FRET Pair and Computational Modeling and Assessment.” In Synthetic Protein Switches, edited by Viktor Stein, 1596:89–99. Synthetic Protein Switches. Springer, 2017. https://doi.org/10.1007/978-1-4939-6940-1_6. ieee: J. Mitchell et al., “Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment,” in Synthetic Protein Switches, vol. 1596, V. Stein, Ed. Springer, 2017, pp. 89–99. ista: 'Mitchell J, Zhang W, Herde M, Henneberger C, Janovjak HL, O’Mara M, Jackson C. 2017.Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment. In: Synthetic Protein Switches. Methods in Molecular Biology, vol. 1596, 89–99.' mla: Mitchell, Joshua, et al. “Method for Developing Optical Sensors Using a Synthetic Dye Fluorescent Protein FRET Pair and Computational Modeling and Assessment.” Synthetic Protein Switches, edited by Viktor Stein, vol. 1596, Springer, 2017, pp. 89–99, doi:10.1007/978-1-4939-6940-1_6. short: J. Mitchell, W. Zhang, M. Herde, C. Henneberger, H.L. Janovjak, M. O’Mara, C. Jackson, in:, V. Stein (Ed.), Synthetic Protein Switches, Springer, 2017, pp. 89–99. date_created: 2018-12-11T11:49:24Z date_published: 2017-05-15T00:00:00Z date_updated: 2021-01-12T08:22:13Z day: '15' department: - _id: HaJa doi: 10.1007/978-1-4939-6940-1_6 editor: - first_name: Viktor full_name: Stein, Viktor last_name: Stein intvolume: ' 1596' language: - iso: eng month: '05' oa_version: None page: 89 - 99 publication: Synthetic Protein Switches publication_identifier: issn: - '10643745' publication_status: published publisher: Springer publist_id: '6450' quality_controlled: '1' scopus_import: 1 series_title: Synthetic Protein Switches status: public title: Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment type: book_chapter user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 1596 year: '2017' ... --- _id: '9707' abstract: - lang: eng text: Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis. article_processing_charge: No author: - first_name: Paul full_name: Riccio, Paul last_name: Riccio - first_name: Christina full_name: Cebrián, Christina last_name: Cebrián - first_name: Hui full_name: Zong, Hui last_name: Zong - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Frank full_name: Costantini, Frank last_name: Costantini citation: ama: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. 2017. doi:10.5061/dryad.pk16b' apa: 'Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., & Costantini, F. (2017). Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. Dryad. https://doi.org/10.5061/dryad.pk16b' chicago: 'Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis.” Dryad, 2017. https://doi.org/10.5061/dryad.pk16b.' ieee: 'P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.” Dryad, 2017.' ista: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis, Dryad, 10.5061/dryad.pk16b.' mla: 'Riccio, Paul, et al. Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis. Dryad, 2017, doi:10.5061/dryad.pk16b.' short: P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017). date_created: 2021-07-23T09:39:34Z date_published: 2017-01-14T00:00:00Z date_updated: 2022-08-25T13:34:55Z day: '14' department: - _id: SiHi doi: 10.5061/dryad.pk16b main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.pk16b month: '01' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '9702' relation: used_in_publication status: deleted status: public title: 'Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis' type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '9844' article_processing_charge: No author: - first_name: Nela full_name: Nikolic, Nela id: 42D9CABC-F248-11E8-B48F-1D18A9856A87 last_name: Nikolic orcid: 0000-0001-9068-6090 - first_name: Frank full_name: Schreiber, Frank last_name: Schreiber - first_name: Alma full_name: Dal Co, Alma last_name: Dal Co - first_name: Daniel full_name: Kiviet, Daniel last_name: Kiviet - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Sten full_name: Littmann, Sten last_name: Littmann - first_name: Marcel full_name: Kuypers, Marcel last_name: Kuypers - first_name: Martin full_name: Ackermann, Martin last_name: Ackermann citation: ama: Nikolic N, Schreiber F, Dal Co A, et al. Source data for figures and tables. 2017. doi:10.1371/journal.pgen.1007122.s018 apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Source data for figures and tables. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007122.s018 chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Source Data for Figures and Tables.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s018. ieee: N. Nikolic et al., “Source data for figures and tables.” Public Library of Science, 2017. ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Source data for figures and tables, Public Library of Science, 10.1371/journal.pgen.1007122.s018. mla: Nikolic, Nela, et al. Source Data for Figures and Tables. Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122.s018. short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, (2017). date_created: 2021-08-09T13:27:16Z date_published: 2017-12-18T00:00:00Z date_updated: 2023-02-23T12:25:04Z day: '18' department: - _id: CaGu doi: 10.1371/journal.pgen.1007122.s018 month: '12' oa_version: Published Version publisher: Public Library of Science related_material: record: - id: '541' relation: used_in_publication status: public status: public title: Source data for figures and tables type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2017' ... --- _id: '12905' article_processing_charge: No author: - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Janos full_name: Kiss, Janos id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87 last_name: Kiss citation: ama: 'Schlögl A, Kiss J. Scientific Computing at IST Austria. In: AHPC17 – Austrian HPC Meeting 2017. FSP Scientific Computing; 2017:28.' apa: 'Schlögl, A., & Kiss, J. (2017). Scientific Computing at IST Austria. In AHPC17 – Austrian HPC Meeting 2017 (p. 28). Grundlsee, Austria: FSP Scientific Computing.' chicago: Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” In AHPC17 – Austrian HPC Meeting 2017, 28. FSP Scientific Computing, 2017. ieee: A. Schlögl and J. Kiss, “Scientific Computing at IST Austria,” in AHPC17 – Austrian HPC Meeting 2017, Grundlsee, Austria, 2017, p. 28. ista: 'Schlögl A, Kiss J. 2017. Scientific Computing at IST Austria. AHPC17 – Austrian HPC Meeting 2017. AHPC: Austrian HPC Meeting, 28.' mla: Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” AHPC17 – Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28. short: A. Schlögl, J. Kiss, in:, AHPC17 – Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28. conference: end_date: 2017-03-03 location: Grundlsee, Austria name: 'AHPC: Austrian HPC Meeting' start_date: 2017-03-01 date_created: 2023-05-05T12:58:53Z date_published: 2017-03-03T00:00:00Z date_updated: 2023-05-16T07:22:23Z day: '03' ddc: - '000' department: - _id: ScienComp file: - access_level: open_access checksum: 7bcc499479d4f4c5ce6c0071c24ca6c6 content_type: application/pdf creator: dernst date_created: 2023-05-16T07:20:50Z date_updated: 2023-05-16T07:20:50Z file_id: '12969' file_name: 2017_AHPC_Schloegl.pdf file_size: 1005486 relation: main_file success: 1 file_date_updated: 2023-05-16T07:20:50Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc17/BOOKLET_AHPC17.pdf month: '03' oa: 1 oa_version: Published Version page: '28' publication: AHPC17 – Austrian HPC Meeting 2017 publication_status: published publisher: FSP Scientific Computing status: public title: Scientific Computing at IST Austria type: conference_abstract user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '13160' abstract: - lang: eng text: "Transforming deterministic ω\r\n-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae." acknowledgement: This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061. alternative_title: - LNCS article_processing_charge: No author: - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Clara full_name: Waldmann, Clara last_name: Waldmann - first_name: Maximilian full_name: Weininger, Maximilian last_name: Weininger citation: ama: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi:10.1007/978-3-662-54577-5_26' apa: 'Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26' chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60. Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26. ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460. ista: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance record for transforming Rabin automata into parity automata. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.' mla: Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26. short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460. conference: end_date: 2017-04-29 location: Uppsala, Sweden name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2017-04-22 date_created: 2023-06-21T13:21:14Z date_published: 2017-03-31T00:00:00Z date_updated: 2023-06-21T13:29:46Z day: '31' department: - _id: KrCh doi: 10.1007/978-3-662-54577-5_26 external_id: arxiv: - '1701.05738' intvolume: ' 10205' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1701.05738 month: '03' oa: 1 oa_version: Preprint page: 443-460 publication: Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eisbn: - '9783662545775' eissn: - 1611-3349 isbn: - '9783662545768' issn: - 0302-9743 publication_status: published publisher: Springer quality_controlled: '1' status: public title: Index appearance record for transforming Rabin automata into parity automata type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10205 year: '2017' ... --- _id: '950' abstract: - lang: eng text: "Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. Both players have separate budgets, which sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously, and a bid is legal if it does not exceed the available budget. The winner of the bidding pays his bid to the other player and moves the token. For reachability objectives, repeated bidding games have been studied and are called Richman games. There, a central question is the existence and computation of threshold budgets; namely, a value t\\in [0,1] such that if\\PO's budget exceeds $t$, he can win the game, and if\\PT's budget exceeds 1-t, he can win the game. We focus on parity games and mean-payoff games. We show the existence of threshold budgets in these games, and reduce the problem of finding them to Richman games. We also determine the strategy-complexity of an optimal strategy. Our most interesting result shows that memoryless strategies suffice for mean-payoff bidding games. \r\n" alternative_title: - LIPIcs article_number: '17' author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - 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: Ventsislav K full_name: Chonev, Ventsislav K id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87 last_name: Chonev citation: ama: 'Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21' apa: 'Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21' chicago: Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21. ieee: 'G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.' ista: 'Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.' mla: Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21. short: G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-09-07 location: Berlin, Germany name: 'CONCUR: Concurrency Theory' start_date: 2017-09-05 date_created: 2018-12-11T11:49:22Z date_published: 2017-09-01T00:00:00Z date_updated: 2023-08-29T07:02:13Z day: '01' ddc: - '000' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPIcs.CONCUR.2017.21 external_id: arxiv: - '1705.01433' file: - access_level: open_access checksum: 6d5cccf755207b91ccbef95d8275b013 content_type: application/pdf creator: system date_created: 2018-12-12T10:18:00Z date_updated: 2020-07-14T12:48:16Z file_id: '5318' file_name: IST-2017-844-v1+1_concur-cr.pdf file_size: 335170 relation: main_file file_date_updated: 2020-07-14T12:48:16Z has_accepted_license: '1' intvolume: ' 85' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication_identifier: issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '6466' pubrep_id: '844' quality_controlled: '1' related_material: record: - id: '6752' relation: later_version status: public scopus_import: 1 status: public title: Infinite-duration bidding 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 85 year: '2017' ... --- _id: '683' abstract: - lang: eng text: 'Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.' alternative_title: - LIPIcs article_number: '49' author: - first_name: Anna full_name: Lubiw, Anna last_name: Lubiw - first_name: Zuzana full_name: Masárová, Zuzana id: 45CFE238-F248-11E8-B48F-1D18A9856A87 last_name: Masárová orcid: 0000-0002-6660-1322 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: 'Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.SoCG.2017.49' apa: 'Lubiw, A., Masárová, Z., & Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49' chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.49. ieee: 'A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia, 2017, vol. 77.' ista: 'Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.' mla: Lubiw, Anna, et al. A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.SoCG.2017.49. short: A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-07-07 location: Brisbane, Australia name: 'SoCG: Symposium on Computational Geometry' start_date: 2017-07-04 date_created: 2018-12-11T11:47:54Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-09-05T15:01:43Z day: '01' ddc: - '514' - '516' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2017.49 file: - access_level: open_access checksum: 24fdde981cc513352a78dcf9b0660ae9 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:12Z date_updated: 2020-07-14T12:47:41Z file_id: '5265' file_name: IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf file_size: 710007 relation: main_file file_date_updated: 2020-07-14T12:47:41Z has_accepted_license: '1' intvolume: ' 77' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7033' pubrep_id: '896' quality_controlled: '1' related_material: record: - id: '5986' relation: later_version status: public scopus_import: 1 status: public title: A proof of the orbit conjecture for flipping edge labelled triangulations 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 77 year: '2017' ... --- _id: '1155' abstract: - lang: eng text: This dissertation concerns the automatic verification of probabilistic systems and programs with arrays by statistical and logical methods. Although statistical and logical methods are different in nature, we show that they can be successfully combined for system analysis. In the first part of the dissertation we present a new statistical algorithm for the verification of probabilistic systems with respect to unbounded properties, including linear temporal logic. Our algorithm often performs faster than the previous approaches, and at the same time requires less information about the system. In addition, our method can be generalized to unbounded quantitative properties such as mean-payoff bounds. In the second part, we introduce two techniques for comparing probabilistic systems. Probabilistic systems are typically compared using the notion of equivalence, which requires the systems to have the equal probability of all behaviors. However, this notion is often too strict, since probabilities are typically only empirically estimated, and any imprecision may break the relation between processes. On the one hand, we propose to replace the Boolean notion of equivalence by a quantitative distance of similarity. For this purpose, we introduce a statistical framework for estimating distances between Markov chains based on their simulation runs, and we investigate which distances can be approximated in our framework. On the other hand, we propose to compare systems with respect to a new qualitative logic, which expresses that behaviors occur with probability one or a positive probability. This qualitative analysis is robust with respect to modeling errors and applicable to many domains. In the last part, we present a new quantifier-free logic for integer arrays, which allows us to express counting. Counting properties are prevalent in array-manipulating programs, however they cannot be expressed in the quantified fragments of the theory of arrays. We present a decision procedure for our logic, and provide several complexity results. acknowledgement: ' First of all, I want to thank my advisor, prof. Thomas A. Henzinger, for his guidance during my PhD program. I am grateful for the freedom I was given to pursue my research interests, and his continuous support. Working with prof. Henzinger was a truly inspiring experience and taught me what it means to be a scientist. I want to express my gratitude to my collaborators: Nikola Beneš, Krishnendu Chatterjee, Martin Chmelík, Ashutosh Gupta, Willibald Krenn, Jan Kˇretínský, Dejan Nickovic, Andrey Kupriyanov, and Tatjana Petrov. I have learned a great deal from my collaborators, and without their help this thesis would not be possible. In addition, I want to thank the members of my thesis committee: Dirk Beyer, Dejan Nickovic, and Georg Weissenbacher for their advice and reviewing this dissertation. I would especially like to acknowledge the late Helmut Veith, who was a member of my committee. I will remember Helmut for his kindness, enthusiasm, and wit, as well as for being an inspiring scientist. Finally, I would like to thank my colleagues for making my stay at IST such a pleasant experience: Guy Avni, Sergiy Bogomolov, Ventsislav Chonev, Rasmus Ibsen-Jensen, Mirco Giacobbe, Bernhard Kragl, Hui Kong, Petr Novotný, Jan Otop, Andreas Pavlogiannis, Tantjana Petrov, Arjun Radhakrishna, Jakob Ruess, Thorsten Tarrach, as well as other members of groups Henzinger and Chatterjee. ' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca citation: ama: Daca P. Statistical and logical methods for property checking. 2017. doi:10.15479/AT:ISTA:TH_730 apa: Daca, P. (2017). Statistical and logical methods for property checking. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_730 chicago: Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:TH_730. ieee: P. Daca, “Statistical and logical methods for property checking,” Institute of Science and Technology Austria, 2017. ista: Daca P. 2017. Statistical and logical methods for property checking. Institute of Science and Technology Austria. mla: Daca, Przemyslaw. Statistical and Logical Methods for Property Checking. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730. short: P. Daca, Statistical and Logical Methods for Property Checking, Institute of Science and Technology Austria, 2017. date_created: 2018-12-11T11:50:27Z date_published: 2017-01-02T00:00:00Z date_updated: 2023-09-07T11:58:34Z day: '02' ddc: - '004' - '005' degree_awarded: PhD department: - _id: ToHe doi: 10.15479/AT:ISTA:TH_730 ec_funded: 1 file: - access_level: open_access checksum: 1406a681cb737508234fde34766be2c2 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:26Z date_updated: 2020-07-14T12:44:34Z file_id: '4880' file_name: IST-2017-730-v1+1_Statistical_and_Logical_Methods_for_Property_Checking.pdf file_size: 1028586 relation: main_file file_date_updated: 2020-07-14T12:44:34Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '163' 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_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '6203' pubrep_id: '730' related_material: record: - id: '1093' relation: part_of_dissertation status: public - id: '1230' relation: part_of_dissertation status: public - id: '1234' relation: part_of_dissertation status: public - id: '1391' relation: part_of_dissertation status: public - id: '1501' relation: part_of_dissertation status: public - id: '1502' relation: part_of_dissertation status: public - id: '2063' relation: part_of_dissertation status: public - id: '2167' relation: part_of_dissertation status: public status: public supervisor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 title: Statistical and logical methods for property checking type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2017' ... --- _id: '6291' abstract: - lang: eng text: Bacteria and their pathogens – phages – are the most abundant living entities on Earth. Throughout their coevolution, bacteria have evolved multiple immune systems to overcome the ubiquitous threat from the phages. Although the molecu- lar details of these immune systems’ functions are relatively well understood, their epidemiological consequences for the phage-bacterial communities have been largely neglected. In this thesis we employed both experimental and theoretical methods to explore whether herd and social immunity may arise in bacterial popu- lations. Using our experimental system consisting of Escherichia coli strains with a CRISPR based immunity to the T7 phage we show that herd immunity arises in phage-bacterial communities and that it is accentuated when the populations are spatially structured. By fitting a mathematical model, we inferred expressions for the herd immunity threshold and the velocity of spread of a phage epidemic in partially resistant bacterial populations, which both depend on the bacterial growth rate, phage burst size and phage latent period. We also investigated the poten- tial for social immunity in Streptococcus thermophilus and its phage 2972 using a bioinformatic analysis of potentially coding short open reading frames with a signalling signature, encoded within the CRISPR associated genes. Subsequently, we tested one identified potentially signalling peptide and found that its addition to a phage-challenged culture increases probability of survival of bacteria two fold, although the results were only marginally significant. Together, these results demonstrate that the ubiquitous arms races between bacteria and phages have further consequences at the level of the population. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Pavel full_name: Payne, Pavel id: 35F78294-F248-11E8-B48F-1D18A9856A87 last_name: Payne orcid: 0000-0002-2711-9453 citation: ama: Payne P. Bacterial herd and social immunity to phages. 2017. apa: Payne, P. (2017). Bacterial herd and social immunity to phages. Institute of Science and Technology Austria. chicago: Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute of Science and Technology Austria, 2017. ieee: P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science and Technology Austria, 2017. ista: Payne P. 2017. Bacterial herd and social immunity to phages. Institute of Science and Technology Austria. mla: Payne, Pavel. Bacterial Herd and Social Immunity to Phages. Institute of Science and Technology Austria, 2017. short: P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science and Technology Austria, 2017. date_created: 2019-04-09T15:16:45Z date_published: 2017-02-01T00:00:00Z date_updated: 2023-09-07T12:00:00Z day: '01' ddc: - '570' degree_awarded: PhD department: - _id: NiBa - _id: JoBo file: - access_level: closed checksum: a0fc5c26a89c0ea759947ffba87d0d8f content_type: application/pdf creator: dernst date_created: 2019-04-09T15:15:32Z date_updated: 2020-07-14T12:47:27Z file_id: '6292' file_name: thesis_pavel_payne_final_w_signature_page.pdf file_size: 3025175 relation: main_file - access_level: open_access checksum: af531e921a7f64a9e0af4cd8783b2226 content_type: application/pdf creator: dernst date_created: 2021-02-22T13:45:59Z date_updated: 2021-02-22T13:45:59Z file_id: '9187' file_name: 2017_Payne_Thesis.pdf file_size: 3111536 relation: main_file success: 1 file_date_updated: 2021-02-22T13:45:59Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '83' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 title: Bacterial herd and social immunity to phages type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2017' ... --- _id: '561' abstract: - lang: eng text: Restriction–modification systems are widespread genetic elements that protect bacteria from bacteriophage infections by recognizing and cleaving heterologous DNA at short, well-defined sequences called restriction sites. Bioinformatic evidence shows that restriction sites are significantly underrepresented in bacteriophage genomes, presumably because bacteriophages with fewer restriction sites are more likely to escape cleavage by restriction–modification systems. However, how mutations in restriction sites affect the likelihood of bacteriophage escape is unknown. Using the bacteriophage l and the restriction–modification system EcoRI, we show that while mutation effects at different restriction sites are unequal, they are independent. As a result, the probability of bacteriophage escape increases with each mutated restriction site. Our results experimentally support the role of restriction site avoidance as a response to selection imposed by restriction–modification systems and offer an insight into the events underlying the process of bacteriophage escape. acknowledgement: This work was funded by an HFSP Young Investigators' grant RGY0079/2011 (C.C.G.). M.P. is a recipient of a DOC Fellowship of the Austrian Academy of Science at the Institute of Science and Technology Austria. article_number: '20170646' article_processing_charge: No article_type: original author: - first_name: Maros full_name: Pleska, Maros id: 4569785E-F248-11E8-B48F-1D18A9856A87 last_name: Pleska orcid: 0000-0001-7460-7479 - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 citation: ama: Pleska M, Guet CC. Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. 2017;13(12). doi:10.1098/rsbl.2017.0646 apa: Pleska, M., & Guet, C. C. (2017). Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. The Royal Society. https://doi.org/10.1098/rsbl.2017.0646 chicago: Pleska, Maros, and Calin C Guet. “Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” Biology Letters. The Royal Society, 2017. https://doi.org/10.1098/rsbl.2017.0646. ieee: M. Pleska and C. C. Guet, “Effects of mutations in phage restriction sites during escape from restriction–modification,” Biology Letters, vol. 13, no. 12. The Royal Society, 2017. ista: Pleska M, Guet CC. 2017. Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. 13(12), 20170646. mla: Pleska, Maros, and Calin C. Guet. “Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” Biology Letters, vol. 13, no. 12, 20170646, The Royal Society, 2017, doi:10.1098/rsbl.2017.0646. short: M. Pleska, C.C. Guet, Biology Letters 13 (2017). date_created: 2018-12-11T11:47:11Z date_published: 2017-12-01T00:00:00Z date_updated: 2023-09-07T11:59:32Z day: '01' department: - _id: CaGu doi: 10.1098/rsbl.2017.0646 external_id: pmid: - '29237814' intvolume: ' 13' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1098/rsbl.2017.0646 month: '12' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 251BCBEC-B435-11E9-9278-68D0E5697425 grant_number: RGY0079/2011 name: Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification Systems (HFSP Young investigators' grant) - _id: 251D65D8-B435-11E9-9278-68D0E5697425 grant_number: '24210' name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level (DOC Fellowship) publication: Biology Letters publication_identifier: issn: - 1744-9561 publication_status: published publisher: The Royal Society publist_id: '7253' quality_controlled: '1' related_material: record: - id: '9847' relation: research_data status: public - id: '202' relation: dissertation_contains status: public scopus_import: '1' status: public title: Effects of mutations in phage restriction sites during escape from restriction–modification type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ...