[{"author":[{"full_name":"Sahoo, Subham","first_name":"Subham","last_name":"Sahoo"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"},{"last_name":"Martius","first_name":"Georg S","full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"publication_status":"published","oa":1,"intvolume":"        80","year":"2018","date_created":"2019-02-14T15:21:07Z","day":"01","publication":"Proceedings of the 35th International Conference on Machine Learning","conference":{"start_date":"2018-07-10","name":"ICML: International Conference on Machine Learning","end_date":"2018-07-15","location":"Stockholm, Sweden"},"ec_funded":1,"department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6012","page":"4442-4450","external_id":{"arxiv":["1806.07259"],"isi":["000683379204058"]},"date_updated":"2025-04-15T06:50:24Z","quality_controlled":"1","month":"02","volume":80,"title":"Learning equations for extrapolation and control","isi":1,"arxiv":1,"date_published":"2018-02-01T00:00:00Z","article_processing_charge":"No","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/first-machine-learning-method-capable-of-accurate-extrapolation/","description":"News on IST Homepage"}]},"type":"conference","status":"public","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class of learnable equations for a recently proposed equation learning network to include divisions, and we improve the learning and model selection strategy to be useful for challenging real-world data. For systems governed by analytical expressions, our method can in many cases identify the true underlying equation and extrapolate to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum system, where only 2 random rollouts are required to learn the forward dynamics and successfully achieve the swing-up task."}],"citation":{"ieee":"S. Sahoo, C. Lampert, and G. S. Martius, “Learning equations for extrapolation and control,” in <i>Proceedings of the 35th International Conference on Machine Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 4442–4450.","ama":"Sahoo S, Lampert C, Martius GS. Learning equations for extrapolation and control. In: <i>Proceedings of the 35th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:4442-4450.","chicago":"Sahoo, Subham, Christoph Lampert, and Georg S Martius. “Learning Equations for Extrapolation and Control.” In <i>Proceedings of the 35th International Conference on Machine Learning</i>, 80:4442–50. ML Research Press, 2018.","apa":"Sahoo, S., Lampert, C., &#38; Martius, G. S. (2018). Learning equations for extrapolation and control. In <i>Proceedings of the 35th International Conference on Machine Learning</i> (Vol. 80, pp. 4442–4450). Stockholm, Sweden: ML Research Press.","ista":"Sahoo S, Lampert C, Martius GS. 2018. Learning equations for extrapolation and control. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 4442–4450.","short":"S. Sahoo, C. Lampert, G.S. Martius, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 4442–4450.","mla":"Sahoo, Subham, et al. “Learning Equations for Extrapolation and Control.” <i>Proceedings of the 35th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 4442–50."},"scopus_import":"1","publisher":"ML Research Press","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.07259"}]},{"status":"public","publication":"2018 IEEE International Workshop on Signal Processing Systems","type":"conference","day":"31","publisher":"IEEE","oa_version":"None","citation":{"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.","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>","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>.","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>","short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","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.","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>."},"article_number":"8598402","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."}],"scopus_import":"1","department":[{"_id":"DaAl"}],"conference":{"name":"SiPS: Workshop on Signal Processing Systems","end_date":"2018-10-24","start_date":"2018-10-21","location":"Cape Town, South Africa"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6031","doi":"10.1109/SiPS.2018.8598402","month":"12","publication_status":"published","date_updated":"2023-09-19T14:41:51Z","quality_controlled":"1","author":[{"last_name":"Stojanov","first_name":"Alen","full_name":"Stojanov, Alen"},{"last_name":"Smith","first_name":"Tyler Michael","full_name":"Smith, Tyler Michael"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Puschel, Markus","last_name":"Puschel","first_name":"Markus"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000465106800060"]},"isi":1,"date_published":"2018-12-31T00:00:00Z","article_processing_charge":"No","date_created":"2019-02-17T22:59:25Z","title":"Fast quantized arithmetic on x86: Trading compute for data movement","year":"2018","volume":"2018-October"},{"oa_version":"Preprint","scopus_import":"1","article_number":"22","citation":{"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.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","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>.","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.","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>"},"abstract":[{"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.","lang":"eng"}],"publisher":"ACM","main_file_link":[{"url":"https://arxiv.org/abs/1602.03124","open_access":"1"}],"related_material":{"record":[{"relation":"earlier_version","id":"1192","status":"public"}]},"type":"journal_article","status":"public","volume":15,"title":"Even delta-matroids and the complexity of planar boolean CSPs","isi":1,"date_published":"2018-12-01T00:00:00Z","article_processing_charge":"No","arxiv":1,"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"date_updated":"2025-06-04T08:46:58Z","quality_controlled":"1","month":"12","department":[{"_id":"VlKo"}],"issue":"2","ec_funded":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6032","day":"01","publication":"ACM Transactions on Algorithms","year":"2018","date_created":"2019-02-17T22:59:25Z","article_type":"original","author":[{"full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandr","last_name":"Kazda"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"language":[{"iso":"eng"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"doi":"10.1145/3230649","oa":1,"publication_status":"published","intvolume":"        15"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"606","issue":"5","department":[{"_id":"JuFi"}],"page":"1267-1319","day":"01","publication":"Annales de l'Institut Henri Poincare (C) Non Linear Analysis","year":"2018","date_created":"2018-12-11T11:47:27Z","language":[{"iso":"eng"}],"author":[{"full_name":"Duerinckx, Mitia","last_name":"Duerinckx","first_name":"Mitia"},{"orcid":"0000-0002-0479-558X","first_name":"Julian L","last_name":"Fischer","full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","oa":1,"doi":"10.1016/j.anihpc.2017.11.004","intvolume":"        35","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"}],"citation":{"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>.","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>","short":"M. Duerinckx, J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non Linear Analysis 35 (2018) 1267–1319.","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.","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>.","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.","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>"},"scopus_import":"1","oa_version":"Submitted Version","publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00268"}],"type":"journal_article","status":"public","volume":35,"publist_id":"7199","title":"Well-posedness for mean-field evolutions arising in superconductivity","date_published":"2018-08-01T00:00:00Z","arxiv":1,"article_processing_charge":"No","isi":1,"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","external_id":{"arxiv":["1607.00268"],"isi":["000437975500005"]},"quality_controlled":"1","date_updated":"2023-09-19T10:39:09Z","month":"08"},{"year":"2018","date_created":"2018-12-11T11:47:28Z","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-7214-0171","last_name":"Bodova","first_name":"Katarina","full_name":"Bodova, Katarina","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Haskovec, Jan","first_name":"Jan","last_name":"Haskovec"},{"full_name":"Markowich, Peter","first_name":"Peter","last_name":"Markowich"}],"publication_status":"published","oa":1,"doi":"10.1016/j.physd.2017.10.015","_id":"607","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"page":"108-120","day":"01","publication":"Physica D: Nonlinear Phenomena","corr_author":"1","publist_id":"7198","volume":"376-377","arxiv":1,"date_published":"2018-08-01T00:00:00Z","article_processing_charge":"No","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","isi":1,"title":"Well posedness and maximum entropy approximation for the dynamics of quantitative traits","date_updated":"2024-10-09T20:58:45Z","quality_controlled":"1","external_id":{"arxiv":["1704.08757"],"isi":["000437962900012"]},"month":"08","citation":{"short":"K. Bodova, J. Haskovec, P. Markowich, Physica D: Nonlinear Phenomena 376–377 (2018) 108–120.","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.","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>.","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>","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>","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."},"scopus_import":"1","abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.08757"}],"publisher":"Elsevier","status":"public","type":"journal_article"},{"year":"2018","article_type":"original","date_created":"2018-12-11T11:47:28Z","ddc":["000"],"language":[{"iso":"eng"}],"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"intvolume":"       712","publication_status":"published","oa":1,"doi":"10.1016/j.tcs.2017.11.001","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"608","ec_funded":1,"department":[{"_id":"ToHe"}],"page":"50 - 72","day":"15","publication":"Theoretical Computer Science","corr_author":"1","publist_id":"7197","volume":712,"article_processing_charge":"No","date_published":"2018-02-15T00:00:00Z","isi":1,"title":"Synthesis from component libraries with costs","date_updated":"2026-06-18T18:58:53Z","quality_controlled":"1","external_id":{"isi":["000424959200003"]},"month":"02","citation":{"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>","ieee":"G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” <i>Theoretical Computer Science</i>, vol. 712. Elsevier, pp. 50–72, 2018.","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>.","short":"G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.","ista":"Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.","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>","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>."},"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."}],"scopus_import":"1","oa_version":"Published Version","main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529","open_access":"1"}],"publisher":"Elsevier","status":"public","type":"journal_article"},{"author":[{"full_name":"Bondarenko, Andriy","first_name":"Andriy","last_name":"Bondarenko"},{"full_name":"Mellit, Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Mellit"},{"first_name":"Andriy","last_name":"Prymak","full_name":"Prymak, Andriy"},{"last_name":"Radchenko","first_name":"Danylo","full_name":"Radchenko, Danylo"},{"first_name":"Maryna","last_name":"Viazovska","full_name":"Viazovska, Maryna"}],"date_updated":"2021-01-12T08:06:06Z","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["1509.06286"]},"month":"05","doi":"10.1007/978-3-319-72456-0_7","publication_status":"published","oa":1,"extern":"1","publist_id":"7993","year":"2018","article_processing_charge":"No","date_published":"2018-05-23T00:00:00Z","arxiv":1,"date_created":"2018-12-11T11:44:25Z","title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","day":"23","status":"public","publication":"Contemporary Computational Mathematics","type":"book_chapter","oa_version":"Preprint","abstract":[{"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. ","lang":"eng"}],"citation":{"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.","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>","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>","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>.","short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","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."},"department":[{"_id":"TaHa"}],"_id":"61","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.06286"}],"page":"131 - 134","publisher":"Springer"},{"corr_author":"1","publication":"eLife","day":"09","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"616","department":[{"_id":"SyCr"}],"ec_funded":1,"oa":1,"publication_status":"published","file":[{"creator":"system","checksum":"540f941e8d3530a9441e4affd94f07d7","access_level":"open_access","file_name":"IST-2018-978-v1+1_elife-32073-v1.pdf","date_created":"2018-12-12T10:10:43Z","file_id":"4832","file_size":1435585,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:47:20Z"}],"project":[{"call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071","_id":"25DC711C-B435-11E9-9278-68D0E5697425"},{"name":"Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach","call_identifier":"FP7","grant_number":"302004","_id":"25DDF0F0-B435-11E9-9278-68D0E5697425"}],"doi":"10.7554/eLife.32073","intvolume":"         7","file_date_updated":"2020-07-14T12:47:20Z","pubrep_id":"978","language":[{"iso":"eng"}],"ddc":["570","590"],"author":[{"orcid":"0000-0003-1122-3982","last_name":"Pull","first_name":"Christopher","full_name":"Pull, Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ugelvig","first_name":"Line V","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","full_name":"Ugelvig, Line V"},{"full_name":"Wiesenhofer, Florian","id":"39523C54-F248-11E8-B48F-1D18A9856A87","last_name":"Wiesenhofer","first_name":"Florian"},{"last_name":"Grasse","first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tragust","first_name":"Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","full_name":"Tragust, Simon"},{"first_name":"Thomas","last_name":"Schmitt","full_name":"Schmitt, Thomas"},{"full_name":"Brown, Mark","first_name":"Mark","last_name":"Brown"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868"}],"date_created":"2018-12-11T11:47:31Z","year":"2018","type":"journal_article","status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"819","status":"public"}]},"publisher":"eLife Sciences Publications","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."}],"citation":{"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.","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>","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>.","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>","short":"C. Pull, L.V. Ugelvig, F. Wiesenhofer, A.V. Grasse, S. Tragust, T. Schmitt, M. Brown, S. Cremer, ELife 7 (2018).","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.","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>."},"scopus_import":"1","article_number":"e32073","oa_version":"Published Version","month":"01","external_id":{"isi":["000419601300001"]},"date_updated":"2026-04-08T14:19:10Z","quality_controlled":"1","title":"Destructive disinfection of infected brood prevents systemic disease spread in ant colonies","article_processing_charge":"Yes","date_published":"2018-01-09T00:00:00Z","isi":1,"volume":7,"publist_id":"7188"},{"volume":31,"publist_id":"7187","title":"Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance","isi":1,"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). ","article_processing_charge":"No","date_published":"2018-01-01T00:00:00Z","external_id":{"pmid":["29150962"],"isi":["000419307000014"]},"quality_controlled":"1","date_updated":"2026-06-18T19:00:18Z","month":"01","oa_version":"Published Version","citation":{"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>","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.","short":"M. Kutzer, J. Kurtz, S. Armitage, Journal of Evolutionary Biology 31 (2018) 159–171.","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.","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>.","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>"},"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","publisher":"Wiley","main_file_link":[{"url":"https://doi.org/10.1111/jeb.13211","open_access":"1"}],"publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]},"type":"journal_article","status":"public","year":"2018","date_created":"2018-12-11T11:47:31Z","article_type":"original","author":[{"id":"29D0B332-F248-11E8-B48F-1D18A9856A87","full_name":"Kutzer, Megan","first_name":"Megan","last_name":"Kutzer","orcid":"0000-0002-8696-6978"},{"last_name":"Kurtz","first_name":"Joachim","full_name":"Kurtz, Joachim"},{"last_name":"Armitage","first_name":"Sophie","full_name":"Armitage, Sophie"}],"language":[{"iso":"eng"}],"ddc":["570"],"doi":"10.1111/jeb.13211","publication_status":"published","oa":1,"intvolume":"        31","department":[{"_id":"SyCr"}],"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"617","pmid":1,"page":"159  - 171","day":"01","publication":"Journal of Evolutionary Biology"},{"publication":"arXiv","status":"public","type":"preprint","day":"20","related_material":{"record":[{"status":"public","relation":"later_version","id":"14694"},{"status":"public","relation":"dissertation_contains","id":"149"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1804.07752","open_access":"1"}],"oa_version":"Preprint","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"}],"citation":{"ista":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and  cusps. arXiv, 1804.07752.","short":"J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).","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>.","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>","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>","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>. ."},"article_number":"1804.07752","department":[{"_id":"LaEr"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6183","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"month":"04","doi":"10.48550/arXiv.1804.07752","publication_status":"draft","oa":1,"author":[{"last_name":"Alt","first_name":"Johannes","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger","full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-08T14:11:36Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["1804.07752"]},"acknowledgement":"Partially funded by ERC Advanced Grant RANMAT No. 338804.\r\nPartially supported by the Hausdorff Center for Mathematics.\r\n","article_processing_charge":"No","arxiv":1,"date_published":"2018-04-20T00:00:00Z","date_created":"2019-03-28T09:20:06Z","title":"The Dyson equation with linear self-energy: Spectral bands, edges and  cusps","year":"2018"},{"doi":"10.1109/icra.2018.8461106","month":"09","publication_status":"published","external_id":{"isi":["000446394503031"]},"author":[{"last_name":"Pozzi","first_name":"Maria","full_name":"Pozzi, Maria"},{"id":"3FB91342-F248-11E8-B48F-1D18A9856A87","full_name":"Miguel Villalba, Eder","first_name":"Eder","last_name":"Miguel Villalba","orcid":"0000-0001-5665-0430"},{"last_name":"Deimel","first_name":"Raphael","full_name":"Deimel, Raphael"},{"full_name":"Malvezzi, Monica","last_name":"Malvezzi","first_name":"Monica"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"full_name":"Brock, Oliver","first_name":"Oliver","last_name":"Brock"},{"first_name":"Domenico","last_name":"Prattichizzo","full_name":"Prattichizzo, Domenico"}],"quality_controlled":"1","date_updated":"2023-09-19T14:49:03Z","language":[{"iso":"eng"}],"date_created":"2019-04-04T09:50:38Z","title":"Efficient FEM-based simulation of soft robots modeled as kinematic chains","isi":1,"date_published":"2018-09-10T00:00:00Z","article_processing_charge":"No","year":"2018","publication_identifier":{"isbn":["9781538630815"]},"type":"conference","status":"public","day":"10","publisher":"IEEE","conference":{"start_date":"2018-05-21","end_date":"2018-05-25","name":"ICRA: International Conference on Robotics and Automation","location":"Brisbane, Australia"},"department":[{"_id":"BeBi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6195","oa_version":"None","article_number":"8461106","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","citation":{"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>","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.","short":"M. Pozzi, E. Miguel Villalba, R. Deimel, M. Malvezzi, B. Bickel, O. Brock, D. Prattichizzo, in:, IEEE, 2018.","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.","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>.","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>.","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>"}},{"type":"journal_article","status":"public","related_material":{"link":[{"relation":"erratum","url":"http://doi.org/10.1038/s41598-018-36220-7"}]},"publisher":"Nature Publishing Group","oa_version":"Published Version","citation":{"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>","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>.","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.","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.","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>"},"scopus_import":"1","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."}],"article_number":"14247","month":"09","external_id":{"isi":["000445336600015"]},"quality_controlled":"1","date_updated":"2023-09-11T14:02:55Z","title":"Flexible learning-free segmentation and reconstruction of neural volumes","isi":1,"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.","date_published":"2018-09-24T00:00:00Z","article_processing_charge":"No","volume":8,"publist_id":"7992","publication":"Scientific Reports","day":"24","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MaJö"}],"issue":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"62","doi":"10.1038/s41598-018-32628-3","file":[{"creator":"dernst","checksum":"1a14ae0666b82fbaa04bef110e3f6bf2","access_level":"open_access","file_name":"2018_ScientificReports_Shahbazi.pdf","date_created":"2018-12-17T12:22:24Z","file_id":"5699","file_size":4141645,"date_updated":"2020-07-14T12:47:24Z","relation":"main_file","content_type":"application/pdf"}],"oa":1,"publication_status":"published","intvolume":"         8","file_date_updated":"2020-07-14T12:47:24Z","author":[{"full_name":"Shabazi, Ali","last_name":"Shabazi","first_name":"Ali"},{"last_name":"Kinnison","first_name":"Jeffery","full_name":"Kinnison, Jeffery"},{"first_name":"Rafael","last_name":"Vescovi","full_name":"Vescovi, Rafael"},{"full_name":"Du, Ming","last_name":"Du","first_name":"Ming"},{"full_name":"Hill, Robert","last_name":"Hill","first_name":"Robert"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A","last_name":"Jösch","first_name":"Maximilian A","orcid":"0000-0002-3937-1330"},{"last_name":"Takeno","first_name":"Marc","full_name":"Takeno, Marc"},{"full_name":"Zeng, Hongkui","last_name":"Zeng","first_name":"Hongkui"},{"last_name":"Da Costa","first_name":"Nuno","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"},{"full_name":"Scheirer, Walter","first_name":"Walter","last_name":"Scheirer"}],"ddc":["570"],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:25Z","article_type":"original","year":"2018"},{"month":"01","external_id":{"isi":["000424786900012"],"pmid":["29192062"]},"quality_controlled":"1","date_updated":"2026-06-18T19:01:31Z","title":"Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis","isi":1,"date_published":"2018-01-04T00:00:00Z","article_processing_charge":"No","volume":131,"publist_id":"7184","type":"journal_article","status":"public","publisher":"Company of Biologists","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29192062","open_access":"1"}],"oa_version":"Published Version","article_number":"jcs207696","abstract":[{"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.","lang":"eng"}],"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.","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>","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>.","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>","short":"W. Yamamoto, S. Wada, M. Nagano, K. Aoshima, D.E. Siekhaus, J. Toshima, J. Toshima, Journal of Cell Science 131 (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.","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>."},"scopus_import":"1","doi":"10.1242/jcs.207696","oa":1,"publication_status":"published","intvolume":"       131","author":[{"last_name":"Yamamoto","first_name":"Wataru","full_name":"Yamamoto, Wataru"},{"full_name":"Wada, Suguru","last_name":"Wada","first_name":"Suguru"},{"first_name":"Makoto","last_name":"Nagano","full_name":"Nagano, Makoto"},{"last_name":"Aoshima","first_name":"Kaito","full_name":"Aoshima, Kaito"},{"full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","last_name":"Siekhaus","first_name":"Daria E"},{"full_name":"Toshima, Junko","first_name":"Junko","last_name":"Toshima"},{"first_name":"Jiro","last_name":"Toshima","full_name":"Toshima, Jiro"}],"language":[{"iso":"eng"}],"ddc":["570"],"date_created":"2018-12-11T11:47:32Z","year":"2018","publication":"Journal of Cell Science","day":"04","issue":"1","department":[{"_id":"DaSi"}],"_id":"620","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1},{"volume":9,"publist_id":"7991","title":"Unusual diversity of sex chromosomes in African cichlid fishes","article_processing_charge":"No","date_published":"2018-10-04T00:00:00Z","acknowledgement":"NSF DEB-1830753 and ISTPlus Fellowship","isi":1,"external_id":{"isi":["000448656700018"]},"quality_controlled":"1","date_updated":"2025-04-15T06:50:01Z","month":"10","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."}],"citation":{"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>","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>.","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>.","short":"W.J. Gammerdinger, T. Kocher, Genes 9 (2018).","ista":"Gammerdinger WJ, Kocher T. 2018. Unusual diversity of sex chromosomes in African cichlid fishes. Genes. 9(10), 480.","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.","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>"},"scopus_import":"1","article_number":"480","oa_version":"Published Version","publisher":"MDPI","type":"journal_article","status":"public","year":"2018","date_created":"2018-12-11T11:44:26Z","file_date_updated":"2020-07-14T12:47:27Z","language":[{"iso":"eng"}],"ddc":["570"],"author":[{"id":"3A7E01BC-F248-11E8-B48F-1D18A9856A87","full_name":"Gammerdinger, William J","last_name":"Gammerdinger","first_name":"William J","orcid":"0000-0001-9638-1220"},{"last_name":"Kocher","first_name":"Thomas","full_name":"Kocher, Thomas"}],"oa":1,"publication_status":"published","file":[{"checksum":"bec527692e2c9b56919c0429634ff337","creator":"dernst","file_name":"2018_Genes_Gammerdinger.pdf","access_level":"open_access","date_created":"2018-12-18T09:54:46Z","file_id":"5743","file_size":1415791,"relation":"main_file","date_updated":"2020-07-14T12:47:27Z","content_type":"application/pdf"}],"doi":"10.3390/genes9100480","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"intvolume":"         9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"63","issue":"10","ec_funded":1,"department":[{"_id":"BeVi"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","day":"04","publication":"Genes"},{"publisher":"American Physical Society","main_file_link":[{"url":"https://arxiv.org/abs/1803.07990","open_access":"1"}],"article_number":"165301","citation":{"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.","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>","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>.","short":"G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).","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."},"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","oa_version":"Preprint","type":"journal_article","status":"public","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/description-of-rotating-molecules-made-easy/","description":"News on IST Homepage"}]},"title":"Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems","arxiv":1,"article_processing_charge":"No","date_published":"2018-10-16T00:00:00Z","isi":1,"volume":121,"month":"10","external_id":{"isi":["000447468400008"],"arxiv":["1803.07990"]},"date_updated":"2025-04-15T07:59:29Z","quality_controlled":"1","_id":"6339","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"issue":"16","publication":"Physical Review Letters","day":"16","date_created":"2019-04-17T10:53:38Z","year":"2018","publication_status":"published","oa":1,"doi":"10.1103/physrevlett.121.165301","project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"}],"intvolume":"       121","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-8823-9777","last_name":"Bighin","first_name":"Giacomo","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tscherbul","first_name":"Timur","full_name":"Tscherbul, Timur"},{"orcid":"0000-0002-6990-7802","last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}]},{"year":"2018","DOAJ_listed":"1","date_created":"2019-04-29T09:40:33Z","article_type":"original","file_date_updated":"2020-07-14T12:47:28Z","language":[{"iso":"eng"}],"ddc":["570"],"author":[{"full_name":"Fan, Shuxia","last_name":"Fan","first_name":"Shuxia"},{"first_name":"Michael","last_name":"Lorenz","full_name":"Lorenz, Michael"},{"first_name":"Steffen","last_name":"Massberg","full_name":"Massberg, Steffen"},{"orcid":"0000-0001-6120-3723","first_name":"Florian R","last_name":"Gärtner","full_name":"Gärtner, Florian R","id":"397A88EE-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"publication_status":"published","doi":"10.21769/bioprotoc.3018","project":[{"grant_number":"747687","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","call_identifier":"H2020"}],"file":[{"creator":"dernst","checksum":"d4588377e789da7f360b553ae02c5119","file_name":"2018_BioProtocol_Fan.pdf","access_level":"open_access","date_created":"2019-04-30T08:04:33Z","file_id":"6360","file_size":2928337,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:47:28Z"}],"intvolume":"         8","_id":"6354","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiSi"}],"ec_funded":1,"issue":"18","pmid":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","day":"20","corr_author":"1","OA_place":"publisher","publication":"Bio-Protocol","volume":8,"title":"Platelet migration and bacterial trapping assay under flow","article_processing_charge":"Yes","date_published":"2018-09-20T00:00:00Z","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.]).","external_id":{"pmid":["34395806"]},"quality_controlled":"1","date_updated":"2025-05-20T07:43:06Z","month":"09","keyword":["Platelets","Cell migration","Bacteria","Shear flow","Fibrinogen","E. coli"],"citation":{"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).","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>.","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.","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>"},"abstract":[{"lang":"eng","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."}],"article_number":"e3018","oa_version":"Published Version","publisher":"Bio-Protocol","OA_type":"gold","type":"journal_article","publication_identifier":{"issn":["2331-8325"]},"status":"public"},{"publication_identifier":{"issn":["2050-5094"]},"type":"journal_article","status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"8156","status":"public"}]},"publisher":"Cambridge University Press","oa_version":"Published Version","citation":{"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>","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.","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>.","short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).","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>","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>."},"article_number":"e7","abstract":[{"lang":"eng","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."}],"month":"05","external_id":{"arxiv":["1712.10205"],"isi":["000433915500001"]},"date_updated":"2026-04-08T07:25:54Z","quality_controlled":"1","title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","isi":1,"date_published":"2018-05-31T00:00:00Z","article_processing_charge":"No","arxiv":1,"volume":6,"corr_author":"1","publication":"Forum of Mathematics, Sigma","day":"31","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"ec_funded":1,"_id":"6355","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_id":"6356","date_created":"2019-04-30T06:14:58Z","file_name":"2018_ForumMahtematics_Akopyan.pdf","access_level":"open_access","creator":"dernst","checksum":"5a71b24ba712a3eb2e46165a38fbc30a","relation":"main_file","date_updated":"2020-07-14T12:47:28Z","content_type":"application/pdf","file_size":249246}],"project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"doi":"10.1017/fms.2018.7","publication_status":"published","oa":1,"intvolume":"         6","file_date_updated":"2020-07-14T12:47:28Z","author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7840-5062","last_name":"Avvakumov","first_name":"Sergey"}],"ddc":["510"],"language":[{"iso":"eng"}],"date_created":"2019-04-30T06:09:57Z","year":"2018"},{"status":"public","type":"journal_article","publication_identifier":{"issn":["0027-8424"]},"scopus_import":"1","abstract":[{"text":"Tropical geometry, an established field in pure mathematics, is a place where string theory, mirror symmetry, computational algebra, auction theory, and so forth meet and influence one another. In this paper, we report on our discovery of a tropical model with self-organized criticality (SOC) behavior. Our model is continuous, in contrast to all known models of SOC, and is a certain scaling limit of the sandpile model, the first and archetypical model of SOC. We describe how our model is related to pattern formation and proportional growth phenomena and discuss the dichotomy between continuous and discrete models in several contexts. Our aim in this context is to present an idealized tropical toy model (cf. Turing reaction-diffusion model), requiring further investigation.","lang":"eng"}],"citation":{"mla":"Kalinin, Nikita, et al. “Self-Organized Criticality and Pattern Emergence through the Lens of Tropical Geometry.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 115, no. 35, National Academy of Sciences, 2018, pp. E8135–42, doi:<a href=\"https://doi.org/10.1073/pnas.1805847115\">10.1073/pnas.1805847115</a>.","ista":"Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E. 2018. Self-organized criticality and pattern emergence through the lens of tropical geometry. Proceedings of the National Academy of Sciences of the United States of America. 115(35), E8135–E8142.","short":"N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, E. Lupercio, Proceedings of the National Academy of Sciences of the United States of America 115 (2018) E8135–E8142.","apa":"Kalinin, N., Guzmán Sáenz, A., Prieto, Y., Shkolnikov, M., Kalinina, V., &#38; Lupercio, E. (2018). Self-organized criticality and pattern emergence through the lens of tropical geometry. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1805847115\">https://doi.org/10.1073/pnas.1805847115</a>","chicago":"Kalinin, Nikita, Aldo Guzmán Sáenz, Y Prieto, Mikhail Shkolnikov, V Kalinina, and Ernesto Lupercio. “Self-Organized Criticality and Pattern Emergence through the Lens of Tropical Geometry.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1805847115\">https://doi.org/10.1073/pnas.1805847115</a>.","ama":"Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E. Self-organized criticality and pattern emergence through the lens of tropical geometry. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2018;115(35):E8135-E8142. doi:<a href=\"https://doi.org/10.1073/pnas.1805847115\">10.1073/pnas.1805847115</a>","ieee":"N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, and E. Lupercio, “Self-organized criticality and pattern emergence through the lens of tropical geometry,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 115, no. 35. National Academy of Sciences, pp. E8135–E8142, 2018."},"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.09153"}],"publisher":"National Academy of Sciences","date_updated":"2025-06-03T11:21:16Z","quality_controlled":"1","external_id":{"isi":["000442861600009"],"arxiv":["1806.09153"]},"month":"08","publist_id":"7990","volume":115,"date_published":"2018-08-28T00:00:00Z","article_processing_charge":"No","arxiv":1,"isi":1,"title":"Self-organized criticality and pattern emergence through the lens of tropical geometry","day":"28","publication":"Proceedings of the National Academy of Sciences of the United States of America","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"64","department":[{"_id":"TaHa"}],"ec_funded":1,"issue":"35","page":"E8135 - E8142","language":[{"iso":"eng"}],"author":[{"full_name":"Kalinin, Nikita","last_name":"Kalinin","first_name":"Nikita"},{"full_name":"Guzmán Sáenz, Aldo","last_name":"Guzmán Sáenz","first_name":"Aldo"},{"full_name":"Prieto, Y","first_name":"Y","last_name":"Prieto"},{"last_name":"Shkolnikov","first_name":"Mikhail","orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87","full_name":"Shkolnikov, Mikhail"},{"first_name":"V","last_name":"Kalinina","full_name":"Kalinina, V"},{"last_name":"Lupercio","first_name":"Ernesto","full_name":"Lupercio, Ernesto"}],"intvolume":"       115","publication_status":"published","oa":1,"doi":"10.1073/pnas.1805847115","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"year":"2018","article_type":"original","date_created":"2018-12-11T11:44:26Z"},{"day":"01","publication":"Journal of the Royal Society Interface","pmid":1,"department":[{"_id":"KrCh"}],"ec_funded":1,"issue":"140","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"198","has_accepted_license":"1","author":[{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"language":[{"iso":"eng"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:45:22Z","intvolume":"        15","file":[{"file_size":219837,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:45:22Z","creator":"dernst","checksum":"444e1a9d98eb0e780671be82b13025f3","access_level":"open_access","file_name":"2018_RS_IbsenJensen.pdf","date_created":"2019-02-12T07:54:37Z","file_id":"5955"}],"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"doi":"10.1098/rsif.2018.0073","oa":1,"publication_status":"published","year":"2018","article_type":"original","date_created":"2018-12-11T11:45:09Z","related_material":{"link":[{"url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971","relation":"supplementary_material"}],"record":[{"status":"public","relation":"research_data","id":"9814"}]},"status":"public","publication_identifier":{"eissn":["1742-5662"]},"type":"journal_article","oa_version":"Submitted Version","article_number":"20180073","scopus_import":"1","citation":{"ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. <i>Journal of the Royal Society Interface</i>. 2018;15(140). doi:<a href=\"https://doi.org/10.1098/rsif.2018.0073\">10.1098/rsif.2018.0073</a>","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” <i>Journal of the Royal Society Interface</i>, vol. 15, no. 140. The Royal Society, 2018.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073.","mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” <i>Journal of the Royal Society Interface</i>, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:<a href=\"https://doi.org/10.1098/rsif.2018.0073\">10.1098/rsif.2018.0073</a>.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” <i>Journal of the Royal Society Interface</i>. The Royal Society, 2018. <a href=\"https://doi.org/10.1098/rsif.2018.0073\">https://doi.org/10.1098/rsif.2018.0073</a>.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018). Language acquisition with communication between learners. <i>Journal of the Royal Society Interface</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsif.2018.0073\">https://doi.org/10.1098/rsif.2018.0073</a>"},"abstract":[{"lang":"eng","text":"We consider a class of students learning a language from a teacher. The situation can be interpreted as a group of child learners receiving input from the linguistic environment. The teacher provides sample sentences. The students try to learn the grammar from the teacher. In addition to just listening to the teacher, the students can also communicate with each other. The students hold hypotheses about the grammar and change them if they receive counter evidence. The process stops when all students have converged to the correct grammar. We study how the time to convergence depends on the structure of the classroom by introducing and evaluating various complexity measures. We find that structured communication between students, although potentially introducing confusion, can greatly reduce some of the complexity measures. Our theory can also be interpreted as applying to the scientific process, where nature is the teacher and the scientists are the students."}],"publisher":"The Royal Society","date_updated":"2025-04-15T07:26:26Z","quality_controlled":"1","external_id":{"pmid":["29593089"],"isi":["000428576200023"]},"month":"03","publist_id":"7715","volume":15,"isi":1,"date_published":"2018-03-01T00:00:00Z","article_processing_charge":"No","title":"Language acquisition with communication between learners"},{"quality_controlled":"1","date_updated":"2024-12-11T13:13:35Z","external_id":{"isi":["000436494200026"]},"month":"06","publist_id":"7714","volume":9,"isi":1,"article_processing_charge":"No","date_published":"2018-06-12T00:00:00Z","title":"Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes","status":"public","type":"journal_article","oa_version":"Published Version","article_number":"294","citation":{"ama":"Ma W, Veltsos P, Toups MA, et al. Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes. <i>Genes</i>. 2018;9(6). doi:<a href=\"https://doi.org/10.3390/genes9060294\">10.3390/genes9060294</a>","ieee":"W. Ma <i>et al.</i>, “Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes,” <i>Genes</i>, vol. 9, no. 6. MDPI, 2018.","short":"W. Ma, P. Veltsos, M.A. Toups, N. Rodrigues, R. Sermier, D. Jeffries, N. Perrin, Genes 9 (2018).","ista":"Ma W, Veltsos P, Toups MA, Rodrigues N, Sermier R, Jeffries D, Perrin N. 2018. Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes. Genes. 9(6), 294.","mla":"Ma, Wen, et al. “Tissue Specificity and Dynamics of Sex Biased Gene Expression in a Common Frog Population with Differentiated, yet Homomorphic, Sex Chromosomes.” <i>Genes</i>, vol. 9, no. 6, 294, MDPI, 2018, doi:<a href=\"https://doi.org/10.3390/genes9060294\">10.3390/genes9060294</a>.","chicago":"Ma, Wen, Paris Veltsos, Melissa A Toups, Nicolas Rodrigues, Roberto Sermier, Daniel Jeffries, and Nicolas Perrin. “Tissue Specificity and Dynamics of Sex Biased Gene Expression in a Common Frog Population with Differentiated, yet Homomorphic, Sex Chromosomes.” <i>Genes</i>. MDPI, 2018. <a href=\"https://doi.org/10.3390/genes9060294\">https://doi.org/10.3390/genes9060294</a>.","apa":"Ma, W., Veltsos, P., Toups, M. A., Rodrigues, N., Sermier, R., Jeffries, D., &#38; Perrin, N. (2018). Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes. <i>Genes</i>. MDPI. <a href=\"https://doi.org/10.3390/genes9060294\">https://doi.org/10.3390/genes9060294</a>"},"scopus_import":"1","abstract":[{"lang":"eng","text":"Sex-biased genes are central to the study of sexual selection, sexual antagonism, and sex chromosome evolution. We describe a comprehensive de novo assembled transcriptome in the common frog Rana temporaria based on five developmental stages and three adult tissues from both sexes, obtained from a population with karyotypically homomorphic but genetically differentiated sex chromosomes. This allows the study of sex-biased gene expression throughout development, and its effect on the rate of gene evolution while accounting for pleiotropic expression, which is known to negatively correlate with the evolutionary rate. Overall, sex-biased genes had little overlap among developmental stages and adult tissues. Late developmental stages and gonad tissues had the highest numbers of stage-or tissue-specific genes. We find that pleiotropic gene expression is a better predictor than sex bias for the evolutionary rate of genes, though it often interacts with sex bias. Although genetically differentiated, the sex chromosomes were not enriched in sex-biased genes, possibly due to a very recent arrest of XY recombination. These results extend our understanding of the developmental dynamics, tissue specificity, and genomic localization of sex-biased genes."}],"publisher":"MDPI","author":[{"last_name":"Ma","first_name":"Wen","full_name":"Ma, Wen"},{"last_name":"Veltsos","first_name":"Paris","full_name":"Veltsos, Paris"},{"orcid":"0000-0002-9752-7380","last_name":"Toups","first_name":"Melissa A","full_name":"Toups, Melissa A","id":"4E099E4E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rodrigues, Nicolas","last_name":"Rodrigues","first_name":"Nicolas"},{"last_name":"Sermier","first_name":"Roberto","full_name":"Sermier, Roberto"},{"full_name":"Jeffries, Daniel","last_name":"Jeffries","first_name":"Daniel"},{"full_name":"Perrin, Nicolas","first_name":"Nicolas","last_name":"Perrin"}],"ddc":["570"],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:22Z","intvolume":"         9","doi":"10.3390/genes9060294","file":[{"file_size":3985796,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:22Z","relation":"main_file","date_created":"2019-02-01T07:52:28Z","file_id":"5905","checksum":"423069beb1cd3cdd25bf3f464b38f1d7","creator":"dernst","file_name":"2018_Genes_Ma.pdf","access_level":"open_access"}],"publication_status":"published","oa":1,"year":"2018","date_created":"2018-12-11T11:45:09Z","day":"12","publication":"Genes","issue":"6","department":[{"_id":"BeVi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"199","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}}]
