[{"department":[{"_id":"DaAl"}],"date_published":"2018-12-31T00:00:00Z","doi":"10.1109/SiPS.2018.8598402","language":[{"iso":"eng"}],"scopus_import":"1","conference":{"location":"Cape Town, South Africa","name":"SiPS: Workshop on Signal Processing Systems","start_date":"2018-10-21","end_date":"2018-10-24"},"article_processing_charge":"No","day":"31","author":[{"full_name":"Stojanov, Alen","first_name":"Alen","last_name":"Stojanov"},{"last_name":"Smith","first_name":"Tyler Michael","full_name":"Smith, Tyler Michael"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Puschel, Markus","first_name":"Markus","last_name":"Puschel"}],"isi":1,"citation":{"mla":"Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” <i>2018 IEEE International Workshop on Signal Processing Systems</i>, vol. 2018–October, 8598402, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">10.1109/SiPS.2018.8598402</a>.","chicago":"Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In <i>2018 IEEE International Workshop on Signal Processing Systems</i>, Vol. 2018–October. IEEE, 2018. <a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">https://doi.org/10.1109/SiPS.2018.8598402</a>.","ista":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402.","apa":"Stojanov, A., Smith, T. M., Alistarh, D.-A., &#38; Puschel, M. (2018). Fast quantized arithmetic on x86: Trading compute for data movement. In <i>2018 IEEE International Workshop on Signal Processing Systems</i> (Vol. 2018–October). Cape Town, South Africa: IEEE. <a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">https://doi.org/10.1109/SiPS.2018.8598402</a>","ama":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: <i>2018 IEEE International Workshop on Signal Processing Systems</i>. Vol 2018-October. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/SiPS.2018.8598402\">10.1109/SiPS.2018.8598402</a>","short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","ieee":"A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in <i>2018 IEEE International Workshop on Signal Processing Systems</i>, Cape Town, South Africa, 2018, vol. 2018–October."},"article_number":"8598402","_id":"6031","volume":"2018-October","publication":"2018 IEEE International Workshop on Signal Processing Systems","date_created":"2019-02-17T22:59:25Z","title":"Fast quantized arithmetic on x86: Trading compute for data movement","status":"public","type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"None","quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved."}],"date_updated":"2023-09-19T14:41:51Z","publisher":"IEEE","month":"12","year":"2018","external_id":{"isi":["000465106800060"]}},{"date_created":"2019-02-17T22:59:25Z","volume":15,"main_file_link":[{"url":"https://arxiv.org/abs/1602.03124","open_access":"1"}],"article_number":"22","citation":{"mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” <i>ACM Transactions on Algorithms</i>, vol. 15, no. 2, 22, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3230649\">10.1145/3230649</a>.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” <i>ACM Transactions on Algorithms</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3230649\">https://doi.org/10.1145/3230649</a>.","apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. <i>ACM Transactions on Algorithms</i>. ACM. <a href=\"https://doi.org/10.1145/3230649\">https://doi.org/10.1145/3230649</a>","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. <i>ACM Transactions on Algorithms</i>. 2018;15(2). doi:<a href=\"https://doi.org/10.1145/3230649\">10.1145/3230649</a>","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” <i>ACM Transactions on Algorithms</i>, vol. 15, no. 2. ACM, 2018."},"day":"01","ec_funded":1,"scopus_import":"1","year":"2018","publisher":"ACM","publication_status":"published","issue":"2","type":"journal_article","title":"Even delta-matroids and the complexity of planar boolean CSPs","publication":"ACM Transactions on Algorithms","_id":"6032","isi":1,"author":[{"full_name":"Kazda, Alexandr","first_name":"Alexandr","last_name":"Kazda","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal","last_name":"Rolinek","first_name":"Michal"}],"project":[{"call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1145/3230649","date_published":"2018-12-01T00:00:00Z","department":[{"_id":"VlKo"}],"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"month":"12","date_updated":"2025-06-04T08:46:58Z","abstract":[{"lang":"eng","text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids."}],"arxiv":1,"quality_controlled":"1","oa_version":"Preprint","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"relation":"earlier_version","id":"1192","status":"public"}]},"intvolume":"        15","article_type":"original","status":"public"},{"arxiv":1,"oa_version":"Submitted Version","quality_controlled":"1","intvolume":"        35","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","external_id":{"isi":["000437975500005"],"arxiv":["1607.00268"]},"publist_id":"7199","month":"08","abstract":[{"text":"We establish the existence of a global solution for a new family of fluid-like equations, which are obtained in certain regimes in as the mean-field evolution of the supercurrent density in a (2D section of a) type-II superconductor with pinning and with imposed electric current. We also consider general vortex-sheet initial data, and investigate the uniqueness and regularity properties of the solution. For some choice of parameters, the equation under investigation coincides with the so-called lake equation from 2D shallow water fluid dynamics, and our analysis then leads to a new existence result for rough initial data.","lang":"eng"}],"date_updated":"2023-09-19T10:39:09Z","article_processing_charge":"No","language":[{"iso":"eng"}],"acknowledgement":"The work of the author is supported by F.R.S.-FNRS ( Fonds de la Recherche Scientifique - FNRS ) through a Research Fellowship.\r\n\r\n","department":[{"_id":"JuFi"}],"date_published":"2018-08-01T00:00:00Z","doi":"10.1016/j.anihpc.2017.11.004","publication":"Annales de l'Institut Henri Poincare (C) Non Linear Analysis","isi":1,"_id":"606","author":[{"full_name":"Duerinckx, Mitia","last_name":"Duerinckx","first_name":"Mitia"},{"full_name":"Fischer, Julian L","orcid":"0000-0002-0479-558X","last_name":"Fischer","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"issue":"5","title":"Well-posedness for mean-field evolutions arising in superconductivity","type":"journal_article","page":"1267-1319","year":"2018","publisher":"Elsevier","publication_status":"published","day":"01","scopus_import":"1","volume":35,"date_created":"2018-12-11T11:47:27Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00268"}],"citation":{"mla":"Duerinckx, Mitia, and Julian L. Fischer. “Well-Posedness for Mean-Field Evolutions Arising in Superconductivity.” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>, vol. 35, no. 5, Elsevier, 2018, pp. 1267–319, doi:<a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">10.1016/j.anihpc.2017.11.004</a>.","chicago":"Duerinckx, Mitia, and Julian L Fischer. “Well-Posedness for Mean-Field Evolutions Arising in Superconductivity.” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">https://doi.org/10.1016/j.anihpc.2017.11.004</a>.","ista":"Duerinckx M, Fischer JL. 2018. Well-posedness for mean-field evolutions arising in superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 35(5), 1267–1319.","apa":"Duerinckx, M., &#38; Fischer, J. L. (2018). Well-posedness for mean-field evolutions arising in superconductivity. <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">https://doi.org/10.1016/j.anihpc.2017.11.004</a>","ama":"Duerinckx M, Fischer JL. Well-posedness for mean-field evolutions arising in superconductivity. <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. 2018;35(5):1267-1319. doi:<a href=\"https://doi.org/10.1016/j.anihpc.2017.11.004\">10.1016/j.anihpc.2017.11.004</a>","short":"M. Duerinckx, J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non Linear Analysis 35 (2018) 1267–1319.","ieee":"M. Duerinckx and J. L. Fischer, “Well-posedness for mean-field evolutions arising in superconductivity,” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>, vol. 35, no. 5. Elsevier, pp. 1267–1319, 2018."}},{"title":"Well posedness and maximum entropy approximation for the dynamics of quantitative traits","type":"journal_article","publisher":"Elsevier","publication_status":"published","year":"2018","page":"108-120","corr_author":"1","scopus_import":"1","day":"01","citation":{"ieee":"K. Bodova, J. Haskovec, and P. Markowich, “Well posedness and maximum entropy approximation for the dynamics of quantitative traits,” <i>Physica D: Nonlinear Phenomena</i>, vol. 376–377. Elsevier, pp. 108–120, 2018.","apa":"Bodova, K., Haskovec, J., &#38; Markowich, P. (2018). Well posedness and maximum entropy approximation for the dynamics of quantitative traits. <i>Physica D: Nonlinear Phenomena</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">https://doi.org/10.1016/j.physd.2017.10.015</a>","ista":"Bodova K, Haskovec J, Markowich P. 2018. Well posedness and maximum entropy approximation for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena. 376–377, 108–120.","short":"K. Bodova, J. Haskovec, P. Markowich, Physica D: Nonlinear Phenomena 376–377 (2018) 108–120.","ama":"Bodova K, Haskovec J, Markowich P. Well posedness and maximum entropy approximation for the dynamics of quantitative traits. <i>Physica D: Nonlinear Phenomena</i>. 2018;376-377:108-120. doi:<a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">10.1016/j.physd.2017.10.015</a>","mla":"Bodova, Katarina, et al. “Well Posedness and Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” <i>Physica D: Nonlinear Phenomena</i>, vol. 376–377, Elsevier, 2018, pp. 108–20, doi:<a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">10.1016/j.physd.2017.10.015</a>.","chicago":"Bodova, Katarina, Jan Haskovec, and Peter Markowich. “Well Posedness and Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” <i>Physica D: Nonlinear Phenomena</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.physd.2017.10.015\">https://doi.org/10.1016/j.physd.2017.10.015</a>."},"volume":"376-377","date_created":"2018-12-11T11:47:28Z","main_file_link":[{"url":"https://arxiv.org/abs/1704.08757","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"status":"public","arxiv":1,"oa_version":"Submitted Version","quality_controlled":"1","month":"08","abstract":[{"text":"We study the Fokker-Planck equation derived in the large system limit of the Markovian process describing the dynamics of quantitative traits. The Fokker-Planck equation is posed on a bounded domain and its transport and diffusion coefficients vanish on the domain's boundary. We first argue that, despite this degeneracy, the standard no-flux boundary condition is valid. We derive the weak formulation of the problem and prove the existence and uniqueness of its solutions by constructing the corresponding contraction semigroup on a suitable function space. Then, we prove that for the parameter regime with high enough mutation rate the problem exhibits a positive spectral gap, which implies exponential convergence to equilibrium.Next, we provide a simple derivation of the so-called Dynamic Maximum Entropy (DynMaxEnt) method for approximation of observables (moments) of the Fokker-Planck solution, which can be interpreted as a nonlinear Galerkin approximation. The limited applicability of the DynMaxEnt method inspires us to introduce its modified version that is valid for the whole range of admissible parameters. Finally, we present several numerical experiments to demonstrate the performance of both the original and modified DynMaxEnt methods. We observe that in the parameter regimes where both methods are valid, the modified one exhibits slightly better approximation properties compared to the original one.","lang":"eng"}],"date_updated":"2024-10-09T20:58:45Z","publist_id":"7198","external_id":{"arxiv":["1704.08757"],"isi":["000437962900012"]},"acknowledgement":"JH and PM are funded by KAUST baseline funds and grant no. 1000000193 .\r\nWe thank Nicholas Barton (IST Austria) for his useful comments and suggestions. \r\n\r\n","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"},{"_id":"GaTk"}],"date_published":"2018-08-01T00:00:00Z","doi":"10.1016/j.physd.2017.10.015","article_processing_charge":"No","isi":1,"_id":"607","author":[{"first_name":"Katarina","last_name":"Bodova","full_name":"Bodova, Katarina","orcid":"0000-0002-7214-0171","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Haskovec","full_name":"Haskovec, Jan"},{"first_name":"Peter","last_name":"Markowich","full_name":"Markowich, Peter"}],"publication":"Physica D: Nonlinear Phenomena"},{"main_file_link":[{"open_access":"1","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529"}],"date_created":"2018-12-11T11:47:28Z","volume":712,"citation":{"apa":"Avni, G., &#38; Kupferman, O. (2018). Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>","ista":"Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.","ama":"Avni G, Kupferman O. Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. 2018;712:50-72. doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>","short":"G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.","mla":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>, vol. 712, Elsevier, 2018, pp. 50–72, doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>.","chicago":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>.","ieee":"G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” <i>Theoretical Computer Science</i>, vol. 712. Elsevier, pp. 50–72, 2018."},"day":"15","ec_funded":1,"scopus_import":"1","corr_author":"1","year":"2018","page":"50 - 72","publication_status":"published","publisher":"Elsevier","type":"journal_article","title":"Synthesis from component libraries with costs","ddc":["000"],"publication":"Theoretical Computer Science","author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"_id":"608","isi":1,"project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"article_processing_charge":"No","doi":"10.1016/j.tcs.2017.11.001","department":[{"_id":"ToHe"}],"date_published":"2018-02-15T00:00:00Z","language":[{"iso":"eng"}],"publist_id":"7197","external_id":{"isi":["000424959200003"]},"abstract":[{"lang":"eng","text":"Synthesis is the automated construction of a system from its specification. In real life, hardware and software systems are rarely constructed from scratch. Rather, a system is typically constructed from a library of components. Lustig and Vardi formalized this intuition and studied LTL synthesis from component libraries. In real life, designers seek optimal systems. In this paper we add optimality considerations to the setting. We distinguish between quality considerations (for example, size - the smaller a system is, the better it is), and pricing (for example, the payment to the company who manufactured the component). We study the problem of designing systems with minimal quality-cost and price. A key point is that while the quality cost is individual - the choices of a designer are independent of choices made by other designers that use the same library, pricing gives rise to a resource-allocation game - designers that use the same component share its price, with the share being proportional to the number of uses (a component can be used several times in a design). We study both closed and open settings, and in both we solve the problem of finding an optimal design. In a setting with multiple designers, we also study the game-theoretic problems of the induced resource-allocation game."}],"date_updated":"2026-06-18T18:58:53Z","month":"02","quality_controlled":"1","oa_version":"Published Version","article_type":"original","status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"       712"},{"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","status":"public","arxiv":1,"quality_controlled":"1","oa_version":"Preprint","month":"05","publisher":"Springer","abstract":[{"lang":"eng","text":"We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. "}],"date_updated":"2021-01-12T08:06:06Z","publication_status":"published","external_id":{"arxiv":["1509.06286"]},"publist_id":"7993","page":"131 - 134","year":"2018","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-72456-0_7","department":[{"_id":"TaHa"}],"date_published":"2018-05-23T00:00:00Z","day":"23","article_processing_charge":"No","extern":"1","_id":"61","citation":{"ama":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: <i>Contemporary Computational Mathematics</i>. Springer; 2018:131-134. doi:<a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">10.1007/978-3-319-72456-0_7</a>","short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","apa":"Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., &#38; Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In <i>Contemporary Computational Mathematics</i> (pp. 131–134). Springer. <a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">https://doi.org/10.1007/978-3-319-72456-0_7</a>","ista":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.","chicago":"Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In <i>Contemporary Computational Mathematics</i>, 131–34. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">https://doi.org/10.1007/978-3-319-72456-0_7</a>.","mla":"Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” <i>Contemporary Computational Mathematics</i>, Springer, 2018, pp. 131–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-72456-0_7\">10.1007/978-3-319-72456-0_7</a>.","ieee":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in <i>Contemporary Computational Mathematics</i>, Springer, 2018, pp. 131–134."},"author":[{"first_name":"Andriy","last_name":"Bondarenko","full_name":"Bondarenko, Andriy"},{"last_name":"Mellit","first_name":"Anton","full_name":"Mellit, Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Prymak, Andriy","last_name":"Prymak","first_name":"Andriy"},{"last_name":"Radchenko","first_name":"Danylo","full_name":"Radchenko, Danylo"},{"last_name":"Viazovska","first_name":"Maryna","full_name":"Viazovska, Maryna"}],"date_created":"2018-12-11T11:44:25Z","publication":"Contemporary Computational Mathematics","main_file_link":[{"url":"https://arxiv.org/abs/1509.06286","open_access":"1"}]},{"year":"2018","page":"E6890-E6899","publisher":"National Academy of Sciences","publication_status":"published","issue":"29","type":"journal_article","file_date_updated":"2020-07-14T12:47:19Z","title":"Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron","date_created":"2019-03-19T12:41:33Z","volume":115,"citation":{"chicago":"Laurent, Patrick, QueeLim Ch’ng, Maëlle Jospin, Changchun Chen, Ramiro Lorenzo, and Mario de Bono. “Genetic Dissection of Neuropeptide Cell Biology at High and Low Activity in a Defined Sensory Neuron.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1714610115\">https://doi.org/10.1073/pnas.1714610115</a>.","mla":"Laurent, Patrick, et al. “Genetic Dissection of Neuropeptide Cell Biology at High and Low Activity in a Defined Sensory Neuron.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 29, National Academy of Sciences, 2018, pp. E6890–99, doi:<a href=\"https://doi.org/10.1073/pnas.1714610115\">10.1073/pnas.1714610115</a>.","short":"P. Laurent, Q. Ch’ng, M. Jospin, C. Chen, R. Lorenzo, M. de Bono, Proceedings of the National Academy of Sciences 115 (2018) E6890–E6899.","ama":"Laurent P, Ch’ng Q, Jospin M, Chen C, Lorenzo R, de Bono M. Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(29):E6890-E6899. doi:<a href=\"https://doi.org/10.1073/pnas.1714610115\">10.1073/pnas.1714610115</a>","apa":"Laurent, P., Ch’ng, Q., Jospin, M., Chen, C., Lorenzo, R., &#38; de Bono, M. (2018). Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1714610115\">https://doi.org/10.1073/pnas.1714610115</a>","ista":"Laurent P, Ch’ng Q, Jospin M, Chen C, Lorenzo R, de Bono M. 2018. Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. Proceedings of the National Academy of Sciences. 115(29), E6890–E6899.","ieee":"P. Laurent, Q. Ch’ng, M. Jospin, C. Chen, R. Lorenzo, and M. de Bono, “Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 29. National Academy of Sciences, pp. E6890–E6899, 2018."},"day":"17","external_id":{"pmid":["29959203"]},"month":"07","date_updated":"2021-01-12T08:06:09Z","abstract":[{"lang":"eng","text":"Neuropeptides are ubiquitous modulators of behavior and physiology. They are packaged in specialized secretory organelles called dense core vesicles (DCVs) that are released upon neural stimulation. Unlike synaptic vesicles, which can be recycled and refilled close to release sites, DCVs must be replenished by de novo synthesis in the cell body. Here, we dissect DCV cell biology in vivo in a Caenorhabditis elegans sensory neuron whose tonic activity we can control using a natural stimulus. We express fluorescently tagged neuropeptides in the neuron and define parameters that describe their subcellular distribution. We measure these parameters at high and low neural activity in 187 mutants defective in proteins implicated in membrane traffic, neuroendocrine secretion, and neuronal or synaptic activity. Using unsupervised hierarchical clustering methods, we analyze these data and identify 62 groups of genes with similar mutant phenotypes. We explore the function of a subset of these groups. We recapitulate many previous findings, validating our paradigm. We uncover a large battery of proteins involved in recycling DCV membrane proteins, something hitherto poorly explored. We show that the unfolded protein response promotes DCV production, which may contribute to intertissue communication of stress. We also find evidence that different mechanisms of priming and exocytosis may operate at high and low neural activity. Our work provides a defined framework to study DCV biology at different neural activity levels."}],"quality_controlled":"1","oa_version":"Published Version","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","pmid":1,"intvolume":"       115","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"status":"public","ddc":["570"],"publication_identifier":{"issn":["0027-8424","1091-6490"]},"publication":"Proceedings of the National Academy of Sciences","_id":"6109","has_accepted_license":"1","author":[{"last_name":"Laurent","first_name":"Patrick","full_name":"Laurent, Patrick"},{"first_name":"QueeLim","last_name":"Ch’ng","full_name":"Ch’ng, QueeLim"},{"last_name":"Jospin","first_name":"Maëlle","full_name":"Jospin, Maëlle"},{"last_name":"Chen","first_name":"Changchun","full_name":"Chen, Changchun"},{"full_name":"Lorenzo, Ramiro","first_name":"Ramiro","last_name":"Lorenzo"},{"orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","last_name":"de Bono","first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"}],"file":[{"relation":"main_file","date_updated":"2020-07-14T12:47:19Z","file_size":1567765,"content_type":"application/pdf","checksum":"5e81665377441cdd8d99ab952c534319","file_id":"6110","date_created":"2019-03-19T13:01:58Z","creator":"kschuh","access_level":"open_access","file_name":"2018_PNAS_Laurent.pdf"}],"extern":"1","language":[{"iso":"eng"}],"doi":"10.1073/pnas.1714610115","date_published":"2018-07-17T00:00:00Z"},{"day":"07","date_created":"2019-03-19T13:09:28Z","volume":14,"citation":{"ieee":"I. G. McLachlan, I. Beets, M. de Bono, and M. G. Heiman, “A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism,” <i>PLOS Genetics</i>, vol. 14, no. 6. Public Library of Science, 2018.","ama":"McLachlan IG, Beets I, de Bono M, Heiman MG. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. <i>PLOS Genetics</i>. 2018;14(6). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007435\">10.1371/journal.pgen.1007435</a>","short":"I.G. McLachlan, I. Beets, M. de Bono, M.G. Heiman, PLOS Genetics 14 (2018).","ista":"McLachlan IG, Beets I, de Bono M, Heiman MG. 2018. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. 14(6), e1007435.","apa":"McLachlan, I. G., Beets, I., de Bono, M., &#38; Heiman, M. G. (2018). A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. <i>PLOS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007435\">https://doi.org/10.1371/journal.pgen.1007435</a>","chicago":"McLachlan, Ian G., Isabel Beets, Mario de Bono, and Maxwell G. Heiman. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” <i>PLOS Genetics</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pgen.1007435\">https://doi.org/10.1371/journal.pgen.1007435</a>.","mla":"McLachlan, Ian G., et al. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” <i>PLOS Genetics</i>, vol. 14, no. 6, e1007435, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007435\">10.1371/journal.pgen.1007435</a>."},"article_number":"e1007435","issue":"6","type":"journal_article","title":"A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism","file_date_updated":"2020-07-14T12:47:19Z","year":"2018","publisher":"Public Library of Science","publication_status":"published","file":[{"date_created":"2019-03-19T13:18:01Z","creator":"kschuh","access_level":"open_access","checksum":"622036b945365dbc575bea2768aa9bc8","content_type":"application/pdf","file_id":"6112","relation":"main_file","date_updated":"2020-07-14T12:47:19Z","file_size":13011506,"file_name":"2018_PLOS_McLachlan.pdf"}],"extern":"1","language":[{"iso":"eng"}],"doi":"10.1371/journal.pgen.1007435","date_published":"2018-06-07T00:00:00Z","publication":"PLOS Genetics","ddc":["570"],"publication_identifier":{"issn":["1553-7404"]},"_id":"6111","has_accepted_license":"1","author":[{"first_name":"Ian G.","last_name":"McLachlan","full_name":"McLachlan, Ian G."},{"last_name":"Beets","first_name":"Isabel","full_name":"Beets, Isabel"},{"orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","last_name":"de Bono","first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Maxwell G.","last_name":"Heiman","full_name":"Heiman, Maxwell G."}],"quality_controlled":"1","oa_version":"Published Version","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        14","pmid":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","external_id":{"pmid":["29879119"]},"month":"06","date_updated":"2021-01-12T08:06:11Z","abstract":[{"lang":"eng","text":"Neurons develop elaborate morphologies that provide a model for understanding cellular architecture. By studying C. elegans sensory dendrites, we previously identified genes that act to promote the extension of ciliated sensory dendrites during embryogenesis. Interestingly, the nonciliated dendrite of the oxygen-sensing neuron URX is not affected by these genes, suggesting it develops through a distinct mechanism. Here, we use a visual forward genetic screen to identify mutants that affect URX dendrite morphogenesis. We find that disruption of the MAP kinase MAPK-15 or the βH-spectrin SMA-1 causes a phenotype opposite to what we had seen before: dendrites extend normally during embryogenesis but begin to overgrow as the animals reach adulthood, ultimately extending up to 150% of their normal length. SMA-1 is broadly expressed and acts non-cell-autonomously, while MAPK-15 is expressed in many sensory neurons including URX and acts cell-autonomously. MAPK-15 acts at the time of overgrowth, localizes at the dendrite ending, and requires its kinase activity, suggesting it acts locally in time and space to constrain dendrite growth. Finally, we find that the oxygen-sensing guanylate cyclase GCY-35, which normally localizes at the dendrite ending, is localized throughout the overgrown region, and that overgrowth can be suppressed by overexpressing GCY-35 or by genetically mimicking elevated cGMP signaling. These results suggest that overgrowth may correspond to expansion of a sensory compartment at the dendrite ending, reminiscent of the remodeling of sensory cilia or dendritic spines. Thus, in contrast to established pathways that promote dendrite growth during early development, our results reveal a distinct mechanism that constrains dendrite growth throughout the life of the animal, possibly by controlling the size of a sensory compartment at the dendrite ending."}]},{"article_number":"e32073","citation":{"ama":"Pull C, Ugelvig LV, Wiesenhofer F, et al. Destructive disinfection of infected brood prevents systemic disease spread in ant colonies. <i>eLife</i>. 2018;7. doi:<a href=\"https://doi.org/10.7554/eLife.32073\">10.7554/eLife.32073</a>","short":"C. Pull, L.V. Ugelvig, F. Wiesenhofer, A.V. Grasse, S. Tragust, T. Schmitt, M. Brown, S. Cremer, ELife 7 (2018).","apa":"Pull, C., Ugelvig, L. V., Wiesenhofer, F., Grasse, A. V., Tragust, S., Schmitt, T., … Cremer, S. (2018). Destructive disinfection of infected brood prevents systemic disease spread in ant colonies. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.32073\">https://doi.org/10.7554/eLife.32073</a>","ista":"Pull C, Ugelvig LV, Wiesenhofer F, Grasse AV, Tragust S, Schmitt T, Brown M, Cremer S. 2018. Destructive disinfection of infected brood prevents systemic disease spread in ant colonies. eLife. 7, e32073.","chicago":"Pull, Christopher, Line V Ugelvig, Florian Wiesenhofer, Anna V Grasse, Simon Tragust, Thomas Schmitt, Mark Brown, and Sylvia Cremer. “Destructive Disinfection of Infected Brood Prevents Systemic Disease Spread in Ant Colonies.” <i>ELife</i>. eLife Sciences Publications, 2018. <a href=\"https://doi.org/10.7554/eLife.32073\">https://doi.org/10.7554/eLife.32073</a>.","mla":"Pull, Christopher, et al. “Destructive Disinfection of Infected Brood Prevents Systemic Disease Spread in Ant Colonies.” <i>ELife</i>, vol. 7, e32073, eLife Sciences Publications, 2018, doi:<a href=\"https://doi.org/10.7554/eLife.32073\">10.7554/eLife.32073</a>.","ieee":"C. Pull <i>et al.</i>, “Destructive disinfection of infected brood prevents systemic disease spread in ant colonies,” <i>eLife</i>, vol. 7. eLife Sciences Publications, 2018."},"date_created":"2018-12-11T11:47:31Z","volume":7,"pubrep_id":"978","scopus_import":"1","ec_funded":1,"day":"09","publication_status":"published","publisher":"eLife Sciences Publications","corr_author":"1","year":"2018","type":"journal_article","title":"Destructive disinfection of infected brood prevents systemic disease spread in ant colonies","file_date_updated":"2020-07-14T12:47:20Z","has_accepted_license":"1","author":[{"id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","last_name":"Pull","first_name":"Christopher","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883"},{"last_name":"Wiesenhofer","first_name":"Florian","full_name":"Wiesenhofer, Florian","id":"39523C54-F248-11E8-B48F-1D18A9856A87"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","full_name":"Grasse, Anna V","first_name":"Anna V","last_name":"Grasse"},{"full_name":"Tragust, Simon","last_name":"Tragust","first_name":"Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schmitt","first_name":"Thomas","full_name":"Schmitt, Thomas"},{"last_name":"Brown","first_name":"Mark","full_name":"Brown, Mark"},{"first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"_id":"616","isi":1,"ddc":["570","590"],"publication":"eLife","doi":"10.7554/eLife.32073","department":[{"_id":"SyCr"}],"date_published":"2018-01-09T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_id":"4832","checksum":"540f941e8d3530a9441e4affd94f07d7","content_type":"application/pdf","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:10:43Z","file_size":1435585,"relation":"main_file","date_updated":"2020-07-14T12:47:20Z","file_name":"IST-2018-978-v1+1_elife-32073-v1.pdf"}],"project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"243071"},{"call_identifier":"FP7","grant_number":"302004","name":"Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach","_id":"25DDF0F0-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"Yes","date_updated":"2026-04-08T14:19:10Z","abstract":[{"lang":"eng","text":"Social insects protect their colonies from infectious disease through collective defences that result in social immunity. In ants, workers first try to prevent infection of colony members. Here, we show that if this fails and a pathogen establishes an infection, ants employ an efficient multicomponent behaviour − &quot;destructive disinfection&quot; − to prevent further spread of disease through the colony. Ants specifically target infected pupae during the pathogen's non-contagious incubation period, relying on chemical 'sickness cues' emitted by pupae. They then remove the pupal cocoon, perforate its cuticle and administer antimicrobial poison, which enters the body and prevents pathogen replication from the inside out. Like the immune system of a body that specifically targets and eliminates infected cells, this social immunity measure sacrifices infected brood to stop the pathogen completing its lifecycle, thus protecting the rest of the colony. Hence, the same principles of disease defence apply at different levels of biological organisation."}],"month":"01","publist_id":"7188","external_id":{"isi":["000419601300001"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"819","status":"public","relation":"dissertation_contains"}]},"intvolume":"         7","quality_controlled":"1","oa_version":"Published Version"},{"quality_controlled":"1","oa_version":"None","type":"conference","title":"Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"     11255","page":"82-96","year":"2018","date_updated":"2022-01-27T15:26:39Z","abstract":[{"text":"In this paper, we propose an algorithm to build discrete spherical shell having integer center and real-valued inner and outer radii on the face-centered cubic (FCC) grid. We address the problem by mapping it to a 2D scenario and building the shell layer by layer on hexagonal grids with additive manufacturing in mind. The layered hexagonal grids get shifted according to need as we move from one layer to another and forms the FCC grid in 3D. However, we restrict our computation strictly to 2D in order to utilize symmetry and simplicity.","lang":"eng"}],"place":"Cham","publication_status":"published","month":"11","publisher":"Springer","conference":{"name":"IWCIA: International Workshop on Combinatorial Image Analysis","location":"Porto, Portugal","start_date":"2018-11-22","end_date":"2018-11-24"},"day":"22","article_processing_charge":"No","extern":"1","doi":"10.1007/978-3-030-05288-1_7","date_published":"2018-11-22T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2019-03-21T12:16:58Z","publication_identifier":{"eisbn":["978-3-030-05288-1"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-030-05287-4"]},"publication":"19th International Workshop","volume":11255,"author":[{"full_name":"Koshti, Girish","first_name":"Girish","last_name":"Koshti"},{"last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin","first_name":"Gaëlle"},{"full_name":"Zrour, Rita","last_name":"Zrour","first_name":"Rita"},{"first_name":"Eric","last_name":"Andres","full_name":"Andres, Eric"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"_id":"6164","citation":{"ieee":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, and P. Bhowmick, “Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D,” in <i>19th International Workshop</i>, Porto, Portugal, 2018, vol. 11255, pp. 82–96.","mla":"Koshti, Girish, et al. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.” <i>19th International Workshop</i>, vol. 11255, Springer, 2018, pp. 82–96, doi:<a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">10.1007/978-3-030-05288-1_7</a>.","chicago":"Koshti, Girish, Ranita Biswas, Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres, and Partha Bhowmick. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.” In <i>19th International Workshop</i>, 11255:82–96. Cham: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">https://doi.org/10.1007/978-3-030-05288-1_7</a>.","ista":"Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. 2018. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. 19th International Workshop. IWCIA: International Workshop on Combinatorial Image Analysis, LNCS, vol. 11255, 82–96.","apa":"Koshti, G., Biswas, R., Largeteau-Skapin, G., Zrour, R., Andres, E., &#38; Bhowmick, P. (2018). Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In <i>19th International Workshop</i> (Vol. 11255, pp. 82–96). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">https://doi.org/10.1007/978-3-030-05288-1_7</a>","short":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, P. Bhowmick, in:, 19th International Workshop, Springer, Cham, 2018, pp. 82–96.","ama":"Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In: <i>19th International Workshop</i>. Vol 11255. Cham: Springer; 2018:82-96. doi:<a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">10.1007/978-3-030-05288-1_7</a>"},"alternative_title":["LNCS"]},{"pmid":1,"intvolume":"        31","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"status":"public","article_type":"original","oa_version":"Published Version","quality_controlled":"1","month":"01","abstract":[{"lang":"eng","text":"Insects are exposed to a variety of potential pathogens in their environment, many of which can severely impact fitness and health. Consequently, hosts have evolved resistance and tolerance strategies to suppress or cope with infections. Hosts utilizing resistance improve fitness by clearing or reducing pathogen loads, and hosts utilizing tolerance reduce harmful fitness effects per pathogen load. To understand variation in, and selective pressures on, resistance and tolerance, we asked to what degree they are shaped by host genetic background, whether plasticity in these responses depends upon dietary environment, and whether there are interactions between these two factors. Females from ten wild-type Drosophila melanogaster genotypes were kept on high- or low-protein (yeast) diets and infected with one of two opportunistic bacterial pathogens, Lactococcus lactis or Pseudomonas entomophila. We measured host resistance as the inverse of bacterial load in the early infection phase. The relationship (slope) between fly fecundity and individual-level bacteria load provided our fecundity tolerance measure. Genotype and dietary yeast determined host fecundity and strongly affected survival after infection with pathogenic P. entomophila. There was considerable genetic variation in host resistance, a commonly found phenomenon resulting from for example varying resistance costs or frequency-dependent selection. Despite this variation and the reproductive cost of higher P. entomophila loads, fecundity tolerance did not vary across genotypes. The absence of genetic variation in tolerance may suggest that at this early infection stage, fecundity tolerance is fixed or that any evolved tolerance mechanisms are not expressed under these infection conditions."}],"date_updated":"2026-06-18T19:00:18Z","external_id":{"pmid":["29150962"],"isi":["000419307000014"]},"publist_id":"7187","acknowledgement":"We would like to thank Susann Wicke for performing the genome-wide SNP/indel analyses, as well as Veronica Alves, Kevin Ferro, Momir Futo, Barbara Hasert, Dafne Maximo, Nora Schulz, Marlene Sroka, and Barth Wieczorek for technical help. We thank Brian Lazzaro for the L. lactis strain and Bruno Lemaitre for the Pseudomonas entomophila strain. We would like to thank two anonymous reviewers for their helpful comments. We are grateful to the Deutsche Forschungsgemeinschaft (DFG) priority programme 1399 ‘Host parasite coevolution’ for funding this project (AR 872/1-1). ","language":[{"iso":"eng"}],"department":[{"_id":"SyCr"}],"date_published":"2018-01-01T00:00:00Z","doi":"10.1111/jeb.13211","article_processing_charge":"No","isi":1,"_id":"617","author":[{"last_name":"Kutzer","first_name":"Megan","orcid":"0000-0002-8696-6978","full_name":"Kutzer, Megan","id":"29D0B332-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kurtz","first_name":"Joachim","full_name":"Kurtz, Joachim"},{"first_name":"Sophie","last_name":"Armitage","full_name":"Armitage, Sophie"}],"ddc":["570"],"publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]},"publication":"Journal of Evolutionary Biology","title":"Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance","type":"journal_article","issue":"1","publisher":"Wiley","publication_status":"published","page":"159  - 171","year":"2018","scopus_import":"1","day":"01","citation":{"ieee":"M. Kutzer, J. Kurtz, and S. Armitage, “Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance,” <i>Journal of Evolutionary Biology</i>, vol. 31, no. 1. Wiley, pp. 159–171, 2018.","apa":"Kutzer, M., Kurtz, J., &#38; Armitage, S. (2018). Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance. <i>Journal of Evolutionary Biology</i>. Wiley. <a href=\"https://doi.org/10.1111/jeb.13211\">https://doi.org/10.1111/jeb.13211</a>","ista":"Kutzer M, Kurtz J, Armitage S. 2018. Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance. Journal of Evolutionary Biology. 31(1), 159–171.","short":"M. Kutzer, J. Kurtz, S. Armitage, Journal of Evolutionary Biology 31 (2018) 159–171.","ama":"Kutzer M, Kurtz J, Armitage S. Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance. <i>Journal of Evolutionary Biology</i>. 2018;31(1):159-171. doi:<a href=\"https://doi.org/10.1111/jeb.13211\">10.1111/jeb.13211</a>","mla":"Kutzer, Megan, et al. “Genotype and Diet Affect Resistance, Survival, and Fecundity but Not Fecundity Tolerance.” <i>Journal of Evolutionary Biology</i>, vol. 31, no. 1, Wiley, 2018, pp. 159–71, doi:<a href=\"https://doi.org/10.1111/jeb.13211\">10.1111/jeb.13211</a>.","chicago":"Kutzer, Megan, Joachim Kurtz, and Sophie Armitage. “Genotype and Diet Affect Resistance, Survival, and Fecundity but Not Fecundity Tolerance.” <i>Journal of Evolutionary Biology</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/jeb.13211\">https://doi.org/10.1111/jeb.13211</a>."},"volume":31,"date_created":"2018-12-11T11:47:31Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/jeb.13211"}]},{"date_created":"2019-03-28T09:20:06Z","publication":"arXiv","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07752"}],"_id":"6183","article_number":"1804.07752","citation":{"ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and  cusps,” <i>arXiv</i>. .","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and  Cusps.” <i>ArXiv</i>, 1804.07752, doi:<a href=\"https://doi.org/10.48550/arXiv.1804.07752\">10.48550/arXiv.1804.07752</a>.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and  Cusps.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1804.07752\">https://doi.org/10.48550/arXiv.1804.07752</a>.","ista":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. arXiv, 1804.07752.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1804.07752\">https://doi.org/10.48550/arXiv.1804.07752</a>","short":"J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1804.07752\">10.48550/arXiv.1804.07752</a>"},"author":[{"full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Krüger","first_name":"Torben H","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87"}],"project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"day":"20","article_processing_charge":"No","ec_funded":1,"language":[{"iso":"eng"}],"acknowledgement":"Partially funded by ERC Advanced Grant RANMAT No. 338804.\r\nPartially supported by the Hausdorff Center for Mathematics.\r\n","doi":"10.48550/arXiv.1804.07752","department":[{"_id":"LaEr"}],"date_published":"2018-04-20T00:00:00Z","external_id":{"arxiv":["1804.07752"]},"year":"2018","month":"04","abstract":[{"text":"We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z - a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq 0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$. We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect to the Lebesgue measure, which\r\nis supported on finitely many intervals, called bands. In fact, the density is\r\nanalytic inside the bands with a square-root growth at the edges and internal\r\ncubic root cusps whenever the gap between two bands vanishes. The shape of\r\nthese singularities is universal and no other singularity may occur. We give a\r\nprecise asymptotic description of $m$ near the singular points. These\r\nasymptotics generalize the analysis at the regular edges given in the companion\r\npaper on the Tracy-Widom universality for the edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744] and they play a key role in the\r\nproof of the Pearcey universality at the cusp for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically rigid under\r\ndeformations and we conclude that these masses are quantized in some important\r\ncases.","lang":"eng"}],"date_updated":"2026-04-08T14:11:36Z","publication_status":"draft","arxiv":1,"oa_version":"Preprint","related_material":{"record":[{"relation":"later_version","status":"public","id":"14694"},{"id":"149","status":"public","relation":"dissertation_contains"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"preprint","title":"The Dyson equation with linear self-energy: Spectral bands, edges and  cusps","status":"public"},{"publication_status":"published","abstract":[{"lang":"eng","text":"In the context of robotic manipulation and grasping, the shift from a view that is static (force closure of a single posture) and contact-deprived (only contact for force closure is allowed, everything else is obstacle) towards a view that is dynamic and contact-rich (soft manipulation) has led to an increased interest in soft hands. These hands can easily exploit environmental constraints and object surfaces without risk, and safely interact with humans, but present also some challenges. Designing them is difficult, as well as predicting, modelling, and “programming” their interactions with the objects and the environment. This paper tackles the problem of simulating them in a fast and effective way, leveraging on novel and existing simulation technologies. We present a triple-layered simulation framework where dynamic properties such as stiffness are determined from slow but accurate FEM simulation data once, and then condensed into a lumped parameter model that can be used to fast simulate soft fingers and soft hands. We apply our approach to the simulation of soft pneumatic fingers."}],"date_updated":"2023-09-19T14:49:03Z","publisher":"IEEE","month":"09","year":"2018","external_id":{"isi":["000446394503031"]},"status":"public","title":"Efficient FEM-based simulation of soft robots modeled as kinematic chains","type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"None","quality_controlled":"1","author":[{"last_name":"Pozzi","first_name":"Maria","full_name":"Pozzi, Maria"},{"full_name":"Miguel Villalba, Eder","orcid":"0000-0001-5665-0430","first_name":"Eder","last_name":"Miguel Villalba","id":"3FB91342-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Deimel, Raphael","first_name":"Raphael","last_name":"Deimel"},{"first_name":"Monica","last_name":"Malvezzi","full_name":"Malvezzi, Monica"},{"last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brock, Oliver","first_name":"Oliver","last_name":"Brock"},{"first_name":"Domenico","last_name":"Prattichizzo","full_name":"Prattichizzo, Domenico"}],"citation":{"ieee":"M. Pozzi <i>et al.</i>, “Efficient FEM-based simulation of soft robots modeled as kinematic chains,” presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia, 2018.","chicago":"Pozzi, Maria, Eder Miguel Villalba, Raphael Deimel, Monica Malvezzi, Bernd Bickel, Oliver Brock, and Domenico Prattichizzo. “Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains.” IEEE, 2018. <a href=\"https://doi.org/10.1109/icra.2018.8461106\">https://doi.org/10.1109/icra.2018.8461106</a>.","mla":"Pozzi, Maria, et al. <i>Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains</i>. 8461106, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/icra.2018.8461106\">10.1109/icra.2018.8461106</a>.","short":"M. Pozzi, E. Miguel Villalba, R. Deimel, M. Malvezzi, B. Bickel, O. Brock, D. Prattichizzo, in:, IEEE, 2018.","ama":"Pozzi M, Miguel Villalba E, Deimel R, et al. Efficient FEM-based simulation of soft robots modeled as kinematic chains. In: IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/icra.2018.8461106\">10.1109/icra.2018.8461106</a>","ista":"Pozzi M, Miguel Villalba E, Deimel R, Malvezzi M, Bickel B, Brock O, Prattichizzo D. 2018. Efficient FEM-based simulation of soft robots modeled as kinematic chains. ICRA: International Conference on Robotics and Automation, 8461106.","apa":"Pozzi, M., Miguel Villalba, E., Deimel, R., Malvezzi, M., Bickel, B., Brock, O., &#38; Prattichizzo, D. (2018). Efficient FEM-based simulation of soft robots modeled as kinematic chains. Presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia: IEEE. <a href=\"https://doi.org/10.1109/icra.2018.8461106\">https://doi.org/10.1109/icra.2018.8461106</a>"},"article_number":"8461106","isi":1,"_id":"6195","publication_identifier":{"isbn":["9781538630815"]},"date_created":"2019-04-04T09:50:38Z","date_published":"2018-09-10T00:00:00Z","department":[{"_id":"BeBi"}],"doi":"10.1109/icra.2018.8461106","language":[{"iso":"eng"}],"scopus_import":"1","conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2018-05-21","location":"Brisbane, Australia","end_date":"2018-05-25"},"article_processing_charge":"No","day":"10"},{"quality_controlled":"1","oa_version":"Published Version","article_type":"original","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"related_material":{"link":[{"relation":"erratum","url":"http://doi.org/10.1038/s41598-018-36220-7"}]},"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"         8","publist_id":"7992","external_id":{"isi":["000445336600015"]},"abstract":[{"lang":"eng","text":"Imaging is a dominant strategy for data collection in neuroscience, yielding stacks of images that often scale to gigabytes of data for a single experiment. Machine learning algorithms from computer vision can serve as a pair of virtual eyes that tirelessly processes these images, automatically detecting and identifying microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specific contextual clues and requires no training. This approach generalizes across different modalities, including serially-sectioned scanning electron microscopy (sSEM) of genetically labeled and contrast enhanced processes, spectral confocal reflectance (SCoRe) microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets, demonstrating the high biological fidelity of the pipeline’s reconstructions. FLoRIN reconstructions are of sufficient quality for preliminary biological study, for example examining the distribution and morphology of cells or extracting single axons from functional data. Compared to existing supervised learning methods, FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively."}],"date_updated":"2023-09-11T14:02:55Z","month":"09","file":[{"file_name":"2018_ScientificReports_Shahbazi.pdf","date_updated":"2020-07-14T12:47:24Z","relation":"main_file","file_size":4141645,"date_created":"2018-12-17T12:22:24Z","creator":"dernst","access_level":"open_access","file_id":"5699","content_type":"application/pdf","checksum":"1a14ae0666b82fbaa04bef110e3f6bf2"}],"article_processing_charge":"No","doi":"10.1038/s41598-018-32628-3","department":[{"_id":"MaJö"}],"date_published":"2018-09-24T00:00:00Z","language":[{"iso":"eng"}],"acknowledgement":"Equipment was generously donated by the NVIDIA Corporation, and made available by the National Science Foundation (NSF) through grant #CNS-1629914. This research used resources of the Argonne Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC02-06CH11357.","ddc":["570"],"publication":"Scientific Reports","has_accepted_license":"1","author":[{"last_name":"Shabazi","first_name":"Ali","full_name":"Shabazi, Ali"},{"full_name":"Kinnison, Jeffery","first_name":"Jeffery","last_name":"Kinnison"},{"last_name":"Vescovi","first_name":"Rafael","full_name":"Vescovi, Rafael"},{"last_name":"Du","first_name":"Ming","full_name":"Du, Ming"},{"full_name":"Hill, Robert","first_name":"Robert","last_name":"Hill"},{"full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","first_name":"Maximilian A","last_name":"Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Takeno","first_name":"Marc","full_name":"Takeno, Marc"},{"full_name":"Zeng, Hongkui","last_name":"Zeng","first_name":"Hongkui"},{"first_name":"Nuno","last_name":"Da Costa","full_name":"Da Costa, Nuno"},{"first_name":"Jaime","last_name":"Grutzendler","full_name":"Grutzendler, Jaime"},{"full_name":"Kasthuri, Narayanan","last_name":"Kasthuri","first_name":"Narayanan"},{"first_name":"Walter","last_name":"Scheirer","full_name":"Scheirer, Walter"}],"_id":"62","isi":1,"issue":"1","type":"journal_article","file_date_updated":"2020-07-14T12:47:24Z","title":"Flexible learning-free segmentation and reconstruction of neural volumes","year":"2018","publication_status":"published","publisher":"Nature Publishing Group","day":"24","scopus_import":"1","date_created":"2018-12-11T11:44:25Z","volume":8,"article_number":"14247","citation":{"chicago":"Shabazi, Ali, Jeffery Kinnison, Rafael Vescovi, Ming Du, Robert Hill, Maximilian A Jösch, Marc Takeno, et al. “Flexible Learning-Free Segmentation and Reconstruction of Neural Volumes.” <i>Scientific Reports</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41598-018-32628-3\">https://doi.org/10.1038/s41598-018-32628-3</a>.","mla":"Shabazi, Ali, et al. “Flexible Learning-Free Segmentation and Reconstruction of Neural Volumes.” <i>Scientific Reports</i>, vol. 8, no. 1, 14247, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-32628-3\">10.1038/s41598-018-32628-3</a>.","ama":"Shabazi A, Kinnison J, Vescovi R, et al. Flexible learning-free segmentation and reconstruction of neural volumes. <i>Scientific Reports</i>. 2018;8(1). doi:<a href=\"https://doi.org/10.1038/s41598-018-32628-3\">10.1038/s41598-018-32628-3</a>","short":"A. Shabazi, J. Kinnison, R. Vescovi, M. Du, R. Hill, M.A. Jösch, M. Takeno, H. Zeng, N. Da Costa, J. Grutzendler, N. Kasthuri, W. Scheirer, Scientific Reports 8 (2018).","ista":"Shabazi A, Kinnison J, Vescovi R, Du M, Hill R, Jösch MA, Takeno M, Zeng H, Da Costa N, Grutzendler J, Kasthuri N, Scheirer W. 2018. Flexible learning-free segmentation and reconstruction of neural volumes. Scientific Reports. 8(1), 14247.","apa":"Shabazi, A., Kinnison, J., Vescovi, R., Du, M., Hill, R., Jösch, M. A., … Scheirer, W. (2018). Flexible learning-free segmentation and reconstruction of neural volumes. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41598-018-32628-3\">https://doi.org/10.1038/s41598-018-32628-3</a>","ieee":"A. Shabazi <i>et al.</i>, “Flexible learning-free segmentation and reconstruction of neural volumes,” <i>Scientific Reports</i>, vol. 8, no. 1. Nature Publishing Group, 2018."}},{"date_published":"2018-01-04T00:00:00Z","department":[{"_id":"DaSi"}],"doi":"10.1242/jcs.207696","language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"last_name":"Yamamoto","first_name":"Wataru","full_name":"Yamamoto, Wataru"},{"full_name":"Wada, Suguru","first_name":"Suguru","last_name":"Wada"},{"last_name":"Nagano","first_name":"Makoto","full_name":"Nagano, Makoto"},{"full_name":"Aoshima, Kaito","last_name":"Aoshima","first_name":"Kaito"},{"orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E","first_name":"Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Toshima, Junko","first_name":"Junko","last_name":"Toshima"},{"first_name":"Jiro","last_name":"Toshima","full_name":"Toshima, Jiro"}],"isi":1,"_id":"620","publication":"Journal of Cell Science","ddc":["570"],"status":"public","pmid":1,"intvolume":"       131","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","quality_controlled":"1","abstract":[{"lang":"eng","text":"Clathrin-mediated endocytosis requires the coordinated assembly of various endocytic proteins and lipids at the plasma membrane. Accumulating evidence demonstrates a crucial role for phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) in endocytosis, but specific roles for PtdIns(4)P other than as the biosynthetic precursor of PtdIns(4,5)P2 have not been clarified. In this study we investigated the role of PtdIns(4)P or PtdIns(4,5)P2 in receptor-mediated endocytosis through the construction of temperature-sensitive (ts) mutants for the PI 4-kinases Stt4p and Pik1p and the PtdIns(4) 5-kinase Mss4p. Quantitative analyses of endocytosis revealed that both the stt4(ts)pik1(ts) and mss4(ts) mutants have a severe defect in endocytic internalization. Live-cell imaging of endocytic protein dynamics in stt4(ts)pik1(ts) and mss4(ts) mutants revealed that PtdIns(4)P is required for the recruitment of the alpha-factor receptor Ste2p to clathrin-coated pits whereas PtdIns(4,5)P2 is required for membrane internalization. We also found that the localization to endocytic sites of the ENTH/ANTH domain-bearing clathrin adaptors, Ent1p/Ent2p and Yap1801p/Yap1802p, is significantly impaired in the stt4(ts)pik1(ts) mutant, but not in the mss4(ts) mutant. These results suggest distinct roles in successive steps for PtdIns(4)P and PtdIns(4,5)P2 during receptor-mediated endocytosis."}],"date_updated":"2026-06-18T19:01:31Z","month":"01","external_id":{"isi":["000424786900012"],"pmid":["29192062"]},"publist_id":"7184","scopus_import":"1","day":"04","article_number":"jcs207696","citation":{"ieee":"W. Yamamoto <i>et al.</i>, “Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis,” <i>Journal of Cell Science</i>, vol. 131, no. 1. Company of Biologists, 2018.","ista":"Yamamoto W, Wada S, Nagano M, Aoshima K, Siekhaus DE, Toshima J, Toshima J. 2018. Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis. Journal of Cell Science. 131(1), jcs207696.","apa":"Yamamoto, W., Wada, S., Nagano, M., Aoshima, K., Siekhaus, D. E., Toshima, J., &#38; Toshima, J. (2018). Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.207696\">https://doi.org/10.1242/jcs.207696</a>","ama":"Yamamoto W, Wada S, Nagano M, et al. Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis. <i>Journal of Cell Science</i>. 2018;131(1). doi:<a href=\"https://doi.org/10.1242/jcs.207696\">10.1242/jcs.207696</a>","short":"W. Yamamoto, S. Wada, M. Nagano, K. Aoshima, D.E. Siekhaus, J. Toshima, J. Toshima, Journal of Cell Science 131 (2018).","mla":"Yamamoto, Wataru, et al. “Distinct Roles for Plasma Membrane PtdIns 4 P and PtdIns 4 5 P2 during Yeast Receptor Mediated Endocytosis.” <i>Journal of Cell Science</i>, vol. 131, no. 1, jcs207696, Company of Biologists, 2018, doi:<a href=\"https://doi.org/10.1242/jcs.207696\">10.1242/jcs.207696</a>.","chicago":"Yamamoto, Wataru, Suguru Wada, Makoto Nagano, Kaito Aoshima, Daria E Siekhaus, Junko Toshima, and Jiro Toshima. “Distinct Roles for Plasma Membrane PtdIns 4 P and PtdIns 4 5 P2 during Yeast Receptor Mediated Endocytosis.” <i>Journal of Cell Science</i>. Company of Biologists, 2018. <a href=\"https://doi.org/10.1242/jcs.207696\">https://doi.org/10.1242/jcs.207696</a>."},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/29192062"}],"volume":131,"date_created":"2018-12-11T11:47:32Z","title":"Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis","type":"journal_article","issue":"1","publication_status":"published","publisher":"Company of Biologists","year":"2018"},{"year":"2018","publication_status":"published","publisher":"MDPI","issue":"10","file_date_updated":"2020-07-14T12:47:27Z","title":"Unusual diversity of sex chromosomes in African cichlid fishes","type":"journal_article","volume":9,"date_created":"2018-12-11T11:44:26Z","article_number":"480","citation":{"ieee":"W. J. Gammerdinger and T. Kocher, “Unusual diversity of sex chromosomes in African cichlid fishes,” <i>Genes</i>, vol. 9, no. 10. MDPI, 2018.","mla":"Gammerdinger, William J., and Thomas Kocher. “Unusual Diversity of Sex Chromosomes in African Cichlid Fishes.” <i>Genes</i>, vol. 9, no. 10, 480, MDPI, 2018, doi:<a href=\"https://doi.org/10.3390/genes9100480\">10.3390/genes9100480</a>.","chicago":"Gammerdinger, William J, and Thomas Kocher. “Unusual Diversity of Sex Chromosomes in African Cichlid Fishes.” <i>Genes</i>. MDPI, 2018. <a href=\"https://doi.org/10.3390/genes9100480\">https://doi.org/10.3390/genes9100480</a>.","ista":"Gammerdinger WJ, Kocher T. 2018. Unusual diversity of sex chromosomes in African cichlid fishes. Genes. 9(10), 480.","apa":"Gammerdinger, W. J., &#38; Kocher, T. (2018). Unusual diversity of sex chromosomes in African cichlid fishes. <i>Genes</i>. MDPI. <a href=\"https://doi.org/10.3390/genes9100480\">https://doi.org/10.3390/genes9100480</a>","short":"W.J. Gammerdinger, T. Kocher, Genes 9 (2018).","ama":"Gammerdinger WJ, Kocher T. Unusual diversity of sex chromosomes in African cichlid fishes. <i>Genes</i>. 2018;9(10). doi:<a href=\"https://doi.org/10.3390/genes9100480\">10.3390/genes9100480</a>"},"day":"04","scopus_import":"1","ec_funded":1,"external_id":{"isi":["000448656700018"]},"publist_id":"7991","abstract":[{"lang":"eng","text":"African cichlids display a remarkable assortment of jaw morphologies, pigmentation patterns, and mating behaviors. In addition to this previously documented diversity, recent studies have documented a rich diversity of sex chromosomes within these fishes. Here we review the known sex-determination network within vertebrates, and the extraordinary number of sex chromosomes systems segregating in African cichlids. We also propose a model for understanding the unusual number of sex chromosome systems within this clade."}],"date_updated":"2025-04-15T06:50:01Z","month":"10","oa_version":"Published Version","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","intvolume":"         9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication":"Genes","ddc":["570"],"author":[{"id":"3A7E01BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9638-1220","full_name":"Gammerdinger, William J","last_name":"Gammerdinger","first_name":"William J"},{"first_name":"Thomas","last_name":"Kocher","full_name":"Kocher, Thomas"}],"has_accepted_license":"1","isi":1,"_id":"63","article_processing_charge":"No","file":[{"access_level":"open_access","creator":"dernst","date_created":"2018-12-18T09:54:46Z","file_id":"5743","checksum":"bec527692e2c9b56919c0429634ff337","content_type":"application/pdf","date_updated":"2020-07-14T12:47:27Z","relation":"main_file","file_size":1415791,"file_name":"2018_Genes_Gammerdinger.pdf"}],"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"date_published":"2018-10-04T00:00:00Z","department":[{"_id":"BeVi"}],"doi":"10.3390/genes9100480","acknowledgement":"NSF DEB-1830753 and ISTPlus Fellowship","language":[{"iso":"eng"}]},{"quality_controlled":"1","oa_version":"Preprint","arxiv":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/description-of-rotating-molecules-made-easy/"}]},"intvolume":"       121","external_id":{"arxiv":["1803.07990"],"isi":["000447468400008"]},"date_updated":"2025-04-15T07:59:29Z","abstract":[{"lang":"eng","text":"We introduce a diagrammatic Monte Carlo approach to angular momentum properties of quantum many-particle systems possessing a macroscopic number of degrees of freedom. The treatment is based on a diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach is applicable at arbitrary coupling, is free of systematic errors and of finite-size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model; however, the method is quite general and can be applied to a broad variety of systems in which particles exchange quantum angular momentum with their many-body environment."}],"month":"10","project":[{"grant_number":"P29902","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment"}],"article_processing_charge":"No","doi":"10.1103/physrevlett.121.165301","date_published":"2018-10-16T00:00:00Z","department":[{"_id":"MiLe"}],"language":[{"iso":"eng"}],"publication":"Physical Review Letters","author":[{"id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo","last_name":"Bighin","first_name":"Giacomo"},{"first_name":"Timur","last_name":"Tscherbul","full_name":"Tscherbul, Timur"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"_id":"6339","isi":1,"issue":"16","type":"journal_article","title":"Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems","year":"2018","publication_status":"published","publisher":"American Physical Society","day":"16","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1803.07990","open_access":"1"}],"date_created":"2019-04-17T10:53:38Z","volume":121,"article_number":"165301","citation":{"short":"G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).","ama":"Bighin G, Tscherbul T, Lemeshko M. Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. <i>Physical Review Letters</i>. 2018;121(16). doi:<a href=\"https://doi.org/10.1103/physrevlett.121.165301\">10.1103/physrevlett.121.165301</a>","apa":"Bighin, G., Tscherbul, T., &#38; Lemeshko, M. (2018). Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.121.165301\">https://doi.org/10.1103/physrevlett.121.165301</a>","ista":"Bighin G, Tscherbul T, Lemeshko M. 2018. Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. 121(16), 165301.","chicago":"Bighin, Giacomo, Timur Tscherbul, and Mikhail Lemeshko. “Diagrammatic Monte Carlo Approach to Angular Momentum in Quantum Many-Particle Systems.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevlett.121.165301\">https://doi.org/10.1103/physrevlett.121.165301</a>.","mla":"Bighin, Giacomo, et al. “Diagrammatic Monte Carlo Approach to Angular Momentum in Quantum Many-Particle Systems.” <i>Physical Review Letters</i>, vol. 121, no. 16, 165301, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevlett.121.165301\">10.1103/physrevlett.121.165301</a>.","ieee":"G. Bighin, T. Tscherbul, and M. Lemeshko, “Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems,” <i>Physical Review Letters</i>, vol. 121, no. 16. American Physical Society, 2018."}},{"_id":"6354","has_accepted_license":"1","author":[{"full_name":"Fan, Shuxia","last_name":"Fan","first_name":"Shuxia"},{"first_name":"Michael","last_name":"Lorenz","full_name":"Lorenz, Michael"},{"full_name":"Massberg, Steffen","first_name":"Steffen","last_name":"Massberg"},{"id":"397A88EE-F248-11E8-B48F-1D18A9856A87","last_name":"Gärtner","first_name":"Florian R","orcid":"0000-0001-6120-3723","full_name":"Gärtner, Florian R"}],"publication":"Bio-Protocol","DOAJ_listed":"1","publication_identifier":{"issn":["2331-8325"]},"ddc":["570"],"acknowledgement":"This protocol was adapted from a previously published study (Gaertner et al., 2017). We thank Michael Lorenz for his excellent assistance in bacteria culture. This work was funded by the DFG SFB 914 (S.M. [B02 and Z01]), the DFG SFB 1123 (S.M. [B06]), the DFG FOR 2033 (S.M. and F.G.), the German Centre for Cardiovascular Research (DZHK) (MHA 1.4VD [S.M.]), FP7 program (project 260309, PRESTIGE [S.M.]), FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.), Marie Sklodowska Curie Individual Fellowship (EU project 747687, LamelliaActin [F.G.]).","language":[{"iso":"eng"}],"doi":"10.21769/bioprotoc.3018","date_published":"2018-09-20T00:00:00Z","department":[{"_id":"MiSi"}],"file":[{"file_name":"2018_BioProtocol_Fan.pdf","creator":"dernst","date_created":"2019-04-30T08:04:33Z","access_level":"open_access","checksum":"d4588377e789da7f360b553ae02c5119","file_id":"6360","content_type":"application/pdf","file_size":2928337,"date_updated":"2020-07-14T12:47:28Z","relation":"main_file"}],"project":[{"grant_number":"747687","call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells"}],"article_processing_charge":"Yes","OA_place":"publisher","month":"09","date_updated":"2025-05-20T07:43:06Z","abstract":[{"text":"Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow.","lang":"eng"}],"external_id":{"pmid":["34395806"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"         8","pmid":1,"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","quality_controlled":"1","oa_version":"Published Version","OA_type":"gold","citation":{"mla":"Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under Flow.” <i>Bio-Protocol</i>, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:<a href=\"https://doi.org/10.21769/bioprotoc.3018\">10.21769/bioprotoc.3018</a>.","chicago":"Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet Migration and Bacterial Trapping Assay under Flow.” <i>Bio-Protocol</i>. Bio-Protocol, 2018. <a href=\"https://doi.org/10.21769/bioprotoc.3018\">https://doi.org/10.21769/bioprotoc.3018</a>.","apa":"Fan, S., Lorenz, M., Massberg, S., &#38; Gärtner, F. R. (2018). Platelet migration and bacterial trapping assay under flow. <i>Bio-Protocol</i>. Bio-Protocol. <a href=\"https://doi.org/10.21769/bioprotoc.3018\">https://doi.org/10.21769/bioprotoc.3018</a>","ista":"Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 8(18), e3018.","short":"S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018).","ama":"Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping assay under flow. <i>Bio-Protocol</i>. 2018;8(18). doi:<a href=\"https://doi.org/10.21769/bioprotoc.3018\">10.21769/bioprotoc.3018</a>","ieee":"S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and bacterial trapping assay under flow,” <i>Bio-Protocol</i>, vol. 8, no. 18. Bio-Protocol, 2018."},"article_number":"e3018","date_created":"2019-04-29T09:40:33Z","volume":8,"ec_funded":1,"day":"20","publisher":"Bio-Protocol","publication_status":"published","corr_author":"1","year":"2018","type":"journal_article","keyword":["Platelets","Cell migration","Bacteria","Shear flow","Fibrinogen","E. coli"],"file_date_updated":"2020-07-14T12:47:28Z","title":"Platelet migration and bacterial trapping assay under flow","issue":"18"},{"intvolume":"         6","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8156"}]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"arxiv":1,"oa_version":"Published Version","quality_controlled":"1","month":"05","abstract":[{"text":"We  prove  that  any  cyclic  quadrilateral  can  be  inscribed  in  any  closed  convex C1-curve.  The smoothness condition is not required if the quadrilateral is a rectangle.","lang":"eng"}],"date_updated":"2026-04-08T07:25:54Z","external_id":{"arxiv":["1712.10205"],"isi":["000433915500001"]},"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"date_published":"2018-05-31T00:00:00Z","doi":"10.1017/fms.2018.7","article_processing_charge":"No","project":[{"call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"}],"file":[{"file_size":249246,"date_updated":"2020-07-14T12:47:28Z","relation":"main_file","checksum":"5a71b24ba712a3eb2e46165a38fbc30a","content_type":"application/pdf","file_id":"6356","date_created":"2019-04-30T06:14:58Z","creator":"dernst","access_level":"open_access","file_name":"2018_ForumMahtematics_Akopyan.pdf"}],"isi":1,"_id":"6355","author":[{"first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7840-5062","full_name":"Avvakumov, Sergey","first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","ddc":["510"],"publication_identifier":{"issn":["2050-5094"]},"publication":"Forum of Mathematics, Sigma","title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","file_date_updated":"2020-07-14T12:47:28Z","type":"journal_article","publisher":"Cambridge University Press","publication_status":"published","year":"2018","corr_author":"1","ec_funded":1,"day":"31","article_number":"e7","citation":{"mla":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” <i>Forum of Mathematics, Sigma</i>, vol. 6, e7, Cambridge University Press, 2018, doi:<a href=\"https://doi.org/10.1017/fms.2018.7\">10.1017/fms.2018.7</a>.","chicago":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2018. <a href=\"https://doi.org/10.1017/fms.2018.7\">https://doi.org/10.1017/fms.2018.7</a>.","ista":"Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7.","apa":"Akopyan, A., &#38; Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2018.7\">https://doi.org/10.1017/fms.2018.7</a>","ama":"Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. <i>Forum of Mathematics, Sigma</i>. 2018;6. doi:<a href=\"https://doi.org/10.1017/fms.2018.7\">10.1017/fms.2018.7</a>","short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).","ieee":"A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” <i>Forum of Mathematics, Sigma</i>, vol. 6. Cambridge University Press, 2018."},"volume":6,"date_created":"2019-04-30T06:09:57Z"},{"_id":"6368","author":[{"last_name":"Higginbotham","first_name":"Andrew P","full_name":"Higginbotham, Andrew P","orcid":"0000-0003-2607-2363","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"P. S.","last_name":"Burns","full_name":"Burns, P. S."},{"last_name":"Urmey","first_name":"M. D.","full_name":"Urmey, M. D."},{"full_name":"Peterson, R. W.","last_name":"Peterson","first_name":"R. W."},{"full_name":"Kampel, N. S.","first_name":"N. S.","last_name":"Kampel"},{"last_name":"Brubaker","first_name":"B. M.","full_name":"Brubaker, B. M."},{"full_name":"Smith, G.","first_name":"G.","last_name":"Smith"},{"first_name":"K. W.","last_name":"Lehnert","full_name":"Lehnert, K. W."},{"full_name":"Regal, C. A.","last_name":"Regal","first_name":"C. A."}],"publication":"Nature Physics","publication_identifier":{"issn":["1745-2473","1745-2481"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41567-018-0210-0","date_published":"2018-10-01T00:00:00Z","extern":"1","month":"10","date_updated":"2021-01-12T08:07:15Z","abstract":[{"lang":"eng","text":"An optical network of superconducting quantum bits (qubits) is an appealing platform for quantum communication and distributed quantum computing, but developing a quantum-compatible link between the microwave and optical domains remains an outstanding challenge. Operating at T < 100 mK temperatures, as required for quantum electrical circuits, we demonstrate a mechanically mediated microwave–optical converter with 47% conversion efficiency, and use a classical feed-forward protocol to reduce added noise to 38 photons. The feed-forward protocol harnesses our discovery that noise emitted from the two converter output ports is strongly correlated because both outputs record thermal motion of the same mechanical mode. We also discuss a quantum feed-forward protocol that, given high system efficiencies, would allow quantum information to be transferred even when thermal phonons enter the mechanical element faster than the electro-optic conversion rate."}],"external_id":{"arxiv":["1712.06535"]},"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        14","status":"public","arxiv":1,"quality_controlled":"1","oa_version":"Preprint","citation":{"ieee":"A. P. Higginbotham <i>et al.</i>, “Harnessing electro-optic correlations in an efficient mechanical converter,” <i>Nature Physics</i>, vol. 14, no. 10. Springer Nature, pp. 1038–1042, 2018.","chicago":"Higginbotham, Andrew P, P. S. Burns, M. D. Urmey, R. W. Peterson, N. S. Kampel, B. M. Brubaker, G. Smith, K. W. Lehnert, and C. A. Regal. “Harnessing Electro-Optic Correlations in an Efficient Mechanical Converter.” <i>Nature Physics</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41567-018-0210-0\">https://doi.org/10.1038/s41567-018-0210-0</a>.","mla":"Higginbotham, Andrew P., et al. “Harnessing Electro-Optic Correlations in an Efficient Mechanical Converter.” <i>Nature Physics</i>, vol. 14, no. 10, Springer Nature, 2018, pp. 1038–42, doi:<a href=\"https://doi.org/10.1038/s41567-018-0210-0\">10.1038/s41567-018-0210-0</a>.","ama":"Higginbotham AP, Burns PS, Urmey MD, et al. Harnessing electro-optic correlations in an efficient mechanical converter. <i>Nature Physics</i>. 2018;14(10):1038-1042. doi:<a href=\"https://doi.org/10.1038/s41567-018-0210-0\">10.1038/s41567-018-0210-0</a>","short":"A.P. Higginbotham, P.S. Burns, M.D. Urmey, R.W. Peterson, N.S. Kampel, B.M. Brubaker, G. Smith, K.W. Lehnert, C.A. Regal, Nature Physics 14 (2018) 1038–1042.","ista":"Higginbotham AP, Burns PS, Urmey MD, Peterson RW, Kampel NS, Brubaker BM, Smith G, Lehnert KW, Regal CA. 2018. Harnessing electro-optic correlations in an efficient mechanical converter. Nature Physics. 14(10), 1038–1042.","apa":"Higginbotham, A. P., Burns, P. S., Urmey, M. D., Peterson, R. W., Kampel, N. S., Brubaker, B. M., … Regal, C. A. (2018). Harnessing electro-optic correlations in an efficient mechanical converter. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-018-0210-0\">https://doi.org/10.1038/s41567-018-0210-0</a>"},"date_created":"2019-05-03T09:17:20Z","volume":14,"main_file_link":[{"url":"https://arxiv.org/abs/1712.06535","open_access":"1"}],"day":"01","publisher":"Springer Nature","publication_status":"published","page":"1038-1042","year":"2018","type":"journal_article","title":"Harnessing electro-optic correlations in an efficient mechanical converter","issue":"10"}]