[{"author":[{"first_name":"Tadeas","last_name":"Priklopil","full_name":"Priklopil, Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"volume":6,"article_processing_charge":"No","month":"09","has_accepted_license":"1","file":[{"file_name":"IST-2016-448-v1+1_games-06-00413.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:12:41Z","creator":"system","file_id":"4959","checksum":"912e1acbaf201100f447a43e4d5958bd","file_size":518832,"access_level":"open_access","relation":"main_file"}],"issue":"4","status":"public","publication_identifier":{"eissn":["2073-4336"]},"date_created":"2018-12-11T11:53:26Z","article_type":"original","_id":"1681","type":"journal_article","ec_funded":1,"pubrep_id":"448","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"date_updated":"2023-10-17T11:42:52Z","citation":{"ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” <i>Games</i>, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","apa":"Priklopil, T., &#38; Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. <i>Games</i>. MDPI. <a href=\"https://doi.org/10.3390/g6040413\">https://doi.org/10.3390/g6040413</a>","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” <i>Games</i>. MDPI, 2015. <a href=\"https://doi.org/10.3390/g6040413\">https://doi.org/10.3390/g6040413</a>.","ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. <i>Games</i>. 2015;6(4):413-437. doi:<a href=\"https://doi.org/10.3390/g6040413\">10.3390/g6040413</a>","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” <i>Games</i>, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:<a href=\"https://doi.org/10.3390/g6040413\">10.3390/g6040413</a>.","short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437."},"file_date_updated":"2020-07-14T12:45:12Z","publisher":"MDPI","date_published":"2015-09-29T00:00:00Z","title":"Evolution of decisions in population games with sequentially searching individuals","publication_status":"published","abstract":[{"text":"In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game.","lang":"eng"}],"ddc":["000"],"year":"2015","page":"413 - 437","doi":"10.3390/g6040413","day":"29","oa":1,"publist_id":"5467","intvolume":"         6","publication":"Games","scopus_import":"1"},{"publist_id":"5466","intvolume":"        62","publication":"Journal of the ACM","scopus_import":1,"status":"public","day":"01","year":"2015","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0858"}],"doi":"10.1145/2751524","date_created":"2018-12-11T11:53:27Z","oa":1,"_id":"1682","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2015-08-01T00:00:00Z","publisher":"ACM","title":"Robust satisfiability of systems of equations","volume":62,"month":"08","publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α &gt; 0, it holds that each function g: K → ℝn such that ||g - f || ∞ &lt; α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K &gt; 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings."}],"article_number":"26","issue":"4","author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek","first_name":"Marek","last_name":"Krcál"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"quality_controlled":"1","date_updated":"2021-01-12T06:52:30Z","citation":{"mla":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” <i>Journal of the ACM</i>, vol. 62, no. 4, 26, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2751524\">10.1145/2751524</a>.","short":"P. Franek, M. Krcál, Journal of the ACM 62 (2015).","ieee":"P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” <i>Journal of the ACM</i>, vol. 62, no. 4. ACM, 2015.","apa":"Franek, P., &#38; Krcál, M. (2015). Robust satisfiability of systems of equations. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2751524\">https://doi.org/10.1145/2751524</a>","chicago":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” <i>Journal of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2751524\">https://doi.org/10.1145/2751524</a>.","ista":"Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.","ama":"Franek P, Krcál M. Robust satisfiability of systems of equations. <i>Journal of the ACM</i>. 2015;62(4). doi:<a href=\"https://doi.org/10.1145/2751524\">10.1145/2751524</a>"},"oa_version":"Preprint"},{"date_updated":"2021-01-12T06:52:30Z","extern":"1","citation":{"mla":"Vicoso, Beatriz, and Doris Bachtrog. “Numerous Transitions of Sex Chromosomes in Diptera.” <i>PLoS Biology</i>, vol. 13, no. 4, e1002078, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002078\">10.1371/journal.pbio.1002078</a>.","short":"B. Vicoso, D. Bachtrog, PLoS Biology 13 (2015).","apa":"Vicoso, B., &#38; Bachtrog, D. (2015). Numerous transitions of sex chromosomes in Diptera. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002078\">https://doi.org/10.1371/journal.pbio.1002078</a>","chicago":"Vicoso, Beatriz, and Doris Bachtrog. “Numerous Transitions of Sex Chromosomes in Diptera.” <i>PLoS Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pbio.1002078\">https://doi.org/10.1371/journal.pbio.1002078</a>.","ista":"Vicoso B, Bachtrog D. 2015. Numerous transitions of sex chromosomes in Diptera. PLoS Biology. 13(4), e1002078.","ama":"Vicoso B, Bachtrog D. Numerous transitions of sex chromosomes in Diptera. <i>PLoS Biology</i>. 2015;13(4). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002078\">10.1371/journal.pbio.1002078</a>","ieee":"B. Vicoso and D. Bachtrog, “Numerous transitions of sex chromosomes in Diptera,” <i>PLoS Biology</i>, vol. 13, no. 4. Public Library of Science, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"abstract":[{"lang":"eng","text":"Many species groups, including mammals and many insects, determine sex using heteromorphic sex chromosomes. Diptera flies, which include the model Drosophila melanogaster, generally have XY sex chromosomes and a conserved karyotype consisting of six chromosomal arms (five large rods and a small dot), but superficially similar karyotypes may conceal the true extent of sex chromosome variation. Here, we use whole-genome analysis in 37 fly species belonging to 22 different families of Diptera and uncover tremendous hidden diversity in sex chromosome karyotypes among flies. We identify over a dozen different sex chromosome configurations, and the small dot chromosome is repeatedly used as the sex chromosome, which presumably reflects the ancestral karyotype of higher Diptera. However, we identify species with undifferentiated sex chromosomes, others in which a different chromosome replaced the dot as a sex chromosome or in which up to three chromosomal elements became incorporated into the sex chromosomes, and others yet with female heterogamety (ZW sex chromosomes). Transcriptome analysis shows that dosage compensation has evolved multiple times in flies, consistently through up-regulation of the single X in males. However, X chromosomes generally show a deficiency of genes with male-biased expression, possibly reflecting sex-specific selective pressures. These species thus provide a rich resource to study sex chromosome biology in a comparative manner and show that similar selective forces have shaped the unique evolution of sex chromosomes in diverse fly taxa."}],"publication_status":"published","ddc":["570"],"publisher":"Public Library of Science","file_date_updated":"2020-07-14T12:45:12Z","date_published":"2015-04-16T00:00:00Z","title":"Numerous transitions of sex chromosomes in Diptera","oa":1,"acknowledgement":"This research was funded by NIH grants (R01GM076007 and R01GM093182) to DB. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.\r\nWe thank the people listed in S2 Table for samples, Jere Schweikert for identifying Tephritid species, and Zaak Walton for technical assistance.","doi":"10.1371/journal.pbio.1002078","year":"2015","day":"16","intvolume":"        13","publist_id":"5463","publication":"PLoS Biology","quality_controlled":"1","oa_version":"Published Version","author":[{"orcid":"0000-0002-4579-8306","last_name":"Vicoso","first_name":"Beatriz","full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bachtrog, Doris","last_name":"Bachtrog","first_name":"Doris"}],"has_accepted_license":"1","month":"04","issue":"4","file":[{"access_level":"open_access","file_size":1104701,"checksum":"92a300d7b97eafb477885303f7632fe1","file_id":"4858","creator":"system","relation":"main_file","file_name":"IST-2016-492-v1+1_journal.pbio.1002078.pdf","date_created":"2018-12-12T10:11:05Z","date_updated":"2020-07-14T12:45:12Z","content_type":"application/pdf"}],"article_number":"e1002078","language":[{"iso":"eng"}],"volume":13,"date_created":"2018-12-11T11:53:27Z","type":"journal_article","_id":"1684","status":"public","pubrep_id":"492"},{"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T06:52:31Z","citation":{"short":"V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.","mla":"Cohen Addad, Vincent, and Arnaud N. de Mesmay. <i>A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface</i>. Vol. 9294, Springer, 2015, pp. 386–98, doi:<a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">10.1007/978-3-662-48350-3_33</a>.","ieee":"V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation scheme for the optimal cut graph of a surface,” presented at the ESA: European Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.","chicago":"Cohen Addad, Vincent, and Arnaud N de Mesmay. “A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface,” 9294:386–98. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">https://doi.org/10.1007/978-3-662-48350-3_33</a>.","ista":"Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms, LNCS, vol. 9294, 386–398.","ama":"Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398. doi:<a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">10.1007/978-3-662-48350-3_33</a>","apa":"Cohen Addad, V., &#38; de Mesmay, A. N. (2015). A fixed parameter tractable approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398). Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">https://doi.org/10.1007/978-3-662-48350-3_33</a>"},"publisher":"Springer","date_published":"2015-09-01T00:00:00Z","title":"A fixed parameter tractable approximation scheme for the optimal cut graph of a surface","publication_status":"published","abstract":[{"lang":"eng","text":"Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph is a subgraph of G such that cutting Σ along G yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any ε &gt; 0, we show how to compute a (1 + ε) approximation of the shortest cut graph in time f(ε, g)n3.\r\nOur techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded tree-width. Then, to solve the bounded tree-width case, we introduce a variant of the surface-cut decomposition of Rué, Sau and Thilikos, which may be of independent interest."}],"doi":"10.1007/978-3-662-48350-3_33","day":"01","page":"386 - 398","year":"2015","oa":1,"publist_id":"5462","intvolume":"      9294","scopus_import":1,"author":[{"full_name":"Cohen Addad, Vincent","last_name":"Cohen Addad","first_name":"Vincent"},{"last_name":"De Mesmay","first_name":"Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","full_name":"De Mesmay, Arnaud N"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"volume":9294,"month":"09","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1507.01688","open_access":"1"}],"date_created":"2018-12-11T11:53:27Z","type":"conference","_id":"1685","conference":{"end_date":"2015-09-16","start_date":"2015-09-14","name":"ESA: European Symposium on Algorithms","location":"Patras, Greece"},"ec_funded":1},{"language":[{"iso":"eng"}],"volume":36,"month":"10","has_accepted_license":"1","issue":"10","file":[{"creator":"system","checksum":"c29973924b790aab02fdd91857759cfb","file_id":"4875","file_size":797964,"access_level":"open_access","relation":"main_file","file_name":"IST-2016-445-v1+1_1-s2.0-S0955067415001064-main.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:11:21Z"}],"author":[{"full_name":"Sarris, Milka","last_name":"Sarris","first_name":"Milka"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K"}],"project":[{"_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Published Version","ec_funded":1,"pubrep_id":"445","status":"public","date_created":"2018-12-11T11:53:28Z","type":"journal_article","_id":"1687","publisher":"Elsevier","date_published":"2015-10-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:12Z","title":"Navigating in tissue mazes: Chemoattractant interpretation in complex environments","abstract":[{"lang":"eng","text":"Guided cell movement is essential for development and integrity of animals and crucially involved in cellular immune responses. Leukocytes are professional migratory cells that can navigate through most types of tissues and sense a wide range of directional cues. The responses of these cells to attractants have been mainly explored in tissue culture settings. How leukocytes make directional decisions in situ, within the challenging environment of a tissue maze, is less understood. Here we review recent advances in how leukocytes sense chemical cues in complex tissue settings and make links with paradigms of directed migration in development and Dictyostelium discoideum amoebae."}],"publication_status":"published","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2021-01-12T06:52:31Z","department":[{"_id":"MiSi"}],"citation":{"short":"M. Sarris, M.K. Sixt, Current Opinion in Cell Biology 36 (2015) 93–102.","mla":"Sarris, Milka, and Michael K. Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 93–102, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">10.1016/j.ceb.2015.08.001</a>.","apa":"Sarris, M., &#38; Sixt, M. K. (2015). Navigating in tissue mazes: Chemoattractant interpretation in complex environments. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">https://doi.org/10.1016/j.ceb.2015.08.001</a>","ista":"Sarris M, Sixt MK. 2015. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 36(10), 93–102.","chicago":"Sarris, Milka, and Michael K Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">https://doi.org/10.1016/j.ceb.2015.08.001</a>.","ama":"Sarris M, Sixt MK. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. <i>Current Opinion in Cell Biology</i>. 2015;36(10):93-102. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">10.1016/j.ceb.2015.08.001</a>","ieee":"M. Sarris and M. K. Sixt, “Navigating in tissue mazes: Chemoattractant interpretation in complex environments,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 93–102, 2015."},"intvolume":"        36","publist_id":"5458","publication":"Current Opinion in Cell Biology","scopus_import":1,"year":"2015","doi":"10.1016/j.ceb.2015.08.001","page":"93 - 102","day":"01","oa":1},{"publication_status":"published","abstract":[{"text":"We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant (Formula presented.) such that whenever (Formula presented.) are n-element subsets of (Formula presented.), we can find a point (Formula presented.) and subsets (Formula presented.) for every i∈[d+1], each of size at least cdn, such that p belongs to all rainbowd-simplices determined by (Formula presented.) simplices with one vertex in each Yi. We show a super-exponentially decreasing upper bound (Formula presented.). The ideas used in the proof of the upper bound also help us to prove Pach’s theorem with (Formula presented.), which is a lower bound doubly exponentially decreasing in d (up to some polynomial in the exponent). For comparison, Pach’s original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach’s theorem with (Formula presented.). In our construction for the upper bound, we use the fact that the minimum solid angle of every d-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the ‘separation’ part of the argument by showing that in one of the key steps only d+1 separations are necessary, compared to 2d separations in the original proof. We also provide a measure version of Pach’s theorem.","lang":"eng"}],"title":"Bounds for Pach's selection theorem and for the minimum solid angle in a simplex","publisher":"Springer","date_published":"2015-10-01T00:00:00Z","citation":{"ieee":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex,” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 3. Springer, pp. 610–636, 2015.","apa":"Karasev, R., Kynčl, J., Paták, P., Patakova, Z., &#38; Tancer, M. (2015). Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9720-z\">https://doi.org/10.1007/s00454-015-9720-z</a>","ista":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. 2015. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &#38; Computational Geometry. 54(3), 610–636.","ama":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. <i>Discrete &#38; Computational Geometry</i>. 2015;54(3):610-636. doi:<a href=\"https://doi.org/10.1007/s00454-015-9720-z\">10.1007/s00454-015-9720-z</a>","chicago":"Karasev, Roman, Jan Kynčl, Pavel Paták, Zuzana Patakova, and Martin Tancer. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00454-015-9720-z\">https://doi.org/10.1007/s00454-015-9720-z</a>.","short":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, M. Tancer, Discrete &#38; Computational Geometry 54 (2015) 610–636.","mla":"Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 3, Springer, 2015, pp. 610–36, doi:<a href=\"https://doi.org/10.1007/s00454-015-9720-z\">10.1007/s00454-015-9720-z</a>."},"department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T06:52:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"publication":"Discrete & Computational Geometry","publist_id":"5457","intvolume":"        54","oa":1,"page":"610 - 636","doi":"10.1007/s00454-015-9720-z","year":"2015","day":"01","acknowledgement":"R. K. was supported by the Russian Foundation for Basic Research Grant 15-31-20403 (mol_a_ved) and grant 15-01-99563. J. K., Z. P., and M. T. were partially supported by ERC Advanced Research Grant No. 267165 (DISCONV) and by the project CE-ITI (GAČR P202/12/G061) of the Czech Science Foundation. J. K. was also partially supported by Swiss National Science Foundation Grants 200021-137574 and 200020-14453. P. P., Z. P., and M. T. were partially supported by the Charles University Grant GAUK 421511. P. P. was also partially supported by the Charles University Grant SVV-2014-260107. Z. P. was also partially supported by the Charles University Grant SVV-2014-260103.","issue":"3","month":"10","volume":54,"language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Karasev, Roman","last_name":"Karasev","first_name":"Roman"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"orcid":"0000-0002-3975-1683","first_name":"Zuzana","last_name":"Patakova","full_name":"Patakova, Zuzana"},{"full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","last_name":"Tancer","first_name":"Martin"}],"_id":"1688","type":"journal_article","date_created":"2018-12-11T11:53:28Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.8147"}],"status":"public"},{"author":[{"full_name":"Svoreňová, Mária","first_name":"Mária","last_name":"Svoreňová"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cěrná, Ivana","last_name":"Cěrná","first_name":"Ivana"},{"full_name":"Belta, Cǎlin","last_name":"Belta","first_name":"Cǎlin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"date_updated":"2023-09-20T09:43:09Z","citation":{"mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, ACM, 2015, pp. 259–68, doi:<a href=\"https://doi.org/10.1145/2728606.2728608\">10.1145/2728606.2728608</a>.","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, Seattle, WA, United States, 2015, pp. 259–268.","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>. ACM; 2015:259-268. doi:<a href=\"https://doi.org/10.1145/2728606.2728608\">10.1145/2728606.2728608</a>","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, 259–68. ACM, 2015. <a href=\"https://doi.org/10.1145/2728606.2728608\">https://doi.org/10.1145/2728606.2728608</a>.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., &#38; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i> (pp. 259–268). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2728606.2728608\">https://doi.org/10.1145/2728606.2728608</a>"},"oa_version":"Preprint","language":[{"iso":"eng"}],"date_published":"2015-04-14T00:00:00Z","publisher":"ACM","title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","month":"04","publication_status":"published","abstract":[{"lang":"eng","text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study."}],"year":"2015","status":"public","day":"14","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.5387"}],"page":"259 - 268","doi":"10.1145/2728606.2728608","oa":1,"date_created":"2018-12-11T11:53:29Z","type":"conference","_id":"1689","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","location":"Seattle, WA, United States","end_date":"2015-04-16","start_date":"2015-04-14"},"publist_id":"5456","ec_funded":1,"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","scopus_import":1,"related_material":{"record":[{"relation":"later_version","id":"1407","status":"public"}]}},{"oa_version":"Preprint","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"author":[{"full_name":"Amaro, Pedro","last_name":"Amaro","first_name":"Pedro"},{"full_name":"Franke, Beatrice","last_name":"Franke","first_name":"Beatrice"},{"full_name":"Krauth, Julian","last_name":"Krauth","first_name":"Julian"},{"full_name":"Diepold, Marc","first_name":"Marc","last_name":"Diepold"},{"full_name":"Fratini, Filippo","first_name":"Filippo","last_name":"Fratini"},{"first_name":"Laleh","last_name":"Safari","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","full_name":"Safari, Laleh"},{"full_name":"Machado, Jorge","first_name":"Jorge","last_name":"Machado"},{"full_name":"Antognini, Aldo","last_name":"Antognini","first_name":"Aldo"},{"first_name":"Franz","last_name":"Kottmann","full_name":"Kottmann, Franz"},{"last_name":"Indelicato","first_name":"Paul","full_name":"Indelicato, Paul"},{"first_name":"Randolf","last_name":"Pohl","full_name":"Pohl, Randolf"},{"full_name":"Santos, José","last_name":"Santos","first_name":"José"}],"issue":"2","article_number":"022514","month":"08","volume":92,"language":[{"iso":"eng"}],"_id":"1693","type":"journal_article","date_created":"2018-12-11T11:53:30Z","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.02734"}],"ec_funded":1,"citation":{"ista":"Amaro P, Franke B, Krauth J, Diepold M, Fratini F, Safari L, Machado J, Antognini A, Kottmann F, Indelicato P, Pohl R, Santos J. 2015. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. 92(2), 022514.","ama":"Amaro P, Franke B, Krauth J, et al. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. <i>Physical Review A</i>. 2015;92(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">10.1103/PhysRevA.92.022514</a>","chicago":"Amaro, Pedro, Beatrice Franke, Julian Krauth, Marc Diepold, Filippo Fratini, Laleh Safari, Jorge Machado, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” <i>Physical Review A</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">https://doi.org/10.1103/PhysRevA.92.022514</a>.","apa":"Amaro, P., Franke, B., Krauth, J., Diepold, M., Fratini, F., Safari, L., … Santos, J. (2015). Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">https://doi.org/10.1103/PhysRevA.92.022514</a>","ieee":"P. Amaro <i>et al.</i>, “Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3,” <i>Physical Review A</i>, vol. 92, no. 2. American Physical Society, 2015.","mla":"Amaro, Pedro, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” <i>Physical Review A</i>, vol. 92, no. 2, 022514, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">10.1103/PhysRevA.92.022514</a>.","short":"P. Amaro, B. Franke, J. Krauth, M. Diepold, F. Fratini, L. Safari, J. Machado, A. Antognini, F. Kottmann, P. Indelicato, R. Pohl, J. Santos, Physical Review A 92 (2015)."},"date_updated":"2021-01-12T06:52:34Z","department":[{"_id":"MiLe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Quantum interference between energetically close states is theoretically investigated, with the state structure being observed via laser spectroscopy. In this work, we focus on hyperfine states of selected hydrogenic muonic isotopes, and on how quantum interference affects the measured Lamb shift. The process of photon excitation and subsequent photon decay is implemented within the framework of nonrelativistic second-order perturbation theory. Due to its experimental interest, calculations are performed for muonic hydrogen, deuterium, and helium-3. We restrict our analysis to the case of photon scattering by incident linear polarized photons and the polarization of the scattered photons not being observed. We conclude that while quantum interference effects can be safely neglected in muonic hydrogen and helium-3, in the case of muonic deuterium there are resonances with close proximity, where quantum interference effects can induce shifts up to a few percent of the linewidth, assuming a pointlike detector. However, by taking into account the geometry of the setup used by the CREMA collaboration, this effect is reduced to less than 0.2% of the linewidth in all possible cases, which makes it irrelevant at the present level of accuracy. © 2015 American Physical Society.","lang":"eng"}],"publication_status":"published","title":"Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3","publisher":"American Physical Society","date_published":"2015-08-28T00:00:00Z","oa":1,"day":"28","year":"2015","doi":"10.1103/PhysRevA.92.022514","scopus_import":1,"publication":"Physical Review A","intvolume":"        92","publist_id":"5451"},{"doi":"10.1002/pssb.201552082","year":"2015","page":"2059 - 2071","day":"01","oa":1,"publication":"Physica Status Solidi (B): Basic Solid State Physics","intvolume":"       252","publist_id":"5449","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kaczmarczyk, Jan, et al. “Evaluation Techniques for Gutzwiller Wave Functions in Finite Dimensions.” <i>Physica Status Solidi (B): Basic Solid State Physics</i>, vol. 252, no. 9, Wiley, 2015, pp. 2059–71, doi:<a href=\"https://doi.org/10.1002/pssb.201552082\">10.1002/pssb.201552082</a>.","short":"J. Kaczmarczyk, T. Schickling, J. Bünemann, Physica Status Solidi (B): Basic Solid State Physics 252 (2015) 2059–2071.","apa":"Kaczmarczyk, J., Schickling, T., &#38; Bünemann, J. (2015). Evaluation techniques for Gutzwiller wave functions in finite dimensions. <i>Physica Status Solidi (B): Basic Solid State Physics</i>. Wiley. <a href=\"https://doi.org/10.1002/pssb.201552082\">https://doi.org/10.1002/pssb.201552082</a>","ama":"Kaczmarczyk J, Schickling T, Bünemann J. Evaluation techniques for Gutzwiller wave functions in finite dimensions. <i>Physica Status Solidi (B): Basic Solid State Physics</i>. 2015;252(9):2059-2071. doi:<a href=\"https://doi.org/10.1002/pssb.201552082\">10.1002/pssb.201552082</a>","ista":"Kaczmarczyk J, Schickling T, Bünemann J. 2015. Evaluation techniques for Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B): Basic Solid State Physics. 252(9), 2059–2071.","chicago":"Kaczmarczyk, Jan, Tobias Schickling, and Jörg Bünemann. “Evaluation Techniques for Gutzwiller Wave Functions in Finite Dimensions.” <i>Physica Status Solidi (B): Basic Solid State Physics</i>. Wiley, 2015. <a href=\"https://doi.org/10.1002/pssb.201552082\">https://doi.org/10.1002/pssb.201552082</a>.","ieee":"J. Kaczmarczyk, T. Schickling, and J. Bünemann, “Evaluation techniques for Gutzwiller wave functions in finite dimensions,” <i>Physica Status Solidi (B): Basic Solid State Physics</i>, vol. 252, no. 9. Wiley, pp. 2059–2071, 2015."},"date_updated":"2021-01-12T06:52:34Z","department":[{"_id":"MiLe"}],"title":"Evaluation techniques for Gutzwiller wave functions in finite dimensions","publisher":"Wiley","date_published":"2015-09-01T00:00:00Z","abstract":[{"lang":"eng","text":"We give a comprehensive introduction into a diagrammatic method that allows for the evaluation of Gutzwiller wave functions in finite spatial dimensions. We discuss in detail some numerical schemes that turned out to be useful in the real-space evaluation of the diagrams. The method is applied to the problem of d-wave superconductivity in a two-dimensional single-band Hubbard model. Here, we discuss in particular the role of long-range contributions in our diagrammatic expansion. We further reconsider our previous analysis on the kinetic energy gain in the superconducting state."}],"publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1503.03738","open_access":"1"}],"status":"public","_id":"1695","type":"journal_article","date_created":"2018-12-11T11:53:31Z","ec_funded":1,"author":[{"last_name":"Kaczmarczyk","first_name":"Jan","orcid":"0000-0002-1629-3675","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarczyk, Jan"},{"full_name":"Schickling, Tobias","last_name":"Schickling","first_name":"Tobias"},{"full_name":"Bünemann, Jörg","first_name":"Jörg","last_name":"Bünemann"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"volume":252,"language":[{"iso":"eng"}],"issue":"9","month":"09"},{"ec_funded":1,"status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1505.07003","open_access":"1"}],"date_created":"2018-12-11T11:53:31Z","type":"journal_article","_id":"1696","language":[{"iso":"eng"}],"volume":92,"month":"09","issue":"12","article_number":"125135","author":[{"full_name":"Wysokiński, Marcin","first_name":"Marcin","last_name":"Wysokiński"},{"orcid":"0000-0002-1629-3675","first_name":"Jan","last_name":"Kaczmarczyk","full_name":"Kaczmarczyk, Jan","id":"46C405DE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jozef","last_name":"Spałek","full_name":"Spałek, Jozef"}],"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"oa_version":"Preprint","intvolume":"        92","publist_id":"5448","publication":"Physical Review B","scopus_import":1,"acknowledgement":"The work was partly supported by the National Science Centre (NCN) under MAESTRO, Grant No. DEC-2012/04/A/ST3/00342. M.W. acknowledges the hospitality of the Institute of Science and Technology Austria during the final stage of development of the present work, as well as partial financial support from the Society-Environment-Technology project of the Jagiellonian University for that stay. J.K. acknowledges support from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant Agreement No. [291734 ].","day":"18","year":"2015","doi":"10.1103/PhysRevB.92.125135","oa":1,"date_published":"2015-09-18T00:00:00Z","publisher":"American Physical Society","title":"Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states","abstract":[{"lang":"eng","text":"The recently proposed diagrammatic expansion (DE) technique for the full Gutzwiller wave function (GWF) is applied to the Anderson lattice model. This approach allows for a systematic evaluation of the expectation values with full Gutzwiller wave function in finite-dimensional systems. It introduces results extending in an essential manner those obtained by means of the standard Gutzwiller approximation (GA), which is variationally exact only in infinite dimensions. Within the DE-GWF approach we discuss the principal paramagnetic properties and their relevance to heavy-fermion systems. We demonstrate the formation of an effective, narrow f band originating from atomic f-electron states and subsequently interpret this behavior as a direct itineracy of f electrons; it represents a combined effect of both the hybridization and the correlations induced by the Coulomb repulsive interaction. Such a feature is absent on the level of GA, which is equivalent to the zeroth order of our expansion. Formation of the hybridization- and electron-concentration-dependent narrow f band rationalizes the common assumption of such dispersion of f levels in the phenomenological modeling of the band structure of CeCoIn5. Moreover, it is shown that the emerging f-electron direct itineracy leads in a natural manner to three physically distinct regimes within a single model that are frequently discussed for 4f- or 5f-electron compounds as separate model situations. We identify these regimes as (i) the mixed-valence regime, (ii) Kondo/almost-Kondo insulating regime, and (iii) the Kondo-lattice limit when the f-electron occupancy is very close to the f-state half filling, ⟨nˆf⟩→1. The nonstandard features of the emerging correlated quantum liquid state are stressed."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:52:35Z","department":[{"_id":"MiLe"}],"citation":{"apa":"Wysokiński, M., Kaczmarczyk, J., &#38; Spałek, J. (2015). Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">https://doi.org/10.1103/PhysRevB.92.125135</a>","ista":"Wysokiński M, Kaczmarczyk J, Spałek J. 2015. Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. Physical Review B. 92(12), 125135.","chicago":"Wysokiński, Marcin, Jan Kaczmarczyk, and Jozef Spałek. “Gutzwiller Wave Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” <i>Physical Review B</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">https://doi.org/10.1103/PhysRevB.92.125135</a>.","ama":"Wysokiński M, Kaczmarczyk J, Spałek J. Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. <i>Physical Review B</i>. 2015;92(12). doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">10.1103/PhysRevB.92.125135</a>","ieee":"M. Wysokiński, J. Kaczmarczyk, and J. Spałek, “Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states,” <i>Physical Review B</i>, vol. 92, no. 12. American Physical Society, 2015.","mla":"Wysokiński, Marcin, et al. “Gutzwiller Wave Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” <i>Physical Review B</i>, vol. 92, no. 12, 125135, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">10.1103/PhysRevB.92.125135</a>.","short":"M. Wysokiński, J. Kaczmarczyk, J. Spałek, Physical Review B 92 (2015)."}},{"date_updated":"2021-01-12T06:52:35Z","department":[{"_id":"GaTk"}],"citation":{"short":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, M. Berry, PLoS Computational Biology 11 (2015).","mla":"Marre, Olivier, et al. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” <i>PLoS Computational Biology</i>, vol. 11, no. 7, e1004304, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">10.1371/journal.pcbi.1004304</a>.","ieee":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, and M. Berry, “High accuracy decoding of dynamical motion from a large retinal population,” <i>PLoS Computational Biology</i>, vol. 11, no. 7. Public Library of Science, 2015.","apa":"Marre, O., Botella Soler, V., Simmons, K., Mora, T., Tkačik, G., &#38; Berry, M. (2015). High accuracy decoding of dynamical motion from a large retinal population. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">https://doi.org/10.1371/journal.pcbi.1004304</a>","chicago":"Marre, Olivier, Vicente Botella Soler, Kristina Simmons, Thierry Mora, Gašper Tkačik, and Michael Berry. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” <i>PLoS Computational Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">https://doi.org/10.1371/journal.pcbi.1004304</a>.","ama":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. High accuracy decoding of dynamical motion from a large retinal population. <i>PLoS Computational Biology</i>. 2015;11(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">10.1371/journal.pcbi.1004304</a>","ista":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. 2015. High accuracy decoding of dynamical motion from a large retinal population. PLoS Computational Biology. 11(7), e1004304."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Motion tracking is a challenge the visual system has to solve by reading out the retinal population. It is still unclear how the information from different neurons can be combined together to estimate the position of an object. Here we recorded a large population of ganglion cells in a dense patch of salamander and guinea pig retinas while displaying a bar moving diffusively. We show that the bar’s position can be reconstructed from retinal activity with a precision in the hyperacuity regime using a linear decoder acting on 100+ cells. We then took advantage of this unprecedented precision to explore the spatial structure of the retina’s population code. The classical view would have suggested that the firing rates of the cells form a moving hill of activity tracking the bar’s position. Instead, we found that most ganglion cells in the salamander fired sparsely and idiosyncratically, so that their neural image did not track the bar. Furthermore, ganglion cell activity spanned an area much larger than predicted by their receptive fields, with cells coding for motion far in their surround. As a result, population redundancy was high, and we could find multiple, disjoint subsets of neurons that encoded the trajectory with high precision. This organization allows for diverse collections of ganglion cells to represent high-accuracy motion information in a form easily read out by downstream neural circuits.","lang":"eng"}],"publication_status":"published","ddc":["570"],"publisher":"Public Library of Science","date_published":"2015-07-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:12Z","title":"High accuracy decoding of dynamical motion from a large retinal population","oa":1,"acknowledgement":"This work was supported by grants EY 014196 and EY 017934 to MJB, ANR OPTIMA, the French State program Investissements d’Avenir managed by the Agence Nationale de la Recherche [LIFESENSES: ANR-10-LABX-65], and by a EC grant from the Human Brain Project (CLAP) to OM, the Austrian Research Foundation FWF P25651 to VBS and GT. VBS is partially supported by contracts MEC, Spain (Grant No. AYA2010- 22111-C03-02, Grant No. AYA2013-48623-C2-2 and FEDER Funds).","year":"2015","doi":"10.1371/journal.pcbi.1004304","day":"01","scopus_import":1,"intvolume":"        11","publist_id":"5447","publication":"PLoS Computational Biology","project":[{"call_identifier":"FWF","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425","name":"Sensitivity to higher-order statistics in natural scenes"}],"quality_controlled":"1","oa_version":"Published Version","author":[{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"full_name":"Botella Soler, Vicente","id":"421234E8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8790-1914","last_name":"Botella Soler","first_name":"Vicente"},{"full_name":"Simmons, Kristina","first_name":"Kristina","last_name":"Simmons"},{"last_name":"Mora","first_name":"Thierry","full_name":"Mora, Thierry"},{"last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"},{"full_name":"Berry, Michael","last_name":"Berry","first_name":"Michael"}],"month":"07","has_accepted_license":"1","issue":"7","file":[{"file_name":"IST-2016-455-v1+1_journal.pcbi.1004304.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:16:25Z","date_updated":"2020-07-14T12:45:12Z","checksum":"472b979f3f1cffb37b3e503f085115ca","file_id":"5212","creator":"system","access_level":"open_access","file_size":4673930,"relation":"main_file"}],"article_number":"e1004304","language":[{"iso":"eng"}],"volume":11,"date_created":"2018-12-11T11:53:31Z","_id":"1697","type":"journal_article","status":"public","pubrep_id":"455"},{"doi":"10.1016/j.ic.2015.03.001","year":"2015","page":"177 - 196","day":"01","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148), ERC Start grant (279499: inVEST).","oa":1,"publication":"Information and Computation","intvolume":"       241","publist_id":"5443","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>.","short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","chicago":"Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>.","ama":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. 2015;241(4):177-196. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>","ista":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.","apa":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &#38; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>","ieee":"Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” <i>Information and Computation</i>, vol. 241, no. 4. Elsevier, pp. 177–196, 2015."},"date_updated":"2021-01-12T06:52:36Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"The complexity of multi-mean-payoff and multi-energy games","date_published":"2015-04-01T00:00:00Z","publisher":"Elsevier","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy games and show inter-reducibility of multi-mean-payoff and multi-energy games for finite-memory strategies. We improve the computational complexity for solving both classes with finite-memory strategies: we prove coNP-completeness improving the previous known EXPSPACE bound. For memoryless strategies, we show that deciding the existence of a winning strategy for the protagonist is NP-complete. We present the first solution of multi-mean-payoff games with infinite-memory strategies: we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf objectives are coNP-complete.","lang":"eng"}],"publication_status":"published","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1209.3234","open_access":"1"}],"type":"journal_article","_id":"1698","date_created":"2018-12-11T11:53:32Z","ec_funded":1,"author":[{"last_name":"Velner","first_name":"Yaron","full_name":"Velner, Yaron"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Alexander","last_name":"Rabinovich","full_name":"Rabinovich, Alexander"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"volume":241,"language":[{"iso":"eng"}],"issue":"4","month":"04"},{"title":"Adaptive gene introgression after secondary contact","publisher":"Springer","file_date_updated":"2020-07-14T12:45:12Z","date_published":"2015-06-01T00:00:00Z","ddc":["576"],"abstract":[{"text":"By hybridization and backcrossing, alleles can surmount species boundaries and be incorporated into the genome of a related species. This introgression of genes is of particular evolutionary relevance if it involves the transfer of adaptations between populations. However, any beneficial allele will typically be associated with other alien alleles that are often deleterious and hamper the introgression process. In order to describe the introgression of an adaptive allele, we set up a stochastic model with an explicit genetic makeup of linked and unlinked deleterious alleles. Based on the theory of reducible multitype branching processes, we derive a recursive expression for the establishment probability of the beneficial allele after a single hybridization event. We furthermore study the probability that slightly deleterious alleles hitchhike to fixation. The key to the analysis is a split of the process into a stochastic phase in which the advantageous alleles establishes and a deterministic phase in which it sweeps to fixation. We thereafter apply the theory to a set of biologically relevant scenarios such as introgression in the presence of many unlinked or few closely linked deleterious alleles. A comparison to computer simulations shows that the approximations work well over a large parameter range.","lang":"eng"}],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Uecker, H., Setter, D., &#38; Hermisson, J. (2015). Adaptive gene introgression after secondary contact. <i>Journal of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s00285-014-0802-y\">https://doi.org/10.1007/s00285-014-0802-y</a>","ista":"Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary contact. Journal of Mathematical Biology. 70(7), 1523–1580.","chicago":"Uecker, Hildegard, Derek Setter, and Joachim Hermisson. “Adaptive Gene Introgression after Secondary Contact.” <i>Journal of Mathematical Biology</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00285-014-0802-y\">https://doi.org/10.1007/s00285-014-0802-y</a>.","ama":"Uecker H, Setter D, Hermisson J. Adaptive gene introgression after secondary contact. <i>Journal of Mathematical Biology</i>. 2015;70(7):1523-1580. doi:<a href=\"https://doi.org/10.1007/s00285-014-0802-y\">10.1007/s00285-014-0802-y</a>","ieee":"H. Uecker, D. Setter, and J. Hermisson, “Adaptive gene introgression after secondary contact,” <i>Journal of Mathematical Biology</i>, vol. 70, no. 7. Springer, pp. 1523–1580, 2015.","mla":"Uecker, Hildegard, et al. “Adaptive Gene Introgression after Secondary Contact.” <i>Journal of Mathematical Biology</i>, vol. 70, no. 7, Springer, 2015, pp. 1523–80, doi:<a href=\"https://doi.org/10.1007/s00285-014-0802-y\">10.1007/s00285-014-0802-y</a>.","short":"H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015) 1523–1580."},"date_updated":"2023-02-23T10:10:36Z","department":[{"_id":"NiBa"}],"publication":"Journal of Mathematical Biology","intvolume":"        70","publist_id":"5442","scopus_import":1,"day":"01","page":"1523 - 1580","year":"2015","doi":"10.1007/s00285-014-0802-y","acknowledgement":"This work was made possible with financial support by the Vienna Science and Technology Fund (WWTF), by the Deutsche Forschungsgemeinschaft (DFG), Research Unit 1078 Natural selection in structured populations, by the Austrian Science Fund (FWF) via funding for the Vienna Graduate School for Population Genetics, and by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with the Austrian Commission for UNESCO and the Austrian Academy of Sciences with financial support from the Federal Ministry for Science and Research Austria).","oa":1,"volume":70,"language":[{"iso":"eng"}],"issue":"7","file":[{"relation":"main_file","file_id":"5079","checksum":"00e3a67bda05d4cc165b3a48b41ef9ad","creator":"system","access_level":"open_access","file_size":1321527,"content_type":"application/pdf","date_created":"2018-12-12T10:14:27Z","date_updated":"2020-07-14T12:45:12Z","file_name":"IST-2016-458-v1+1_s00285-014-0802-y.pdf"}],"has_accepted_license":"1","month":"06","author":[{"first_name":"Hildegard","last_name":"Uecker","orcid":"0000-0001-9435-2813","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","full_name":"Uecker, Hildegard"},{"last_name":"Setter","first_name":"Derek","full_name":"Setter, Derek"},{"full_name":"Hermisson, Joachim","first_name":"Joachim","last_name":"Hermisson"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"_id":"25B67606-B435-11E9-9278-68D0E5697425","name":"L'OREAL Fellowship"}],"pubrep_id":"458","status":"public","type":"journal_article","_id":"1699","date_created":"2018-12-11T11:53:32Z"},{"publist_id":"5441","intvolume":"        92","publication":"Physical Review B","scopus_import":1,"acknowledgement":"The work is supported by European Research Council (ERC) Advanced Grant No. 338957 FEMTO/NANO.","doi":"10.1103/PhysRevB.92.081106","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1506.06007","open_access":"1"}],"year":"2015","day":"10","date_created":"2018-12-11T11:53:32Z","oa":1,"_id":"1700","type":"journal_article","publisher":"American Physical Society","date_published":"2015-08-10T00:00:00Z","language":[{"iso":"eng"}],"volume":92,"title":"Ultralong-range order in the Fermi-Hubbard model with long-range interactions","month":"08","publication_status":"published","abstract":[{"lang":"eng","text":"We use the dual boson approach to reveal the phase diagram of the Fermi-Hubbard model with long-range dipole-dipole interactions. By using a large-scale finite-temperature calculation on a 64×64 square lattice we demonstrate the existence of a novel phase, possessing an &quot;ultralong-range&quot; order. The fingerprint of this phase - the density correlation function - features a nontrivial behavior on a scale of tens of lattice sites. We study the properties and the stability of the ultralong-range-ordered phase, and show that it is accessible in modern experiments with ultracold polar molecules and magnetic atoms."}],"article_number":"081106","issue":"8","author":[{"first_name":"Erik","last_name":"Van Loon","full_name":"Van Loon, Erik"},{"full_name":"Katsnelson, Mikhail","first_name":"Mikhail","last_name":"Katsnelson"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"date_updated":"2021-01-12T06:52:37Z","oa_version":"Preprint","citation":{"ieee":"E. Van Loon, M. Katsnelson, and M. Lemeshko, “Ultralong-range order in the Fermi-Hubbard model with long-range interactions,” <i>Physical Review B</i>, vol. 92, no. 8. American Physical Society, 2015.","apa":"Van Loon, E., Katsnelson, M., &#38; Lemeshko, M. (2015). Ultralong-range order in the Fermi-Hubbard model with long-range interactions. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">https://doi.org/10.1103/PhysRevB.92.081106</a>","ama":"Van Loon E, Katsnelson M, Lemeshko M. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. <i>Physical Review B</i>. 2015;92(8). doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">10.1103/PhysRevB.92.081106</a>","chicago":"Van Loon, Erik, Mikhail Katsnelson, and Mikhail Lemeshko. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” <i>Physical Review B</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">https://doi.org/10.1103/PhysRevB.92.081106</a>.","ista":"Van Loon E, Katsnelson M, Lemeshko M. 2015. Ultralong-range order in the Fermi-Hubbard model with long-range interactions. Physical Review B. 92(8), 081106.","short":"E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015).","mla":"Van Loon, Erik, et al. “Ultralong-Range Order in the Fermi-Hubbard Model with Long-Range Interactions.” <i>Physical Review B</i>, vol. 92, no. 8, 081106, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.081106\">10.1103/PhysRevB.92.081106</a>."}},{"date_created":"2018-12-11T11:53:33Z","_id":"1701","type":"journal_article","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/","open_access":"1"}],"status":"public","quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425","name":"Sensitivity to higher-order statistics in natural scenes"}],"oa_version":"Submitted Version","author":[{"full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper"},{"last_name":"Mora","first_name":"Thierry","full_name":"Mora, Thierry"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"full_name":"Amodei, Dario","last_name":"Amodei","first_name":"Dario"},{"last_name":"Palmer","first_name":"Stephanie","full_name":"Palmer, Stephanie"},{"full_name":"Berry Ii, Michael","first_name":"Michael","last_name":"Berry Ii"},{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"}],"month":"09","issue":"37","language":[{"iso":"eng"}],"volume":112,"oa":1,"acknowledgement":"Research was supported in part by National Science Foundation Grants PHY-1305525, PHY-1451171, and CCF-0939370, by National Institutes of Health Grant R01 EY14196, and by Austrian Science Foundation Grant FWF P25651. Additional support was provided by the\r\nFannie and John Hertz Foundation, by the Swartz Foundation, by the W. M. Keck Foundation, and by the Simons Foundation.","day":"15","page":"11508 - 11513","doi":"10.1073/pnas.1514188112","year":"2015","scopus_import":1,"intvolume":"       112","publist_id":"5440","publication":"PNAS","date_updated":"2021-01-12T06:52:37Z","department":[{"_id":"GaTk"}],"citation":{"ieee":"G. Tkačik <i>et al.</i>, “Thermodynamics and signatures of criticality in a network of neurons,” <i>PNAS</i>, vol. 112, no. 37. National Academy of Sciences, pp. 11508–11513, 2015.","chicago":"Tkačik, Gašper, Thierry Mora, Olivier Marre, Dario Amodei, Stephanie Palmer, Michael Berry Ii, and William Bialek. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1514188112\">https://doi.org/10.1073/pnas.1514188112</a>.","ama":"Tkačik G, Mora T, Marre O, et al. Thermodynamics and signatures of criticality in a network of neurons. <i>PNAS</i>. 2015;112(37):11508-11513. doi:<a href=\"https://doi.org/10.1073/pnas.1514188112\">10.1073/pnas.1514188112</a>","ista":"Tkačik G, Mora T, Marre O, Amodei D, Palmer S, Berry Ii M, Bialek W. 2015. Thermodynamics and signatures of criticality in a network of neurons. PNAS. 112(37), 11508–11513.","apa":"Tkačik, G., Mora, T., Marre, O., Amodei, D., Palmer, S., Berry Ii, M., &#38; Bialek, W. (2015). Thermodynamics and signatures of criticality in a network of neurons. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1514188112\">https://doi.org/10.1073/pnas.1514188112</a>","short":"G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek, PNAS 112 (2015) 11508–11513.","mla":"Tkačik, Gašper, et al. “Thermodynamics and Signatures of Criticality in a Network of Neurons.” <i>PNAS</i>, vol. 112, no. 37, National Academy of Sciences, 2015, pp. 11508–13, doi:<a href=\"https://doi.org/10.1073/pnas.1514188112\">10.1073/pnas.1514188112</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["26330611"]},"abstract":[{"lang":"eng","text":"The activity of a neural network is defined by patterns of spiking and silence from the individual neurons. Because spikes are (relatively) sparse, patterns of activity with increasing numbers of spikes are less probable, but, with more spikes, the number of possible patterns increases. This tradeoff between probability and numerosity is mathematically equivalent to the relationship between entropy and energy in statistical physics. We construct this relationship for populations of up to N = 160 neurons in a small patch of the vertebrate retina, using a combination of direct and model-based analyses of experiments on the response of this network to naturalistic movies. We see signs of a thermodynamic limit, where the entropy per neuron approaches a smooth function of the energy per neuron as N increases. The form of this function corresponds to the distribution of activity being poised near an unusual kind of critical point. We suggest further tests of criticality, and give a brief discussion of its functional significance. "}],"publication_status":"published","publisher":"National Academy of Sciences","date_published":"2015-09-15T00:00:00Z","pmid":1,"title":"Thermodynamics and signatures of criticality in a network of neurons"},{"scopus_import":1,"publication":"Letters in Mathematical Physics","intvolume":"       105","publist_id":"5432","oa":1,"doi":"10.1007/s11005-015-0787-5","year":"2015","page":"1449 - 1466","day":"05","ddc":["510"],"abstract":[{"lang":"eng","text":"Given a convex function (Formula presented.) and two hermitian matrices A and B, Lewin and Sabin study in (Lett Math Phys 104:691–705, 2014) the relative entropy defined by (Formula presented.). Among other things, they prove that the so-defined quantity is monotone if and only if (Formula presented.) is operator monotone. The monotonicity is then used to properly define (Formula presented.) for bounded self-adjoint operators acting on an infinite-dimensional Hilbert space by a limiting procedure. More precisely, for an increasing sequence of finite-dimensional projections (Formula presented.) with (Formula presented.) strongly, the limit (Formula presented.) is shown to exist and to be independent of the sequence of projections (Formula presented.). The question whether this sequence converges to its &quot;obvious&quot; limit, namely (Formula presented.), has been left open. We answer this question in principle affirmatively and show that (Formula presented.). If the operators A and B are regular enough, that is (A − B), (Formula presented.) and (Formula presented.) are trace-class, the identity (Formula presented.) holds."}],"publication_status":"published","title":"Note on a family of monotone quantum relative entropies","date_published":"2015-08-05T00:00:00Z","publisher":"Springer","file_date_updated":"2020-07-14T12:45:13Z","citation":{"chicago":"Deuchert, Andreas, Christian Hainzl, and Robert Seiringer. “Note on a Family of Monotone Quantum Relative Entropies.” <i>Letters in Mathematical Physics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s11005-015-0787-5\">https://doi.org/10.1007/s11005-015-0787-5</a>.","ista":"Deuchert A, Hainzl C, Seiringer R. 2015. Note on a family of monotone quantum relative entropies. Letters in Mathematical Physics. 105(10), 1449–1466.","ama":"Deuchert A, Hainzl C, Seiringer R. Note on a family of monotone quantum relative entropies. <i>Letters in Mathematical Physics</i>. 2015;105(10):1449-1466. doi:<a href=\"https://doi.org/10.1007/s11005-015-0787-5\">10.1007/s11005-015-0787-5</a>","apa":"Deuchert, A., Hainzl, C., &#38; Seiringer, R. (2015). Note on a family of monotone quantum relative entropies. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-015-0787-5\">https://doi.org/10.1007/s11005-015-0787-5</a>","ieee":"A. Deuchert, C. Hainzl, and R. Seiringer, “Note on a family of monotone quantum relative entropies,” <i>Letters in Mathematical Physics</i>, vol. 105, no. 10. Springer, pp. 1449–1466, 2015.","mla":"Deuchert, Andreas, et al. “Note on a Family of Monotone Quantum Relative Entropies.” <i>Letters in Mathematical Physics</i>, vol. 105, no. 10, Springer, 2015, pp. 1449–66, doi:<a href=\"https://doi.org/10.1007/s11005-015-0787-5\">10.1007/s11005-015-0787-5</a>.","short":"A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105 (2015) 1449–1466."},"date_updated":"2021-01-12T06:52:38Z","department":[{"_id":"RoSe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"type":"journal_article","_id":"1704","date_created":"2018-12-11T11:53:34Z","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.07205"}],"issue":"10","file":[{"file_size":484967,"access_level":"open_access","creator":"dernst","checksum":"fd7307282a314cc1fbbaef77b187516b","file_id":"5836","relation":"main_file","file_name":"2015_LettersMathPhys_Deuchert.pdf","date_updated":"2020-07-14T12:45:13Z","date_created":"2019-01-15T14:42:07Z","content_type":"application/pdf"}],"month":"08","has_accepted_license":"1","volume":105,"language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Deuchert, Andreas","first_name":"Andreas","last_name":"Deuchert","orcid":"0000-0003-3146-6746"},{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}]},{"scopus_import":1,"publist_id":"5430","intvolume":"      9355","oa":1,"day":"01","page":"194 - 208","doi":"10.1007/978-3-319-24486-0_13","year":"2015","publication_status":"published","abstract":[{"lang":"eng","text":"We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin classifier. Our results show that, under mild conditions on the family of kernels used for learning, solving several related tasks simultaneously is beneficial over single task learning. In particular, as the number of observed tasks grows, assuming that in the considered family of kernels there exists one that yields low approximation error on all tasks, the overhead associated with learning such a kernel vanishes and the complexity converges to that of learning when this good kernel is given to the learner."}],"title":"Multi-task and lifelong learning of kernels","date_published":"2015-01-01T00:00:00Z","publisher":"Springer","citation":{"short":"A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.","mla":"Pentina, Anastasia, and Shai Ben David. <i>Multi-Task and Lifelong Learning of Kernels</i>. Vol. 9355, Springer, 2015, pp. 194–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">10.1007/978-3-319-24486-0_13</a>.","apa":"Pentina, A., &#38; Ben David, S. (2015). Multi-task and lifelong learning of kernels (Vol. 9355, pp. 194–208). Presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">https://doi.org/10.1007/978-3-319-24486-0_13</a>","ista":"Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels. ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 194–208.","chicago":"Pentina, Anastasia, and Shai Ben David. “Multi-Task and Lifelong Learning of Kernels,” 9355:194–208. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">https://doi.org/10.1007/978-3-319-24486-0_13</a>.","ama":"Pentina A, Ben David S. Multi-task and lifelong learning of kernels. In: Vol 9355. Springer; 2015:194-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-24486-0_13\">10.1007/978-3-319-24486-0_13</a>","ieee":"A. Pentina and S. Ben David, “Multi-task and lifelong learning of kernels,” presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada, 2015, vol. 9355, pp. 194–208."},"department":[{"_id":"ChLa"}],"date_updated":"2021-01-12T06:52:39Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2015-10-06","start_date":"2015-10-04","name":"ALT: Algorithmic Learning Theory","location":"Banff, AB, Canada"},"ec_funded":1,"type":"conference","_id":"1706","date_created":"2018-12-11T11:53:35Z","main_file_link":[{"url":"http://arxiv.org/abs/1602.06531","open_access":"1"}],"status":"public","month":"01","volume":9355,"language":[{"iso":"eng"}],"oa_version":"Preprint","project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding"}],"quality_controlled":"1","author":[{"full_name":"Pentina, Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina","first_name":"Anastasia"},{"first_name":"Shai","last_name":"Ben David","full_name":"Ben David, Shai"}]},{"language":[{"iso":"eng"}],"article_processing_charge":"No","volume":282,"month":"07","issue":"1812","author":[{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes","orcid":"0000-0002-0170-7353"},{"full_name":"Kanodia, Ayush","last_name":"Kanodia","first_name":"Ayush"},{"last_name":"Gupta","first_name":"Raghav","full_name":"Gupta, Raghav"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"}],"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Submitted Version","status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528522/","open_access":"1"}],"date_created":"2018-12-11T11:53:35Z","type":"journal_article","_id":"1709","article_type":"original","date_published":"2015-07-15T00:00:00Z","publisher":"Royal Society","pmid":1,"title":"Biological auctions with multiple rewards","abstract":[{"text":"The competition for resources among cells, individuals or species is a fundamental characteristic of evolution. Biological all-pay auctions have been used to model situations where multiple individuals compete for a single resource. However, in many situations multiple resources with various values exist and single reward auctions are not applicable. We generalize the model to multiple rewards and study the evolution of strategies. In biological all-pay auctions the bid of an individual corresponds to its strategy and is equivalent to its payment in the auction. The decreasingly ordered rewards are distributed according to the decreasingly ordered bids of the participating individuals. The reproductive success of an individual is proportional to its fitness given by the sum of the rewards won minus its payments. Hence, successful bidding strategies spread in the population. We find that the results for the multiple reward case are very different from the single reward case. While the mixed strategy equilibrium in the single reward case with more than two players consists of mostly low-bidding individuals, we show that the equilibrium can convert to many high-bidding individuals and a few low-bidding individuals in the multiple reward case. Some reward values lead to a specialization among the individuals where one subpopulation competes for the rewards and the other subpopulation largely avoids costly competitions. Whether the mixed strategy equilibrium is an evolutionarily stable strategy (ESS) depends on the specific values of the rewards.","lang":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["26180069"]},"date_updated":"2023-09-07T11:40:43Z","department":[{"_id":"KrCh"}],"citation":{"mla":"Reiter, Johannes, et al. “Biological Auctions with Multiple Rewards.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 282, no. 1812, Royal Society, 2015, doi:<a href=\"https://doi.org/10.1098/rspb.2015.1041\">10.1098/rspb.2015.1041</a>.","short":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015).","ieee":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 282, no. 1812. Royal Society, 2015.","apa":"Reiter, J., Kanodia, A., Gupta, R., Nowak, M., &#38; Chatterjee, K. (2015). Biological auctions with multiple rewards. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rspb.2015.1041\">https://doi.org/10.1098/rspb.2015.1041</a>","chicago":"Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, 2015. <a href=\"https://doi.org/10.1098/rspb.2015.1041\">https://doi.org/10.1098/rspb.2015.1041</a>.","ista":"Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).","ama":"Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. Biological auctions with multiple rewards. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2015;282(1812). doi:<a href=\"https://doi.org/10.1098/rspb.2015.1041\">10.1098/rspb.2015.1041</a>"},"intvolume":"       282","publist_id":"5425","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","related_material":{"record":[{"id":"1400","relation":"dissertation_contains","status":"public"}]},"scopus_import":1,"acknowledgement":"This work was supported by grants from the John Templeton Foundation, ERC Start Grant (279307: Graph Games), FWF NFN Grant (No S11407N23 RiSE/SHiNE), FWF Grant (No P23499N23) and a Microsoft faculty fellows award.","year":"2015","doi":"10.1098/rspb.2015.1041","day":"15","oa":1},{"issue":"4","month":"07","volume":47,"language":[{"iso":"eng"}],"oa_version":"Preprint","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","author":[{"orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander","last_name":"Plakhov","full_name":"Plakhov, Alexander"}],"ec_funded":1,"_id":"1710","type":"journal_article","date_created":"2018-12-11T11:53:36Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.3736"}],"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by a function u : (-1, 1) → ℝ, u(x) &lt; 0, and a vertical flow of point particles incident on the hollow. It is assumed that u satisfies the so-called single impact condition (SIC): each incident particle is elastically reflected by graph(u) and goes away without hitting the graph of u anymore. We solve the problem: find the function u minimizing the force of resistance created by the flow. We show that the graph of the minimizer is formed by two arcs of parabolas symmetric to each other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals 1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014), pp. 2730-2742] stating in particular that the minimal resistance of a hollow in higher dimensions equals 0.5. We additionally consider a similar problem of minimal resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1 is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x = (x1,...,xd), u(ξ) &lt; 0 for 0 ≤ ξ &lt; 1, and u(ξ) = 0 for ξ ≥ 1, and the flow is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides with 0.6435 when d = 1) and converges to 0.5 as d → ∞."}],"title":"Minimal resistance of curves under the single impact assumption","date_published":"2015-07-14T00:00:00Z","publisher":"SIAM","citation":{"short":"A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47 (2015) 2754–2769.","mla":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” <i>Society for Industrial and Applied Mathematics</i>, vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:<a href=\"https://doi.org/10.1137/140993843\">10.1137/140993843</a>.","apa":"Akopyan, A., &#38; Plakhov, A. (2015). Minimal resistance of curves under the single impact assumption. <i>Society for Industrial and Applied Mathematics</i>. SIAM. <a href=\"https://doi.org/10.1137/140993843\">https://doi.org/10.1137/140993843</a>","ama":"Akopyan A, Plakhov A. Minimal resistance of curves under the single impact assumption. <i>Society for Industrial and Applied Mathematics</i>. 2015;47(4):2754-2769. doi:<a href=\"https://doi.org/10.1137/140993843\">10.1137/140993843</a>","ista":"Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.","chicago":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” <i>Society for Industrial and Applied Mathematics</i>. SIAM, 2015. <a href=\"https://doi.org/10.1137/140993843\">https://doi.org/10.1137/140993843</a>.","ieee":"A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single impact assumption,” <i>Society for Industrial and Applied Mathematics</i>, vol. 47, no. 4. SIAM, pp. 2754–2769, 2015."},"department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:52:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"publication":"Society for Industrial and Applied Mathematics","publist_id":"5423","intvolume":"        47","oa":1,"year":"2015","page":"2754 - 2769","doi":"10.1137/140993843","day":"14"},{"language":[{"iso":"eng"}],"volume":36,"has_accepted_license":"1","month":"10","issue":"10","file":[{"relation":"main_file","file_size":1023680,"access_level":"open_access","creator":"system","checksum":"bbb1ee39ca52929aefe4f48752b166ee","file_id":"5098","date_updated":"2020-07-14T12:45:13Z","date_created":"2018-12-12T10:14:44Z","content_type":"application/pdf","file_name":"IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf"}],"author":[{"first_name":"Aparna","last_name":"Ratheesh","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","full_name":"Ratheesh, Aparna"},{"id":"47F080FE-F248-11E8-B48F-1D18A9856A87","full_name":"Belyaeva, Vera","first_name":"Vera","last_name":"Belyaeva"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","full_name":"Siekhaus, Daria E","first_name":"Daria E","last_name":"Siekhaus","orcid":"0000-0001-8323-8353"}],"quality_controlled":"1","project":[{"grant_number":"334077","_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions","call_identifier":"FP7"}],"oa_version":"Published Version","ec_funded":1,"pubrep_id":"346","status":"public","date_created":"2018-12-11T11:53:36Z","_id":"1712","type":"journal_article","date_published":"2015-10-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:13Z","publisher":"Elsevier","title":"Drosophila immune cell migration and adhesion during embryonic development and larval immune responses","abstract":[{"lang":"eng","text":"The majority of immune cells in Drosophila melanogaster are plasmatocytes; they carry out similar functions to vertebrate macrophages, influencing development as well as protecting against infection and cancer. Plasmatocytes, sometimes referred to with the broader term of hemocytes, migrate widely during embryonic development and cycle in the larvae between sessile and circulating positions. Here we discuss the similarities of plasmatocyte developmental migration and its functions to that of vertebrate macrophages, considering the recent controversy regarding the functions of Drosophila PDGF/VEGF related ligands. We also examine recent findings on the significance of adhesion for plasmatocyte migration in the embryo, as well as proliferation, trans-differentiation, and tumor responses in the larva. We spotlight parallels throughout to vertebrate immune responses."}],"publication_status":"published","ddc":["573"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"date_updated":"2021-01-12T06:52:41Z","department":[{"_id":"DaSi"}],"citation":{"ieee":"A. Ratheesh, V. Belyaeva, and D. E. Siekhaus, “Drosophila immune cell migration and adhesion during embryonic development and larval immune responses,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 71–79, 2015.","apa":"Ratheesh, A., Belyaeva, V., &#38; Siekhaus, D. E. (2015). Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">https://doi.org/10.1016/j.ceb.2015.07.003</a>","ama":"Ratheesh A, Belyaeva V, Siekhaus DE. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. <i>Current Opinion in Cell Biology</i>. 2015;36(10):71-79. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">10.1016/j.ceb.2015.07.003</a>","ista":"Ratheesh A, Belyaeva V, Siekhaus DE. 2015. Drosophila immune cell migration and adhesion during embryonic development and larval immune responses. Current Opinion in Cell Biology. 36(10), 71–79.","chicago":"Ratheesh, Aparna, Vera Belyaeva, and Daria E Siekhaus. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">https://doi.org/10.1016/j.ceb.2015.07.003</a>.","short":"A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology 36 (2015) 71–79.","mla":"Ratheesh, Aparna, et al. “Drosophila Immune Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 71–79, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.07.003\">10.1016/j.ceb.2015.07.003</a>."},"intvolume":"        36","publist_id":"5421","publication":"Current Opinion in Cell Biology","scopus_import":1,"year":"2015","day":"01","page":"71 - 79","doi":"10.1016/j.ceb.2015.07.003","oa":1}]