[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"388","year":"2015","title":"Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3","publication_status":"published","status":"public","publisher":"American Physical Society","intvolume":" 114","author":[{"full_name":"Alpichshev, Zhanybek","first_name":"Zhanybek","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203"},{"full_name":"Mahmood, Fahad","last_name":"Mahmood","first_name":"Fahad"},{"last_name":"Cao","first_name":"Gang","full_name":"Cao, Gang"},{"last_name":"Gedik","first_name":"Nuh","full_name":"Gedik, Nuh"}],"date_created":"2018-12-11T11:46:11Z","date_updated":"2021-01-12T07:52:54Z","oa_version":"Published Version","volume":114,"type":"journal_article","abstract":[{"text":"We use ultrafast optical spectroscopy to observe binding of charged single-particle excitations (SE) in the magnetically frustrated Mott insulator Na2IrO3. Above the antiferromagnetic ordering temperature (TN) the system response is due to both Hubbard excitons (HE) and their constituent unpaired SE. The SE response becomes strongly suppressed immediately below TN. We argue that this increase in binding energy is due to a unique interplay between the frustrated Kitaev and the weak Heisenberg-type ordering term in the Hamiltonian, mediating an effective interaction between the spin-singlet SE. This interaction grows with distance causing the SE to become trapped in the HE, similar to quark confinement inside hadrons. This binding of charged particles, induced by magnetic ordering, is a result of a confinement-deconfinement transition of spin excitations. This observation provides evidence for spin liquid type behavior which is expected in Na2IrO3.","lang":"eng"}],"publist_id":"7441","issue":"1","extern":"1","publication":"Physical Review Letters","citation":{"short":"Z. Alpichshev, F. Mahmood, G. Cao, N. Gedik, Physical Review Letters 114 (2015).","mla":"Alpichshev, Zhanybek, et al. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” Physical Review Letters, vol. 114, no. 1, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.017203.","chicago":"Alpichshev, Zhanybek, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.017203.","ama":"Alpichshev Z, Mahmood F, Cao G, Gedik N. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 2015;114(1). doi:10.1103/PhysRevLett.114.017203","apa":"Alpichshev, Z., Mahmood, F., Cao, G., & Gedik, N. (2015). Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.017203","ieee":"Z. Alpichshev, F. Mahmood, G. Cao, and N. Gedik, “Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3,” Physical Review Letters, vol. 114, no. 1. American Physical Society, 2015.","ista":"Alpichshev Z, Mahmood F, Cao G, Gedik N. 2015. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 114(1)."},"main_file_link":[{"url":"https://dspace.mit.edu/handle/1721.1/92979","open_access":"1"}],"oa":1,"quality_controlled":"1","article_type":"original","doi":"10.1103/PhysRevLett.114.017203","date_published":"2015-07-07T00:00:00Z","language":[{"iso":"eng"}],"month":"07","day":"07","article_processing_charge":"No"},{"date_published":"2015-07-01T00:00:00Z","publication":"Proceedings - Symposium on Logic in Computer Science","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34."},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","_id":"1661","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","title":"Improved algorithms for one-pair and k-pair Streett objectives","status":"public","abstract":[{"text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"type":"conference","conference":{"name":"LICS: Logic in Computer Science","location":"Kyoto, Japan","start_date":"2015-07-06","end_date":"2015-07-10"},"doi":"10.1109/LICS.2015.34","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://eprints.cs.univie.ac.at/4368/","open_access":"1"}],"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"month":"07","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"464"}]},"date_updated":"2023-02-23T12:20:05Z","date_created":"2018-12-11T11:53:19Z","volume":"2015-July","year":"2015","acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrCh"}],"ec_funded":1,"publist_id":"5489","article_number":"7174888"},{"abstract":[{"text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2.","lang":"eng"}],"type":"journal_article","pubrep_id":"951","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:12:53Z","checksum":"a40eb4016717ddc9927154798a4c164a","file_id":"4974","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":1084254,"file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","access_level":"open_access"}],"_id":"473","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2","title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","ddc":["539"],"status":"public","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2015-01-01T00:00:00Z","citation":{"ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2015;2:65-115. doi:10.5802/jep.18","apa":"Lewin, M., Nam, P., & Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique. https://doi.org/10.5802/jep.18","ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.","ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:10.5802/jep.18.","chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique, 2015. https://doi.org/10.5802/jep.18."},"publication":"Journal de l'Ecole Polytechnique - Mathematiques","page":"65 - 115","publist_id":"7344","ec_funded":1,"file_date_updated":"2020-07-14T12:46:35Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"full_name":"Phan Thanh, Nam","first_name":"Nam","last_name":"Phan Thanh","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rougerie, Nicolas","first_name":"Nicolas","last_name":"Rougerie"}],"volume":2,"date_updated":"2021-01-12T08:00:52Z","date_created":"2018-12-11T11:46:40Z","year":"2015","department":[{"_id":"RoSe"}],"publisher":"Ecole Polytechnique","publication_status":"published","month":"01","doi":"10.5802/jep.18","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1"},{"scopus_import":1,"day":"15","month":"06","page":"2866 - 2880","quality_controlled":"1","citation":{"mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” Journal of Cell Science, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:10.1242/jcs.167999.","short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” Journal of Cell Science. Company of Biologists, 2015. https://doi.org/10.1242/jcs.167999.","ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 2015;128(15):2866-2880. doi:10.1242/jcs.167999","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.167999","ieee":"K. Holst et al., “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” Journal of Cell Science, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015."},"publication":"Journal of Cell Science","language":[{"iso":"eng"}],"date_published":"2015-06-15T00:00:00Z","doi":"10.1242/jcs.167999","type":"journal_article","issue":"15","publist_id":"7343","abstract":[{"lang":"eng","text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders."}],"publisher":"Company of Biologists","department":[{"_id":"MiSi"}],"intvolume":" 128","publication_status":"published","title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","status":"public","year":"2015","_id":"477","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":128,"oa_version":"None","date_updated":"2021-01-12T08:00:54Z","date_created":"2018-12-11T11:46:41Z","author":[{"full_name":"Holst, Katrin","first_name":"Katrin","last_name":"Holst"},{"full_name":"Guseva, Daria","last_name":"Guseva","first_name":"Daria"},{"full_name":"Schindler, Susann","last_name":"Schindler","first_name":"Susann"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"first_name":"Armin","last_name":"Braun","full_name":"Braun, Armin"},{"full_name":"Chopra, Himpriya","first_name":"Himpriya","last_name":"Chopra"},{"full_name":"Pabst, Oliver","last_name":"Pabst","first_name":"Oliver"},{"full_name":"Ponimaskin, Evgeni","last_name":"Ponimaskin","first_name":"Evgeni"}]},{"month":"03","language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2015.03.010","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_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"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1302.4248"}],"ec_funded":1,"publist_id":"7296","volume":242,"date_updated":"2023-02-23T10:36:02Z","date_created":"2018-12-11T11:46:57Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2279"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Mickael","last_name":"Randour","full_name":"Randour, Mickael"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"department":[{"_id":"KrCh"}],"publisher":"Elsevier","publication_status":"published","year":"2015","day":"24","scopus_import":1,"date_published":"2015-03-24T00:00:00Z","page":"25 - 52","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.","mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:10.1016/j.ic.2015.03.010.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","apa":"Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.010","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. Information and Computation. 2015;242(6):25-52. doi:10.1016/j.ic.2015.03.010"},"publication":"Information and Computation","issue":"6","abstract":[{"lang":"eng","text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 242","title":"Looking at mean-payoff and total-payoff through windows","status":"public","_id":"523","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants."}],"issue":"3","publist_id":"7285","type":"journal_article","author":[{"first_name":"Wenyang","last_name":"Li","full_name":"Li, Wenyang"},{"full_name":"Ma, Mengdi","first_name":"Mengdi","last_name":"Ma"},{"full_name":"Feng, Ying","first_name":"Ying","last_name":"Feng"},{"last_name":"Li","first_name":"Hongjiang","orcid":"0000-0001-5039-9660","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Hongjiang"},{"last_name":"Wang","first_name":"Yichuan","full_name":"Wang, Yichuan"},{"last_name":"Ma","first_name":"Yutong","full_name":"Ma, Yutong"},{"last_name":"Li","first_name":"Mingzhe","full_name":"Li, Mingzhe"},{"full_name":"An, Fengying","first_name":"Fengying","last_name":"An"},{"full_name":"Guo, Hongwei","last_name":"Guo","first_name":"Hongwei"}],"date_updated":"2021-01-12T08:01:27Z","date_created":"2018-12-11T11:47:00Z","volume":163,"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"532","year":"2015","title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","status":"public","publication_status":"published","intvolume":" 163","department":[{"_id":"JiFr"}],"publisher":"Cell Press","month":"10","day":"22","scopus_import":1,"date_published":"2015-10-22T00:00:00Z","doi":"10.1016/j.cell.2015.09.037","language":[{"iso":"eng"}],"publication":"Cell","citation":{"ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 2015;163(3):670-683. doi:10.1016/j.cell.2015.09.037","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. Cell Press. https://doi.org/10.1016/j.cell.2015.09.037","ieee":"W. Li et al., “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” Cell, vol. 163, no. 3. Cell Press, pp. 670–683, 2015.","mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” Cell, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:10.1016/j.cell.2015.09.037.","short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” Cell. Cell Press, 2015. https://doi.org/10.1016/j.cell.2015.09.037."},"quality_controlled":"1","page":"670 - 683"},{"day":"11","scopus_import":1,"date_published":"2015-10-11T00:00:00Z","page":"2 - 24","citation":{"ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. Information and Computation. 2015;242(6):2-24. doi:10.1016/j.ic.2015.03.009","ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.009","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.","short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009."},"publication":"Information and Computation","issue":"6","abstract":[{"lang":"eng","text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 242","status":"public","title":"Qualitative analysis of concurrent mean payoff games","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"524","month":"10","language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2015.03.009","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1409.5306","open_access":"1"}],"external_id":{"arxiv":["1409.5306"]},"oa":1,"publist_id":"7295","volume":242,"date_created":"2018-12-11T11:46:57Z","date_updated":"2023-02-23T12:24:45Z","related_material":{"record":[{"id":"5403","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2015"},{"ec_funded":1,"publist_id":"5713","related_material":{"record":[{"id":"5410","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Ahmed, Umair","last_name":"Ahmed","first_name":"Umair"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Gulwani, Sumit","last_name":"Gulwani","first_name":"Sumit"}],"volume":2,"date_updated":"2023-02-23T12:25:07Z","date_created":"2018-12-11T11:52:16Z","acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n","year":"2015","publisher":"AAAI Press","department":[{"_id":"KrCh"}],"publication_status":"published","month":"01","conference":{"end_date":"2015-01-30","start_date":"2015-01-25","location":"Austin, TX, USA","name":"AAAI: Conference on Artificial Intelligence"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300"}],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. We present an approach that generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. The presence of such states for standard game variants like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played as the default start state is heavily biased. "}],"type":"conference","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1481","intvolume":" 2","title":"Automatic generation of alternative starting positions for simple traditional board games","status":"public","article_processing_charge":"No","day":"01","scopus_import":1,"date_published":"2015-01-01T00:00:00Z","citation":{"ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.","apa":"Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.","ama":"Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting positions for simple traditional board games. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.","mla":"Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52."},"publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","page":"745 - 752"},{"month":"01","doi":"10.1109/ICRA.2015.7139019","conference":{"end_date":"2015-05-30","location":"Seattle, WA, United States","start_date":"2015-05-26","name":"ICRA: International Conference on Robotics and Automation"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1409.3360"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1409.3360","open_access":"1"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","publist_id":"5394","ec_funded":1,"related_material":{"record":[{"id":"5424","status":"public","relation":"earlier_version"},{"id":"5426","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gupta","first_name":"Raghav","full_name":"Gupta, Raghav"},{"first_name":"Ayush","last_name":"Kanodia","full_name":"Kanodia, Ayush"}],"date_created":"2018-12-11T11:53:43Z","date_updated":"2023-02-23T12:25:52Z","year":"2015","publisher":"IEEE","department":[{"_id":"KrCh"}],"publication_status":"published","day":"01","scopus_import":1,"date_published":"2015-01-01T00:00:00Z","citation":{"short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IEEE, 2015, pp. 325–30, doi:10.1109/ICRA.2015.7139019.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. doi:10.1109/ICRA.2015.7139019","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330."},"page":"325 - 330","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty."}],"type":"conference","oa_version":"Preprint","_id":"1732","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","status":"public"},{"date_published":"2015-02-19T00:00:00Z","doi":"10.15479/AT:IST-2015-322-v1-1","language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria; 2015. doi:10.15479/AT:IST-2015-322-v1-1"},"oa":1,"page":"25","month":"02","day":"19","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Hansen, Kristoffer","last_name":"Hansen","first_name":"Kristoffer"}],"pubrep_id":"322","date_created":"2018-12-12T11:39:17Z","date_updated":"2021-01-12T08:02:13Z","oa_version":"Published Version","file":[{"file_size":661015,"content_type":"application/pdf","creator":"system","file_name":"IST-2015-322-v1+1_safetygames.pdf","access_level":"open_access","date_created":"2018-12-12T11:53:31Z","date_updated":"2020-07-14T12:46:53Z","checksum":"bfb858262c30445b8e472c40069178a2","relation":"main_file","file_id":"5491"}],"year":"2015","_id":"5431","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"The patience of concurrent stochastic games with safety and reachability objectives","publication_status":"published","ddc":["005","519"],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:53Z","abstract":[{"lang":"eng","text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"date_updated":"2020-07-14T23:04:59Z","date_created":"2018-12-12T11:39:18Z","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2015-326-v1+1_main.pdf","creator":"system","content_type":"application/pdf","file_size":378162,"file_id":"5475","relation":"main_file","checksum":"8542fd0b10aed7811cd41077b8ccb632","date_created":"2018-12-12T11:53:14Z","date_updated":"2020-07-14T12:46:53Z"},{"access_level":"closed","file_name":"IST-2015-326-v1+2_authors.txt","creator":"dernst","content_type":"text/plain","file_size":64,"file_id":"6317","relation":"main_file","checksum":"84c31c537bdaf7a91909f18d25d640ab","date_updated":"2020-07-14T12:46:53Z","date_created":"2019-04-16T13:00:33Z"}],"author":[{"first_name":"1","last_name":"Anonymous","full_name":"Anonymous, 1"},{"full_name":"Anonymous, 2","last_name":"Anonymous","first_name":"2"}],"pubrep_id":"326","ddc":["000"],"title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","status":"public","publication_status":"published","publisher":"IST Austria","year":"2015","_id":"5434","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new method to solve the problem that extends methods for finite-horizon DEC- POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show our approach presents promising results."}],"file_date_updated":"2020-07-14T12:46:53Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","language":[{"iso":"eng"}],"date_published":"2015-02-19T00:00:00Z","page":"16","citation":{"ama":"Anonymous 1, Anonymous 2. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. IST Austria; 2015.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p.","ieee":"1 Anonymous and 2 Anonymous, Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria, 2015.","apa":"Anonymous, 1, & Anonymous, 2. (2015). Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria.","mla":"Anonymous, 1, and 2 Anonymous. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.","chicago":"Anonymous, 1, and 2 Anonymous. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. IST Austria, 2015."},"oa":1,"month":"02","day":"19","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]}},{"month":"07","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1109/LICS.2015.32","conference":{"end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"publist_id":"5493","ec_funded":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IEEE","publication_status":"published","year":"2015","acknowledgement":"A Technical Report of this paper is available at: https://repository.ist.ac.at/327\r\n","date_created":"2018-12-11T11:53:18Z","date_updated":"2023-02-23T12:26:16Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"466"},{"status":"public","relation":"earlier_version","id":"5429"},{"id":"5435","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zuzana","last_name":"Komárková","full_name":"Komárková, Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"}],"series_title":"LICS","scopus_import":1,"day":"01","page":"244 - 256","citation":{"short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.","chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:10.1109/LICS.2015.32","apa":"Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256."},"date_published":"2015-07-01T00:00:00Z","alternative_title":["LICS"],"type":"conference","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"status":"public","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1657","oa_version":"None"},{"month":"07","language":[{"iso":"eng"}],"conference":{"end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2015.72","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1606.03598"]},"ec_funded":1,"publist_id":"5494","article_number":"7174926","date_created":"2018-12-11T11:53:17Z","date_updated":"2023-02-23T12:26:19Z","volume":"2015-July","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"467"},{"id":"5415","relation":"earlier_version","status":"public"},{"id":"5436","relation":"earlier_version","status":"public"}]},"publication_status":"published","publisher":"IEEE","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"year":"2015","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nA Technical Report of the paper is available at: \r\nhttps://repository.ist.ac.at/331/\r\n","day":"31","scopus_import":1,"date_published":"2015-07-31T00:00:00Z","publication":"Proceedings - Symposium on Logic in Computer Science","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.72","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174926, IEEE, 2015, doi:10.1109/LICS.2015.72.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72."},"abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"type":"conference","oa_version":"None","status":"public","title":"Nested weighted automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1656"},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"1657"},{"id":"466","status":"public","relation":"later_version"},{"status":"public","relation":"later_version","id":"5435"}]},"pubrep_id":"318","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Komarkova, Zuzana","first_name":"Zuzana","last_name":"Komarkova"},{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"}],"file":[{"date_created":"2018-12-12T11:54:11Z","date_updated":"2020-07-14T12:46:52Z","checksum":"e4869a584567c506349abda9c8ec7db3","file_id":"5533","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":689863,"file_name":"IST-2015-318-v1+1_main.pdf","access_level":"open_access"}],"oa_version":"Published Version","date_updated":"2023-02-23T12:26:16Z","date_created":"2018-12-12T11:39:17Z","_id":"5429","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","department":[{"_id":"KrCh"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","status":"public","publication_status":"published","ddc":["004"],"abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:52Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_published":"2015-01-12T00:00:00Z","doi":"10.15479/AT:IST-2015-318-v1-1","language":[{"iso":"eng"}],"citation":{"short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p."},"oa":1,"page":"41","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"month":"01","day":"12"},{"oa":1,"citation":{"short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v2-1","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p."},"page":"51","date_published":"2015-02-23T00:00:00Z","doi":"10.15479/AT:IST-2015-318-v2-1","language":[{"iso":"eng"}],"day":"23","month":"02","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","_id":"5435","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","status":"public","ddc":["004"],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"IST Austria","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Komarkova, Zuzana","first_name":"Zuzana","last_name":"Komarkova"},{"first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"}],"related_material":{"record":[{"id":"1657","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"466"},{"id":"5429","relation":"earlier_version","status":"public"}]},"pubrep_id":"327","date_updated":"2023-02-23T12:26:00Z","date_created":"2018-12-12T11:39:19Z","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5525","checksum":"75284adec80baabdfe71ff9ebbc27445","date_updated":"2020-07-14T12:46:53Z","date_created":"2018-12-12T11:54:03Z","access_level":"open_access","file_name":"IST-2015-318-v2+1_main.pdf","file_size":717630,"content_type":"application/pdf","creator":"system"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:53Z","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}]},{"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"month":"04","day":"24","page":"29","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-170-v2-2","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-170-v2-2.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2015-04-24T00:00:00Z","doi":"10.15479/AT:IST-2015-170-v2-2","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:54Z","abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.\r\nIn nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IST Austria","publication_status":"published","title":"Nested weighted automata","ddc":["000"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5436","year":"2015","file":[{"content_type":"application/pdf","file_size":569991,"creator":"system","access_level":"open_access","file_name":"IST-2015-170-v2+2_report.pdf","checksum":"3c402f47d3669c28d04d1af405a08e3f","date_updated":"2020-07-14T12:46:54Z","date_created":"2018-12-12T11:54:19Z","relation":"main_file","file_id":"5541"}],"oa_version":"Published Version","date_updated":"2023-02-23T12:25:21Z","date_created":"2018-12-12T11:39:19Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1656"},{"relation":"later_version","status":"public","id":"467"},{"id":"5415","status":"public","relation":"earlier_version"}]},"pubrep_id":"331","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}]},{"series_title":"Logic in Computer Science","scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No","page":"750 - 761","publication":"LICS","citation":{"chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. “The Target Discounted-Sum Problem.” In LICS, 750–61. Logic in Computer Science. IEEE, 2015. https://doi.org/10.1109/LICS.2015.74.","short":"U. Boker, T.A. Henzinger, J. Otop, in:, LICS, IEEE, 2015, pp. 750–761.","mla":"Boker, Udi, et al. “The Target Discounted-Sum Problem.” LICS, IEEE, 2015, pp. 750–61, doi:10.1109/LICS.2015.74.","ieee":"U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,” in LICS, Kyoto, Japan, 2015, pp. 750–761.","apa":"Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum problem. In LICS (pp. 750–761). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.74","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS. LICS: Logic in Computer ScienceLogic in Computer Science, 750–761.","ama":"Boker U, Henzinger TA, Otop J. The target discounted-sum problem. In: LICS. Logic in Computer Science. IEEE; 2015:750-761. doi:10.1109/LICS.2015.74"},"date_published":"2015-07-01T00:00:00Z","type":"conference","abstract":[{"text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata.","lang":"eng"}],"status":"public","title":"The target discounted-sum problem","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1659","file":[{"relation":"main_file","file_id":"7852","date_updated":"2020-07-14T12:45:10Z","date_created":"2020-05-15T08:53:29Z","checksum":"6abebca9c1a620e9e103a8f9222befac","file_name":"2015_LICS_Boker.pdf","access_level":"open_access","content_type":"application/pdf","file_size":340215,"creator":"dernst"}],"oa_version":"Submitted Version","month":"07","publication_identifier":{"eisbn":["978-1-4799-8875-4 "],"issn":["1043-6871 "]},"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2015-07-10","start_date":"2015-007-06","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2015.74","file_date_updated":"2020-07-14T12:45:10Z","ec_funded":1,"publist_id":"5491","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"IEEE","year":"2015","acknowledgement":"A technical report of the article is available at: https://research-explorer.app.ist.ac.at/record/5439","date_updated":"2023-02-23T12:26:27Z","date_created":"2018-12-11T11:53:19Z","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"5439","relation":"earlier_version","status":"public"}]}},{"publication":"42nd International Colloquium","citation":{"ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_10","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: 42nd International Colloquium. Vol 9135. Springer Nature; 2015:121-133. doi:10.1007/978-3-662-47666-6_10","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” 42nd International Colloquium, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133."},"page":"121 - 133","date_published":"2015-07-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"1610","status":"public","title":"Edit distance for pushdown automata","intvolume":" 9135","pubrep_id":"321","oa_version":"None","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k.","lang":"eng"}],"issue":"Part II","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.08259","open_access":"1"}],"external_id":{"arxiv":["1504.08259"]},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan"},"doi":"10.1007/978-3-662-47666-6_10","language":[{"iso":"eng"}],"month":"07","publication_identifier":{"isbn":["978-3-662-47665-9"]},"year":"2015","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"}],"related_material":{"record":[{"id":"465","status":"public","relation":"later_version"},{"id":"5438","status":"public","relation":"earlier_version"}]},"date_created":"2018-12-11T11:53:01Z","date_updated":"2023-02-23T12:26:24Z","volume":9135,"publist_id":"5556","ec_funded":1},{"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2015-330-v2-1","date_published":"2015-04-27T00:00:00Z","page":"27","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-330-v2-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p."},"oa":1,"day":"27","month":"04","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_updated":"2023-02-23T12:26:05Z","date_created":"2018-12-12T11:39:19Z","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":1072137,"creator":"system","access_level":"open_access","file_name":"IST-2015-330-v2+1_main.pdf","checksum":"f5917c20f84018b362d385c000a2e123","date_created":"2018-12-12T11:53:12Z","date_updated":"2020-07-14T12:46:54Z","relation":"main_file","file_id":"5473"}],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1607"},{"id":"5430","relation":"earlier_version","status":"public"}]},"pubrep_id":"333","ddc":["000"],"status":"public","title":"Faster algorithms for quantitative verification in constant treewidth graphs","publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5437","year":"2015","file_date_updated":"2020-07-14T12:46:54Z","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. \r\nThe algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main theoretical results are as follows.\r\nFirst, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when the output is $\\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$ and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. "}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report"},{"type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"file_date_updated":"2020-07-14T12:46:52Z","_id":"5430","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"status":"public","title":"Faster algorithms for quantitative verification in constant treewidth graphs","publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"}],"pubrep_id":"319","related_material":{"record":[{"id":"1607","status":"public","relation":"later_version"},{"status":"public","relation":"later_version","id":"5437"}]},"date_created":"2018-12-12T11:39:17Z","date_updated":"2023-02-23T12:26:22Z","file":[{"checksum":"62c6ea01e342553dcafb88a070fb1ad5","date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:53:21Z","file_id":"5482","relation":"main_file","creator":"system","file_size":1089651,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2015-319-v1+1_long.pdf"}],"oa_version":"Published Version","day":"10","month":"02","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"oa":1,"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1."},"page":"31","doi":"10.15479/AT:IST-2015-319-v1-1","date_published":"2015-02-10T00:00:00Z","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","day":"18","month":"05","citation":{"mla":"Boker, Udi, et al. The Target Discounted-Sum Problem. IST Austria, 2015, doi:10.15479/AT:IST-2015-335-v1-1.","short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. The Target Discounted-Sum Problem. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-335-v1-1.","ama":"Boker U, Henzinger TA, Otop J. The Target Discounted-Sum Problem. IST Austria; 2015. doi:10.15479/AT:IST-2015-335-v1-1","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","apa":"Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum problem. IST Austria. https://doi.org/10.15479/AT:IST-2015-335-v1-1","ieee":"U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem. IST Austria, 2015."},"oa":1,"page":"20","doi":"10.15479/AT:IST-2015-335-v1-1","date_published":"2015-05-18T00:00:00Z","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata. ","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:55Z","_id":"5439","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","department":[{"_id":"ToHe"}],"publication_status":"published","title":"The target discounted-sum problem","ddc":["004","512","513"],"status":"public","pubrep_id":"335","related_material":{"record":[{"relation":"later_version","status":"public","id":"1659"}]},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"oa_version":"Published Version","file":[{"file_name":"IST-2015-335-v1+1_report.pdf","access_level":"open_access","creator":"system","file_size":589619,"content_type":"application/pdf","file_id":"5517","relation":"main_file","date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:53:55Z","checksum":"40405907aa012acece1bc26cf0be554d"}],"date_updated":"2023-02-23T10:08:48Z","date_created":"2018-12-12T11:39:20Z"},{"date_published":"2015-05-05T00:00:00Z","doi":"10.15479/AT:IST-2015-334-v1-1","language":[{"iso":"eng"}],"citation":{"ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1."},"oa":1,"page":"15","day":"05","month":"05","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1610"},{"id":"465","relation":"later_version","status":"public"}]},"pubrep_id":"334","date_updated":"2023-02-23T12:20:08Z","date_created":"2018-12-12T11:39:20Z","oa_version":"Published Version","file":[{"file_size":422573,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2015-334-v1+1_report.pdf","checksum":"8a5f2d77560e552af87eb1982437a43b","date_updated":"2020-07-14T12:46:55Z","date_created":"2018-12-12T11:53:56Z","relation":"main_file","file_id":"5518"}],"year":"2015","_id":"5438","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Edit distance for pushdown automata","ddc":["004"],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:55Z","abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. ","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"16","month":"06","page":"18","oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v2-2"},"language":[{"iso":"eng"}],"date_published":"2015-06-16T00:00:00Z","doi":"10.15479/AT:IST-2015-323-v2-2","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:56Z","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive.","lang":"eng"}],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"status":"public","publication_status":"published","title":"The complexity of evolutionary games on graphs","ddc":["005","576"],"_id":"5440","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","oa_version":"Published Version","file":[{"creator":"system","content_type":"application/pdf","file_size":466161,"file_name":"IST-2015-323-v2+2_main.pdf","access_level":"open_access","date_created":"2018-12-12T11:53:23Z","date_updated":"2020-07-14T12:46:56Z","checksum":"66aace7d367032af97c15e35c9be9636","file_id":"5484","relation":"main_file"}],"date_created":"2018-12-12T11:39:21Z","date_updated":"2023-02-23T12:26:10Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5421"},{"id":"5432","status":"public","relation":"earlier_version"}]},"pubrep_id":"338","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}]},{"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","day":"19","month":"02","page":"29","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v1-1","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2015-02-19T00:00:00Z","doi":"10.15479/AT:IST-2015-323-v1-1","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:53Z","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n","lang":"eng"}],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"status":"public","title":"The complexity of evolutionary games on graphs","ddc":["005","576"],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5432","year":"2015","file":[{"checksum":"546c1b291d545e7b24aaaf4199dac671","date_created":"2018-12-12T11:53:57Z","date_updated":"2020-07-14T12:46:53Z","relation":"main_file","file_id":"5519","file_size":576347,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2015-323-v1+1_main.pdf"}],"oa_version":"Published Version","date_created":"2018-12-12T11:39:18Z","date_updated":"2023-02-23T12:26:33Z","related_material":{"record":[{"id":"5421","status":"public","relation":"earlier_version"},{"id":"5440","status":"public","relation":"later_version"}]},"pubrep_id":"323","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}]},{"file_date_updated":"2020-07-14T12:46:58Z","abstract":[{"text":"A comprehensive understanding of the clonal evolution of cancer is critical for understanding neoplasia. Genome-wide sequencing data enables evolutionary studies at unprecedented depth. However, classical phylogenetic methods often struggle with noisy sequencing data of impure DNA samples and fail to detect subclones that have different evolutionary trajectories. We have developed a tool, called Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly available sequencing technologies. Using Bayesian inference and Integer Linear Programming, robust phylogenies consistent with the biological processes underlying cancer evolution were obtained for pancreatic, ovarian, and prostate cancers. Furthermore, Treeomics correctly identified sequencing artifacts such as those resulting from low statistical power; nearly 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumor heterogeneity among distinct samples. Importantly, we show that the evolutionary trees generated with Treeomics are mathematically optimal.","lang":"eng"}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2015-399-v1+1_treeomics.pdf","creator":"system","file_size":3533200,"content_type":"application/pdf","file_id":"5485","relation":"main_file","checksum":"c47d33bdda06181753c0af36f16e7b5d","date_created":"2018-12-12T11:53:24Z","date_updated":"2020-07-14T12:46:58Z"}],"date_created":"2018-12-12T11:39:22Z","date_updated":"2020-07-14T23:05:07Z","pubrep_id":"399","author":[{"first_name":"Johannes","last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"first_name":"Alvin","last_name":"Makohon-Moore","full_name":"Makohon-Moore, Alvin"},{"first_name":"Jeffrey","last_name":"Gerold","full_name":"Gerold, Jeffrey"},{"full_name":"Bozic, Ivana","first_name":"Ivana","last_name":"Bozic"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Iacobuzio-Donahue, Christine","last_name":"Iacobuzio-Donahue","first_name":"Christine"},{"full_name":"Vogelstein, Bert","first_name":"Bert","last_name":"Vogelstein"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","status":"public","publication_status":"published","title":"Reconstructing robust phylogenies of metastatic cancers","ddc":["000","576"],"_id":"5444","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"30","month":"12","language":[{"iso":"eng"}],"date_published":"2015-12-30T00:00:00Z","doi":"10.15479/AT:IST-2015-399-v1-1","page":"25","citation":{"chicago":"Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.","mla":"Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.","short":"J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.","ista":"Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.","ieee":"J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.","apa":"Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1","ama":"Reiter J, Makohon-Moore A, Gerold J, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1"},"oa":1},{"month":"11","day":"06","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2015-325-v2-1","date_published":"2015-11-06T00:00:00Z","language":[{"iso":"eng"}],"citation":{"apa":"Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.","ista":"Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.","ama":"Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.","short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1."},"oa":1,"page":"23","file_date_updated":"2020-07-14T12:46:57Z","abstract":[{"text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"id":"378E0060-F248-11E8-B48F-1D18A9856A87","first_name":"Jessica","last_name":"Davies","full_name":"Davies, Jessica"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1166"}]},"pubrep_id":"362","date_updated":"2023-02-21T16:24:05Z","date_created":"2018-12-12T11:39:22Z","file":[{"checksum":"f0fa31ad8161ed655137e94012123ef9","date_updated":"2020-07-14T12:46:57Z","date_created":"2018-12-12T11:53:05Z","file_id":"5466","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":412379,"access_level":"open_access","file_name":"IST-2015-325-v2+1_main.pdf"}],"oa_version":"Published Version","_id":"5443","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["000"],"publication_status":"published","title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","publisher":"IST Austria","department":[{"_id":"KrCh"}]},{"extern":"1","abstract":[{"text":"We present here the first integer-based algorithm for constructing a well-defined lattice sphere specified by integer radius and integer center. The algorithm evolves from a unique correspondence between the lattice points comprising the sphere and the distribution of sum of three square numbers in integer intervals. We characterize these intervals to derive a useful set of recurrences, which, in turn, aids in efficient computation. Each point of the lattice sphere is determined by resorting to only a few primitive operations in the integer domain. The symmetry of its quadraginta octants provides an added advantage by confining the computation to its prima quadraginta octant. Detailed theoretical analysis and experimental results have been furnished to demonstrate its simplicity and elegance.","lang":"eng"}],"issue":"4","type":"journal_article","date_updated":"2021-01-12T08:03:36Z","date_created":"2019-01-08T20:44:06Z","oa_version":"None","volume":624,"author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","first_name":"Ranita","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"status":"public","publication_status":"published","title":"From prima quadraginta octant to lattice sphere through primitive integer operations","intvolume":" 624","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5804","year":"2015","month":"04","day":"18","publication_identifier":{"issn":["0304-3975"]},"language":[{"iso":"eng"}],"date_published":"2015-04-18T00:00:00Z","doi":"10.1016/j.tcs.2015.11.018","quality_controlled":"1","page":"56-72","publication":"Theoretical Computer Science","citation":{"short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 624 (2015) 56–72.","mla":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science, vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi:10.1016/j.tcs.2015.11.018.","chicago":"Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.11.018.","ama":"Biswas R, Bhowmick P. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 2015;624(4):56-72. doi:10.1016/j.tcs.2015.11.018","apa":"Biswas, R., & Bhowmick, P. (2015). From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.11.018","ieee":"R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere through primitive integer operations,” Theoretical Computer Science, vol. 624, no. 4. Elsevier, pp. 56–72, 2015.","ista":"Biswas R, Bhowmick P. 2015. From prima quadraginta octant to lattice sphere through primitive integer operations. Theoretical Computer Science. 624(4), 56–72."}},{"type":"journal_article","issue":"11","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5807","year":"2015","status":"public","title":"On different topological classes of spherical geodesic paths and circles inZ3","publication_status":"published","intvolume":" 605","publisher":"Elsevier","author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","first_name":"Ranita","last_name":"Biswas"},{"first_name":"Partha","last_name":"Bhowmick","full_name":"Bhowmick, Partha"}],"date_updated":"2021-01-12T08:03:37Z","date_created":"2019-01-08T20:44:52Z","volume":605,"oa_version":"None","month":"11","day":"09","publication_identifier":{"issn":["0304-3975"]},"publication":"Theoretical Computer Science","citation":{"ama":"Biswas R, Bhowmick P. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 2015;605(11):146-163. doi:10.1016/j.tcs.2015.09.003","apa":"Biswas, R., & Bhowmick, P. (2015). On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.09.003","ieee":"R. Biswas and P. Bhowmick, “On different topological classes of spherical geodesic paths and circles inZ3,” Theoretical Computer Science, vol. 605, no. 11. Elsevier, pp. 146–163, 2015.","ista":"Biswas R, Bhowmick P. 2015. On different topological classes of spherical geodesic paths and circles inZ3. Theoretical Computer Science. 605(11), 146–163.","short":"R. Biswas, P. Bhowmick, Theoretical Computer Science 605 (2015) 146–163.","mla":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science, vol. 605, no. 11, Elsevier, 2015, pp. 146–63, doi:10.1016/j.tcs.2015.09.003.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.09.003."},"quality_controlled":"1","page":"146-163","date_published":"2015-11-09T00:00:00Z","doi":"10.1016/j.tcs.2015.09.003","language":[{"iso":"eng"}]},{"publisher":"Springer Nature","intvolume":" 31","status":"public","title":"Layer the sphere","publication_status":"published","_id":"5808","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":31,"date_created":"2019-01-08T20:45:05Z","date_updated":"2021-01-12T08:03:37Z","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","last_name":"Bhowmick","full_name":"Bhowmick, Partha"}],"type":"journal_article","extern":"1","issue":"6-8","page":"787-797","quality_controlled":"1","citation":{"short":"R. Biswas, P. Bhowmick, The Visual Computer 31 (2015) 787–797.","mla":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer, vol. 31, no. 6–8, Springer Nature, 2015, pp. 787–97, doi:10.1007/s00371-015-1101-3.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Layer the Sphere.” The Visual Computer. Springer Nature, 2015. https://doi.org/10.1007/s00371-015-1101-3.","ama":"Biswas R, Bhowmick P. Layer the sphere. The Visual Computer. 2015;31(6-8):787-797. doi:10.1007/s00371-015-1101-3","ieee":"R. Biswas and P. Bhowmick, “Layer the sphere,” The Visual Computer, vol. 31, no. 6–8. Springer Nature, pp. 787–797, 2015.","apa":"Biswas, R., & Bhowmick, P. (2015). Layer the sphere. The Visual Computer. Springer Nature. https://doi.org/10.1007/s00371-015-1101-3","ista":"Biswas R, Bhowmick P. 2015. Layer the sphere. The Visual Computer. 31(6–8), 787–797."},"publication":"The Visual Computer","language":[{"iso":"eng"}],"date_published":"2015-05-08T00:00:00Z","doi":"10.1007/s00371-015-1101-3","publication_identifier":{"issn":["0178-2789","1432-2315"]},"day":"08","month":"05"},{"type":"journal_article","issue":"3","publist_id":"7206","abstract":[{"lang":"eng","text":"Transcription of eukaryotic protein-coding genes commences with the assembly of a conserved initiation complex, which consists of RNA polymerase II (Pol II) and the general transcription factors, at promoter DNA. After two decades of research, the structural basis of transcription initiation is emerging. Crystal structures of many components of the initiation complex have been resolved, and structural information on Pol II complexes with general transcription factors has recently been obtained. Although mechanistic details await elucidation, available data outline how Pol II cooperates with the general transcription factors to bind to and open promoter DNA, and how Pol II directs RNA synthesis and escapes from the promoter."}],"extern":"1","year":"2015","_id":"594","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Nature Publishing Group","intvolume":" 16","publication_status":"published","status":"public","title":"Structural basis of transcription initiation by RNA polymerase II","author":[{"first_name":"Sarah","last_name":"Sainsbury","full_name":"Sainsbury, Sarah"},{"first_name":"Carrie A","last_name":"Bernecky","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0893-7036","full_name":"Bernecky, Carrie A"},{"last_name":"Cramer","first_name":"Patrick","full_name":"Cramer, Patrick"}],"oa_version":"None","volume":16,"date_updated":"2021-01-12T08:05:16Z","date_created":"2018-12-11T11:47:23Z","article_processing_charge":"No","day":"26","month":"03","citation":{"ista":"Sainsbury S, Bernecky C, Cramer P. 2015. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 16(3), 129–143.","apa":"Sainsbury, S., Bernecky, C., & Cramer, P. (2015). Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. Nature Publishing Group. https://doi.org/10.1038/nrm3952","ieee":"S. Sainsbury, C. Bernecky, and P. Cramer, “Structural basis of transcription initiation by RNA polymerase II,” Nature Reviews Molecular Cell Biology, vol. 16, no. 3. Nature Publishing Group, pp. 129–143, 2015.","ama":"Sainsbury S, Bernecky C, Cramer P. Structural basis of transcription initiation by RNA polymerase II. Nature Reviews Molecular Cell Biology. 2015;16(3):129-143. doi:10.1038/nrm3952","chicago":"Sainsbury, Sarah, Carrie Bernecky, and Patrick Cramer. “Structural Basis of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular Cell Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nrm3952.","mla":"Sainsbury, Sarah, et al. “Structural Basis of Transcription Initiation by RNA Polymerase II.” Nature Reviews Molecular Cell Biology, vol. 16, no. 3, Nature Publishing Group, 2015, pp. 129–43, doi:10.1038/nrm3952.","short":"S. Sainsbury, C. Bernecky, P. Cramer, Nature Reviews Molecular Cell Biology 16 (2015) 129–143."},"publication":"Nature Reviews Molecular Cell Biology","page":"129 - 143","date_published":"2015-03-26T00:00:00Z","doi":"10.1038/nrm3952","language":[{"iso":"eng"}]},{"publist_id":"5666","ec_funded":1,"file_date_updated":"2020-07-14T12:44:59Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2015","acknowledgement":"The work by Z. P. was partially supported by the Charles University Grant SVV-2014-260103. The\r\nwork by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of\r\nthe Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research\r\nwork of M. T. was conducted at IST Austria, supported by an IST Fellowship. The work by U.W.\r\nwas partially supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and\r\nSNSF-PP00P2-138948).","volume":"34 ","date_updated":"2023-02-23T12:38:00Z","date_created":"2018-12-11T11:52:27Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"610"}]},"author":[{"full_name":"Goaoc, Xavier","first_name":"Xavier","last_name":"Goaoc"},{"full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","first_name":"Isaac"},{"full_name":"Paták, Pavel","first_name":"Pavel","last_name":"Paták"},{"last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","full_name":"Patakova, Zuzana"},{"full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin","last_name":"Tancer"},{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner"}],"month":"06","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SOCG.2015.476","conference":{"end_date":"2015-06-25","location":"Eindhoven, Netherlands","start_date":"2015-06-22","name":"SoCG: Symposium on Computational Geometry"},"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"The fact that the complete graph K_5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph K_n embeds in a closed surface M if and only if (n-3)(n-4) is at most 6b_1(M), where b_1(M) is the first Z_2-Betti number of M. On the other hand, Van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of K_{n+1}) embeds in R^{2k} if and only if n is less or equal to 2k+2. Two decades ago, Kuhnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k-1)-connected 2k-manifold with kth Z_2-Betti number b_k only if the following generalized Heawood inequality holds: binom{n-k-1}{k+1} is at most binom{2k+1}{k+1} b_k. This is a common generalization of the case of graphs on surfaces as well as the Van Kampen--Flores theorem. In the spirit of Kuhnel's conjecture, we prove that if the k-skeleton of the n-simplex embeds in a 2k-manifold with kth Z_2-Betti number b_k, then n is at most 2b_k binom{2k+2}{k} + 2k + 5. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k-1)-connected. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition.","lang":"eng"}],"status":"public","title":"On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1511","file":[{"creator":"system","content_type":"application/pdf","file_size":636735,"access_level":"open_access","file_name":"IST-2016-502-v1+1_42.pdf","checksum":"0945811875351796324189312ca29e9e","date_updated":"2020-07-14T12:44:59Z","date_created":"2018-12-12T10:11:18Z","file_id":"4871","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"502","scopus_import":1,"has_accepted_license":"1","day":"11","page":"476 - 490","citation":{"ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:476-490. doi:10.4230/LIPIcs.SOCG.2015.476","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2015). On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result (Vol. 34, pp. 476–490). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.476","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2015. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.","mla":"Goaoc, Xavier, et al. On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–90, doi:10.4230/LIPIcs.SOCG.2015.476.","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result,” 34:476–90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.476."},"date_published":"2015-06-11T00:00:00Z"},{"type":"journal_article","issue":"27","abstract":[{"text":"Carbon dioxide (CO2) gradients are ubiquitous and provide animals with information about their environment, such as the potential presence of prey or predators. The nematode Caenorhabditis elegans avoids elevated CO2, and previous work identified three neuron pairs called “BAG,” “AFD,” and “ASE” that respond to CO2 stimuli. Using in vivo Ca2+ imaging and behavioral analysis, we show that C. elegans can detect CO2 independently of these sensory pathways. Many of the C. elegans sensory neurons we examined, including the AWC olfactory neurons, the ASJ and ASK gustatory neurons, and the ASH and ADL nociceptors, respond to a rise in CO2 with a rise in Ca2+. In contrast, glial sheath cells harboring the sensory endings of C. elegans’ major chemosensory neurons exhibit strong and sustained decreases in Ca2+ in response to high CO2. Some of these CO2 responses appear to be cell intrinsic. Worms therefore may couple detection of CO2 to that of other cues at the earliest stages of sensory processing. We show that C. elegans persistently suppresses oviposition at high CO2. Hermaphrodite-specific neurons (HSNs), the executive neurons driving egg-laying, are tonically inhibited when CO2 is elevated. CO2 modulates the egg-laying system partly through the AWC olfactory neurons: High CO2 tonically activates AWC by a cGMP-dependent mechanism, and AWC output inhibits the HSNs. Our work shows that CO2 is a more complex sensory cue for C. elegans than previously thought, both in terms of behavior and neural circuitry.","lang":"eng"}],"intvolume":" 112","status":"public","title":"Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity","ddc":["570"],"_id":"6118","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2015_PNAS_Fenk.pdf","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","file_size":2822681,"file_id":"6119","relation":"main_file","date_created":"2019-03-19T14:21:07Z","date_updated":"2020-07-14T12:47:20Z","checksum":"3d2da5af8d72467e382a565abc2e003d"}],"oa_version":"Published Version","has_accepted_license":"1","day":"07","page":"E3525-E3534","citation":{"ama":"Fenk LA, de Bono M. Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. 2015;112(27):E3525-E3534. doi:10.1073/pnas.1423808112","apa":"Fenk, L. A., & de Bono, M. (2015). Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1423808112","ieee":"L. A. Fenk and M. de Bono, “Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity,” Proceedings of the National Academy of Sciences, vol. 112, no. 27. National Academy of Sciences, pp. E3525–E3534, 2015.","ista":"Fenk LA, de Bono M. 2015. Environmental CO2 inhibits Caenorhabditis elegans egg-laying by modulating olfactory neurons and evokes widespread changes in neural activity. Proceedings of the National Academy of Sciences. 112(27), E3525–E3534.","short":"L.A. Fenk, M. de Bono, Proceedings of the National Academy of Sciences 112 (2015) E3525–E3534.","mla":"Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes in Neural Activity.” Proceedings of the National Academy of Sciences, vol. 112, no. 27, National Academy of Sciences, 2015, pp. E3525–34, doi:10.1073/pnas.1423808112.","chicago":"Fenk, Lorenz A., and Mario de Bono. “Environmental CO2 Inhibits Caenorhabditis Elegans Egg-Laying by Modulating Olfactory Neurons and Evokes Widespread Changes in Neural Activity.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1423808112."},"publication":"Proceedings of the National Academy of Sciences","date_published":"2015-07-07T00:00:00Z","extern":"1","file_date_updated":"2020-07-14T12:47:20Z","publisher":"National Academy of Sciences","publication_status":"published","pmid":1,"year":"2015","volume":112,"date_created":"2019-03-19T14:15:50Z","date_updated":"2021-01-12T08:06:12Z","author":[{"last_name":"Fenk","first_name":"Lorenz A.","full_name":"Fenk, Lorenz A."},{"full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443","first_name":"Mario","last_name":"de Bono"}],"publication_identifier":{"issn":["0027-8424","1091-6490"]},"month":"07","quality_controlled":"1","external_id":{"pmid":["26100886"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1423808112"},{"article_number":"e04241","extern":"1","file_date_updated":"2020-07-14T12:47:20Z","publisher":"eLife Sciences Publications","publication_status":"published","pmid":1,"year":"2015","volume":4,"date_created":"2019-03-19T14:23:51Z","date_updated":"2021-01-12T08:06:13Z","author":[{"full_name":"Laurent, Patrick","first_name":"Patrick","last_name":"Laurent"},{"full_name":"Soltesz, Zoltan","first_name":"Zoltan","last_name":"Soltesz"},{"first_name":"Geoffrey M","last_name":"Nelson","full_name":"Nelson, Geoffrey M"},{"last_name":"Chen","first_name":"Changchun","full_name":"Chen, Changchun"},{"full_name":"Arellano-Carbajal, Fausto","last_name":"Arellano-Carbajal","first_name":"Fausto"},{"full_name":"Levy, Emmanuel","last_name":"Levy","first_name":"Emmanuel"},{"full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443","first_name":"Mario","last_name":"de Bono"}],"publication_identifier":{"issn":["2050-084X"]},"month":"03","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["25760081"]},"language":[{"iso":"eng"}],"doi":"10.7554/elife.04241","type":"journal_article","abstract":[{"lang":"eng","text":"Brains organize behavior and physiology to optimize the response to threats or opportunities. We dissect how 21% O2, an indicator of surface exposure, reprograms C. elegans' global state, inducing sustained locomotory arousal and altering expression of neuropeptides, metabolic enzymes, and other non-neural genes. The URX O2-sensing neurons drive arousal at 21% O2 by tonically activating the RMG interneurons. Stimulating RMG is sufficient to switch behavioral state. Ablating the ASH, ADL, or ASK sensory neurons connected to RMG by gap junctions does not disrupt arousal. However, disrupting cation currents in these neurons curtails RMG neurosecretion and arousal. RMG signals high O2 by peptidergic secretion. Neuropeptide reporters reveal neural circuit state, as neurosecretion stimulates neuropeptide expression. Neural imaging in unrestrained animals shows that URX and RMG encode O2 concentration rather than behavior, while the activity of downstream interneurons such as AVB and AIY reflect both O2 levels and the behavior being executed."}],"intvolume":" 4","title":"Decoding a neural circuit controlling global animal state in C. elegans","status":"public","ddc":["570"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6120","file":[{"checksum":"cf641b7a363aecd0a101755d23dee7e0","date_created":"2019-03-19T14:29:43Z","date_updated":"2020-07-14T12:47:20Z","file_id":"6121","relation":"main_file","creator":"kschuh","file_size":6723528,"content_type":"application/pdf","access_level":"open_access","file_name":"2015_elife_Laurent.pdf"}],"oa_version":"Published Version","has_accepted_license":"1","day":"11","citation":{"ama":"Laurent P, Soltesz Z, Nelson GM, et al. Decoding a neural circuit controlling global animal state in C. elegans. eLife. 2015;4. doi:10.7554/elife.04241","ista":"Laurent P, Soltesz Z, Nelson GM, Chen C, Arellano-Carbajal F, Levy E, de Bono M. 2015. Decoding a neural circuit controlling global animal state in C. elegans. eLife. 4, e04241.","apa":"Laurent, P., Soltesz, Z., Nelson, G. M., Chen, C., Arellano-Carbajal, F., Levy, E., & de Bono, M. (2015). Decoding a neural circuit controlling global animal state in C. elegans. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.04241","ieee":"P. Laurent et al., “Decoding a neural circuit controlling global animal state in C. elegans,” eLife, vol. 4. eLife Sciences Publications, 2015.","mla":"Laurent, Patrick, et al. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” ELife, vol. 4, e04241, eLife Sciences Publications, 2015, doi:10.7554/elife.04241.","short":"P. Laurent, Z. Soltesz, G.M. Nelson, C. Chen, F. Arellano-Carbajal, E. Levy, M. de Bono, ELife 4 (2015).","chicago":"Laurent, Patrick, Zoltan Soltesz, Geoffrey M Nelson, Changchun Chen, Fausto Arellano-Carbajal, Emmanuel Levy, and Mario de Bono. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” ELife. eLife Sciences Publications, 2015. https://doi.org/10.7554/elife.04241."},"publication":"eLife","date_published":"2015-03-11T00:00:00Z"},{"alternative_title":["56th Annual Symposium on Foundations of Computer Science"],"type":"conference","abstract":[{"lang":"eng","text":"An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P ≠ NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in {0, ∞} corresponds to ordinary CSPs, where one deals only with the feasibility issue and there is no optimization. This case is the subject of the Algebraic CSP Dichotomy Conjecture predicting for which constraint languages CSPs are tractable (i.e. solvable in polynomial time) and for which NP-hard. The case when all allowed functions take only finite values corresponds to finite-valued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Zivny. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e. the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"title":"The complexity of general-valued CSPs","status":"public","_id":"1637","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","scopus_import":1,"day":"01","page":"1246 - 1258","citation":{"ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. In: IEEE; 2015:1246-1258. doi:10.1109/FOCS.2015.80","apa":"Kolmogorov, V., Krokhin, A., & Rolinek, M. (2015). The complexity of general-valued CSPs (pp. 1246–1258). Presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States: IEEE. https://doi.org/10.1109/FOCS.2015.80","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, , 1246–1258.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.","mla":"Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,” 1246–58. IEEE, 2015. https://doi.org/10.1109/FOCS.2015.80."},"date_published":"2015-12-01T00:00:00Z","ec_funded":1,"publist_id":"5518","department":[{"_id":"VlKo"}],"publisher":"IEEE","publication_status":"published","year":"2015","date_updated":"2023-02-23T12:44:26Z","date_created":"2018-12-11T11:53:10Z","related_material":{"record":[{"id":"644","status":"public","relation":"other"}]},"author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"full_name":"Krokhin, Andrei","last_name":"Krokhin","first_name":"Andrei"},{"last_name":"Rolinek","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"month":"12","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1502.07327","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/FOCS.2015.80","conference":{"name":"FOCS: Foundations of Computer Science","end_date":"2015-10-20","start_date":"2015-10-18","location":"Berkeley, CA, United States"}},{"year":"2015","_id":"6507","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"title":"Structural basis for collagen recognition by the immune receptor OSCAR","status":"public","publication_status":"published","intvolume":" 127","publisher":"American Society of Hematology","author":[{"full_name":"Zhou, Long","orcid":"0000-0002-1864-8951","id":"3E751364-F248-11E8-B48F-1D18A9856A87","last_name":"Zhou","first_name":"Long"},{"first_name":"J. M.","last_name":"Hinerman","full_name":"Hinerman, J. M."},{"full_name":"Blaszczyk, M.","last_name":"Blaszczyk","first_name":"M."},{"full_name":"Miller, J. L. C.","first_name":"J. L. C.","last_name":"Miller"},{"full_name":"Conrady, D. G.","last_name":"Conrady","first_name":"D. G."},{"full_name":"Barrow, A. D.","first_name":"A. D.","last_name":"Barrow"},{"full_name":"Chirgadze, D. Y.","first_name":"D. Y.","last_name":"Chirgadze"},{"last_name":"Bihan","first_name":"D.","full_name":"Bihan, D."},{"full_name":"Farndale, R. W.","last_name":"Farndale","first_name":"R. W."},{"last_name":"Herr","first_name":"A. B.","full_name":"Herr, A. B."}],"date_created":"2019-05-31T09:38:50Z","date_updated":"2021-01-12T08:07:47Z","volume":127,"oa_version":"None","type":"journal_article","abstract":[{"text":"The osteoclast-associated receptor (OSCAR) is a collagen-binding immune receptor with important roles in dendritic cell maturation and activation of inflammatory monocytes as well as in osteoclastogenesis. The crystal structure of the OSCAR ectodomain is presented, both free and in complex with a consensus triple-helical peptide (THP). The structures revealed a collagen-binding site in each immunoglobulin-like domain (D1 and D2). The THP binds near a predicted collagen-binding groove in D1, but a more extensive interaction with D2 is facilitated by the unusually wide D1-D2 interdomain angle in OSCAR. Direct binding assays, combined with site-directed mutagenesis, confirm that the primary collagen-binding site in OSCAR resides in D2, in marked contrast to the related collagen receptors, glycoprotein VI (GPVI) and leukocyte-associated immunoglobulin-like receptor-1 (LAIR-1). Monomeric OSCAR D1D2 binds to the consensus THP with a KD of 28 µM measured in solution, but shows a higher affinity (KD 1.5 μM) when binding to a solid-phase THP, most likely due to an avidity effect. These data suggest a 2-stage model for the interaction of OSCAR with a collagen fibril, with transient, low-affinity interactions initiated by the membrane-distal D1, followed by firm adhesion to the primary binding site in D2.","lang":"eng"}],"issue":"5","extern":"1","publication":"Blood","citation":{"short":"L. Zhou, J.M. Hinerman, M. Blaszczyk, J.L.C. Miller, D.G. Conrady, A.D. Barrow, D.Y. Chirgadze, D. Bihan, R.W. Farndale, A.B. Herr, Blood 127 (2015) 529–537.","mla":"Zhou, Long, et al. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” Blood, vol. 127, no. 5, American Society of Hematology, 2015, pp. 529–37, doi:10.1182/blood-2015-08-667055.","chicago":"Zhou, Long, J. M. Hinerman, M. Blaszczyk, J. L. C. Miller, D. G. Conrady, A. D. Barrow, D. Y. Chirgadze, D. Bihan, R. W. Farndale, and A. B. Herr. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” Blood. American Society of Hematology, 2015. https://doi.org/10.1182/blood-2015-08-667055.","ama":"Zhou L, Hinerman JM, Blaszczyk M, et al. Structural basis for collagen recognition by the immune receptor OSCAR. Blood. 2015;127(5):529-537. doi:10.1182/blood-2015-08-667055","apa":"Zhou, L., Hinerman, J. M., Blaszczyk, M., Miller, J. L. C., Conrady, D. G., Barrow, A. D., … Herr, A. B. (2015). Structural basis for collagen recognition by the immune receptor OSCAR. Blood. American Society of Hematology. https://doi.org/10.1182/blood-2015-08-667055","ieee":"L. Zhou et al., “Structural basis for collagen recognition by the immune receptor OSCAR,” Blood, vol. 127, no. 5. American Society of Hematology, pp. 529–537, 2015.","ista":"Zhou L, Hinerman JM, Blaszczyk M, Miller JLC, Conrady DG, Barrow AD, Chirgadze DY, Bihan D, Farndale RW, Herr AB. 2015. Structural basis for collagen recognition by the immune receptor OSCAR. Blood. 127(5), 529–537."},"external_id":{"pmid":["26552697"]},"quality_controlled":"1","page":"529-537","doi":"10.1182/blood-2015-08-667055","date_published":"2015-11-02T00:00:00Z","language":[{"iso":"eng"}],"month":"11","day":"02","publication_identifier":{"issn":["0006-4971","1528-0020"]}},{"publication":"IEEE Transactions on Information Theory","main_file_link":[{"url":"https://arxiv.org/abs/1401.6060","open_access":"1"}],"external_id":{"arxiv":["1401.6060"]},"oa":1,"citation":{"mla":"Mondelli, Marco, et al. “Achieving Marton’s Region for Broadcast Channels Using Polar Codes.” IEEE Transactions on Information Theory, vol. 61, no. 2, IEEE, 2015, pp. 783–800, doi:10.1109/tit.2014.2368555.","short":"M. Mondelli, H. Hassani, I. Sason, R. Urbanke, IEEE Transactions on Information Theory 61 (2015) 783–800.","chicago":"Mondelli, Marco, Hamed Hassani, Igal Sason, and Rudiger Urbanke. “Achieving Marton’s Region for Broadcast Channels Using Polar Codes.” IEEE Transactions on Information Theory. IEEE, 2015. https://doi.org/10.1109/tit.2014.2368555.","ama":"Mondelli M, Hassani H, Sason I, Urbanke R. Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. 2015;61(2):783-800. doi:10.1109/tit.2014.2368555","ista":"Mondelli M, Hassani H, Sason I, Urbanke R. 2015. Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. 61(2), 783–800.","apa":"Mondelli, M., Hassani, H., Sason, I., & Urbanke, R. (2015). Achieving Marton’s region for broadcast channels using polar codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2014.2368555","ieee":"M. Mondelli, H. Hassani, I. Sason, and R. Urbanke, “Achieving Marton’s region for broadcast channels using polar codes,” IEEE Transactions on Information Theory, vol. 61, no. 2. IEEE, pp. 783–800, 2015."},"quality_controlled":"1","page":"783-800","date_published":"2015-02-01T00:00:00Z","doi":"10.1109/tit.2014.2368555","language":[{"iso":"eng"}],"day":"01","month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6737","year":"2015","status":"public","title":"Achieving Marton’s region for broadcast channels using polar codes","publication_status":"published","publisher":"IEEE","intvolume":" 61","author":[{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"full_name":"Hassani, Hamed","last_name":"Hassani","first_name":"Hamed"},{"first_name":"Igal","last_name":"Sason","full_name":"Sason, Igal"},{"full_name":"Urbanke, Rudiger","last_name":"Urbanke","first_name":"Rudiger"}],"date_updated":"2021-01-12T08:08:46Z","date_created":"2019-07-31T07:03:38Z","oa_version":"Preprint","volume":61,"type":"journal_article","abstract":[{"text":"This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all classes of two-user DM-BCs whose capacity regions are known. To accomplish this task, we first construct polar codes for both the superposition as well as binning strategy. By combining these two schemes, we obtain Marton's region with private messages only. Finally, we show how to handle the case of common information. The proposed coding schemes possess the usual advantages of polar codes, i.e., they have low encoding and decoding complexity and a superpolynomial decay rate of the error probability. We follow the lead of Goela, Abbe, and Gastpar, who recently introduced polar codes emulating the superposition and binning schemes. To align the polar indices, for both schemes, their solution involves some degradedness constraints that are assumed to hold between the auxiliary random variables and channel outputs. To remove these constraints, we consider the transmission of k blocks and employ a chaining construction that guarantees the proper alignment of the polarized indices. The techniques described in this paper are quite general, and they can be adopted to many other multiterminal scenarios whenever there polar indices need to be aligned.","lang":"eng"}],"issue":"2","extern":"1"},{"author":[{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"full_name":"Urbanke, Rudiger","last_name":"Urbanke","first_name":"Rudiger"}],"volume":61,"oa_version":"Preprint","date_updated":"2021-01-12T08:08:45Z","date_created":"2019-07-31T06:50:34Z","_id":"6736","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 61","publisher":"IEEE","status":"public","publication_status":"published","title":"Scaling exponent of list decoders with applications to polar codes","issue":"9","abstract":[{"lang":"eng","text":"Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff between the block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under MAP decoding with list size L for any binary-input memoryless output-symmetric channel and for any class of linear codes such that their minimum distance is unbounded as the block length grows large. Then, it is shown that under MAP decoding, although the introduction of a list can significantly improve the involved constants, the scaling exponent itself, i.e., the speed at which capacity is approached, stays unaffected for any finite list size. In particular, this result applies to polar codes, since their minimum distance tends to infinity as the block length increases. A similar result is proved for genie-aided successive cancellation decoding when transmission takes place over the binary erasure channel, namely, the scaling exponent remains constant for any fixed number of helps from the genie. Note that since genie-aided successive cancellation decoding might be strictly worse than successive cancellation list decoding, the problem of establishing the scaling exponent of the latter remains open."}],"extern":"1","type":"journal_article","doi":"10.1109/tit.2015.2453315","date_published":"2015-09-01T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1304.5220","open_access":"1"}],"external_id":{"arxiv":["1304.5220"]},"oa":1,"citation":{"chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Scaling Exponent of List Decoders with Applications to Polar Codes.” IEEE Transactions on Information Theory. IEEE, 2015. https://doi.org/10.1109/tit.2015.2453315.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 61 (2015) 4838–4851.","mla":"Mondelli, Marco, et al. “Scaling Exponent of List Decoders with Applications to Polar Codes.” IEEE Transactions on Information Theory, vol. 61, no. 9, IEEE, 2015, pp. 4838–51, doi:10.1109/tit.2015.2453315.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2015). Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2015.2453315","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Scaling exponent of list decoders with applications to polar codes,” IEEE Transactions on Information Theory, vol. 61, no. 9. IEEE, pp. 4838–4851, 2015.","ista":"Mondelli M, Hassani H, Urbanke R. 2015. Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. 61(9), 4838–4851.","ama":"Mondelli M, Hassani H, Urbanke R. Scaling exponent of list decoders with applications to polar codes. IEEE Transactions on Information Theory. 2015;61(9):4838-4851. doi:10.1109/tit.2015.2453315"},"publication":"IEEE Transactions on Information Theory","page":"4838-4851","quality_controlled":"1","month":"09","day":"01"},{"publication_identifier":{"issn":["1098-0121","1550-235X"]},"article_processing_charge":"No","month":"11","day":"23","language":[{"iso":"eng"}],"date_published":"2015-11-23T00:00:00Z","doi":"10.1103/physrevb.92.180509","quality_controlled":"1","article_type":"original","citation":{"short":"J.F. Yu, B.J. Ramshaw, I. Kokanović, K.A. Modic, N. Harrison, J. Day, R. Liang, W.N. Hardy, D.A. Bonn, A. McCollam, S.R. Julian, J.R. Cooper, Physical Review B 92 (2015).","mla":"Yu, Jing Fei, et al. “Magnetization of Underdoped YBa2Cu3Oy above the Irreversibility Field.” Physical Review B, vol. 92, no. 18, 180509, APS, 2015, doi:10.1103/physrevb.92.180509.","chicago":"Yu, Jing Fei, B. J. Ramshaw, I. Kokanović, Kimberly A Modic, N. Harrison, James Day, Ruixing Liang, et al. “Magnetization of Underdoped YBa2Cu3Oy above the Irreversibility Field.” Physical Review B. APS, 2015. https://doi.org/10.1103/physrevb.92.180509.","ama":"Yu JF, Ramshaw BJ, Kokanović I, et al. Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. 2015;92(18). doi:10.1103/physrevb.92.180509","ieee":"J. F. Yu et al., “Magnetization of underdoped YBa2Cu3Oy above the irreversibility field,” Physical Review B, vol. 92, no. 18. APS, 2015.","apa":"Yu, J. F., Ramshaw, B. J., Kokanović, I., Modic, K. A., Harrison, N., Day, J., … Cooper, J. R. (2015). Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. APS. https://doi.org/10.1103/physrevb.92.180509","ista":"Yu JF, Ramshaw BJ, Kokanović I, Modic KA, Harrison N, Day J, Liang R, Hardy WN, Bonn DA, McCollam A, Julian SR, Cooper JR. 2015. Magnetization of underdoped YBa2Cu3Oy above the irreversibility field. Physical Review B. 92(18), 180509."},"publication":"Physical Review B","extern":"1","issue":"18","abstract":[{"lang":"eng","text":"Torque magnetization measurements on YBa2Cu3Oy (YBCO) at doping y=6.67 (p=0.12), in dc fields (B) up to 33 T and temperatures down to 4.5 K, show that weak diamagnetism persists above the extrapolated irreversibility field Hirr(T=0)≈24 T. The differential susceptibility dM/dB, however, is more rapidly suppressed for B≳16 T than expected from the properties of the low field superconducting state, and saturates at a low value for fields B≳24 T. In addition, torque measurements on a p=0.11 YBCO crystal in pulsed field up to 65 T and temperatures down to 8 K show similar behavior, with no additional features at higher fields. We offer two candidate scenarios to explain these observations: (a) superconductivity survives but is heavily suppressed at high field by competition with charge-density-wave (CDW) order; (b) static superconductivity disappears near 24 T and is followed by a region of fluctuating superconductivity, which causes dM/dB to saturate at high field. The diamagnetic signal observed above 50 T for the p=0.11 crystal at 40 K and below may be caused by changes in the normal state susceptibility rather than bulk or fluctuating superconductivity. There will be orbital (Landau) diamagnetism from electron pockets and possibly a reduction in spin susceptibility caused by the stronger three-dimensional ordered CDW."}],"type":"journal_article","article_number":"180509","oa_version":"None","volume":92,"date_created":"2019-11-19T13:22:06Z","date_updated":"2021-01-12T08:11:42Z","author":[{"first_name":"Jing Fei","last_name":"Yu","full_name":"Yu, Jing Fei"},{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"full_name":"Kokanović, I.","last_name":"Kokanović","first_name":"I."},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A"},{"full_name":"Harrison, N.","last_name":"Harrison","first_name":"N."},{"full_name":"Day, James","last_name":"Day","first_name":"James"},{"full_name":"Liang, Ruixing","first_name":"Ruixing","last_name":"Liang"},{"last_name":"Hardy","first_name":"W. N.","full_name":"Hardy, W. N."},{"last_name":"Bonn","first_name":"D. A.","full_name":"Bonn, D. A."},{"last_name":"McCollam","first_name":"A.","full_name":"McCollam, A."},{"full_name":"Julian, S. R.","last_name":"Julian","first_name":"S. R."},{"last_name":"Cooper","first_name":"J. R.","full_name":"Cooper, J. R."}],"publisher":"APS","intvolume":" 92","status":"public","publication_status":"published","title":"Magnetization of underdoped YBa2Cu3Oy above the irreversibility field","_id":"7070","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"extern":"1","publication_status":"published","publisher":"RSC","year":"2015","pmid":1,"date_updated":"2023-02-23T13:08:24Z","date_created":"2020-02-05T14:16:37Z","volume":7,"author":[{"full_name":"Caruntu, Daniela","last_name":"Caruntu","first_name":"Daniela"},{"last_name":"Rostamzadeh","first_name":"Taha","full_name":"Rostamzadeh, Taha"},{"orcid":"0000-0001-9732-3815","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","first_name":"Tommaso","full_name":"Costanzo, Tommaso"},{"first_name":"Saman","last_name":"Salemizadeh Parizi","full_name":"Salemizadeh Parizi, Saman"},{"first_name":"Gabriel","last_name":"Caruntu","full_name":"Caruntu, Gabriel"}],"month":"08","publication_identifier":{"issn":["2040-3364","2040-3372"]},"quality_controlled":"1","external_id":{"pmid":["26168304"]},"language":[{"iso":"eng"}],"doi":"10.1039/c5nr00737b","type":"journal_article","abstract":[{"lang":"eng","text":"The rational design of monodisperse ferroelectric nanocrystals with controlled size and shape and their organization into hierarchical structures has been a critical step for understanding the polar ordering in nanoscale ferroelectrics, as well as the design of nanocrystal-based functional materials which harness the properties of individual nanoparticles and the collective interactions between them. We report here on the synthesis and self-assembly of aggregate-free, single-crystalline titanium-based perovskite nanoparticles with controlled morphology and surface composition by using a simple, easily scalable and highly versatile colloidal route. Single-crystalline, non-aggregated BaTiO3 colloidal nanocrystals, used as a model system, have been prepared under solvothermal conditions at temperatures as low as 180 °C. The shape of the nanocrystals was tuned from spheroidal to cubic upon changing the polarity of the solvent, whereas their size was varied from 16 to 30 nm for spheres and 5 to 78 nm for cubes by changing the concentration of the precursors and the reaction time, respectively. The hydrophobic, oleic acid-passivated nanoparticles exhibit very good solubility in non-polar solvents and can be rendered dispersible in polar solvents by a simple process involving the oxidative cleavage of the double bond upon treating the nanopowders with the Lemieux–von Rudloff reagent. Lattice dynamic analysis indicated that regardless of their size, BaTiO3 nanocrystals present local disorder within the perovskite unit cell, associated with the existence of polar ordering. We also demonstrate for the first time that, in addition to being used for fabricating large area, crack-free, highly uniform films, BaTiO3 nanocubes can serve as building blocks for the design of 2D and 3D mesoscale structures, such as superlattices and superparticles. Interestingly, the type of superlattice structure (simple cubic or face centered cubic) appears to be determined by the type of solvent in which the nanocrystals were dispersed. This approach provides an excellent platform for the synthesis of other titanium-based perovskite colloidal nanocrystals with controlled chemical composition, surface structure and morphology and for their assembly into complex architectures, therefore opening the door for the design of novel mesoscale functional materials/nanocomposites with potential applications in energy conversion, data storage and the biomedical field."}],"issue":"30","title":"Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals","status":"public","intvolume":" 7","_id":"7456","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","day":"14","article_processing_charge":"No","article_type":"original","page":"12955-12969","publication":"Nanoscale","citation":{"ama":"Caruntu D, Rostamzadeh T, Costanzo T, Salemizadeh Parizi S, Caruntu G. Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. 2015;7(30):12955-12969. doi:10.1039/c5nr00737b","ista":"Caruntu D, Rostamzadeh T, Costanzo T, Salemizadeh Parizi S, Caruntu G. 2015. Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. 7(30), 12955–12969.","ieee":"D. Caruntu, T. Rostamzadeh, T. Costanzo, S. Salemizadeh Parizi, and G. Caruntu, “Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals,” Nanoscale, vol. 7, no. 30. RSC, pp. 12955–12969, 2015.","apa":"Caruntu, D., Rostamzadeh, T., Costanzo, T., Salemizadeh Parizi, S., & Caruntu, G. (2015). Solvothermal synthesis and controlled self-assembly of monodisperse titanium-based perovskite colloidal nanocrystals. Nanoscale. RSC. https://doi.org/10.1039/c5nr00737b","mla":"Caruntu, Daniela, et al. “Solvothermal Synthesis and Controlled Self-Assembly of Monodisperse Titanium-Based Perovskite Colloidal Nanocrystals.” Nanoscale, vol. 7, no. 30, RSC, 2015, pp. 12955–69, doi:10.1039/c5nr00737b.","short":"D. Caruntu, T. Rostamzadeh, T. Costanzo, S. Salemizadeh Parizi, G. Caruntu, Nanoscale 7 (2015) 12955–12969.","chicago":"Caruntu, Daniela, Taha Rostamzadeh, Tommaso Costanzo, Saman Salemizadeh Parizi, and Gabriel Caruntu. “Solvothermal Synthesis and Controlled Self-Assembly of Monodisperse Titanium-Based Perovskite Colloidal Nanocrystals.” Nanoscale. RSC, 2015. https://doi.org/10.1039/c5nr00737b."},"date_published":"2015-08-14T00:00:00Z"},{"extern":"1","abstract":[{"text":"A new organic–inorganic ferroelectric hybrid capacitor designed by uniformly incorporating surface modified monodisperse 15 nm ferroelectric BaTiO3 nanocubes into non-polar polymer blends of poly(methyl methacrylate) (PMMA) polymer and acrylonitrile-butadiene-styrene (ABS) terpolymer is described. The investigation of spatial distribution of nanofillers via a non-distractive thermal pulse method illustrates that the surface functionalization of nanocubes plays a key role in the uniform distribution of charge polarization within the polymer matrix. The discharged energy density of the nanocomposite with 30 vol% BaTiO3 nanocubes is ∼44 × 10−3 J cm−3, which is almost six times higher than that of the neat polymer. The facile processing, along with the superior mechanical and electrical properties of the BaTiO3/PMMA–ABS nanocomposites make them suitable for implementation into capacitive electrical energy storage devices.","lang":"eng"}],"issue":"93","type":"journal_article","date_updated":"2023-02-23T13:08:26Z","date_created":"2020-02-05T14:17:26Z","oa_version":"Submitted Version","volume":5,"author":[{"full_name":"Parizi, Saman Salemizadeh","last_name":"Parizi","first_name":"Saman Salemizadeh"},{"full_name":"Conley, Gavin","first_name":"Gavin","last_name":"Conley"},{"full_name":"Costanzo, Tommaso","first_name":"Tommaso","last_name":"Costanzo","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","orcid":"0000-0001-9732-3815"},{"first_name":"Bob","last_name":"Howell","full_name":"Howell, Bob"},{"full_name":"Mellinger, Axel","last_name":"Mellinger","first_name":"Axel"},{"last_name":"Caruntu","first_name":"Gabriel","full_name":"Caruntu, Gabriel"}],"title":"Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors","status":"public","publication_status":"published","publisher":"RSC","intvolume":" 5","_id":"7457","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","month":"09","day":"01","article_processing_charge":"No","publication_identifier":{"issn":["2046-2069"]},"language":[{"iso":"eng"}],"doi":"10.1039/c5ra11347d","date_published":"2015-09-01T00:00:00Z","quality_controlled":"1","article_type":"original","page":"76356-76362","publication":"RSC Advances","citation":{"ista":"Parizi SS, Conley G, Costanzo T, Howell B, Mellinger A, Caruntu G. 2015. Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. 5(93), 76356–76362.","apa":"Parizi, S. S., Conley, G., Costanzo, T., Howell, B., Mellinger, A., & Caruntu, G. (2015). Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. RSC. https://doi.org/10.1039/c5ra11347d","ieee":"S. S. Parizi, G. Conley, T. Costanzo, B. Howell, A. Mellinger, and G. Caruntu, “Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors,” RSC Advances, vol. 5, no. 93. RSC, pp. 76356–76362, 2015.","ama":"Parizi SS, Conley G, Costanzo T, Howell B, Mellinger A, Caruntu G. Fabrication of barium titanate/acrylonitrile-butadiene styrene/poly(methyl methacrylate) nanocomposite films for hybrid ferroelectric capacitors. RSC Advances. 2015;5(93):76356-76362. doi:10.1039/c5ra11347d","chicago":"Parizi, Saman Salemizadeh, Gavin Conley, Tommaso Costanzo, Bob Howell, Axel Mellinger, and Gabriel Caruntu. “Fabrication of Barium Titanate/Acrylonitrile-Butadiene Styrene/Poly(Methyl Methacrylate) Nanocomposite Films for Hybrid Ferroelectric Capacitors.” RSC Advances. RSC, 2015. https://doi.org/10.1039/c5ra11347d.","mla":"Parizi, Saman Salemizadeh, et al. “Fabrication of Barium Titanate/Acrylonitrile-Butadiene Styrene/Poly(Methyl Methacrylate) Nanocomposite Films for Hybrid Ferroelectric Capacitors.” RSC Advances, vol. 5, no. 93, RSC, 2015, pp. 76356–62, doi:10.1039/c5ra11347d.","short":"S.S. Parizi, G. Conley, T. Costanzo, B. Howell, A. Mellinger, G. Caruntu, RSC Advances 5 (2015) 76356–76362."}},{"publication_identifier":{"issn":["1061-4036","1546-1718"]},"article_processing_charge":"No","month":"09","day":"14","language":[{"iso":"eng"}],"date_published":"2015-09-14T00:00:00Z","doi":"10.1038/ng.3401","page":"1357-1362","article_type":"original","quality_controlled":"1","citation":{"mla":"Robinson, Matthew Richard, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics, vol. 47, no. 11, Springer Nature, 2015, pp. 1357–62, doi:10.1038/ng.3401.","short":"M.R. Robinson, G. Hemani, C. Medina-Gomez, M. Mezzavilla, T. Esko, K. Shakhbazov, J.E. Powell, A. Vinkhuyzen, S.I. Berndt, S. Gustafsson, A.E. Justice, B. Kahali, A.E. Locke, T.H. Pers, S. Vedantam, A.R. Wood, W. van Rheenen, O.A. Andreassen, P. Gasparini, A. Metspalu, L.H. van den Berg, J.H. Veldink, F. Rivadeneira, T.M. Werge, G.R. Abecasis, D.I. Boomsma, D.I. Chasman, E.J.C. de Geus, T.M. Frayling, J.N. Hirschhorn, J.J. Hottenga, E. Ingelsson, R.J.F. Loos, P.K.E. Magnusson, N.G. Martin, G.W. Montgomery, K.E. North, N.L. Pedersen, T.D. Spector, E.K. Speliotes, M.E. Goddard, J. Yang, P.M. Visscher, Nature Genetics 47 (2015) 1357–1362.","chicago":"Robinson, Matthew Richard, Gibran Hemani, Carolina Medina-Gomez, Massimo Mezzavilla, Tonu Esko, Konstantin Shakhbazov, Joseph E Powell, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics. Springer Nature, 2015. https://doi.org/10.1038/ng.3401.","ama":"Robinson MR, Hemani G, Medina-Gomez C, et al. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 2015;47(11):1357-1362. doi:10.1038/ng.3401","ista":"Robinson MR, Hemani G, Medina-Gomez C, Mezzavilla M, Esko T, Shakhbazov K, Powell JE, Vinkhuyzen A, Berndt SI, Gustafsson S, Justice AE, Kahali B, Locke AE, Pers TH, Vedantam S, Wood AR, van Rheenen W, Andreassen OA, Gasparini P, Metspalu A, Berg LH van den, Veldink JH, Rivadeneira F, Werge TM, Abecasis GR, Boomsma DI, Chasman DI, de Geus EJC, Frayling TM, Hirschhorn JN, Hottenga JJ, Ingelsson E, Loos RJF, Magnusson PKE, Martin NG, Montgomery GW, North KE, Pedersen NL, Spector TD, Speliotes EK, Goddard ME, Yang J, Visscher PM. 2015. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 47(11), 1357–1362.","apa":"Robinson, M. R., Hemani, G., Medina-Gomez, C., Mezzavilla, M., Esko, T., Shakhbazov, K., … Visscher, P. M. (2015). Population genetic differentiation of height and body mass index across Europe. Nature Genetics. Springer Nature. https://doi.org/10.1038/ng.3401","ieee":"M. R. Robinson et al., “Population genetic differentiation of height and body mass index across Europe,” Nature Genetics, vol. 47, no. 11. Springer Nature, pp. 1357–1362, 2015."},"publication":"Nature Genetics","extern":"1","issue":"11","abstract":[{"lang":"eng","text":"Across-nation differences in the mean values for complex traits are common1,2,3,4,5,6,7,8, but the reasons for these differences are unknown. Here we find that many independent loci contribute to population genetic differences in height and body mass index (BMI) in 9,416 individuals across 14 European countries. Using discovery data on over 250,000 individuals and unbiased effect size estimates from 17,500 sibling pairs, we estimate that 24% (95% credible interval (CI) = 9%, 41%) and 8% (95% CI = 4%, 16%) of the captured additive genetic variance for height and BMI, respectively, reflect population genetic differences. Population genetic divergence differed significantly from that in a null model (height, P < 3.94 × 10−8; BMI, P < 5.95 × 10−4), and we find an among-population genetic correlation for tall and slender individuals (r = −0.80, 95% CI = −0.95, −0.60), consistent with correlated selection for both phenotypes. Observed differences in height among populations reflected the predicted genetic means (r = 0.51; P < 0.001), but environmental differences across Europe masked genetic differentiation for BMI (P < 0.58)."}],"type":"journal_article","volume":47,"oa_version":"None","date_updated":"2021-01-12T08:15:13Z","date_created":"2020-04-30T10:58:23Z","author":[{"full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813"},{"full_name":"Hemani, Gibran","last_name":"Hemani","first_name":"Gibran"},{"first_name":"Carolina","last_name":"Medina-Gomez","full_name":"Medina-Gomez, Carolina"},{"full_name":"Mezzavilla, Massimo","first_name":"Massimo","last_name":"Mezzavilla"},{"last_name":"Esko","first_name":"Tonu","full_name":"Esko, Tonu"},{"full_name":"Shakhbazov, Konstantin","last_name":"Shakhbazov","first_name":"Konstantin"},{"last_name":"Powell","first_name":"Joseph E","full_name":"Powell, Joseph E"},{"full_name":"Vinkhuyzen, Anna","last_name":"Vinkhuyzen","first_name":"Anna"},{"last_name":"Berndt","first_name":"Sonja I","full_name":"Berndt, Sonja I"},{"full_name":"Gustafsson, Stefan","last_name":"Gustafsson","first_name":"Stefan"},{"full_name":"Justice, Anne E","last_name":"Justice","first_name":"Anne E"},{"first_name":"Bratati","last_name":"Kahali","full_name":"Kahali, Bratati"},{"last_name":"Locke","first_name":"Adam E","full_name":"Locke, Adam E"},{"first_name":"Tune H","last_name":"Pers","full_name":"Pers, Tune H"},{"full_name":"Vedantam, Sailaja","last_name":"Vedantam","first_name":"Sailaja"},{"full_name":"Wood, Andrew R","last_name":"Wood","first_name":"Andrew R"},{"last_name":"van Rheenen","first_name":"Wouter","full_name":"van Rheenen, Wouter"},{"full_name":"Andreassen, Ole A","last_name":"Andreassen","first_name":"Ole A"},{"full_name":"Gasparini, Paolo","first_name":"Paolo","last_name":"Gasparini"},{"first_name":"Andres","last_name":"Metspalu","full_name":"Metspalu, Andres"},{"full_name":"Berg, Leonard H van den","first_name":"Leonard H van den","last_name":"Berg"},{"last_name":"Veldink","first_name":"Jan H","full_name":"Veldink, Jan H"},{"full_name":"Rivadeneira, Fernando","last_name":"Rivadeneira","first_name":"Fernando"},{"first_name":"Thomas M","last_name":"Werge","full_name":"Werge, Thomas M"},{"full_name":"Abecasis, Goncalo R","first_name":"Goncalo R","last_name":"Abecasis"},{"full_name":"Boomsma, Dorret I","last_name":"Boomsma","first_name":"Dorret I"},{"full_name":"Chasman, Daniel I","last_name":"Chasman","first_name":"Daniel I"},{"full_name":"de Geus, Eco J C","first_name":"Eco J C","last_name":"de Geus"},{"last_name":"Frayling","first_name":"Timothy M","full_name":"Frayling, Timothy M"},{"full_name":"Hirschhorn, Joel N","last_name":"Hirschhorn","first_name":"Joel N"},{"full_name":"Hottenga, Jouke Jan","last_name":"Hottenga","first_name":"Jouke Jan"},{"full_name":"Ingelsson, Erik","first_name":"Erik","last_name":"Ingelsson"},{"full_name":"Loos, Ruth J F","last_name":"Loos","first_name":"Ruth J F"},{"full_name":"Magnusson, Patrik K E","last_name":"Magnusson","first_name":"Patrik K E"},{"full_name":"Martin, Nicholas G","last_name":"Martin","first_name":"Nicholas G"},{"last_name":"Montgomery","first_name":"Grant W","full_name":"Montgomery, Grant W"},{"first_name":"Kari E","last_name":"North","full_name":"North, Kari E"},{"first_name":"Nancy L","last_name":"Pedersen","full_name":"Pedersen, Nancy L"},{"full_name":"Spector, Timothy D","last_name":"Spector","first_name":"Timothy D"},{"full_name":"Speliotes, Elizabeth K","first_name":"Elizabeth K","last_name":"Speliotes"},{"last_name":"Goddard","first_name":"Michael E","full_name":"Goddard, Michael E"},{"full_name":"Yang, Jian","first_name":"Jian","last_name":"Yang"},{"full_name":"Visscher, Peter M","last_name":"Visscher","first_name":"Peter M"}],"publisher":"Springer Nature","intvolume":" 47","publication_status":"published","status":"public","title":"Population genetic differentiation of height and body mass index across Europe","year":"2015","_id":"7742","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"doi":"10.1098/rspb.2015.0689","quality_controlled":"1","oa":1,"external_id":{"pmid":["26063846"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1098/rspb.2015.0689"}],"publication_identifier":{"issn":["0962-8452","1471-2954"]},"month":"07","volume":282,"date_updated":"2021-01-12T08:15:12Z","date_created":"2020-04-30T10:58:07Z","author":[{"full_name":"Adams, Mark James","last_name":"Adams","first_name":"Mark James"},{"full_name":"Robinson, Matthew Richard","last_name":"Robinson","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"},{"full_name":"Mannarelli, Maria-Elena","first_name":"Maria-Elena","last_name":"Mannarelli"},{"first_name":"Ben J.","last_name":"Hatchwell","full_name":"Hatchwell, Ben J."}],"publisher":"The Royal Society","publication_status":"published","pmid":1,"year":"2015","extern":"1","article_number":"20150689","date_published":"2015-07-07T00:00:00Z","article_type":"original","citation":{"chicago":"Adams, Mark James, Matthew Richard Robinson, Maria-Elena Mannarelli, and Ben J. Hatchwell. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences. The Royal Society, 2015. https://doi.org/10.1098/rspb.2015.0689.","mla":"Adams, Mark James, et al. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810, 20150689, The Royal Society, 2015, doi:10.1098/rspb.2015.0689.","short":"M.J. Adams, M.R. Robinson, M.-E. Mannarelli, B.J. Hatchwell, Proceedings of the Royal Society B: Biological Sciences 282 (2015).","ista":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. 2015. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 282(1810), 20150689.","apa":"Adams, M. J., Robinson, M. R., Mannarelli, M.-E., & Hatchwell, B. J. (2015). Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. The Royal Society. https://doi.org/10.1098/rspb.2015.0689","ieee":"M. J. Adams, M. R. Robinson, M.-E. Mannarelli, and B. J. Hatchwell, “Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird,” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810. The Royal Society, 2015.","ama":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 2015;282(1810). doi:10.1098/rspb.2015.0689"},"publication":"Proceedings of the Royal Society B: Biological Sciences","article_processing_charge":"No","day":"07","oa_version":"Published Version","intvolume":" 282","title":"Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird","status":"public","_id":"7741","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1810","abstract":[{"lang":"eng","text":"Phenotypes expressed in a social context are not only a function of the individual, but can also be shaped by the phenotypes of social partners. These social effects may play a major role in the evolution of cooperative breeding if social partners differ in the quality of care they provide and if individual carers adjust their effort in relation to that of other carers. When applying social effects models to wild study systems, it is also important to explore sources of individual plasticity that could masquerade as social effects. We studied offspring provisioning rates of parents and helpers in a wild population of long-tailed tits Aegithalos caudatus using a quantitative genetic framework to identify these social effects and partition them into genetic, permanent environment and current environment components. Controlling for other effects, individuals were consistent in their provisioning effort at a given nest, but adjusted their effort based on who was in their social group, indicating the presence of social effects. However, these social effects differed between years and social contexts, indicating a current environment effect, rather than indicating a genetic or permanent environment effect. While this study reveals the importance of examining environmental and genetic sources of social effects, the framework we present is entirely general, enabling a greater understanding of potentially important social effects within any ecological population."}],"type":"journal_article"},{"citation":{"chicago":"Santure, Anna W., Jocelyn Poissant, Isabelle De Cauwer, Kees van Oers, Matthew Richard Robinson, John L. Quinn, Martien A. M. Groenen, Marcel E. Visser, Ben C. Sheldon, and Jon Slate. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology. Wiley, 2015. https://doi.org/10.1111/mec.13452.","short":"A.W. Santure, J. Poissant, I. De Cauwer, K. van Oers, M.R. Robinson, J.L. Quinn, M.A.M. Groenen, M.E. Visser, B.C. Sheldon, J. Slate, Molecular Ecology 24 (2015) 6148–6162.","mla":"Santure, Anna W., et al. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology, vol. 24, Wiley, 2015, pp. 6148–62, doi:10.1111/mec.13452.","ieee":"A. W. Santure et al., “Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations,” Molecular Ecology, vol. 24. Wiley, pp. 6148–6162, 2015.","apa":"Santure, A. W., Poissant, J., De Cauwer, I., van Oers, K., Robinson, M. R., Quinn, J. L., … Slate, J. (2015). Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.13452","ista":"Santure AW, Poissant J, De Cauwer I, van Oers K, Robinson MR, Quinn JL, Groenen MAM, Visser ME, Sheldon BC, Slate J. 2015. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 24, 6148–6162.","ama":"Santure AW, Poissant J, De Cauwer I, et al. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 2015;24:6148-6162. doi:10.1111/mec.13452"},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1111/mec.13452","open_access":"1"}],"publication":"Molecular Ecology","page":"6148-6162","article_type":"original","quality_controlled":"1","doi":"10.1111/mec.13452","date_published":"2015-12-10T00:00:00Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0962-1083"]},"article_processing_charge":"No","day":"10","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7739","year":"2015","intvolume":" 24","publisher":"Wiley","status":"public","publication_status":"published","title":"Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations","author":[{"full_name":"Santure, Anna W.","last_name":"Santure","first_name":"Anna W."},{"last_name":"Poissant","first_name":"Jocelyn","full_name":"Poissant, Jocelyn"},{"full_name":"De Cauwer, Isabelle","first_name":"Isabelle","last_name":"De Cauwer"},{"last_name":"van Oers","first_name":"Kees","full_name":"van Oers, Kees"},{"full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson"},{"first_name":"John L.","last_name":"Quinn","full_name":"Quinn, John L."},{"first_name":"Martien A. M.","last_name":"Groenen","full_name":"Groenen, Martien A. M."},{"first_name":"Marcel E.","last_name":"Visser","full_name":"Visser, Marcel E."},{"full_name":"Sheldon, Ben C.","first_name":"Ben C.","last_name":"Sheldon"},{"first_name":"Jon","last_name":"Slate","full_name":"Slate, Jon"}],"volume":24,"oa_version":"Published Version","date_created":"2020-04-30T10:51:01Z","date_updated":"2021-01-12T08:15:12Z","type":"journal_article","abstract":[{"text":"Currently, there is much debate on the genetic architecture of quantitative traits in wild populations. Is trait variation influenced by many genes of small effect or by a few genes of major effect? Where is additive genetic variation located in the genome? Do the same loci cause similar phenotypic variation in different populations? Great tits (Parus major) have been studied extensively in long‐term studies across Europe and consequently are considered an ecological ‘model organism’. Recently, genomic resources have been developed for the great tit, including a custom SNP chip and genetic linkage map. In this study, we used a suite of approaches to investigate the genetic architecture of eight quantitative traits in two long‐term study populations of great tits—one in the Netherlands and the other in the United Kingdom. Overall, we found little evidence for the presence of genes of large effects in either population. Instead, traits appeared to be influenced by many genes of small effect, with conservative estimates of the number of contributing loci ranging from 31 to 310. Despite concordance between population‐specific heritabilities, we found no evidence for the presence of loci having similar effects in both populations. While population‐specific genetic architectures are possible, an undetected shared architecture cannot be rejected because of limited power to map loci of small and moderate effects. This study is one of few examples of genetic architecture analysis in replicated wild populations and highlights some of the challenges and limitations researchers will face when attempting similar molecular quantitative genetic studies in free‐living populations.","lang":"eng"}],"extern":"1"},{"article_processing_charge":"No","month":"01","day":"24","language":[{"iso":"eng"}],"doi":"10.1145/2688500.2688523","date_published":"2015-01-24T00:00:00Z","conference":{"name":"PPoPP: Principles and Practice of Parallel Pogramming"},"page":"11 - 20","citation":{"ista":"Alistarh D-A, Kopinsky J, Li J, Shavit N. 2015. The SprayList: A scalable relaxed priority queue. PPoPP: Principles and Practice of Parallel Pogramming vol. 2015–January, 11–20.","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2015, vol. 2015–January, pp. 11–20.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., & Shavit, N. (2015). The SprayList: A scalable relaxed priority queue (Vol. 2015–January, pp. 11–20). Presented at the PPoPP: Principles and Practice of Parallel Pogramming, ACM. https://doi.org/10.1145/2688500.2688523","ama":"Alistarh D-A, Kopinsky J, Li J, Shavit N. The SprayList: A scalable relaxed priority queue. In: Vol 2015-January. ACM; 2015:11-20. doi:10.1145/2688500.2688523","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015. https://doi.org/10.1145/2688500.2688523.","mla":"Alistarh, Dan-Adrian, et al. The SprayList: A Scalable Relaxed Priority Queue. Vol. 2015–January, ACM, 2015, pp. 11–20, doi:10.1145/2688500.2688523.","short":"D.-A. Alistarh, J. Kopinsky, J. Li, N. Shavit, in:, ACM, 2015, pp. 11–20."},"extern":"1","publist_id":"6878","abstract":[{"text":"High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by "spraying" themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(plog3p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log3p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. Furthermore, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.","lang":"eng"}],"type":"conference","oa_version":"None","volume":"2015-January","date_created":"2018-12-11T11:48:26Z","date_updated":"2023-02-23T13:16:43Z","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"},{"last_name":"Shavit","first_name":"Nir","full_name":"Shavit, Nir"}],"publisher":"ACM","status":"public","title":"The SprayList: A scalable relaxed priority queue","publication_status":"published","_id":"776","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle\r\nand Intel corporations.","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_processing_charge":"No","publication_identifier":{"issn":["0031-9007","1079-7114"]},"month":"06","day":"04","article_type":"original","quality_controlled":"1","citation":{"chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/physrevlett.114.225501.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 114 (2015).","mla":"Goodrich, Carl Peter, et al. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters, vol. 114, no. 22, 225501, American Physical Society, 2015, doi:10.1103/physrevlett.114.225501.","apa":"Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.114.225501","ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior,” Physical Review Letters, vol. 114, no. 22. American Physical Society, 2015.","ista":"Goodrich CP, Liu AJ, Nagel SR. 2015. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 114(22), 225501.","ama":"Goodrich CP, Liu AJ, Nagel SR. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 2015;114(22). doi:10.1103/physrevlett.114.225501"},"publication":"Physical Review Letters","language":[{"iso":"eng"}],"doi":"10.1103/physrevlett.114.225501","date_published":"2015-06-04T00:00:00Z","type":"journal_article","article_number":"225501","extern":"1","issue":"22","abstract":[{"lang":"eng","text":"We introduce a principle unique to disordered solids wherein the contribution of any bond to one global perturbation is uncorrelated with its contribution to another. Coupled with sufficient variability in the contributions of different bonds, this “independent bond-level response” paves the way for the design of real materials with unusual and exquisitely tuned properties. To illustrate this, we choose two global perturbations: compression and shear. By applying a bond removal procedure that is both simple and experimentally relevant to remove a very small fraction of bonds, we can drive disordered spring networks to both the incompressible and completely auxetic limits of mechanical behavior."}],"intvolume":" 114","publisher":"American Physical Society","title":"The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior","status":"public","publication_status":"published","_id":"7765","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","oa_version":"None","volume":114,"date_created":"2020-04-30T11:41:08Z","date_updated":"2021-01-12T08:15:23Z","author":[{"last_name":"Goodrich","first_name":"Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","full_name":"Goodrich, Carl Peter"},{"full_name":"Liu, Andrea J.","last_name":"Liu","first_name":"Andrea J."},{"full_name":"Nagel, Sidney R.","last_name":"Nagel","first_name":"Sidney R."}]},{"extern":"1","issue":"3","abstract":[{"text":"We present a model of soft active particles that leads to a rich array of collective behavior found also in dense biological swarms of bacteria and other unicellular organisms. Our model uses only local interactions, such as Vicsek-type nearest-neighbor alignment, short-range repulsion, and a local boundary term. Changing the relative strength of these interactions leads to migrating swarms, rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble motion, alternating between migration and either rotating or jammed states. Interestingly, although a migrating swarm moves slower than an individual particle, the diffusion constant can be up to three orders of magnitude larger, suggesting that collective motion can be highly advantageous, for example, when searching for food.","lang":"eng"}],"type":"journal_article","article_number":"032706","oa_version":"None","volume":91,"date_created":"2020-04-30T11:41:38Z","date_updated":"2021-01-12T08:15:24Z","author":[{"full_name":"van Drongelen, Ruben","last_name":"van Drongelen","first_name":"Ruben"},{"last_name":"Pal","first_name":"Anshuman","full_name":"Pal, Anshuman"},{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","last_name":"Goodrich","full_name":"Goodrich, Carl Peter"},{"full_name":"Idema, Timon","last_name":"Idema","first_name":"Timon"}],"intvolume":" 91","publisher":"American Physical Society","title":"Collective dynamics of soft active particles","status":"public","publication_status":"published","_id":"7767","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1539-3755","1550-2376"]},"article_processing_charge":"No","day":"01","month":"03","language":[{"iso":"eng"}],"date_published":"2015-03-01T00:00:00Z","doi":"10.1103/physreve.91.032706","article_type":"original","quality_controlled":"1","citation":{"apa":"van Drongelen, R., Pal, A., Goodrich, C. P., & Idema, T. (2015). Collective dynamics of soft active particles. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.91.032706","ieee":"R. van Drongelen, A. Pal, C. P. Goodrich, and T. Idema, “Collective dynamics of soft active particles,” Physical Review E, vol. 91, no. 3. American Physical Society, 2015.","ista":"van Drongelen R, Pal A, Goodrich CP, Idema T. 2015. Collective dynamics of soft active particles. Physical Review E. 91(3), 032706.","ama":"van Drongelen R, Pal A, Goodrich CP, Idema T. Collective dynamics of soft active particles. Physical Review E. 2015;91(3). doi:10.1103/physreve.91.032706","chicago":"Drongelen, Ruben van, Anshuman Pal, Carl Peter Goodrich, and Timon Idema. “Collective Dynamics of Soft Active Particles.” Physical Review E. American Physical Society, 2015. https://doi.org/10.1103/physreve.91.032706.","short":"R. van Drongelen, A. Pal, C.P. Goodrich, T. Idema, Physical Review E 91 (2015).","mla":"van Drongelen, Ruben, et al. “Collective Dynamics of Soft Active Particles.” Physical Review E, vol. 91, no. 3, 032706, American Physical Society, 2015, doi:10.1103/physreve.91.032706."},"publication":"Physical Review E"},{"citation":{"short":"D.M. Sussman, C.P. Goodrich, A.J. Liu, S.R. Nagel, Soft Matter 11 (2015) 2745–2751.","mla":"Sussman, Daniel M., et al. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter, vol. 11, no. 14, Royal Society of Chemistry, 2015, pp. 2745–51, doi:10.1039/c4sm02905d.","chicago":"Sussman, Daniel M., Carl Peter Goodrich, Andrea J. Liu, and Sidney R. Nagel. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter. Royal Society of Chemistry, 2015. https://doi.org/10.1039/c4sm02905d.","ama":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. Disordered surface vibrations in jammed sphere packings. Soft Matter. 2015;11(14):2745-2751. doi:10.1039/c4sm02905d","apa":"Sussman, D. M., Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). Disordered surface vibrations in jammed sphere packings. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/c4sm02905d","ieee":"D. M. Sussman, C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Disordered surface vibrations in jammed sphere packings,” Soft Matter, vol. 11, no. 14. Royal Society of Chemistry, pp. 2745–2751, 2015.","ista":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. 2015. Disordered surface vibrations in jammed sphere packings. Soft Matter. 11(14), 2745–2751."},"publication":"Soft Matter","page":"2745-2751","article_type":"original","quality_controlled":"1","date_published":"2015-02-15T00:00:00Z","doi":"10.1039/c4sm02905d","language":[{"iso":"eng"}],"article_processing_charge":"No","publication_identifier":{"issn":["1744-683X","1744-6848"]},"month":"02","day":"15","year":"2015","_id":"7766","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 11","publisher":"Royal Society of Chemistry","title":"Disordered surface vibrations in jammed sphere packings","status":"public","publication_status":"published","author":[{"last_name":"Sussman","first_name":"Daniel M.","full_name":"Sussman, Daniel M."},{"last_name":"Goodrich","first_name":"Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","full_name":"Goodrich, Carl Peter"},{"first_name":"Andrea J.","last_name":"Liu","full_name":"Liu, Andrea J."},{"last_name":"Nagel","first_name":"Sidney R.","full_name":"Nagel, Sidney R."}],"volume":11,"oa_version":"None","date_created":"2020-04-30T11:41:23Z","date_updated":"2021-01-12T08:15:23Z","type":"journal_article","issue":"14","abstract":[{"lang":"eng","text":"We study the vibrational properties near a free surface of disordered spring networks derived from jammed sphere packings. In bulk systems, without surfaces, it is well understood that such systems have a plateau in the density of vibrational modes extending down to a frequency scale ω*. This frequency is controlled by ΔZ = 〈Z〉 − 2d, the difference between the average coordination of the spheres and twice the spatial dimension, d, of the system, which vanishes at the jamming transition. In the presence of a free surface we find that there is a density of disordered vibrational modes associated with the surface that extends far below ω*. The total number of these low-frequency surface modes is controlled by ΔZ, and the profile of their decay into the bulk has two characteristic length scales, which diverge as ΔZ−1/2 and ΔZ−1 as the jamming transition is approached."}],"extern":"1"},{"main_file_link":[{"url":"http://papers.nips.cc/paper/5897-streaming-min-max-hypergraph-partitioning"}],"citation":{"chicago":"Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.","short":"D.-A. Alistarh, J. Iglesias, M. Vojnović, in:, Neural Information Processing Systems, 2015, pp. 1900–1908.","mla":"Alistarh, Dan-Adrian, et al. Streaming Min-Max Hypergraph Partitioning. Vol. 2015–January, Neural Information Processing Systems, 2015, pp. 1900–08.","apa":"Alistarh, D.-A., Iglesias, J., & Vojnović, M. (2015). Streaming min-max hypergraph partitioning (Vol. 2015–January, pp. 1900–1908). Presented at the NIPS: Neural Information Processing Systems, Neural Information Processing Systems.","ieee":"D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph partitioning,” presented at the NIPS: Neural Information Processing Systems, 2015, vol. 2015–January, pp. 1900–1908.","ista":"Alistarh D-A, Iglesias J, Vojnović M. 2015. Streaming min-max hypergraph partitioning. NIPS: Neural Information Processing Systems vol. 2015–January, 1900–1908.","ama":"Alistarh D-A, Iglesias J, Vojnović M. Streaming min-max hypergraph partitioning. In: Vol 2015-January. Neural Information Processing Systems; 2015:1900-1908."},"page":"1900 - 1908","conference":{"name":"NIPS: Neural Information Processing Systems"},"date_published":"2015-01-01T00:00:00Z","language":[{"iso":"eng"}],"day":"01","month":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"777","year":"2015","title":"Streaming min-max hypergraph partitioning","publication_status":"published","status":"public","publisher":"Neural Information Processing Systems","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Iglesias, Jennifer","first_name":"Jennifer","last_name":"Iglesias"},{"last_name":"Vojnović","first_name":"Milan","full_name":"Vojnović, Milan"}],"date_updated":"2023-02-23T13:17:09Z","date_created":"2018-12-11T11:48:27Z","volume":"2015-January","oa_version":"None","type":"conference","abstract":[{"lang":"eng","text":"In many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges. Equivalently, we are given an input bipartite graph with two types of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items into a given number of components such that the maximum number of topics covered by a component is minimized. This is a clustering problem with various applications, e.g. partitioning of a set of information objects such as documents, images, and videos, and load balancing in the context of modern computation platforms.Inthis paper, we focus on the streaming computation model for this problem, in which items arrive online one at a time and each item must be assigned irrevocably to a component at its arrival time. Motivated by scalability requirements, we focus on the class of streaming computation algorithms with memory limited to be at most linear in the number of components. We show that a greedy assignment strategy is able to recover a hidden co-clustering of items under a natural set of recovery conditions. We also report results of an extensive empirical evaluation, which demonstrate that this greedy strategy yields superior performance when compared with alternative approaches."}],"publist_id":"6879","extern":"1"},{"doi":"10.1007/978-3-662-48653-5_13","conference":{"name":"DISC: Distributed Computing"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1405.5689","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1405.5689"]},"quality_controlled":"1","month":"01","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"full_name":"Kuznetsov, Petr","last_name":"Kuznetsov","first_name":"Petr"},{"full_name":"Ravi, Srivatsan","first_name":"Srivatsan","last_name":"Ravi"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"volume":9363,"date_created":"2018-12-11T11:48:27Z","date_updated":"2023-02-23T13:17:35Z","year":"2015","acknowledgement":"P. Kuznetsov-The author is supported by the Agence Nationale de la Recherche, ANR-14-CE35-0010-01, project DISCMAT. N. Shavit-Support is gratfeully acknowledgedfrom the National Science Foundation under grants CCF-1217921, CCF-1201926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.","publisher":"Springer","publication_status":"published","publist_id":"6880","extern":"1","date_published":"2015-01-01T00:00:00Z","citation":{"short":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 185–199.","mla":"Alistarh, Dan-Adrian, et al. Inherent Limitations of Hybrid Transactional Memory. Vol. 9363, Springer, 2015, pp. 185–99, doi:10.1007/978-3-662-48653-5_13.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99. Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13.","ama":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13","ieee":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent limitations of hybrid transactional memory,” presented at the DISC: Distributed Computing, 2015, vol. 9363, pp. 185–199.","apa":"Alistarh, D.-A., Kopinsky, J., Kuznetsov, P., Ravi, S., & Shavit, N. (2015). Inherent limitations of hybrid transactional memory (Vol. 9363, pp. 185–199). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-662-48653-5_13","ista":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. 2015. Inherent limitations of hybrid transactional memory. DISC: Distributed Computing, LNCS, vol. 9363, 185–199."},"page":"185 - 199","article_processing_charge":"No","day":"01","oa_version":"None","_id":"778","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9363","status":"public","title":"Inherent limitations of hybrid transactional memory","abstract":[{"text":"Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed to complement the fast, but best-effort nature of Hardware Transactional Memory (HTM) with a slow, reliable software backup. However, the costs of providing concurrency between hardware and software transactions in HyTM are still not well understood. In this paper, we propose a general model for HyTM implementations, which captures the ability of hardware transactions to buffer memory accesses. The model allows us to formally quantify and analyze the amount of overhead (instrumentation) caused by the potential presence of software transactions.We prove that (1) it is impossible to build a strictly serializable HyTM implementation that has both uninstrumented reads and writes, even for very weak progress guarantees, and (2) the instrumentation cost incurred by a hardware transaction in any progressive opaque HyTM is linear in the size of the transaction’s data set.We further describe two implementations which exhibit optimal instrumentation costs for two different progress conditions. In sum, this paper proposes the first formal HyTM model and captures for the first time the trade-off between the degree of hardware-software TM concurrency and the amount of instrumentation overhead.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"page":"242","citation":{"short":"C.P. Goodrich, ArXiv:1510.08820 (2015).","mla":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","chicago":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.","ama":"Goodrich CP. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:151008820. 2015.","ieee":"C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response of disordered solids,” arXiv:1510.08820. 2015.","apa":"Goodrich, C. P. (2015). Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:1510.08820.","ista":"Goodrich CP. 2015. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv:1510.08820, ."},"external_id":{"arxiv":["1510.08820"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08820"}],"publication":"arXiv:1510.08820","language":[{"iso":"eng"}],"date_published":"2015-10-29T00:00:00Z","article_processing_charge":"No","day":"29","month":"10","status":"public","title":"Unearthing the anticrystal: Criticality in the linear response of disordered solids","publication_status":"published","year":"2015","_id":"7779","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_updated":"2021-01-12T08:15:28Z","date_created":"2020-04-30T12:16:18Z","author":[{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","last_name":"Goodrich","first_name":"Carl Peter"}],"type":"preprint","extern":"1","abstract":[{"text":"The fact that a disordered material is not constrained in its properties in\r\nthe same way as a crystal presents significant and yet largely untapped\r\npotential for novel material design. However, unlike their crystalline\r\ncounterparts, disordered solids are not well understood. One of the primary\r\nobstacles is the lack of a theoretical framework for thinking about disorder\r\nand its relation to mechanical properties. To this end, we study an idealized\r\nsystem of frictionless athermal soft spheres that, when compressed, undergoes a\r\njamming phase transition with diverging length scales and clean power-law\r\nsignatures. This critical point is the cornerstone of a much larger \"jamming\r\nscenario\" that has the potential to provide the essential theoretical\r\nfoundation necessary for a unified understanding of the mechanics of disordered\r\nsolids. We begin by showing that jammed sphere packings have a valid linear\r\nregime despite the presence of \"contact nonlinearities.\" We then investigate\r\nthe critical nature of the transition, focusing on diverging length scales and\r\nfinite-size effects. Next, we argue that jamming plays the same role for\r\ndisordered solids as the perfect crystal plays for crystalline solids. Not only\r\ncan it be considered an idealized starting point for understanding disordered\r\nmaterials, but it can even influence systems that have a relatively high amount\r\nof crystalline order. The behavior of solids can thus be thought of as existing\r\non a spectrum, with the perfect crystal and the jamming transition at opposing\r\nends. Finally, we introduce a new principle wherein the contribution of an\r\nindividual bond to one global property is independent of its contribution to\r\nanother. This principle allows the different global responses of a disordered\r\nsystem to be manipulated independently and provides a great deal of flexibility\r\nin designing materials with unique, textured and tunable properties.","lang":"eng"}]},{"type":"conference","extern":"1","abstract":[{"lang":"eng","text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU, are either prohibitively expensive or require significant programming expertise, to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated. In this paper, we take a new approach to concurrent memory reclamation: instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads. Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free."}],"publist_id":"6876","publication_status":"published","title":"ThreadScan: Automatic and scalable memory reclamation","status":"public","publisher":"ACM","_id":"779","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle corporation. In particular, we would like to thank Dave Dice, Alex Kogan, and Mark Moir from the Oracle Scalable Synchronization Research Group for very useful feedback on earlier drafts of this paper.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","date_updated":"2023-02-23T12:35:42Z","date_created":"2018-12-11T11:48:27Z","oa_version":"None","volume":"2015-June","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Matveev, Alexander","first_name":"Alexander","last_name":"Matveev"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"6001"}]},"day":"13","month":"06","article_processing_charge":"No","page":"123 - 132","citation":{"ama":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. ThreadScan: Automatic and scalable memory reclamation. In: Vol 2015-June. ACM; 2015:123-132. doi:10.1145/2755573.2755600","ista":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. 2015. ThreadScan: Automatic and scalable memory reclamation. SPAA: Symposium on Parallelism in Algorithms and Architectures vol. 2015–June, 123–132.","ieee":"D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.","apa":"Alistarh, D.-A., Matveev, A., Leiserson, W., & Shavit, N. (2015). ThreadScan: Automatic and scalable memory reclamation (Vol. 2015–June, pp. 123–132). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2755573.2755600","mla":"Alistarh, Dan-Adrian, et al. ThreadScan: Automatic and Scalable Memory Reclamation. Vol. 2015–June, ACM, 2015, pp. 123–32, doi:10.1145/2755573.2755600.","short":"D.-A. Alistarh, A. Matveev, W. Leiserson, N. Shavit, in:, ACM, 2015, pp. 123–132.","chicago":"Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM, 2015. https://doi.org/10.1145/2755573.2755600."},"language":[{"iso":"eng"}],"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"doi":"10.1145/2755573.2755600","date_published":"2015-06-13T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-47666-6_38","date_published":"2015-01-01T00:00:00Z","conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"},"page":"479 - 491","citation":{"short":"D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.","mla":"Alistarh, Dan-Adrian, and Rati Gelashvili. Polylogarithmic-Time Leader Election in Population Protocols. Vol. 9135, Springer, 2015, pp. 479–91, doi:10.1007/978-3-662-47666-6_38.","chicago":"Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38.","ama":"Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38","apa":"Alistarh, D.-A., & Gelashvili, R. (2015). Polylogarithmic-time leader election in population protocols (Vol. 9135, pp. 479–491). Presented at the ICALP: International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-662-47666-6_38","ieee":"D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in population protocols,” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2015, vol. 9135, pp. 479–491.","ista":"Alistarh D-A, Gelashvili R. 2015. Polylogarithmic-time leader election in population protocols. ICALP: International Colloquium on Automota, Languages and Programming vol. 9135, 479–491."},"main_file_link":[{"url":"https://arxiv.org/abs/1502.05745","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1502.05745"]},"day":"01","month":"01","oa_version":"Preprint","volume":9135,"date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:11Z","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Gelashvili, Rati","first_name":"Rati","last_name":"Gelashvili"}],"publisher":"Springer","intvolume":" 9135","publication_status":"published","status":"public","title":"Polylogarithmic-time leader election in population protocols","_id":"780","year":"2015","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.”","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","publist_id":"6877","abstract":[{"lang":"eng","text":"Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computational constructions. Yet, the fastest currently known population protocol for electing a leader only has linear convergence time, and it has recently been shown that no population protocol using a constant number of states per node may overcome this linear bound. In this paper, we give the first population protocol for leader election with polylogarithmic convergence time, using polylogarithmic memory states per node. The protocol structure is quite simple: each node has an associated value, and is either a leader (still in contention) or a minion (following some leader). A leader keeps incrementing its value and “defeats” other leaders in one-to-one interactions, and will drop from contention and become a minion if it meets a leader with higher value. Importantly, a leader also drops out if it meets a minion with higher absolute value. While these rules are quite simple, the proof that this algorithm achieves polylogarithmic convergence time is non-trivial. In particular, the argument combines careful use of concentration inequalities with anti-concentration bounds, showing that the leaders’ values become spread apart as the execution progresses, which in turn implies that straggling leaders get quickly eliminated. We complement our analysis with empirical results, showing that our protocol converges extremely fast, even for large network sizes."}],"type":"conference"},{"publisher":"ACM","publication_status":"published","title":"Fast and exact majority in population protocols","status":"public","_id":"781","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":"2015-July","oa_version":"None","date_updated":"2023-02-23T13:18:35Z","date_created":"2018-12-11T11:48:28Z","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"first_name":"Milan","last_name":"Vojnović","full_name":"Vojnović, Milan"}],"type":"conference","extern":"1","publist_id":"6873","abstract":[{"text":"Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states; the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority. Despite considerable research effort, known protocols for this problem are either exact but slow (taking linear parallel time to converge), or fast but approximate (with non-zero probability of error). In this paper, we show that this trade-off between preciasion and speed is not inherent. We present a new protocol called Average and Conquer (AVC) that solves majority ex-actly in expected parallel convergence time O(log n/(sε) + log n log s), where n is the number of nodes, εn is the initial node advantage of the majority state, and s = Ω(log n log log n) is the number of states the protocol employs. This shows that the majority problem can be solved exactly in time poly-logarithmic in n, provided that the memory per node is s = Ω(1/ε + lognlog1/ε). On the negative side, we establish a lower bound of Ω(1/ε) on the expected paraallel convergence time for the case of four memory states per node, and a lower bound of Ω(logn) parallel time for protocols using any number of memory states per node.per node, and a lower bound of (log n) parallel time for protocols using any number of memory states per node.","lang":"eng"}],"page":"47 - 56","citation":{"chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429.","mla":"Alistarh, Dan-Adrian, et al. Fast and Exact Majority in Population Protocols. Vol. 2015–July, ACM, 2015, pp. 47–56, doi:10.1145/2767386.2767429.","short":"D.-A. Alistarh, R. Gelashvili, M. Vojnović, in:, ACM, 2015, pp. 47–56.","ista":"Alistarh D-A, Gelashvili R, Vojnović M. 2015. Fast and exact majority in population protocols. PODC: Principles of Distributed Computing vol. 2015–July, 47–56.","ieee":"D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority in population protocols,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 47–56.","apa":"Alistarh, D.-A., Gelashvili, R., & Vojnović, M. (2015). Fast and exact majority in population protocols (Vol. 2015–July, pp. 47–56). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767429","ama":"Alistarh D-A, Gelashvili R, Vojnović M. Fast and exact majority in population protocols. In: Vol 2015-July. ACM; 2015:47-56. doi:10.1145/2767386.2767429"},"language":[{"iso":"eng"}],"date_published":"2015-07-21T00:00:00Z","doi":"10.1145/2767386.2767429","conference":{"name":"PODC: Principles of Distributed Computing"},"article_processing_charge":"No","month":"07","day":"21"},{"volume":"2015-July","oa_version":"None","date_updated":"2023-02-23T13:18:50Z","date_created":"2018-12-11T11:48:28Z","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Sauerwald, Thomas","last_name":"Sauerwald","first_name":"Thomas"},{"full_name":"Vojnović, Milan","first_name":"Milan","last_name":"Vojnović"}],"publisher":"ACM","status":"public","title":"Lock-Free algorithms under stochastic schedulers","publication_status":"published","_id":"782","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","extern":"1","publist_id":"6874","abstract":[{"lang":"eng","text":"In this work, we consider the following random process, mo- Tivated by the analysis of lock-free concurrent algorithms under high memory contention. In each round, a new scheduling step is allocated to one of n threads, according to a distribution p = (p1; p2; : : : ; pn), where thread i is scheduled with probability pi. When some thread first reaches a set threshold of executed steps, it registers a win, completing its current operation, and resets its step count to 1. At the same time, threads whose step count was close to the threshold also get reset because of the win, but to 0 steps, being penalized for almost winning. We are interested in two questions: how often does some thread complete an operation (system latency), and how often does a specific thread complete an operation (individual latency)? We provide asymptotically tight bounds for the system and individual latency of this general concurrency pattern, for arbitrary scheduling distributions p. Surprisingly, a sim- ple characterization exists: in expectation, the system will complete a new operation every Θ(1/p 2) steps, while thread i will complete a new operation every Θ(1/2=p i ) steps. The proof is interesting in its own right, as it requires a careful analysis of how the higher norms of the vector p inuence the thread step counts and latencies in this random process. Our result offers a simple connection between the scheduling distribution and the average performance of concurrent algorithms, which has several applications."}],"type":"conference","language":[{"iso":"eng"}],"date_published":"2015-07-21T00:00:00Z","doi":"10.1145/2767386.2767430","conference":{"name":"PODC: Principles of Distributed Computing"},"page":"251 - 260","citation":{"short":"D.-A. Alistarh, T. Sauerwald, M. Vojnović, in:, ACM, 2015, pp. 251–260.","mla":"Alistarh, Dan-Adrian, et al. Lock-Free Algorithms under Stochastic Schedulers. Vol. 2015–July, ACM, 2015, pp. 251–60, doi:10.1145/2767386.2767430.","chicago":"Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430.","ama":"Alistarh D-A, Sauerwald T, Vojnović M. Lock-Free algorithms under stochastic schedulers. In: Vol 2015-July. ACM; 2015:251-260. doi:10.1145/2767386.2767430","ieee":"D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under stochastic schedulers,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 251–260.","apa":"Alistarh, D.-A., Sauerwald, T., & Vojnović, M. (2015). Lock-Free algorithms under stochastic schedulers (Vol. 2015–July, pp. 251–260). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767430","ista":"Alistarh D-A, Sauerwald T, Vojnović M. 2015. Lock-Free algorithms under stochastic schedulers. PODC: Principles of Distributed Computing vol. 2015–July, 251–260."},"article_processing_charge":"No","month":"07","day":"21"},{"page":"365 - 374","citation":{"apa":"Alistarh, D.-A., Gelashvili, R., & Vladu, A. (2015). How to elect a leader faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420","ieee":"D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.","ista":"Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.","ama":"Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament. In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.","short":"D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.","mla":"Alistarh, Dan-Adrian, et al. How to Elect a Leader Faster than a Tournament. Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.1001"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"PODC: Principles of Distributed Computing"},"doi":"10.1145/2767386.2767420","date_published":"2015-07-21T00:00:00Z","day":"21","month":"07","article_processing_charge":"No","status":"public","title":"How to elect a leader faster than a tournament","publication_status":"published","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"783","year":"2015","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926,\r\nand IIS-1447786, the Department of Energy under grant\r\nER26116/DE-SC0008923, and the Oracle and Intel corporations.\r\nThe authors would like to thank Prof. Nir Shavit for ad-\r\nvice and encouragement during this work, and the anonymous reviewers for their very useful suggestions.","date_created":"2018-12-11T11:48:28Z","date_updated":"2023-02-23T13:18:55Z","oa_version":"None","volume":"2015-July","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"}],"type":"conference","extern":"1","abstract":[{"text":"The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper, we answer this question in the affirmative, improving on a decades-old upper bound. We introduce two new algorithmic ideas to reduce the time complexity of electing a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application of our algorithm is a new upper bound for the tight renaming problem, assigning n items to the n participants in expected O(log2 n) time and O(n2) messages. We complement our results with lower bound of Ω(n2) messages for solving these two problems, closing the question of their message complexity.","lang":"eng"}],"publist_id":"6875"},{"day":"01","month":"01","publication_identifier":{"isbn":["978-1-4503-3542-3"]},"citation":{"short":"D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 2015, pp. 367–368.","mla":"Alistarh, Dan-Adrian, et al. A High-Radix, Low-Latency Optical Switch for Data Centers. ACM, 2015, pp. 367–68, doi:10.1145/2785956.2790035.","chicago":"Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035.","ama":"Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035","ieee":"D.-A. Alistarh et al., “A high-radix, low-latency optical switch for data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom, 2015, pp. 367–368.","apa":"Alistarh, D.-A., Ballani, H., Costa, P., Funnell, A., Benjamin, J., Watts, P., & Thomsen, B. (2015). A high-radix, low-latency optical switch for data centers (pp. 367–368). Presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom: ACM. https://doi.org/10.1145/2785956.2790035","ista":"Alistarh D-A, Ballani H, Costa P, Funnell A, Benjamin J, Watts P, Thomsen B. 2015. A high-radix, low-latency optical switch for data centers. SIGCOMM: Special Interest Group on Data Communication, 367–368."},"quality_controlled":"1","page":"367 - 368","conference":{"end_date":"2015-08-21","start_date":"2015-08-17","location":"London, United Kindgdom","name":"SIGCOMM: Special Interest Group on Data Communication"},"doi":"10.1145/2785956.2790035","date_published":"2015-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","abstract":[{"text":"We demonstrate an optical switch design that can scale up to a thousand ports with high per-port bandwidth (25 Gbps+) and low switching latency (40 ns). Our design uses a broadcast and select architecture, based on a passive star coupler and fast tunable transceivers. In addition we employ time division multiplexing to achieve very low switching latency. Our demo shows the feasibility of the switch data plane using a small testbed, comprising two transmitters and a receiver, connected through a star coupler.","lang":"eng"}],"publist_id":"6872","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"784","year":"2015","title":"A high-radix, low-latency optical switch for data centers","status":"public","publication_status":"published","publisher":"ACM","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Ballani, Hitesh","last_name":"Ballani","first_name":"Hitesh"},{"first_name":"Paolo","last_name":"Costa","full_name":"Costa, Paolo"},{"last_name":"Funnell","first_name":"Adam","full_name":"Funnell, Adam"},{"full_name":"Benjamin, Joshua","last_name":"Benjamin","first_name":"Joshua"},{"first_name":"Philip","last_name":"Watts","full_name":"Watts, Philip"},{"last_name":"Thomsen","first_name":"Benn","full_name":"Thomsen, Benn"}],"date_updated":"2023-02-23T13:18:57Z","date_created":"2018-12-11T11:48:29Z","oa_version":"None"},{"doi":"10.1093/glycob/cwv059","date_published":"2015-12-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ieee":"J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier, “Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology, vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.","apa":"Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., & Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059","ista":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 25(12), 1423–1430.","ama":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430. doi:10.1093/glycob/cwv059","chicago":"Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059.","short":"J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier, Glycobiology 25 (2015) 1423–1430.","mla":"Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30, doi:10.1093/glycob/cwv059."},"external_id":{"pmid":["26306635"]},"publication":"Glycobiology","page":"1423 - 1430","quality_controlled":"1","day":"01","month":"12","scopus_import":1,"author":[{"last_name":"Engel","first_name":"Jakob","full_name":"Engel, Jakob"},{"orcid":"0000-0002-5795-0133","id":"309D50DA-F248-11E8-B48F-1D18A9856A87","last_name":"Schmalhorst","first_name":"Philipp S","full_name":"Schmalhorst, Philipp S"},{"full_name":"Kruger, Anke","first_name":"Anke","last_name":"Kruger"},{"last_name":"Muller","first_name":"Christina","full_name":"Muller, Christina"},{"full_name":"Buettner, Falk","first_name":"Falk","last_name":"Buettner"},{"last_name":"Routier","first_name":"Françoise","full_name":"Routier, Françoise"}],"volume":25,"oa_version":"None","date_created":"2018-12-11T11:48:35Z","date_updated":"2021-01-12T08:16:33Z","pmid":1,"_id":"802","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaHe"}],"publisher":"Oxford University Press","intvolume":" 25","status":"public","publication_status":"published","title":"Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis","publist_id":"6851","issue":"12","abstract":[{"text":"Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at the plasma membrane of various eukaryotes with the important exception of mammals. In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man) linked at position 2 of the inositol. However, several pathogenic fungi additionally synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC, which is the most abundant GIPC synthesized by this fungus. In this study, we identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted deletion of the gene encoding GntA in A. fumigatus resulted in complete absence of zwitterionic GIPC; a phenotype that could be reverted by episomal expression of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid product resistant to saponification and to digestion by phosphatidylinositol-phospholipase C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.","lang":"eng"}],"type":"journal_article"},{"month":"09","day":"22","quality_controlled":"1","page":"10294 - 10302","publication":"Journal of Virology","citation":{"apa":"Schur, F. K., Dick, R., Hagen, W., Vogt, V., & Briggs, J. (2015). The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. ASM. https://doi.org/10.1128/JVI.01502-15","ieee":"F. K. Schur, R. Dick, W. Hagen, V. Vogt, and J. Briggs, “The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly,” Journal of Virology, vol. 89, no. 20. ASM, pp. 10294–10302, 2015.","ista":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. 2015. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 89(20), 10294–10302.","ama":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 2015;89(20):10294-10302. doi:10.1128/JVI.01502-15","chicago":"Schur, Florian KM, Robert Dick, Wim Hagen, Volker Vogt, and John Briggs. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology. ASM, 2015. https://doi.org/10.1128/JVI.01502-15.","short":"F.K. Schur, R. Dick, W. Hagen, V. Vogt, J. Briggs, Journal of Virology 89 (2015) 10294–10302.","mla":"Schur, Florian KM, et al. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology, vol. 89, no. 20, ASM, 2015, pp. 10294–302, doi:10.1128/JVI.01502-15."},"external_id":{"pmid":["26223638"]},"language":[{"iso":"eng"}],"date_published":"2015-09-22T00:00:00Z","doi":"10.1128/JVI.01502-15","type":"journal_article","extern":"1","abstract":[{"text":"The polyprotein Gag is the primary structural component of retroviruses. Gag consists of independently folded domains connected by flexible linkers. Interactions between the conserved capsid (CA) domains of Gag mediate formation of hexameric protein lattices that drive assembly of immature virus particles. Proteolytic cleavage of Gag by the viral protease (PR) is required for maturation of retroviruses from an immature form into an infectious form. Within the assembled Gag lattices of HIV-1 and Mason- Pfizer monkey virus (M-PMV), the C-terminal domain of CA adopts similar quaternary arrangements, while the N-terminal domain of CA is packed in very different manners. Here, we have used cryo-electron tomography and subtomogram averaging to study in vitro-assembled, immature virus-like Rous sarcoma virus (RSV) Gag particles and have determined the structure of CA and the surrounding regions to a resolution of ~8 Å. We found that the C-terminal domain of RSV CA is arranged similarly to HIV-1 and M-PMV, whereas the N-terminal domain of CA adopts a novel arrangement in which the upstream p10 domain folds back into the CA lattice. In this position the cleavage site between CA and p10 appears to be inaccessible to PR. Below CA, an extended density is consistent with the presence of a six-helix bundle formed by the spacer-peptide region. We have also assessed the affect of lattice assembly on proteolytic processing by exogenous PR. The cleavage between p10 and CA is indeed inhibited in the assembled lattice, a finding consistent with structural regulation of proteolytic maturation.\r\n","lang":"eng"}],"publist_id":"6837","issue":"20","status":"public","title":"The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly","publication_status":"published","publisher":"ASM","intvolume":" 89","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"815","year":"2015","pmid":1,"date_created":"2018-12-11T11:48:39Z","date_updated":"2021-01-12T08:17:09Z","oa_version":"None","volume":89,"author":[{"last_name":"Schur","first_name":"Florian","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian"},{"last_name":"Dick","first_name":"Robert","full_name":"Dick, Robert"},{"last_name":"Hagen","first_name":"Wim","full_name":"Hagen, Wim"},{"first_name":"Volker","last_name":"Vogt","full_name":"Vogt, Volker"},{"full_name":"Briggs, John","last_name":"Briggs","first_name":"John"}]},{"type":"journal_article","publist_id":"6836","issue":"7535","abstract":[{"text":"Human immunodeficiency virus type 1 (HIV-1) assembly proceeds in two stages. First, the 55 kilodalton viral Gag polyprotein assembles into a hexameric protein lattice at the plasma membrane of the infected cell, inducing budding and release of an immature particle. Second, Gag is cleaved by the viral protease, leading to internal rearrangement of the virus into the mature, infectious form. Immature and mature HIV-1 particles are heterogeneous in size and morphology, preventing high-resolution analysis of their protein arrangement in situ by conventional structural biology methods. Here we apply cryo-electron tomography and sub-tomogram averaging methods to resolve the structure of the capsid lattice within intact immature HIV-1 particles at subnanometre resolution, allowing unambiguous positioning of all α-helices. The resulting model reveals tertiary and quaternary structural interactions that mediate HIV-1 assembly. Strikingly, these interactions differ from those predicted by the current model based on in vitro-assembled arrays of Gag-derived proteins from Mason-Pfizer monkey virus. To validate this difference, we solve the structure of the capsid lattice within intact immature Mason-Pfizer monkey virus particles. Comparison with the immature HIV-1 structure reveals that retroviral capsid proteins, while having conserved tertiary structures, adopt different quaternary arrangements during virus assembly. The approach demonstrated here should be applicable to determine structures of other proteins at subnanometre resolution within heterogeneous environments.","lang":"eng"}],"extern":1,"_id":"814","year":"2015","acknowledgement":"This study was supported by Deutsche Forschungsgemeinschaft grants BR 3635/2-1 to J.A.G.B., KR 906/7-1 to H.-G.K. and by Grant Agency of the Czech Republic 14-15326S to M.R. The Briggs laboratory acknowledges financial support from the European Molecular Biology Laboratory and from the Chica und Heinz Schaller Stiftung. We thank B. Glass, M. Anders and S. Mattei for preparation of samples, and R. Hadravova, K. H. Bui, F. Thommen, M. Schorb, S. Dodonova, S. Glatt, P. Ulbrich and T. Bharat for technical support and/or discussion. This study was technically supported by the European Molecular Biology Laboratory IT services unit.","intvolume":" 517","publisher":"Nature Publishing Group","status":"public","title":"Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution","publication_status":"published","author":[{"orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian","full_name":"Florian Schur"},{"full_name":"Hagen, Wim J","first_name":"Wim","last_name":"Hagen"},{"full_name":"Rumlová, Michaela","last_name":"Rumlová","first_name":"Michaela"},{"full_name":"Ruml, Tomáš","last_name":"Ruml","first_name":"Tomáš"},{"first_name":"B","last_name":"Müller","full_name":"Müller B"},{"last_name":"Kraüsslich","first_name":"Hans","full_name":"Kraüsslich, Hans Georg"},{"last_name":"Briggs","first_name":"John","full_name":"Briggs, John A"}],"volume":517,"date_created":"2018-12-11T11:48:39Z","date_updated":"2021-01-12T08:17:08Z","day":"22","month":"01","citation":{"short":"F.K. Schur, W. Hagen, M. Rumlová, T. Ruml, B. Müller, H. Kraüsslich, J. Briggs, Nature 517 (2015) 505–508.","mla":"Schur, Florian KM, et al. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature, vol. 517, no. 7535, Nature Publishing Group, 2015, pp. 505–08, doi:10.1038/nature13838.","chicago":"Schur, Florian KM, Wim Hagen, Michaela Rumlová, Tomáš Ruml, B Müller, Hans Kraüsslich, and John Briggs. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature13838.","ama":"Schur FK, Hagen W, Rumlová M, et al. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 2015;517(7535):505-508. doi:10.1038/nature13838","apa":"Schur, F. K., Hagen, W., Rumlová, M., Ruml, T., Müller, B., Kraüsslich, H., & Briggs, J. (2015). Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. Nature Publishing Group. https://doi.org/10.1038/nature13838","ieee":"F. K. Schur et al., “Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution,” Nature, vol. 517, no. 7535. Nature Publishing Group, pp. 505–508, 2015.","ista":"Schur FK, Hagen W, Rumlová M, Ruml T, Müller B, Kraüsslich H, Briggs J. 2015. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 517(7535), 505–508."},"publication":"Nature","page":"505 - 508","quality_controlled":0,"date_published":"2015-01-22T00:00:00Z","doi":"10.1038/nature13838"},{"issue":"2","extern":"1","type":"journal_article","article_number":"AB101","author":[{"last_name":"Einhorn","first_name":"Lukas","full_name":"Einhorn, Lukas"},{"full_name":"Fazekas, Judit","last_name":"Fazekas","first_name":"Judit","orcid":"0000-0002-8777-3502","id":"36432834-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martina","last_name":"Muhr","full_name":"Muhr, Martina"},{"last_name":"Schoos","first_name":"Alexandra","full_name":"Schoos, Alexandra"},{"first_name":"Kumiko","last_name":"Oida","full_name":"Oida, Kumiko"},{"full_name":"Singer, Josef","last_name":"Singer","first_name":"Josef"},{"first_name":"Lucia","last_name":"Panakova","full_name":"Panakova, Lucia"},{"full_name":"Manzano-Szalai, Krisztina","last_name":"Manzano-Szalai","first_name":"Krisztina"},{"full_name":"Jensen-Jarolim, Erika","first_name":"Erika","last_name":"Jensen-Jarolim"}],"volume":135,"oa_version":"None","date_updated":"2021-01-12T08:17:42Z","date_created":"2020-08-10T11:54:09Z","year":"2015","_id":"8242","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 135","publisher":"Elsevier","status":"public","publication_status":"published","title":"Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients","publication_identifier":{"issn":["0091-6749"]},"article_processing_charge":"No","month":"02","day":"01","doi":"10.1016/j.jaci.2014.12.1263","date_published":"2015-02-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"short":"L. Einhorn, J. Singer, M. Muhr, A. Schoos, K. Oida, J. Singer, L. Panakova, K. Manzano-Szalai, E. Jensen-Jarolim, Journal of Allergy and Clinical Immunology 135 (2015).","mla":"Einhorn, Lukas, et al. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology, vol. 135, no. 2, AB101, Elsevier, 2015, doi:10.1016/j.jaci.2014.12.1263.","chicago":"Einhorn, Lukas, Judit Singer, Martina Muhr, Alexandra Schoos, Kumiko Oida, Josef Singer, Lucia Panakova, Krisztina Manzano-Szalai, and Erika Jensen-Jarolim. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology. Elsevier, 2015. https://doi.org/10.1016/j.jaci.2014.12.1263.","ama":"Einhorn L, Singer J, Muhr M, et al. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 2015;135(2). doi:10.1016/j.jaci.2014.12.1263","ieee":"L. Einhorn et al., “Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients,” Journal of Allergy and Clinical Immunology, vol. 135, no. 2. Elsevier, 2015.","apa":"Einhorn, L., Singer, J., Muhr, M., Schoos, A., Oida, K., Singer, J., … Jensen-Jarolim, E. (2015). Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. Elsevier. https://doi.org/10.1016/j.jaci.2014.12.1263","ista":"Einhorn L, Singer J, Muhr M, Schoos A, Oida K, Singer J, Panakova L, Manzano-Szalai K, Jensen-Jarolim E. 2015. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 135(2), AB101."},"publication":"Journal of Allergy and Clinical Immunology","article_type":"original","quality_controlled":"1"},{"date_published":"2015-04-20T00:00:00Z","doi":"10.21769/BioProtoc.1446","quality_controlled":0,"publication":"Bio-protocol","citation":{"ieee":"P. Marhavý and E. Benková, “Real time analysis of lateral root organogenesis in arabidopsis,” Bio-protocol, vol. 5, no. 8. Bio-protocol LLC, 2015.","apa":"Marhavý, P., & Benková, E. (2015). Real time analysis of lateral root organogenesis in arabidopsis. Bio-Protocol. Bio-protocol LLC. https://doi.org/10.21769/BioProtoc.1446","ista":"Marhavý P, Benková E. 2015. Real time analysis of lateral root organogenesis in arabidopsis. Bio-protocol. 5(8).","ama":"Marhavý P, Benková E. Real time analysis of lateral root organogenesis in arabidopsis. Bio-protocol. 2015;5(8). doi:10.21769/BioProtoc.1446","chicago":"Marhavý, Peter, and Eva Benková. “Real Time Analysis of Lateral Root Organogenesis in Arabidopsis.” Bio-Protocol. Bio-protocol LLC, 2015. https://doi.org/10.21769/BioProtoc.1446.","short":"P. Marhavý, E. Benková, Bio-Protocol 5 (2015).","mla":"Marhavý, Peter, and Eva Benková. “Real Time Analysis of Lateral Root Organogenesis in Arabidopsis.” Bio-Protocol, vol. 5, no. 8, Bio-protocol LLC, 2015, doi:10.21769/BioProtoc.1446."},"day":"20","month":"04","date_updated":"2021-01-12T08:18:07Z","date_created":"2018-12-11T11:48:44Z","volume":5,"author":[{"last_name":"Marhavy","first_name":"Peter","orcid":"0000-0001-5227-5741","id":"3F45B078-F248-11E8-B48F-1D18A9856A87","full_name":"Peter Marhavy"},{"full_name":"Eva Benková","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"}],"title":"Real time analysis of lateral root organogenesis in arabidopsis","publication_status":"published","status":"public","intvolume":" 5","publisher":"Bio-protocol LLC","_id":"832","year":"2015","acknowledgement":"European Research Council with a Starting Independent Research grant: ERC-2007-Stg-207362-HCPO, Czech Science Foundation: GA13-39982S\nWe thank Matyas Fendrych for critical reading and comments. The protocol was developed based on previously published work of De Rybel et al. (2010) and Laskowski et al. (2008). ","extern":1,"abstract":[{"text":"Plants maintain capacity to form new organs such as leaves, flowers, lateral shoots and roots throughout their postembryonic lifetime. Lateral roots (LRs) originate from a few pericycle cells that acquire attributes of founder cells (FCs), undergo series of anticlinal divisions, and give rise to a few short initial cells. After initiation, coordinated cell division and differentiation occur, giving rise to lateral root primordia (LRP). Primordia continue to grow, emerge through the cortex and epidermal layers of the primary root, and finally a new apical meristem is established taking over the responsibility for growth of mature lateral roots [for detailed description of the individual stages of lateral root organogenesis see Malamy and Benfey (1997)]. To examine this highly dynamic developmental process and to investigate a role of various hormonal, genetic and environmental factors in the regulation of lateral root organogenesis, the real time imaging based analyses represent extremely powerful tools (Laskowski et al., 2008; De Smet et al., 2012; Marhavy et al., 2013 and 2014). Herein, we describe a protocol for real time lateral root primordia (LRP) analysis, which enables the monitoring of an onset of the specific gene expression and subcellular protein localization during primordia organogenesis, as well as the evaluation of the impact of genetic and environmental perturbations on LRP organogenesis.","lang":"eng"}],"publist_id":"6816","issue":"8","type":"journal_article"},{"article_processing_charge":"No","publication_identifier":{"issn":["2041-1723"]},"day":"05","month":"10","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"language":[{"iso":"eng"}],"date_published":"2015-10-05T00:00:00Z","doi":"10.1038/ncomms9361","quality_controlled":"1","article_type":"original","citation":{"chicago":"Ma, Peixiang, Yi Xue, Nicolas Coquelle, Jens D. Haller, Tairan Yuwen, Isabel Ayala, Oleg Mikhailovskii, et al. “Observing the Overall Rocking Motion of a Protein in a Crystal.” Nature Communications. Springer Nature, 2015. https://doi.org/10.1038/ncomms9361.","mla":"Ma, Peixiang, et al. “Observing the Overall Rocking Motion of a Protein in a Crystal.” Nature Communications, vol. 6, 8361, Springer Nature, 2015, doi:10.1038/ncomms9361.","short":"P. Ma, Y. Xue, N. Coquelle, J.D. Haller, T. Yuwen, I. Ayala, O. Mikhailovskii, D. Willbold, J.-P. Colletier, N.R. Skrynnikov, P. Schanda, Nature Communications 6 (2015).","ista":"Ma P, Xue Y, Coquelle N, Haller JD, Yuwen T, Ayala I, Mikhailovskii O, Willbold D, Colletier J-P, Skrynnikov NR, Schanda P. 2015. Observing the overall rocking motion of a protein in a crystal. Nature Communications. 6, 8361.","apa":"Ma, P., Xue, Y., Coquelle, N., Haller, J. D., Yuwen, T., Ayala, I., … Schanda, P. (2015). Observing the overall rocking motion of a protein in a crystal. Nature Communications. Springer Nature. https://doi.org/10.1038/ncomms9361","ieee":"P. Ma et al., “Observing the overall rocking motion of a protein in a crystal,” Nature Communications, vol. 6. Springer Nature, 2015.","ama":"Ma P, Xue Y, Coquelle N, et al. Observing the overall rocking motion of a protein in a crystal. Nature Communications. 2015;6. doi:10.1038/ncomms9361"},"publication":"Nature Communications","extern":"1","abstract":[{"lang":"eng","text":"The large majority of three-dimensional structures of biological macromolecules have been determined by X-ray diffraction of crystalline samples. High-resolution structure determination crucially depends on the homogeneity of the protein crystal. Overall ‘rocking’ motion of molecules in the crystal is expected to influence diffraction quality, and such motion may therefore affect the process of solving crystal structures. Yet, so far overall molecular motion has not directly been observed in protein crystals, and the timescale of such dynamics remains unclear. Here we use solid-state NMR, X-ray diffraction methods and μs-long molecular dynamics simulations to directly characterize the rigid-body motion of a protein in different crystal forms. For ubiquitin crystals investigated in this study we determine the range of possible correlation times of rocking motion, 0.1–100 μs. The amplitude of rocking varies from one crystal form to another and is correlated with the resolution obtainable in X-ray diffraction experiments."}],"type":"journal_article","article_number":"8361","oa_version":"Published Version","volume":6,"date_updated":"2021-01-12T08:19:24Z","date_created":"2020-09-18T10:07:36Z","author":[{"full_name":"Ma, Peixiang","last_name":"Ma","first_name":"Peixiang"},{"first_name":"Yi","last_name":"Xue","full_name":"Xue, Yi"},{"last_name":"Coquelle","first_name":"Nicolas","full_name":"Coquelle, Nicolas"},{"last_name":"Haller","first_name":"Jens D.","full_name":"Haller, Jens D."},{"last_name":"Yuwen","first_name":"Tairan","full_name":"Yuwen, Tairan"},{"full_name":"Ayala, Isabel","first_name":"Isabel","last_name":"Ayala"},{"first_name":"Oleg","last_name":"Mikhailovskii","full_name":"Mikhailovskii, Oleg"},{"first_name":"Dieter","last_name":"Willbold","full_name":"Willbold, Dieter"},{"last_name":"Colletier","first_name":"Jacques-Philippe","full_name":"Colletier, Jacques-Philippe"},{"first_name":"Nikolai R.","last_name":"Skrynnikov","full_name":"Skrynnikov, Nikolai R."},{"full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","first_name":"Paul","last_name":"Schanda"}],"intvolume":" 6","publisher":"Springer Nature","status":"public","publication_status":"published","title":"Observing the overall rocking motion of a protein in a crystal","year":"2015","_id":"8456","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"extern":"1","issue":"3","abstract":[{"text":"We review recent advances in methodologies to study microseconds‐to‐milliseconds exchange processes in biological molecules using magic‐angle spinning solid‐state nuclear magnetic resonance (MAS ssNMR) spectroscopy. The particularities of MAS ssNMR, as compared to solution‐state NMR, are elucidated using numerical simulations and experimental data. These simulations reveal the potential of MAS NMR to provide detailed insight into short‐lived conformations of biological molecules. Recent studies of conformational exchange dynamics in microcrystalline ubiquitin are discussed.","lang":"eng"}],"type":"journal_article","volume":4,"oa_version":"None","date_created":"2020-09-18T10:07:45Z","date_updated":"2021-01-12T08:19:24Z","author":[{"first_name":"Peixiang","last_name":"Ma","full_name":"Ma, Peixiang"},{"first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul"}],"publisher":"Wiley","intvolume":" 4","publication_status":"published","title":"Conformational exchange processes in biological systems: Detection by solid-state NMR","status":"public","year":"2015","_id":"8457","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publication_identifier":{"isbn":["9780470034590","9780470058213"]},"day":"10","month":"09","language":[{"iso":"eng"}],"doi":"10.1002/9780470034590.emrstm1418","date_published":"2015-09-10T00:00:00Z","page":"699-708","quality_controlled":"1","article_type":"original","citation":{"short":"P. Ma, P. Schanda, EMagRes 4 (2015) 699–708.","mla":"Ma, Peixiang, and Paul Schanda. “Conformational Exchange Processes in Biological Systems: Detection by Solid-State NMR.” EMagRes, vol. 4, no. 3, Wiley, 2015, pp. 699–708, doi:10.1002/9780470034590.emrstm1418.","chicago":"Ma, Peixiang, and Paul Schanda. “Conformational Exchange Processes in Biological Systems: Detection by Solid-State NMR.” EMagRes. Wiley, 2015. https://doi.org/10.1002/9780470034590.emrstm1418.","ama":"Ma P, Schanda P. Conformational exchange processes in biological systems: Detection by solid-state NMR. eMagRes. 2015;4(3):699-708. doi:10.1002/9780470034590.emrstm1418","apa":"Ma, P., & Schanda, P. (2015). Conformational exchange processes in biological systems: Detection by solid-state NMR. EMagRes. Wiley. https://doi.org/10.1002/9780470034590.emrstm1418","ieee":"P. Ma and P. Schanda, “Conformational exchange processes in biological systems: Detection by solid-state NMR,” eMagRes, vol. 4, no. 3. Wiley, pp. 699–708, 2015.","ista":"Ma P, Schanda P. 2015. Conformational exchange processes in biological systems: Detection by solid-state NMR. eMagRes. 4(3), 699–708."},"publication":"eMagRes"},{"date_created":"2018-12-11T11:48:49Z","date_updated":"2021-01-12T08:19:33Z","oa_version":"None","volume":32,"author":[{"full_name":"Usmanova, Dinara","first_name":"Dinara","last_name":"Usmanova"},{"full_name":"Ferretti, Luca","last_name":"Ferretti","first_name":"Luca"},{"full_name":"Povolotskaya, Inna","first_name":"Inna","last_name":"Povolotskaya"},{"first_name":"Peter","last_name":"Vlasov","full_name":"Vlasov, Peter"},{"full_name":"Kondrashov, Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov"}],"title":"A model of substitution trajectories in sequence space and long-term protein evolution","publication_status":"published","status":"public","intvolume":" 32","publisher":"Oxford University Press","_id":"848","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","extern":"1","abstract":[{"text":"The nature of factors governing the tempo and mode of protein evolution is a fundamental issue in evolutionary biology. Specifically, whether or not interactions between different sites, or epistasis, are important in directing the course of evolution became one of the central questions. Several recent reports have scrutinized patterns of long-term protein evolution claiming them to be compatible only with an epistatic fitness landscape. However, these claims have not yet been substantiated with a formal model of protein evolution. Here, we formulate a simple covarion-like model of protein evolution focusing on the rate at which the fitness impact of amino acids at a site changes with time. We then apply the model to the data on convergent and divergent protein evolution to test whether or not the incorporation of epistatic interactions is necessary to explain the data. We find that convergent evolution cannot be explained without the incorporation of epistasis and the rate at which an amino acid state switches from being acceptable at a site to being deleterious is faster than the rate of amino acid substitution. Specifically, for proteins that have persisted in modern prokaryotic organisms since the last universal common ancestor for one amino acid substitution approximately ten amino acid states switch from being accessible to being deleterious, or vice versa. Thus, molecular evolution can only be perceived in the context of rapid turnover of which amino acids are available for evolution.","lang":"eng"}],"issue":"2","publist_id":"6804","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1093/molbev/msu318","date_published":"2015-02-01T00:00:00Z","quality_controlled":"1","page":"542 - 554","publication":"Molecular Biology and Evolution","citation":{"short":"D. Usmanova, L. Ferretti, I. Povolotskaya, P. Vlasov, F. Kondrashov, Molecular Biology and Evolution 32 (2015) 542–554.","mla":"Usmanova, Dinara, et al. “A Model of Substitution Trajectories in Sequence Space and Long-Term Protein Evolution.” Molecular Biology and Evolution, vol. 32, no. 2, Oxford University Press, 2015, pp. 542–54, doi:10.1093/molbev/msu318.","chicago":"Usmanova, Dinara, Luca Ferretti, Inna Povolotskaya, Peter Vlasov, and Fyodor Kondrashov. “A Model of Substitution Trajectories in Sequence Space and Long-Term Protein Evolution.” Molecular Biology and Evolution. Oxford University Press, 2015. https://doi.org/10.1093/molbev/msu318.","ama":"Usmanova D, Ferretti L, Povolotskaya I, Vlasov P, Kondrashov F. A model of substitution trajectories in sequence space and long-term protein evolution. Molecular Biology and Evolution. 2015;32(2):542-554. doi:10.1093/molbev/msu318","apa":"Usmanova, D., Ferretti, L., Povolotskaya, I., Vlasov, P., & Kondrashov, F. (2015). A model of substitution trajectories in sequence space and long-term protein evolution. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msu318","ieee":"D. Usmanova, L. Ferretti, I. Povolotskaya, P. Vlasov, and F. Kondrashov, “A model of substitution trajectories in sequence space and long-term protein evolution,” Molecular Biology and Evolution, vol. 32, no. 2. Oxford University Press, pp. 542–554, 2015.","ista":"Usmanova D, Ferretti L, Povolotskaya I, Vlasov P, Kondrashov F. 2015. A model of substitution trajectories in sequence space and long-term protein evolution. Molecular Biology and Evolution. 32(2), 542–554."},"month":"02","day":"01"},{"date_created":"2020-09-18T10:46:43Z","date_updated":"2021-01-12T08:19:41Z","oa_version":"None","volume":28,"author":[{"first_name":"Vadim","last_name":"Kaloshin","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","full_name":"Kaloshin, Vadim"},{"full_name":"Zhang, K","last_name":"Zhang","first_name":"K"}],"status":"public","title":"Arnold diffusion for smooth convex systems of two and a half degrees of freedom","publication_status":"published","intvolume":" 28","publisher":"IOP Publishing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8498","year":"2015","extern":"1","abstract":[{"text":"In the present note we announce a proof of a strong form of Arnold diffusion for smooth convex Hamiltonian systems. Let ${\\mathbb T}^2$ be a 2-dimensional torus and B2 be the unit ball around the origin in ${\\mathbb R}^2$ . Fix ρ > 0. Our main result says that for a 'generic' time-periodic perturbation of an integrable system of two degrees of freedom $H_0(p)+\\varepsilon H_1(\\theta,p,t),\\quad \\ \\theta\\in {\\mathbb T}^2,\\ p\\in B^2,\\ t\\in {\\mathbb T}={\\mathbb R}/{\\mathbb Z}$ , with a strictly convex H0, there exists a ρ-dense orbit (θε, pε, t)(t) in ${\\mathbb T}^2 \\times B^2 \\times {\\mathbb T}$ , namely, a ρ-neighborhood of the orbit contains ${\\mathbb T}^2 \\times B^2 \\times {\\mathbb T}$ .\r\n\r\nOur proof is a combination of geometric and variational methods. The fundamental elements of the construction are the usage of crumpled normally hyperbolic invariant cylinders from [9], flower and simple normally hyperbolic invariant manifolds from [36] as well as their kissing property at a strong double resonance. This allows us to build a 'connected' net of three-dimensional normally hyperbolic invariant manifolds. To construct diffusing orbits along this net we employ a version of the Mather variational method [41] equipped with weak KAM theory [28], proposed by Bernard in [7].","lang":"eng"}],"issue":"8","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2015-06-30T00:00:00Z","doi":"10.1088/0951-7715/28/8/2699","article_type":"original","quality_controlled":"1","page":"2699-2720","publication":"Nonlinearity","citation":{"ama":"Kaloshin V, Zhang K. Arnold diffusion for smooth convex systems of two and a half degrees of freedom. Nonlinearity. 2015;28(8):2699-2720. doi:10.1088/0951-7715/28/8/2699","ista":"Kaloshin V, Zhang K. 2015. Arnold diffusion for smooth convex systems of two and a half degrees of freedom. Nonlinearity. 28(8), 2699–2720.","ieee":"V. Kaloshin and K. Zhang, “Arnold diffusion for smooth convex systems of two and a half degrees of freedom,” Nonlinearity, vol. 28, no. 8. IOP Publishing, pp. 2699–2720, 2015.","apa":"Kaloshin, V., & Zhang, K. (2015). Arnold diffusion for smooth convex systems of two and a half degrees of freedom. Nonlinearity. IOP Publishing. https://doi.org/10.1088/0951-7715/28/8/2699","mla":"Kaloshin, Vadim, and K. Zhang. “Arnold Diffusion for Smooth Convex Systems of Two and a Half Degrees of Freedom.” Nonlinearity, vol. 28, no. 8, IOP Publishing, 2015, pp. 2699–720, doi:10.1088/0951-7715/28/8/2699.","short":"V. Kaloshin, K. Zhang, Nonlinearity 28 (2015) 2699–2720.","chicago":"Kaloshin, Vadim, and K Zhang. “Arnold Diffusion for Smooth Convex Systems of Two and a Half Degrees of Freedom.” Nonlinearity. IOP Publishing, 2015. https://doi.org/10.1088/0951-7715/28/8/2699."},"month":"06","day":"30","publication_identifier":{"issn":["0951-7715","1361-6544"]},"article_processing_charge":"No","keyword":["Mathematical Physics","General Physics and Astronomy","Applied Mathematics","Statistical and Nonlinear Physics"]},{"publication_identifier":{"issn":["1435-9855"]},"article_processing_charge":"No","day":"05","month":"02","doi":"10.4171/jems/499","date_published":"2015-02-05T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ama":"Guardia M, Kaloshin V. Growth of Sobolev norms in the cubic defocusing nonlinear Schrödinger equation. Journal of the European Mathematical Society. 2015;17(1):71-149. doi:10.4171/jems/499","ista":"Guardia M, Kaloshin V. 2015. Growth of Sobolev norms in the cubic defocusing nonlinear Schrödinger equation. Journal of the European Mathematical Society. 17(1), 71–149.","apa":"Guardia, M., & Kaloshin, V. (2015). Growth of Sobolev norms in the cubic defocusing nonlinear Schrödinger equation. Journal of the European Mathematical Society. European Mathematical Society Publishing House. https://doi.org/10.4171/jems/499","ieee":"M. Guardia and V. Kaloshin, “Growth of Sobolev norms in the cubic defocusing nonlinear Schrödinger equation,” Journal of the European Mathematical Society, vol. 17, no. 1. European Mathematical Society Publishing House, pp. 71–149, 2015.","mla":"Guardia, Marcel, and Vadim Kaloshin. “Growth of Sobolev Norms in the Cubic Defocusing Nonlinear Schrödinger Equation.” Journal of the European Mathematical Society, vol. 17, no. 1, European Mathematical Society Publishing House, 2015, pp. 71–149, doi:10.4171/jems/499.","short":"M. Guardia, V. Kaloshin, Journal of the European Mathematical Society 17 (2015) 71–149.","chicago":"Guardia, Marcel, and Vadim Kaloshin. “Growth of Sobolev Norms in the Cubic Defocusing Nonlinear Schrödinger Equation.” Journal of the European Mathematical Society. European Mathematical Society Publishing House, 2015. https://doi.org/10.4171/jems/499."},"publication":"Journal of the European Mathematical Society","page":"71-149","article_type":"original","quality_controlled":"1","issue":"1","abstract":[{"text":"We consider the cubic defocusing nonlinear Schrödinger equation in the two dimensional torus. Fix s>1. Recently Colliander, Keel, Staffilani, Tao and Takaoka proved the existence of solutions with s-Sobolev norm growing in time.\r\n\r\nWe establish the existence of solutions with polynomial time estimates. More exactly, there is c>0 such that for any K≫1 we find a solution u and a time T such that ∥u(T)∥Hs≥K∥u(0)∥Hs. Moreover, the time T satisfies the polynomial bound 0Science Advances, vol. 1, no. 4, e1400214, American Association for the Advancement of Science , 2015, doi:10.1126/sciadv.1400214.","chicago":"Palacci, Jérémie A, Stefano Sacanna, Anaïs Abramian, Jérémie Barral, Kasey Hanson, Alexander Y. Grosberg, David J. Pine, and Paul M. Chaikin. “Artificial Rheotaxis.” Science Advances. American Association for the Advancement of Science , 2015. https://doi.org/10.1126/sciadv.1400214.","ama":"Palacci JA, Sacanna S, Abramian A, et al. Artificial rheotaxis. Science Advances. 2015;1(4). doi:10.1126/sciadv.1400214","apa":"Palacci, J. A., Sacanna, S., Abramian, A., Barral, J., Hanson, K., Grosberg, A. Y., … Chaikin, P. M. (2015). Artificial rheotaxis. Science Advances. American Association for the Advancement of Science . https://doi.org/10.1126/sciadv.1400214","ieee":"J. A. Palacci et al., “Artificial rheotaxis,” Science Advances, vol. 1, no. 4. American Association for the Advancement of Science , 2015.","ista":"Palacci JA, Sacanna S, Abramian A, Barral J, Hanson K, Grosberg AY, Pine DJ, Chaikin PM. 2015. Artificial rheotaxis. Science Advances. 1(4), e1400214."},"publication":"Science Advances","date_published":"2015-05-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","intvolume":" 1","status":"public","title":"Artificial rheotaxis","ddc":["530"],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9057","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"9058","date_updated":"2021-02-02T13:22:19Z","date_created":"2021-02-02T13:22:19Z","checksum":"b97d62433581875c1b85210c5f6ae370","success":1,"file_name":"2015_ScienceAdvances_Palacci.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2416780,"creator":"cziletti"}],"type":"journal_article","issue":"4","abstract":[{"text":"Motility is a basic feature of living microorganisms, and how it works is often determined by environmental cues. Recent efforts have focused on developing artificial systems that can mimic microorganisms, in particular their self-propulsion. We report on the design and characterization of synthetic self-propelled particles that migrate upstream, known as positive rheotaxis. This phenomenon results from a purely physical mechanism involving the interplay between the polarity of the particles and their alignment by a viscous torque. We show quantitative agreement between experimental data and a simple model of an overdamped Brownian pendulum. The model notably predicts the existence of a stagnation point in a diverging flow. We take advantage of this property to demonstrate that our active particles can sense and predictably organize in an imposed flow. Our colloidal system represents an important step toward the realization of biomimetic microsystems with the ability to sense and respond to environmental changes.","lang":"eng"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"arxiv":["1505.05111"],"pmid":["26601175"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1126/sciadv.1400214","publication_identifier":{"issn":["2375-2548"]},"month":"05","publisher":"American Association for the Advancement of Science ","publication_status":"published","pmid":1,"year":"2015","volume":1,"date_created":"2021-02-02T13:15:02Z","date_updated":"2023-02-23T13:47:52Z","author":[{"full_name":"Palacci, Jérémie A","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","orcid":"0000-0002-7253-9465","first_name":"Jérémie A","last_name":"Palacci"},{"first_name":"Stefano","last_name":"Sacanna","full_name":"Sacanna, Stefano"},{"full_name":"Abramian, Anaïs","last_name":"Abramian","first_name":"Anaïs"},{"full_name":"Barral, Jérémie","first_name":"Jérémie","last_name":"Barral"},{"first_name":"Kasey","last_name":"Hanson","full_name":"Hanson, Kasey"},{"last_name":"Grosberg","first_name":"Alexander Y.","full_name":"Grosberg, Alexander Y."},{"last_name":"Pine","first_name":"David J.","full_name":"Pine, David J."},{"last_name":"Chaikin","first_name":"Paul M.","full_name":"Chaikin, Paul M."}],"article_number":"e1400214","extern":"1","file_date_updated":"2021-02-02T13:22:19Z"},{"date_published":"2015-05-11T00:00:00Z","doi":"10.1371/journal.pone.0125888","quality_controlled":0,"publication":"PLoS One","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"short":"O. Arkhipova, M. Meer, G. Mikoulinskaia, M. Zakharova, A. Galushko, V. Akimenko, F. Kondrashov, PLoS One 10 (2015).","mla":"Arkhipova, Oksana, et al. “Recent Origin of the Methacrylate Redox System in Geobacter Sulfurreducens AM-1 through Horizontal Gene Transfer.” PLoS One, vol. 10, no. 5, Public Library of Science, 2015, doi:10.1371/journal.pone.0125888.","chicago":"Arkhipova, Oksana, Margarita Meer, Galina Mikoulinskaia, Marina Zakharova, Alexander Galushko, Vasilii Akimenko, and Fyodor Kondrashov. “Recent Origin of the Methacrylate Redox System in Geobacter Sulfurreducens AM-1 through Horizontal Gene Transfer.” PLoS One. Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0125888.","ama":"Arkhipova O, Meer M, Mikoulinskaia G, et al. Recent origin of the methacrylate redox system in Geobacter sulfurreducens AM-1 through horizontal gene transfer. PLoS One. 2015;10(5). doi:10.1371/journal.pone.0125888","apa":"Arkhipova, O., Meer, M., Mikoulinskaia, G., Zakharova, M., Galushko, A., Akimenko, V., & Kondrashov, F. (2015). Recent origin of the methacrylate redox system in Geobacter sulfurreducens AM-1 through horizontal gene transfer. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0125888","ieee":"O. Arkhipova et al., “Recent origin of the methacrylate redox system in Geobacter sulfurreducens AM-1 through horizontal gene transfer,” PLoS One, vol. 10, no. 5. Public Library of Science, 2015.","ista":"Arkhipova O, Meer M, Mikoulinskaia G, Zakharova M, Galushko A, Akimenko V, Kondrashov F. 2015. Recent origin of the methacrylate redox system in Geobacter sulfurreducens AM-1 through horizontal gene transfer. PLoS One. 10(5)."},"day":"11","month":"05","date_created":"2018-12-11T11:49:08Z","date_updated":"2021-01-12T08:21:48Z","volume":10,"author":[{"last_name":"Arkhipova","first_name":"Oksana","full_name":"Arkhipova, Oksana V"},{"last_name":"Meer","first_name":"Margarita","full_name":"Meer, Margarita V"},{"first_name":"Galina","last_name":"Mikoulinskaia","full_name":"Mikoulinskaia, Galina V"},{"last_name":"Zakharova","first_name":"Marina","full_name":"Zakharova, Marina V"},{"full_name":"Galushko, Alexander S","first_name":"Alexander","last_name":"Galushko"},{"last_name":"Akimenko","first_name":"Vasilii","full_name":"Akimenko, Vasilii K"},{"full_name":"Fyodor Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov"}],"status":"public","publication_status":"published","title":"Recent origin of the methacrylate redox system in Geobacter sulfurreducens AM-1 through horizontal gene transfer","publisher":"Public Library of Science","intvolume":" 10","_id":"906","year":"2015","acknowledgement":"Funding: The work has been supported by a grant of the HHMI International Early Career Scientist Program (55007424), the Spanish Ministry of Economy and Competitiveness (EUI-EURYIP-2011-4320) as part of the EMBO YIP program, two grants from the Spanish Ministry of Economy and Competitiveness, \"Centro de Excelencia Severo Ochoa 2013–2017 (Sev-2012-0208)\" and (BFU2012-31329), the European Union and the European Research Council under grant agreement 335980_EinME. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.Our author Dr., Prof. Akimenko Vasilii K. (1942–2013) passed away during work on the article. Prof. Akimenko was a leading biochemist in IBPM RAS and active researcher until last days. A number of his work remains unfinished. We mourn premature care of Prof. Akimenko Vasilii. We thank Heinz Himmelbauer and the CRG Genomic Unit for the sequencing.","extern":1,"abstract":[{"text":"The origin and evolution of novel biochemical functions remains one of the key questions in molecular evolution. We study recently emerged methacrylate reductase function that is thought to have emerged in the last century and reported in Geobacter sulfurreducens strain AM-1. We report the sequence and study the evolution of the operon coding for the flavin-containing methacrylate reductase (Mrd) and tetraheme cytochrome (Mcc) in the genome of G. sulfurreducens AM-1. Different types of signal peptides in functionally interlinked proteins Mrd and Mcc suggest a possible complex mechanism of biogenesis for chromoproteids of the methacrylate redox system. The homologs of the Mrd and Mcc sequence found in δ-Proteobacteria and Deferribacteres are also organized into an operon and their phylogenetic distribution suggested that these two genes tend to be horizontally transferred together. Specifically, the mrd and mcc genes from G. sulfurreducens AM-1 are not monophyletic with any of the homologs found in other Geobacter genomes. The acquisition of methacrylate reductase function by G. sulfurreducens AM-1 appears linked to a horizontal gene transfer event. However, the new function of the products of mrd and mcc may have evolved either prior or subsequent to their acquisition by G. sulfurreducens AM-1.","lang":"eng"}],"publist_id":"6742","issue":"5","type":"journal_article"},{"date_created":"2021-02-15T14:21:49Z","date_updated":"2022-01-24T13:45:41Z","volume":120,"author":[{"last_name":"Lefauve","first_name":"Adrien","full_name":"Lefauve, Adrien"},{"last_name":"Muller","first_name":"Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J"},{"first_name":"Angélique","last_name":"Melet","full_name":"Melet, Angélique"}],"publication_status":"published","publisher":"American Geophysical Union","year":"2015","extern":"1","language":[{"iso":"eng"}],"doi":"10.1002/2014jc010598","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.1002/2014JC010598","open_access":"1"}],"month":"06","publication_identifier":{"issn":["2169-9275"]},"oa_version":"Published Version","status":"public","title":"A three-dimensional map of tidal dissipation over abyssal hills","intvolume":" 120","_id":"9141","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"text":"The breaking of internal tides is believed to provide a large part of the power needed to mix the abyssal ocean and sustain the meridional overturning circulation. Both the fraction of internal tide energy that is dissipated locally and the resulting vertical mixing distribution are crucial for the ocean state, but remain poorly quantified. Here we present a first worldwide estimate of mixing due to internal tides generated at small‐scale abyssal hills. Our estimate is based on linear wave theory, a nonlinear parameterization for wave breaking and uses quasi‐global small‐scale abyssal hill bathymetry, stratification, and tidal data. We show that a large fraction of abyssal‐hill generated internal tide energy is locally dissipated over mid‐ocean ridges in the Southern Hemisphere. Significant dissipation occurs above ridge crests, and, upon rescaling by the local stratification, follows a monotonic exponential decay with height off the bottom, with a nonuniform decay scale. We however show that a substantial part of the dissipation occurs over the smoother flanks of mid‐ocean ridges, and exhibits a middepth maximum due to the interplay of wave amplitude with stratification. We link the three‐dimensional map of dissipation to abyssal hills characteristics, ocean stratification, and tidal forcing, and discuss its potential implementation in time‐evolving parameterizations for global climate models. Current tidal parameterizations only account for waves generated at large‐scale satellite‐resolved bathymetry. Our results suggest that the presence of small‐scale, mostly unresolved abyssal hills could significantly enhance the spatial inhomogeneity of tidal mixing, particularly above mid‐ocean ridges in the Southern Hemisphere.","lang":"eng"}],"issue":"7","type":"journal_article","date_published":"2015-06-08T00:00:00Z","article_type":"original","page":"4760-4777","publication":"Journal of Geophysical Research: Oceans","citation":{"short":"A. Lefauve, C.J. Muller, A. Melet, Journal of Geophysical Research: Oceans 120 (2015) 4760–4777.","mla":"Lefauve, Adrien, et al. “A Three-Dimensional Map of Tidal Dissipation over Abyssal Hills.” Journal of Geophysical Research: Oceans, vol. 120, no. 7, American Geophysical Union, 2015, pp. 4760–77, doi:10.1002/2014jc010598.","chicago":"Lefauve, Adrien, Caroline J Muller, and Angélique Melet. “A Three-Dimensional Map of Tidal Dissipation over Abyssal Hills.” Journal of Geophysical Research: Oceans. American Geophysical Union, 2015. https://doi.org/10.1002/2014jc010598.","ama":"Lefauve A, Muller CJ, Melet A. A three-dimensional map of tidal dissipation over abyssal hills. Journal of Geophysical Research: Oceans. 2015;120(7):4760-4777. doi:10.1002/2014jc010598","apa":"Lefauve, A., Muller, C. J., & Melet, A. (2015). A three-dimensional map of tidal dissipation over abyssal hills. Journal of Geophysical Research: Oceans. American Geophysical Union. https://doi.org/10.1002/2014jc010598","ieee":"A. Lefauve, C. J. Muller, and A. Melet, “A three-dimensional map of tidal dissipation over abyssal hills,” Journal of Geophysical Research: Oceans, vol. 120, no. 7. American Geophysical Union, pp. 4760–4777, 2015.","ista":"Lefauve A, Muller CJ, Melet A. 2015. A three-dimensional map of tidal dissipation over abyssal hills. Journal of Geophysical Research: Oceans. 120(7), 4760–4777."},"day":"08","article_processing_charge":"No"},{"_id":"928","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["539","570"],"title":"Assembly and positioning of actomyosin rings by contractility and planar cell polarity","intvolume":" 4","oa_version":"Published Version","file":[{"file_name":"2015_eLife_Sehring.pdf","access_level":"open_access","content_type":"application/pdf","file_size":7202224,"creator":"dernst","relation":"main_file","file_id":"5769","date_updated":"2020-07-14T12:48:15Z","date_created":"2018-12-20T15:50:56Z","checksum":"1e4024b3161adcae4a53a0b3dc8a946e"}],"type":"journal_article","abstract":[{"lang":"eng","text":"The actomyosin cytoskeleton is a primary force-generating mechanism in morphogenesis, thus a robust spatial control of cytoskeletal positioning is essential. In this report, we demonstrate that actomyosin contractility and planar cell polarity (PCP) interact in post-mitotic Ciona notochord cells to self-assemble and reposition actomyosin rings, which play an essential role for cell elongation. Intriguingly, rings always form at the cells′ anterior edge before migrating towards the center as contractility increases, reflecting a novel dynamical property of the cortex. Our drug and genetic manipulations uncover a tug-of-war between contractility, which localizes cortical flows toward the equator and PCP, which tries to reposition them. We develop a simple model of the physical forces underlying this tug-of-war, which quantitatively reproduces our results. We thus propose a quantitative framework for dissecting the relative contribution of contractility and PCP to the self-assembly and repositioning of cytoskeletal structures, which should be applicable to other morphogenetic events."}],"publication":"eLife","citation":{"mla":"Sehring, Ivonne, et al. “Assembly and Positioning of Actomyosin Rings by Contractility and Planar Cell Polarity.” ELife, vol. 4, e09206, eLife Sciences Publications, 2015, doi:10.7554/eLife.09206.","short":"I. Sehring, P. Recho, E. Denker, M. Kourakis, B. Mathiesen, E.B. Hannezo, B. Dong, D. Jiang, ELife 4 (2015).","chicago":"Sehring, Ivonne, Pierre Recho, Elsa Denker, Matthew Kourakis, Birthe Mathiesen, Edouard B Hannezo, Bo Dong, and Di Jiang. “Assembly and Positioning of Actomyosin Rings by Contractility and Planar Cell Polarity.” ELife. eLife Sciences Publications, 2015. https://doi.org/10.7554/eLife.09206.","ama":"Sehring I, Recho P, Denker E, et al. Assembly and positioning of actomyosin rings by contractility and planar cell polarity. eLife. 2015;4. doi:10.7554/eLife.09206","ista":"Sehring I, Recho P, Denker E, Kourakis M, Mathiesen B, Hannezo EB, Dong B, Jiang D. 2015. Assembly and positioning of actomyosin rings by contractility and planar cell polarity. eLife. 4, e09206.","apa":"Sehring, I., Recho, P., Denker, E., Kourakis, M., Mathiesen, B., Hannezo, E. B., … Jiang, D. (2015). Assembly and positioning of actomyosin rings by contractility and planar cell polarity. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.09206","ieee":"I. Sehring et al., “Assembly and positioning of actomyosin rings by contractility and planar cell polarity,” eLife, vol. 4. eLife Sciences Publications, 2015."},"date_published":"2015-10-21T00:00:00Z","day":"21","has_accepted_license":"1","year":"2015","publication_status":"published","publisher":"eLife Sciences Publications","author":[{"full_name":"Sehring, Ivonne","last_name":"Sehring","first_name":"Ivonne"},{"last_name":"Recho","first_name":"Pierre","full_name":"Recho, Pierre"},{"full_name":"Denker, Elsa","first_name":"Elsa","last_name":"Denker"},{"full_name":"Kourakis, Matthew","first_name":"Matthew","last_name":"Kourakis"},{"full_name":"Mathiesen, Birthe","first_name":"Birthe","last_name":"Mathiesen"},{"full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561","first_name":"Edouard B","last_name":"Hannezo"},{"full_name":"Dong, Bo","first_name":"Bo","last_name":"Dong"},{"full_name":"Jiang, Di","first_name":"Di","last_name":"Jiang"}],"date_created":"2018-12-11T11:49:15Z","date_updated":"2021-01-12T08:21:58Z","volume":4,"article_number":"e09206","file_date_updated":"2020-07-14T12:48:15Z","publist_id":"6512","extern":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.7554/eLife.09206","language":[{"iso":"eng"}],"month":"10"},{"oa":1,"external_id":{"arxiv":["1501.04816"]},"main_file_link":[{"url":"https://arxiv.org/abs/1501.04816","open_access":"1"}],"quality_controlled":"1","doi":"10.1016/j.endm.2015.06.027","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"issn":["1571-0653"]},"year":"2015","publication_status":"published","publisher":"Elsevier","author":[{"full_name":"Krivelevich, Michael","first_name":"Michael","last_name":"Krivelevich"},{"first_name":"Matthew Alan","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"}],"date_updated":"2023-02-23T14:01:28Z","date_created":"2021-06-21T06:40:34Z","volume":49,"extern":"1","publication":"Electronic Notes in Discrete Mathematics","citation":{"chicago":"Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” Electronic Notes in Discrete Mathematics. Elsevier, 2015. https://doi.org/10.1016/j.endm.2015.06.027.","mla":"Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.” Electronic Notes in Discrete Mathematics, vol. 49, Elsevier, 2015, pp. 181–87, doi:10.1016/j.endm.2015.06.027.","short":"M. Krivelevich, M.A. Kwan, B. Sudakov, Electronic Notes in Discrete Mathematics 49 (2015) 181–187.","ista":"Krivelevich M, Kwan MA, Sudakov B. 2015. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. 49, 181–187.","apa":"Krivelevich, M., Kwan, M. A., & Sudakov, B. (2015). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2015.06.027","ieee":"M. Krivelevich, M. A. Kwan, and B. Sudakov, “Cycles and matchings in randomly perturbed digraphs and hypergraphs,” Electronic Notes in Discrete Mathematics, vol. 49. Elsevier, pp. 181–187, 2015.","ama":"Krivelevich M, Kwan MA, Sudakov B. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. 2015;49:181-187. doi:10.1016/j.endm.2015.06.027"},"article_type":"original","page":"181-187","date_published":"2015-11-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9575","title":"Cycles and matchings in randomly perturbed digraphs and hypergraphs","status":"public","intvolume":" 49","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves an interesting application of Szemerédi's Regularity Lemma, which might be independently useful. We next prove that digraphs with certain strong expansion properties are pancyclic, and use this to show that adding a linear number of random edges typically makes a dense digraph pancyclic. Finally, we prove that perturbing a certain (minimum-degree-dependent) number of random edges in a tournament typically ensures the existence of multiple edge-disjoint Hamilton cycles. All our results are tight.","lang":"eng"}]},{"author":[{"first_name":"H.S.","last_name":"Leung","full_name":"Leung, H.S."},{"first_name":"P.S.S.","last_name":"Leung","full_name":"Leung, P.S.S."},{"full_name":"Cheng, Bingqing","last_name":"Cheng","first_name":"Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"},{"full_name":"Ngan, A.H.W.","first_name":"A.H.W.","last_name":"Ngan"}],"date_updated":"2023-02-23T14:04:28Z","date_created":"2021-07-15T14:09:32Z","oa_version":"None","volume":67,"_id":"9673","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2015","status":"public","title":"A new dislocation-density-function dynamics scheme for computational crystal plasticity by explicit consideration of dislocation elastic interactions","publication_status":"published","publisher":"Elsevier","intvolume":" 67","abstract":[{"text":"Current strategies of computational crystal plasticity that focus on individual atoms or dislocations are impractical for real-scale, large-strain problems even with today’s computing power. Dislocation-density based approaches are a way forward but a critical issue to address is a realistic description of the interactions between dislocations. In this paper, a new scheme for computational dynamics of dislocation-density functions is proposed, which takes full consideration of the mutual elastic interactions between dislocations based on the Hirth–Lothe formulation. Other features considered include (i) the continuity nature of the movements of dislocation densities, (ii) forest hardening, (iii) generation according to high spatial gradients in dislocation densities, and (iv) annihilation. Numerical implementation by the finite-volume method, which is well suited for flow problems with high gradients, is discussed. Numerical examples performed for a single-crystal aluminum model show typical strength anisotropy behavior comparable to experimental observations. Furthermore, a detailed case study on small-scale crystal plasticity successfully captures a number of key experimental features, including power-law relation between strength and size, low dislocation storage and jerky deformation.","lang":"eng"}],"extern":"1","type":"journal_article","date_published":"2015-04-01T00:00:00Z","doi":"10.1016/j.ijplas.2014.09.009","language":[{"iso":"eng"}],"publication":"International Journal of Plasticity","citation":{"ama":"Leung HS, Leung PSS, Cheng B, Ngan AHW. A new dislocation-density-function dynamics scheme for computational crystal plasticity by explicit consideration of dislocation elastic interactions. International Journal of Plasticity. 2015;67:1-25. doi:10.1016/j.ijplas.2014.09.009","apa":"Leung, H. S., Leung, P. S. S., Cheng, B., & Ngan, A. H. W. (2015). A new dislocation-density-function dynamics scheme for computational crystal plasticity by explicit consideration of dislocation elastic interactions. International Journal of Plasticity. Elsevier. https://doi.org/10.1016/j.ijplas.2014.09.009","ieee":"H. S. Leung, P. S. S. Leung, B. Cheng, and A. H. W. Ngan, “A new dislocation-density-function dynamics scheme for computational crystal plasticity by explicit consideration of dislocation elastic interactions,” International Journal of Plasticity, vol. 67. Elsevier, pp. 1–25, 2015.","ista":"Leung HS, Leung PSS, Cheng B, Ngan AHW. 2015. A new dislocation-density-function dynamics scheme for computational crystal plasticity by explicit consideration of dislocation elastic interactions. International Journal of Plasticity. 67, 1–25.","short":"H.S. Leung, P.S.S. Leung, B. Cheng, A.H.W. Ngan, International Journal of Plasticity 67 (2015) 1–25.","mla":"Leung, H. S., et al. “A New Dislocation-Density-Function Dynamics Scheme for Computational Crystal Plasticity by Explicit Consideration of Dislocation Elastic Interactions.” International Journal of Plasticity, vol. 67, Elsevier, 2015, pp. 1–25, doi:10.1016/j.ijplas.2014.09.009.","chicago":"Leung, H.S., P.S.S. Leung, Bingqing Cheng, and A.H.W. Ngan. “A New Dislocation-Density-Function Dynamics Scheme for Computational Crystal Plasticity by Explicit Consideration of Dislocation Elastic Interactions.” International Journal of Plasticity. Elsevier, 2015. https://doi.org/10.1016/j.ijplas.2014.09.009."},"article_type":"original","page":"1-25","day":"01","month":"04","article_processing_charge":"No","publication_identifier":{"issn":["0749-6419"]},"scopus_import":"1"},{"publication_status":"published","publisher":"American Physical Society","year":"2015","date_updated":"2021-08-09T12:38:49Z","date_created":"2021-07-19T10:07:22Z","volume":92,"author":[{"full_name":"Cheng, Bingqing","first_name":"Bingqing","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632"},{"full_name":"Tribello, Gareth A.","last_name":"Tribello","first_name":"Gareth A."},{"last_name":"Ceriotti","first_name":"Michele","full_name":"Ceriotti, Michele"}],"article_number":"180102","extern":"1","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1511.08668","open_access":"1"}],"external_id":{"arxiv":["1511.08668"]},"language":[{"iso":"eng"}],"doi":"10.1103/physrevb.92.180102","month":"11","publication_identifier":{"eissn":["1550-235X"],"issn":["1098-0121"]},"status":"public","title":"Solid-liquid interfacial free energy out of equilibrium","intvolume":" 92","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9688","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"The properties of the interface between solid and melt are key to solidification and melting, as the interfacial free energy introduces a kinetic barrier to phase transitions. This makes solidification happen below the melting temperature, in out-of-equilibrium conditions at which the interfacial free energy is ill defined. Here we draw a connection between the atomistic description of a diffuse solid-liquid interface and its thermodynamic characterization. This framework resolves the ambiguities in defining the solid-liquid interfacial free energy above and below the melting temperature. In addition, we introduce a simulation protocol that allows solid-liquid interfaces to be reversibly created and destroyed at conditions relevant for experiments. We directly evaluate the value of the interfacial free energy away from the melting point for a simple but realistic atomic potential, and find a more complex temperature dependence than the constant positive slope that has been generally assumed based on phenomenological considerations and that has been used to interpret experiments. This methodology could be easily extended to the study of other phase transitions, from condensation to precipitation. Our analysis can help reconcile the textbook picture of classical nucleation theory with the growing body of atomistic studies and mesoscale models of solidification.","lang":"eng"}],"issue":"18","article_type":"original","publication":"Physical Review B - Condensed Matter and Materials Physics","citation":{"mla":"Cheng, Bingqing, et al. “Solid-Liquid Interfacial Free Energy out of Equilibrium.” Physical Review B - Condensed Matter and Materials Physics, vol. 92, no. 18, 180102, American Physical Society, 2015, doi:10.1103/physrevb.92.180102.","short":"B. Cheng, G.A. Tribello, M. Ceriotti, Physical Review B - Condensed Matter and Materials Physics 92 (2015).","chicago":"Cheng, Bingqing, Gareth A. Tribello, and Michele Ceriotti. “Solid-Liquid Interfacial Free Energy out of Equilibrium.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2015. https://doi.org/10.1103/physrevb.92.180102.","ama":"Cheng B, Tribello GA, Ceriotti M. Solid-liquid interfacial free energy out of equilibrium. Physical Review B - Condensed Matter and Materials Physics. 2015;92(18). doi:10.1103/physrevb.92.180102","ista":"Cheng B, Tribello GA, Ceriotti M. 2015. Solid-liquid interfacial free energy out of equilibrium. Physical Review B - Condensed Matter and Materials Physics. 92(18), 180102.","ieee":"B. Cheng, G. A. Tribello, and M. Ceriotti, “Solid-liquid interfacial free energy out of equilibrium,” Physical Review B - Condensed Matter and Materials Physics, vol. 92, no. 18. American Physical Society, 2015.","apa":"Cheng, B., Tribello, G. A., & Ceriotti, M. (2015). Solid-liquid interfacial free energy out of equilibrium. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/physrevb.92.180102"},"date_published":"2015-11-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"oa_version":"Published Version","date_updated":"2023-02-23T10:07:02Z","date_created":"2021-07-23T11:53:50Z","related_material":{"record":[{"id":"1619","relation":"used_in_publication","status":"public"}]},"author":[{"full_name":"Chevereau, Guillaume","first_name":"Guillaume","last_name":"Chevereau","id":"424D78A0-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2519-8004","id":"4342E402-F248-11E8-B48F-1D18A9856A87","last_name":"Lukacisinova","first_name":"Marta","full_name":"Lukacisinova, Marta"},{"first_name":"Tugce","last_name":"Batur","full_name":"Batur, Tugce"},{"last_name":"Guvenek","first_name":"Aysegul","full_name":"Guvenek, Aysegul"},{"first_name":"Dilay Hazal","last_name":"Ayhan","full_name":"Ayhan, Dilay Hazal"},{"full_name":"Toprak, Erdal","last_name":"Toprak","first_name":"Erdal"},{"full_name":"Bollenbach, Mark Tobias","first_name":"Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"}],"publisher":"Public Library of Science","department":[{"_id":"ToBo"}],"title":"Excel file containing the raw data for all figures","status":"public","_id":"9711","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2015","type":"research_data_reference","date_published":"2015-11-18T00:00:00Z","doi":"10.1371/journal.pbio.1002299.s001","citation":{"ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach MT. 2015. Excel file containing the raw data for all figures, Public Library of Science, 10.1371/journal.pbio.1002299.s001.","apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak, E., & Bollenbach, M. T. (2015). Excel file containing the raw data for all figures. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002299.s001","ieee":"G. Chevereau et al., “Excel file containing the raw data for all figures.” Public Library of Science, 2015.","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Excel file containing the raw data for all figures. 2015. doi:10.1371/journal.pbio.1002299.s001","chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Excel File Containing the Raw Data for All Figures.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s001.","mla":"Chevereau, Guillaume, et al. Excel File Containing the Raw Data for All Figures. Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.s001.","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak, M.T. Bollenbach, (2015)."},"article_processing_charge":"No","day":"18","month":"11"},{"volume":84,"date_created":"2018-12-11T11:54:23Z","date_updated":"2023-02-23T14:06:09Z","related_material":{"record":[{"id":"9720","relation":"research_data","status":"public"}]},"author":[{"full_name":"Mcmahon, Dino","first_name":"Dino","last_name":"Mcmahon"},{"full_name":"Fürst, Matthias","last_name":"Fürst","first_name":"Matthias","orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Caspar, Jesicca","last_name":"Caspar","first_name":"Jesicca"},{"full_name":"Theodorou, Panagiotis","first_name":"Panagiotis","last_name":"Theodorou"},{"full_name":"Brown, Mark","first_name":"Mark","last_name":"Brown"},{"full_name":"Paxton, Robert","last_name":"Paxton","first_name":"Robert"}],"publisher":"Wiley","department":[{"_id":"SyCr"}],"publication_status":"published","pmid":1,"year":"2015","acknowledgement":"We thank J.R. de Miranda, L. De Smet and D. de Graaf for supplying qRT-PCR and MLPA positive controls, respectively, in the form of plasmids. This work was supported by the Insect Pollinators Initiative (IPI grants BB/1000100/1 and BB/I000151/1). The IPI is funded jointly by the Biotechnology and Biological Sciences Research Council, the Department for Environment, Food and Rural Affairs, the Natural Environment Research Council, The Scottish Government and The Wellcome Trust, under the Living with Environmental Change Partnership.","publist_id":"5245","file_date_updated":"2020-07-14T12:45:19Z","language":[{"iso":"eng"}],"doi":"10.1111/1365-2656.12345","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["25646973"]},"oa":1,"month":"03","file":[{"creator":"system","file_size":1823045,"content_type":"application/pdf","file_name":"IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf","access_level":"open_access","date_created":"2018-12-12T10:18:29Z","date_updated":"2020-07-14T12:45:19Z","checksum":"542a0b9b07e78050a81b35f26f0b82da","file_id":"5350","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"460","intvolume":" 84","ddc":["570"],"status":"public","title":"A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"1855","issue":"3","abstract":[{"lang":"eng","text":"Summary: Declining populations of bee pollinators are a cause of concern, with major repercussions for biodiversity loss and food security. RNA viruses associated with honeybees represent a potential threat to other insect pollinators, but the extent of this threat is poorly understood. This study aims to attain a detailed understanding of the current and ongoing risk of emerging infectious disease (EID) transmission between managed and wild pollinator species across a wide range of RNA viruses. Within a structured large-scale national survey across 26 independent sites, we quantify the prevalence and pathogen loads of multiple RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee (Bombus spp.) populations. We then construct models that compare virus prevalence between wild and managed pollinators. Multiple RNA viruses associated with honeybees are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees is a significant predictor of virus prevalence in bumblebees, but we remain cautious in speculating over the principle direction of pathogen transmission. We demonstrate species-specific differences in prevalence, indicating significant variation in disease susceptibility or tolerance. Pathogen loads within individual bumblebees may be high and in the case of at least one RNA virus, prevalence is higher in wild bumblebees than in managed honeybee populations. Our findings indicate widespread transmission of RNA viruses between managed and wild bee pollinators, pointing to an interconnected network of potential disease pressures within and among pollinator species. In the context of the biodiversity crisis, our study emphasizes the importance of targeting a wide range of pathogens and defining host associations when considering potential drivers of population decline."}],"type":"journal_article","date_published":"2015-03-03T00:00:00Z","page":"615 - 624","article_type":"original","citation":{"ieee":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, and R. Paxton, “A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees,” Journal of Animal Ecology, vol. 84, no. 3. Wiley, pp. 615–624, 2015.","apa":"Mcmahon, D., Fürst, M., Caspar, J., Theodorou, P., Brown, M., & Paxton, R. (2015). A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. Journal of Animal Ecology. Wiley. https://doi.org/10.1111/1365-2656.12345","ista":"Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. 2015. A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. Journal of Animal Ecology. 84(3), 615–624.","ama":"Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. Journal of Animal Ecology. 2015;84(3):615-624. doi:10.1111/1365-2656.12345","chicago":"Mcmahon, Dino, Matthias Fürst, Jesicca Caspar, Panagiotis Theodorou, Mark Brown, and Robert Paxton. “A Sting in the Spit: Widespread Cross-Infection of Multiple RNA Viruses across Wild and Managed Bees.” Journal of Animal Ecology. Wiley, 2015. https://doi.org/10.1111/1365-2656.12345.","short":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, Journal of Animal Ecology 84 (2015) 615–624.","mla":"Mcmahon, Dino, et al. “A Sting in the Spit: Widespread Cross-Infection of Multiple RNA Viruses across Wild and Managed Bees.” Journal of Animal Ecology, vol. 84, no. 3, Wiley, 2015, pp. 615–24, doi:10.1111/1365-2656.12345."},"publication":"Journal of Animal Ecology","has_accepted_license":"1","article_processing_charge":"No","day":"03","scopus_import":"1"},{"language":[{"iso":"eng"}],"doi":"10.1098/rstb.2014.0108","quality_controlled":"1","project":[{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7"},{"grant_number":"302004","_id":"25DDF0F0-B435-11E9-9278-68D0E5697425","name":"Pathogen Detectors Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach","call_identifier":"FP7"},{"name":"Antnet","_id":"25E0E184-B435-11E9-9278-68D0E5697425"},{"name":"Fellowship of Wissenschaftskolleg zu Berlin","_id":"25E24DB2-B435-11E9-9278-68D0E5697425"}],"external_id":{"pmid":["25870394"]},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4410374/"}],"oa":1,"month":"05","publication_identifier":{"issn":["0962-8436"],"eissn":["1471-2970"]},"date_created":"2018-12-11T11:54:15Z","date_updated":"2023-02-23T14:06:12Z","volume":370,"author":[{"last_name":"Theis","first_name":"Fabian","full_name":"Theis, Fabian"},{"full_name":"Ugelvig, Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","first_name":"Line V","last_name":"Ugelvig"},{"last_name":"Marr","first_name":"Carsten","full_name":"Marr, Carsten"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9721"}]},"publication_status":"published","publisher":"Royal Society, The","department":[{"_id":"SyCr"}],"acknowledgement":"We thank Meghan L. Vyleta for the genetical fungal strain characterization and Eva Sixt for ant drawings, Matthias Konrad for discussion and Christopher D. Pull, Barbara Casillas-Peréz, Sebastian Novak, as well as three anonymous reviewers and the theme issue editors Peter Kappeler and Charlie Nunn for valuable comments on the manuscript.","year":"2015","pmid":1,"publist_id":"5273","ec_funded":1,"date_published":"2015-05-26T00:00:00Z","article_type":"original","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","citation":{"short":"F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 370 (2015).","mla":"Theis, Fabian, et al. “Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences, vol. 370, no. 1669, Royal Society, The, 2015, doi:10.1098/rstb.2014.0108.","chicago":"Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. Royal Society, The, 2015. https://doi.org/10.1098/rstb.2014.0108.","ama":"Theis F, Ugelvig LV, Marr C, Cremer S. Opposing effects of allogrooming on disease transmission in ant societies. Philosophical Transactions of the Royal Society of London Series B, Biological Sciences. 2015;370(1669). doi:10.1098/rstb.2014.0108","ieee":"F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Opposing effects of allogrooming on disease transmission in ant societies,” Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences, vol. 370, no. 1669. Royal Society, The, 2015.","apa":"Theis, F., Ugelvig, L. V., Marr, C., & Cremer, S. (2015). Opposing effects of allogrooming on disease transmission in ant societies. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. Royal Society, The. https://doi.org/10.1098/rstb.2014.0108","ista":"Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Opposing effects of allogrooming on disease transmission in ant societies. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 370(1669)."},"day":"26","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","status":"public","title":"Opposing effects of allogrooming on disease transmission in ant societies","intvolume":" 370","_id":"1830","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"lang":"eng","text":"To prevent epidemics, insect societies have evolved collective disease defences that are highly effective at curing exposed individuals and limiting disease transmission to healthy group members. Grooming is an important sanitary behaviour—either performed towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious agents from the body surface of exposed individuals, but at the risk of disease contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal pathogen Metarhizium as a model system to study how pathogen presence affects self-grooming and allogrooming between exposed and healthy individuals. We develop an epidemiological SIS model to explore how experimentally observed grooming patterns affect disease spread within the colony, thereby providing a direct link between the expression and direction of sanitary behaviours, and their effects on colony-level epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously decreasing allogrooming. This behavioural modulation seems universally adaptive and is predicted to contain disease spread in a great variety of host–pathogen systems. In contrast, allogrooming directed towards pathogen-exposed individuals might both increase and decrease disease risk. Our model reveals that the effect of allogrooming depends on the balance between pathogen infectiousness and efficiency of social host defences, which are likely to vary across host–pathogen systems."}],"issue":"1669","type":"journal_article"},{"doi":"10.5061/dryad.dj2bf","date_published":"2015-12-29T00:00:00Z","citation":{"chicago":"Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Data from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.” Dryad, 2015. https://doi.org/10.5061/dryad.dj2bf.","short":"F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, (2015).","mla":"Theis, Fabian, et al. Data from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies. Dryad, 2015, doi:10.5061/dryad.dj2bf.","ieee":"F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Data from: Opposing effects of allogrooming on disease transmission in ant societies.” Dryad, 2015.","apa":"Theis, F., Ugelvig, L. V., Marr, C., & Cremer, S. (2015). Data from: Opposing effects of allogrooming on disease transmission in ant societies. Dryad. https://doi.org/10.5061/dryad.dj2bf","ista":"Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Data from: Opposing effects of allogrooming on disease transmission in ant societies, Dryad, 10.5061/dryad.dj2bf.","ama":"Theis F, Ugelvig LV, Marr C, Cremer S. Data from: Opposing effects of allogrooming on disease transmission in ant societies. 2015. doi:10.5061/dryad.dj2bf"},"oa":1,"main_file_link":[{"url":"https://doi.org/10.5061/dryad.dj2bf","open_access":"1"}],"article_processing_charge":"No","day":"29","month":"12","related_material":{"record":[{"id":"1830","status":"public","relation":"used_in_publication"}]},"author":[{"last_name":"Theis","first_name":"Fabian","full_name":"Theis, Fabian"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V"},{"last_name":"Marr","first_name":"Carsten","full_name":"Marr, Carsten"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"}],"oa_version":"Published Version","date_created":"2021-07-26T09:38:36Z","date_updated":"2023-02-23T10:16:22Z","year":"2015","_id":"9721","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","department":[{"_id":"SyCr"}],"publisher":"Dryad","status":"public","title":"Data from: Opposing effects of allogrooming on disease transmission in ant societies","abstract":[{"lang":"eng","text":"To prevent epidemics, insect societies have evolved collective disease defences that are highly effective at curing exposed individuals and limiting disease transmission to healthy group members. Grooming is an important sanitary behaviour—either performed towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious agents from the body surface of exposed individuals, but at the risk of disease contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal pathogen Metarhizium as a model system to study how pathogen presence affects self-grooming and allogrooming between exposed and healthy individuals. We develop an epidemiological SIS model to explore how experimentally observed grooming patterns affect disease spread within the colony, thereby providing a direct link between the expression and direction of sanitary behaviours, and their effects on colony-level epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously decreasing allogrooming. This behavioural modulation seems universally adaptive and is predicted to contain disease spread in a great variety of host–pathogen systems. In contrast, allogrooming directed towards pathogen-exposed individuals might both increase and decrease disease risk. Our model reveals that the effect of allogrooming depends on the balance between pathogen infectiousness and efficiency of social host defences, which are likely to vary across host–pathogen systems."}],"type":"research_data_reference"},{"type":"research_data_reference","date_created":"2021-07-26T08:35:23Z","date_updated":"2023-02-23T10:16:13Z","oa_version":"Published Version","author":[{"last_name":"Friedlander","first_name":"Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","full_name":"Friedlander, Tamar"},{"last_name":"Mayo","first_name":"Avraham E.","full_name":"Mayo, Avraham E."},{"first_name":"Tsvi","last_name":"Tlusty","full_name":"Tlusty, Tsvi"},{"full_name":"Alon, Uri","first_name":"Uri","last_name":"Alon"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"1827"}]},"title":"Supporting information text","status":"public","department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9718","year":"2015","month":"03","day":"23","article_processing_charge":"No","date_published":"2015-03-23T00:00:00Z","doi":"10.1371/journal.pcbi.1004055.s001","citation":{"ama":"Friedlander T, Mayo AE, Tlusty T, Alon U. Supporting information text. 2015. doi:10.1371/journal.pcbi.1004055.s001","ista":"Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Supporting information text, Public Library of Science, 10.1371/journal.pcbi.1004055.s001.","apa":"Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Supporting information text. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s001","ieee":"T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Supporting information text.” Public Library of Science, 2015.","mla":"Friedlander, Tamar, et al. Supporting Information Text. Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004055.s001.","short":"T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).","chicago":"Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Supporting Information Text.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s001."}},{"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":1850825,"creator":"system","file_name":"IST-2016-454-v1+1_journal.pone.0127657.pdf","access_level":"open_access","date_created":"2018-12-12T10:15:30Z","date_updated":"2020-07-14T12:45:16Z","checksum":"d20f26461ca575276ad3ed9ce4bfc787","relation":"main_file","file_id":"5150"}],"pubrep_id":"454","ddc":["000"],"status":"public","title":"DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots","intvolume":" 10","_id":"1793","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We present a software platform for reconstructing and analyzing the growth of a plant root system from a time-series of 3D voxelized shapes. It aligns the shapes with each other, constructs a geometric graph representation together with the function that records the time of growth, and organizes the branches into a hierarchy that reflects the order of creation. The software includes the automatic computation of structural and dynamic traits for each root in the system enabling the quantification of growth on fine-scale. These are important advances in plant phenotyping with applications to the study of genetic and environmental influences on growth."}],"issue":"6","type":"journal_article","date_published":"2015-06-01T00:00:00Z","publication":"PLoS One","citation":{"chicago":"Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One. Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0127657.","short":"O. Symonova, C. Topp, H. Edelsbrunner, PLoS One 10 (2015).","mla":"Symonova, Olga, et al. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One, vol. 10, no. 6, e0127657, Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.","apa":"Symonova, O., Topp, C., & Edelsbrunner, H. (2015). DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0127657","ieee":"O. Symonova, C. Topp, and H. Edelsbrunner, “DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots,” PLoS One, vol. 10, no. 6. Public Library of Science, 2015.","ista":"Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.","ama":"Symonova O, Topp C, Edelsbrunner H. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 2015;10(6). doi:10.1371/journal.pone.0127657"},"day":"01","has_accepted_license":"1","scopus_import":1,"date_updated":"2023-02-23T14:06:33Z","date_created":"2018-12-11T11:54:02Z","volume":10,"author":[{"first_name":"Olga","last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga"},{"full_name":"Topp, Christopher","last_name":"Topp","first_name":"Christopher"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9737"}]},"publication_status":"published","department":[{"_id":"MaJö"},{"_id":"HeEd"}],"publisher":"Public Library of Science","year":"2015","file_date_updated":"2020-07-14T12:45:16Z","publist_id":"5318","article_number":"e0127657","language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0127657","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"06"},{"citation":{"short":"O. Symonova, C. Topp, H. Edelsbrunner, (2015).","mla":"Symonova, Olga, et al. Root Traits Computed by DynamicRoots for the Maize Root Shown in Fig 2. Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.s001.","chicago":"Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0127657.s001.","ama":"Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for the maize root shown in fig 2. 2015. doi:10.1371/journal.pone.0127657.s001","apa":"Symonova, O., Topp, C., & Edelsbrunner, H. (2015). Root traits computed by DynamicRoots for the maize root shown in fig 2. Public Library of Science. https://doi.org/10.1371/journal.pone.0127657.s001","ieee":"O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots for the maize root shown in fig 2.” Public Library of Science, 2015.","ista":"Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001."},"doi":"10.1371/journal.pone.0127657.s001","date_published":"2015-06-01T00:00:00Z","day":"01","month":"06","article_processing_charge":"No","_id":"9737","year":"2015","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","title":"Root traits computed by DynamicRoots for the maize root shown in fig 2","publisher":"Public Library of Science","department":[{"_id":"MaJö"},{"_id":"HeEd"}],"author":[{"full_name":"Symonova, Olga","first_name":"Olga","last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Topp, Christopher","first_name":"Christopher","last_name":"Topp"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"related_material":{"record":[{"id":"1793","status":"public","relation":"used_in_publication"}]},"date_updated":"2023-02-23T10:14:42Z","date_created":"2021-07-28T06:20:13Z","oa_version":"Published Version","type":"research_data_reference"},{"doi":"10.1371/journal.pcbi.1004055","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"month":"03","author":[{"last_name":"Friedlander","first_name":"Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","full_name":"Friedlander, Tamar"},{"full_name":"Mayo, Avraham","first_name":"Avraham","last_name":"Mayo"},{"last_name":"Tlusty","first_name":"Tsvi","full_name":"Tlusty, Tsvi"},{"last_name":"Alon","first_name":"Uri","full_name":"Alon, Uri"}],"related_material":{"record":[{"id":"9718","status":"public","relation":"research_data"},{"id":"9773","status":"public","relation":"research_data"}]},"date_created":"2018-12-11T11:54:14Z","date_updated":"2023-02-23T14:07:51Z","volume":11,"year":"2015","publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","file_date_updated":"2020-07-14T12:45:17Z","ec_funded":1,"publist_id":"5278","date_published":"2015-03-23T00:00:00Z","publication":"PLoS Computational Biology","citation":{"ista":"Friedlander T, Mayo A, Tlusty T, Alon U. 2015. Evolution of bow-tie architectures in biology. PLoS Computational Biology. 11(3).","ieee":"T. Friedlander, A. Mayo, T. Tlusty, and U. Alon, “Evolution of bow-tie architectures in biology,” PLoS Computational Biology, vol. 11, no. 3. Public Library of Science, 2015.","apa":"Friedlander, T., Mayo, A., Tlusty, T., & Alon, U. (2015). Evolution of bow-tie architectures in biology. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055","ama":"Friedlander T, Mayo A, Tlusty T, Alon U. Evolution of bow-tie architectures in biology. PLoS Computational Biology. 2015;11(3). doi:10.1371/journal.pcbi.1004055","chicago":"Friedlander, Tamar, Avraham Mayo, Tsvi Tlusty, and Uri Alon. “Evolution of Bow-Tie Architectures in Biology.” PLoS Computational Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.","mla":"Friedlander, Tamar, et al. “Evolution of Bow-Tie Architectures in Biology.” PLoS Computational Biology, vol. 11, no. 3, Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004055.","short":"T. Friedlander, A. Mayo, T. Tlusty, U. Alon, PLoS Computational Biology 11 (2015)."},"day":"23","has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"pubrep_id":"452","file":[{"access_level":"open_access","file_name":"IST-2016-452-v1+1_journal.pcbi.1004055.pdf","content_type":"application/pdf","file_size":1811647,"creator":"system","relation":"main_file","file_id":"5161","checksum":"b8aa66f450ff8de393014b87ec7d2efb","date_created":"2018-12-12T10:15:39Z","date_updated":"2020-07-14T12:45:17Z"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1827","status":"public","ddc":["576"],"title":"Evolution of bow-tie architectures in biology","intvolume":" 11","abstract":[{"lang":"eng","text":"Bow-tie or hourglass structure is a common architectural feature found in many biological systems. A bow-tie in a multi-layered structure occurs when intermediate layers have much fewer components than the input and output layers. Examples include metabolism where a handful of building blocks mediate between multiple input nutrients and multiple output biomass components, and signaling networks where information from numerous receptor types passes through a small set of signaling pathways to regulate multiple output genes. Little is known, however, about how bow-tie architectures evolve. Here, we address the evolution of bow-tie architectures using simulations of multi-layered systems evolving to fulfill a given input-output goal. We find that bow-ties spontaneously evolve when the information in the evolutionary goal can be compressed. Mathematically speaking, bow-ties evolve when the rank of the input-output matrix describing the evolutionary goal is deficient. The maximal compression possible (the rank of the goal) determines the size of the narrowest part of the network—that is the bow-tie. A further requirement is that a process is active to reduce the number of links in the network, such as product-rule mutations, otherwise a non-bow-tie solution is found in the evolutionary simulations. This offers a mechanism to understand a common architectural principle of biological systems, and a way to quantitate the effective rank of the goals under which they evolved."}],"issue":"3","type":"journal_article"},{"doi":"10.1371/journal.pone.0126907","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","month":"05","author":[{"full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967","id":"42302D54-F248-11E8-B48F-1D18A9856A87","last_name":"Trubenova","first_name":"Barbora"},{"full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","last_name":"Novak"},{"full_name":"Hager, Reinmar","first_name":"Reinmar","last_name":"Hager"}],"related_material":{"record":[{"id":"9715","status":"public","relation":"research_data"},{"id":"9772","relation":"research_data","status":"public"}]},"date_updated":"2023-02-23T14:07:48Z","date_created":"2018-12-11T11:54:07Z","volume":10,"year":"2015","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Public Library of Science","file_date_updated":"2020-07-14T12:45:17Z","publist_id":"5299","date_published":"2015-05-18T00:00:00Z","publication":"PLoS One","citation":{"ama":"Trubenova B, Novak S, Hager R. Indirect genetic effects and the dynamics of social interactions. PLoS One. 2015;10(5). doi:10.1371/journal.pone.0126907","apa":"Trubenova, B., Novak, S., & Hager, R. (2015). Indirect genetic effects and the dynamics of social interactions. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907","ieee":"B. Trubenova, S. Novak, and R. Hager, “Indirect genetic effects and the dynamics of social interactions,” PLoS One, vol. 10, no. 5. Public Library of Science, 2015.","ista":"Trubenova B, Novak S, Hager R. 2015. Indirect genetic effects and the dynamics of social interactions. PLoS One. 10(5).","short":"B. Trubenova, S. Novak, R. Hager, PLoS One 10 (2015).","mla":"Trubenova, Barbora, et al. “Indirect Genetic Effects and the Dynamics of Social Interactions.” PLoS One, vol. 10, no. 5, Public Library of Science, 2015, doi:10.1371/journal.pone.0126907.","chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Indirect Genetic Effects and the Dynamics of Social Interactions.” PLoS One. Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907."},"day":"18","has_accepted_license":"1","scopus_import":1,"pubrep_id":"453","file":[{"access_level":"open_access","file_name":"IST-2016-453-v1+1_journal.pone.0126907.pdf","creator":"system","content_type":"application/pdf","file_size":2748982,"file_id":"4730","relation":"main_file","checksum":"d3a4a58ef4bd3b3e2f32b7fd7af4a743","date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:09:07Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1809","title":"Indirect genetic effects and the dynamics of social interactions","ddc":["570","576"],"status":"public","intvolume":" 10","abstract":[{"text":"Background: Indirect genetic effects (IGEs) occur when genes expressed in one individual alter the expression of traits in social partners. Previous studies focused on the evolutionary consequences and evolutionary dynamics of IGEs, using equilibrium solutions to predict phenotypes in subsequent generations. However, whether or not such steady states may be reached may depend on the dynamics of interactions themselves. Results: In our study, we focus on the dynamics of social interactions and indirect genetic effects and investigate how they modify phenotypes over time. Unlike previous IGE studies, we do not analyse evolutionary dynamics; rather we consider within-individual phenotypic changes, also referred to as phenotypic plasticity. We analyse iterative interactions, when individuals interact in a series of discontinuous events, and investigate the stability of steady state solutions and the dependence on model parameters, such as population size, strength, and the nature of interactions. We show that for interactions where a feedback loop occurs, the possible parameter space of interaction strength is fairly limited, affecting the evolutionary consequences of IGEs. We discuss the implications of our results for current IGE model predictions and their limitations.","lang":"eng"}],"issue":"5","type":"journal_article"},{"article_processing_charge":"No","day":"18","month":"05","citation":{"ama":"Trubenova B, Novak S, Hager R. Description of the agent based simulations. 2015. doi:10.1371/journal.pone.0126907.s003","ista":"Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations, Public Library of Science, 10.1371/journal.pone.0126907.s003.","ieee":"B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.” Public Library of Science, 2015.","apa":"Trubenova, B., Novak, S., & Hager, R. (2015). Description of the agent based simulations. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s003","mla":"Trubenova, Barbora, et al. Description of the Agent Based Simulations. Public Library of Science, 2015, doi:10.1371/journal.pone.0126907.s003.","short":"B. Trubenova, S. Novak, R. Hager, (2015).","chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of the Agent Based Simulations.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s003."},"date_published":"2015-05-18T00:00:00Z","doi":"10.1371/journal.pone.0126907.s003","type":"research_data_reference","publisher":"Public Library of Science","department":[{"_id":"NiBa"}],"title":"Description of the agent based simulations","status":"public","year":"2015","_id":"9772","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","date_updated":"2023-02-23T10:15:25Z","date_created":"2021-08-05T12:55:20Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"1809"}]},"author":[{"full_name":"Trubenova, Barbora","id":"42302D54-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6873-2967","first_name":"Barbora","last_name":"Trubenova"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","last_name":"Novak","full_name":"Novak, Sebastian"},{"full_name":"Hager, Reinmar","first_name":"Reinmar","last_name":"Hager"}]},{"type":"research_data_reference","department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","title":"Evolutionary simulation code","status":"public","year":"2015","_id":"9773","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","date_updated":"2023-02-23T10:16:13Z","date_created":"2021-08-05T12:58:07Z","related_material":{"record":[{"id":"1827","status":"public","relation":"used_in_publication"}]},"author":[{"full_name":"Friedlander, Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","last_name":"Friedlander","first_name":"Tamar"},{"first_name":"Avraham E.","last_name":"Mayo","full_name":"Mayo, Avraham E."},{"last_name":"Tlusty","first_name":"Tsvi","full_name":"Tlusty, Tsvi"},{"last_name":"Alon","first_name":"Uri","full_name":"Alon, Uri"}],"article_processing_charge":"No","month":"03","day":"23","citation":{"mla":"Friedlander, Tamar, et al. Evolutionary Simulation Code. Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004055.s002.","short":"T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).","chicago":"Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Evolutionary Simulation Code.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s002.","ama":"Friedlander T, Mayo AE, Tlusty T, Alon U. Evolutionary simulation code. 2015. doi:10.1371/journal.pcbi.1004055.s002","ista":"Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Evolutionary simulation code, Public Library of Science, 10.1371/journal.pcbi.1004055.s002.","apa":"Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Evolutionary simulation code. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s002","ieee":"T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation code.” Public Library of Science, 2015."},"doi":"10.1371/journal.pcbi.1004055.s002","date_published":"2015-03-23T00:00:00Z"},{"month":"03","day":"01","page":"318 - 324","quality_controlled":0,"oa":1,"citation":{"chicago":"Zeljkovic, Ilija, Yoshinori Okada, Maksym Serbyn, Raman Sankar, Daniel Walkup, Wenwen Zhou, Junwei Liu, et al. “Dirac Mass Generation from Crystal Symmetry Breaking on the Surfaces of Topological Crystalline Insulators.” Nature Materials. Nature Publishing Group, 2015. https://doi.org/10.1038/nmat4215.","short":"I. Zeljkovic, Y. Okada, M. Serbyn, R. Sankar, D. Walkup, W. Zhou, J. Liu, G. Chang, Y. Wang, M. Hasan, F. Chou, H. Lin, A. Bansil, L. Fu, V. Madhavan, Nature Materials 14 (2015) 318–324.","mla":"Zeljkovic, Ilija, et al. “Dirac Mass Generation from Crystal Symmetry Breaking on the Surfaces of Topological Crystalline Insulators.” Nature Materials, vol. 14, no. 3, Nature Publishing Group, 2015, pp. 318–24, doi:10.1038/nmat4215.","apa":"Zeljkovic, I., Okada, Y., Serbyn, M., Sankar, R., Walkup, D., Zhou, W., … Madhavan, V. (2015). Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators. Nature Materials. Nature Publishing Group. https://doi.org/10.1038/nmat4215","ieee":"I. Zeljkovic et al., “Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators,” Nature Materials, vol. 14, no. 3. Nature Publishing Group, pp. 318–324, 2015.","ista":"Zeljkovic I, Okada Y, Serbyn M, Sankar R, Walkup D, Zhou W, Liu J, Chang G, Wang Y, Hasan M, Chou F, Lin H, Bansil A, Fu L, Madhavan V. 2015. Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators. Nature Materials. 14(3), 318–324.","ama":"Zeljkovic I, Okada Y, Serbyn M, et al. Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators. Nature Materials. 2015;14(3):318-324. doi:10.1038/nmat4215"},"main_file_link":[{"url":"https://arxiv.org/abs/1403.4906","open_access":"1"}],"publication":"Nature Materials","doi":"10.1038/nmat4215","date_published":"2015-03-01T00:00:00Z","type":"journal_article","extern":1,"issue":"3","publist_id":"6419","abstract":[{"lang":"eng","text":"The tunability of topological surface states and controllable opening of the Dirac gap are of fundamental and practical interest in the field of topological materials. In the newly discovered topological crystalline insulators (TCIs), theory predicts that the Dirac node is protected by a crystalline symmetry and that the surface state electrons can acquire a mass if this symmetry is broken. Recent studies have detected signatures of a spontaneously generated Dirac gap in TCIs; however, the mechanism of mass formation remains elusive. In this work, we present scanning tunnelling microscopy (STM) measurements of the TCI Pb 1â'x Sn x Se for a wide range of alloy compositions spanning the topological and non-topological regimes. The STM topographies reveal a symmetry-breaking distortion on the surface, which imparts mass to the otherwise massless Dirac electrons-a mechanism analogous to the long sought-after Higgs mechanism in particle physics. Interestingly, the measured Dirac gap decreases on approaching the trivial phase, whereas the magnitude of the distortion remains nearly constant. Our data and calculations reveal that the penetration depth of Dirac surface states controls the magnitude of the Dirac mass. At the limit of the critical composition, the penetration depth is predicted to go to infinity, resulting in zero mass, consistent with our measurements. Finally, we discover the existence of surface states in the non-topological regime, which have the characteristics of gapped, double-branched Dirac fermions and could be exploited in realizing superconductivity in these materials."}],"publisher":"Nature Publishing Group","intvolume":" 14","publication_status":"published","status":"public","title":"Dirac mass generation from crystal symmetry breaking on the surfaces of topological crystalline insulators","acknowledgement":"We thank R. Buczko, C. Chamon, J. C. Seamus Davis, M. El-Batanouny, A. Mesaros, Y. Ran and A. Soumyanarayanan for useful conversations and G. McMahon for help with EDS measurements. V.M. gratefully acknowledges funding from the US Department of Energy, Scanned Probe Division under Award Number DE-FG02-12ER46880 for the support of I.Z., Y.O., W.Z. and D.W. for this project. Work at Massachusetts Institute of Technology is supported by US Department of Energy, Office of Basic Energy Sciences, Division of Materials Sciences and Engineering under Award DE-SC0010526 (L.F.), and NSF-DMR-1104498 (M.S.). H.L. acknowledges the Singapore National Research Foundation for support under NRF Award No. NRF-NRFF2013-03. Y.O. was partly supported by JSPS KAKENHI Grant Numbers 26707016 and 00707656. The work at Northeastern University is supported by the US Department of Energy grant number DE-FG02-07ER46352, and benefited from Northeastern University’s Advanced Scientific Computation Center (ASCC), theory support at the Advanced Light Source, Berkeley and the allocation of supercomputer time at the NERSC through DOE grant number DE-AC02-05CH11231. Work at Princeton University is supported by the US National Science Foundation Grant, NSF-DMR-1006492. F.C. acknowledges the support provided by MOST-Taiwan under project number NSC-102-2119-M-002-004.","_id":"981","year":"2015","volume":14,"date_updated":"2021-01-12T08:22:24Z","date_created":"2018-12-11T11:49:31Z","author":[{"full_name":"Zeljkovic, Ilija","first_name":"Ilija","last_name":"Zeljkovic"},{"first_name":"Yoshinori","last_name":"Okada","full_name":"Okada, Yoshinori"},{"last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","full_name":"Maksym Serbyn"},{"last_name":"Sankar","first_name":"Raman","full_name":"Sankar, Raman"},{"full_name":"Walkup, Daniel","last_name":"Walkup","first_name":"Daniel"},{"full_name":"Zhou, Wenwen","first_name":"Wenwen","last_name":"Zhou"},{"full_name":"Liu, Junwei","last_name":"Liu","first_name":"Junwei"},{"first_name":"Guoqing","last_name":"Chang","full_name":"Chang, Guoqing"},{"full_name":"Wang, Yungjui","last_name":"Wang","first_name":"Yungjui"},{"first_name":"Md","last_name":"Hasan","full_name":"Hasan, Md Z"},{"first_name":"Fangcheng","last_name":"Chou","full_name":"Chou, Fangcheng"},{"first_name":"Hsin","last_name":"Lin","full_name":"Lin, Hsin"},{"last_name":"Bansil","first_name":"Arun","full_name":"Bansil, Arun"},{"first_name":"Liang","last_name":"Fu","full_name":"Fu, Liang"},{"full_name":"Madhavan, Vidya","first_name":"Vidya","last_name":"Madhavan"}]},{"type":"journal_article","extern":1,"issue":"4","publist_id":"6418","abstract":[{"text":"We propose a new approach to probing ergodicity and its breakdown in one-dimensional quantum manybody systems based on their response to a local perturbation. We study the distribution of matrix elements of a local operator between the system's eigenstates, finding a qualitatively different behavior in the manybody localized (MBL) and ergodic phases. To characterize how strongly a local perturbation modifies the eigenstates, we introduce the parameter g(L) = (In (Vnm/δ)) which represents the disorder-averaged ratio of a typical matrix element of a local operator V to energy level spacing δ this parameter is reminiscent of the Thouless conductance in the single-particle localization. We show that the parameter g(L) decreases with system size L in the MBL phase and grows in the ergodic phase. We surmise that the delocalization transition occurs when g(L) is independent of system size, g(L)=gc ~ 1. We illustrate our approach by studying the many-body localization transition and resolving the many-body mobility edge in a disordered one-dimensional XXZ spin-1=2 chain using exact diagonalization and time-evolving block-decimation methods. Our criterion for the MBL transition gives insights into microscopic details of transition. Its direct physical consequences, in particular, logarithmically slow transport at the transition and extensive entanglement entropy of the eigenstates, are consistent with recent renormalization-group predictions.","lang":"eng"}],"publisher":"American Physical Society","intvolume":" 5","title":"Criterion for many-body localization-delocalization phase transition","status":"public","publication_status":"published","acknowledgement":"We acknowledge helpful discussions with Sid Parameswaran, Andrew Potter, Antonello Scardicchio, Romain Vasseur, and especially with Ehud Altman and David Huse. We would like to thank Miles Stoudenmire for the assistance with ITensor library. Research at Perimeter Institute is supported by the Government of Canada through Industry Canada and by the Province of Ontario through the Ministry of Economic Development & Innovation. This research was supported by Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4307 (M. S.), Sloan Foundation, NSERC, and Early Researcher Award of Ontario (D. A.). This work made use of the facilities of N8 HPC Centre of Excellence, provided and funded by the N8 consortium and EPSRC (Grant No. EP/K000225/1). The Centre is coordinated by the Universities of Leeds and Manchester.","_id":"982","year":"2015","volume":5,"date_created":"2018-12-11T11:49:32Z","date_updated":"2021-01-12T08:22:25Z","author":[{"full_name":"Maksym Serbyn","last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zlatko","last_name":"Papić","full_name":"Papić, Zlatko"},{"last_name":"Abanin","first_name":"Dmitry","full_name":"Abanin, Dmitry A"}],"day":"01","month":"01","quality_controlled":0,"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1507.01635","open_access":"1"}],"citation":{"apa":"Serbyn, M., Papić, Z., & Abanin, D. (2015). Criterion for many-body localization-delocalization phase transition. Physical Review X. American Physical Society. https://doi.org/10.1103/PhysRevX.5.041047","ieee":"M. Serbyn, Z. Papić, and D. Abanin, “Criterion for many-body localization-delocalization phase transition,” Physical Review X, vol. 5, no. 4. American Physical Society, 2015.","ista":"Serbyn M, Papić Z, Abanin D. 2015. Criterion for many-body localization-delocalization phase transition. Physical Review X. 5(4).","ama":"Serbyn M, Papić Z, Abanin D. Criterion for many-body localization-delocalization phase transition. Physical Review X. 2015;5(4). doi:10.1103/PhysRevX.5.041047","chicago":"Serbyn, Maksym, Zlatko Papić, and Dmitry Abanin. “Criterion for Many-Body Localization-Delocalization Phase Transition.” Physical Review X. American Physical Society, 2015. https://doi.org/10.1103/PhysRevX.5.041047.","short":"M. Serbyn, Z. Papić, D. Abanin, Physical Review X 5 (2015).","mla":"Serbyn, Maksym, et al. “Criterion for Many-Body Localization-Delocalization Phase Transition.” Physical Review X, vol. 5, no. 4, American Physical Society, 2015, doi:10.1103/PhysRevX.5.041047."},"publication":"Physical Review X","doi":"10.1103/PhysRevX.5.041047","date_published":"2015-01-01T00:00:00Z"},{"year":"2015","acknowledgement":"Research support by Microsoft Project Q, the Danish National Research Foundation, the Lundbeck Foundation, the Carlsberg Foundation, and the European Commission. A.P.H. acknowledges support from the US Department of Energy, C.M.M. acknowledges support from the Villum Foundation.","publisher":"Nature Publishing Group","publication_status":"published","author":[{"last_name":"Higginbotham","first_name":"Andrew P","orcid":"0000-0003-2607-2363","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P"},{"full_name":"Albrecht, S M","first_name":"S M","last_name":"Albrecht"},{"full_name":"Kiršanskas, Gediminas","last_name":"Kiršanskas","first_name":"Gediminas"},{"first_name":"W","last_name":"Chang","full_name":"Chang, W"},{"full_name":"Kuemmeth, Ferdinand","first_name":"Ferdinand","last_name":"Kuemmeth"},{"full_name":"Krogstrup, Peter","last_name":"Krogstrup","first_name":"Peter"},{"full_name":"Jespersen, Thomas","last_name":"Jespersen","first_name":"Thomas"},{"last_name":"Nygård","first_name":"Jesper","full_name":"Nygård, Jesper"},{"full_name":"Flensberg, Karsten","first_name":"Karsten","last_name":"Flensberg"},{"full_name":"Marcus, Charles","first_name":"Charles","last_name":"Marcus"}],"volume":11,"date_created":"2018-12-11T11:44:37Z","date_updated":"2021-01-12T08:22:28Z","publist_id":"7955","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1501.05155"}],"external_id":{"arxiv":["1501.05155"]},"oa":1,"quality_controlled":"1","doi":"10.1038/nphys3461","language":[{"iso":"eng"}],"month":"09","_id":"99","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 11","title":"Parity lifetime of bound states in a proximitized semiconductor nanowire","status":"public","oa_version":"Preprint","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"Quasiparticle excitations can compromise the performance of superconducting devices, causing high-frequency dissipation, decoherence in Josephson qubits, and braiding errors in proposed Majorana-based topological quantum computers. Quasiparticle dynamics have been studied in detail in metallic superconductors but remain relatively unexplored in semiconductor-superconductor structures, which are now being intensely pursued in the context of topological superconductivity. To this end, we use a system comprising a gate-confined semiconductor nanowire with an epitaxially grown superconductor layer, yielding an isolated, proximitized nanowire segment. We identify bound states in the semiconductor by means of bias spectroscopy, determine the characteristic temperatures and magnetic fields for quasiparticle excitations, and extract a parity lifetime (poisoning time) of the bound state in the semiconductor exceeding 10 ms."}],"citation":{"apa":"Higginbotham, A. P., Albrecht, S. M., Kiršanskas, G., Chang, W., Kuemmeth, F., Krogstrup, P., … Marcus, C. (2015). Parity lifetime of bound states in a proximitized semiconductor nanowire. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys3461","ieee":"A. P. Higginbotham et al., “Parity lifetime of bound states in a proximitized semiconductor nanowire,” Nature Physics, vol. 11, no. 12. Nature Publishing Group, pp. 1017–1021, 2015.","ista":"Higginbotham AP, Albrecht SM, Kiršanskas G, Chang W, Kuemmeth F, Krogstrup P, Jespersen T, Nygård J, Flensberg K, Marcus C. 2015. Parity lifetime of bound states in a proximitized semiconductor nanowire. Nature Physics. 11(12), 1017–1021.","ama":"Higginbotham AP, Albrecht SM, Kiršanskas G, et al. Parity lifetime of bound states in a proximitized semiconductor nanowire. Nature Physics. 2015;11(12):1017-1021. doi:10.1038/nphys3461","chicago":"Higginbotham, Andrew P, S M Albrecht, Gediminas Kiršanskas, W Chang, Ferdinand Kuemmeth, Peter Krogstrup, Thomas Jespersen, Jesper Nygård, Karsten Flensberg, and Charles Marcus. “Parity Lifetime of Bound States in a Proximitized Semiconductor Nanowire.” Nature Physics. Nature Publishing Group, 2015. https://doi.org/10.1038/nphys3461.","short":"A.P. Higginbotham, S.M. Albrecht, G. Kiršanskas, W. Chang, F. Kuemmeth, P. Krogstrup, T. Jespersen, J. Nygård, K. Flensberg, C. Marcus, Nature Physics 11 (2015) 1017–1021.","mla":"Higginbotham, Andrew P., et al. “Parity Lifetime of Bound States in a Proximitized Semiconductor Nanowire.” Nature Physics, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 1017–21, doi:10.1038/nphys3461."},"publication":"Nature Physics","page":"1017 - 1021","date_published":"2015-09-14T00:00:00Z","day":"14"},{"doi":"10.1090/proc/12796","date_published":"2015-12-21T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the American Mathematical Society","citation":{"short":"A. Bounemoura, V. Kaloshin, Proceedings of the American Mathematical Society 144 (2015) 1553–1560.","mla":"Bounemoura, Abed, and Vadim Kaloshin. “A Note on Micro-Instability for Hamiltonian Systems Close to Integrable.” Proceedings of the American Mathematical Society, vol. 144, no. 4, American Mathematical Society, 2015, pp. 1553–60, doi:10.1090/proc/12796.","chicago":"Bounemoura, Abed, and Vadim Kaloshin. “A Note on Micro-Instability for Hamiltonian Systems Close to Integrable.” Proceedings of the American Mathematical Society. American Mathematical Society, 2015. https://doi.org/10.1090/proc/12796.","ama":"Bounemoura A, Kaloshin V. A note on micro-instability for Hamiltonian systems close to integrable. Proceedings of the American Mathematical Society. 2015;144(4):1553-1560. doi:10.1090/proc/12796","apa":"Bounemoura, A., & Kaloshin, V. (2015). A note on micro-instability for Hamiltonian systems close to integrable. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/12796","ieee":"A. Bounemoura and V. Kaloshin, “A note on micro-instability for Hamiltonian systems close to integrable,” Proceedings of the American Mathematical Society, vol. 144, no. 4. American Mathematical Society, pp. 1553–1560, 2015.","ista":"Bounemoura A, Kaloshin V. 2015. A note on micro-instability for Hamiltonian systems close to integrable. Proceedings of the American Mathematical Society. 144(4), 1553–1560."},"quality_controlled":"1","article_type":"letter_note","page":"1553-1560","month":"12","day":"21","article_processing_charge":"No","publication_identifier":{"issn":["0002-9939","1088-6826"]},"author":[{"first_name":"Abed","last_name":"Bounemoura","full_name":"Bounemoura, Abed"},{"id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","first_name":"Vadim","last_name":"Kaloshin","full_name":"Kaloshin, Vadim"}],"date_updated":"2021-01-12T08:19:40Z","date_created":"2020-09-18T10:46:14Z","oa_version":"None","volume":144,"_id":"8495","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"A note on micro-instability for Hamiltonian systems close to integrable","intvolume":" 144","publisher":"American Mathematical Society","abstract":[{"text":"In this note, we consider the dynamics associated to a perturbation of an integrable Hamiltonian system in action-angle coordinates in any number of degrees of freedom and we prove the following result of ``micro-diffusion'': under generic assumptions on $ h$ and $ f$, there exists an orbit of the system for which the drift of its action variables is at least of order $ \\sqrt {\\varepsilon }$, after a time of order $ \\sqrt {\\varepsilon }^{-1}$. The assumptions, which are essentially minimal, are that there exists a resonant point for $ h$ and that the corresponding averaged perturbation is non-constant. The conclusions, although very weak when compared to usual instability phenomena, are also essentially optimal within this setting.","lang":"eng"}],"issue":"4","extern":"1","type":"journal_article"},{"month":"07","day":"28","quality_controlled":0,"page":"9328 - 9333","publication":"PNAS","citation":{"ista":"Kretz C, Dai M, Soylemez O, Yee A, Desch K, Siemieniak D, Tomberg K, Kondrashov F, Meng F, Ginsburg D. 2015. Massively parallel enzyme kinetics reveals the substrate recognition landscape of the metalloprotease ADAMTS13. PNAS. 112(30), 9328–9333.","ieee":"C. Kretz et al., “Massively parallel enzyme kinetics reveals the substrate recognition landscape of the metalloprotease ADAMTS13,” PNAS, vol. 112, no. 30. National Academy of Sciences, pp. 9328–9333, 2015.","apa":"Kretz, C., Dai, M., Soylemez, O., Yee, A., Desch, K., Siemieniak, D., … Ginsburg, D. (2015). Massively parallel enzyme kinetics reveals the substrate recognition landscape of the metalloprotease ADAMTS13. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1511328112","ama":"Kretz C, Dai M, Soylemez O, et al. Massively parallel enzyme kinetics reveals the substrate recognition landscape of the metalloprotease ADAMTS13. PNAS. 2015;112(30):9328-9333. doi:10.1073/pnas.1511328112","chicago":"Kretz, Colin, Manhong Dai, Onuralp Soylemez, Andrew Yee, Karl Desch, David Siemieniak, Kärt Tomberg, Fyodor Kondrashov, Fan Meng, and David Ginsburg. “Massively Parallel Enzyme Kinetics Reveals the Substrate Recognition Landscape of the Metalloprotease ADAMTS13.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511328112.","mla":"Kretz, Colin, et al. “Massively Parallel Enzyme Kinetics Reveals the Substrate Recognition Landscape of the Metalloprotease ADAMTS13.” PNAS, vol. 112, no. 30, National Academy of Sciences, 2015, pp. 9328–33, doi:10.1073/pnas.1511328112.","short":"C. Kretz, M. Dai, O. Soylemez, A. Yee, K. Desch, D. Siemieniak, K. Tomberg, F. Kondrashov, F. Meng, D. Ginsburg, PNAS 112 (2015) 9328–9333."},"date_published":"2015-07-28T00:00:00Z","doi":"10.1073/pnas.1511328112","type":"journal_article","extern":1,"abstract":[{"text":"Proteases play important roles in many biologic processes and are key mediators of cancer, inflammation, and thrombosis. However, comprehensive and quantitative techniques to define the substrate specificity profile of proteases are lacking. The metalloprotease ADAMTS13 regulates blood coagulation by cleaving von Willebrand factor (VWF), reducing its procoagulant activity. A mutagenized substrate phage display library based on a 73-amino acid fragment of VWF was constructed, and the ADAMTS13-dependent change in library complexity was evaluated over reaction time points, using high-throughput sequencing. Reaction rate constants (kcat/KM) were calculated for nearly every possible single amino acid substitution within this fragment. This massively parallel enzyme kinetics analysis detailed the specificity of ADAMTS13 and demonstrated the critical importance of the P1-P1' substrate residues while defining exosite binding domains. These data provided empirical evidence for the propensity for epistasis within VWF and showed strong correlation to conservation across orthologs, highlighting evolutionary selective pressures for VWF.","lang":"eng"}],"issue":"30","publist_id":"6783","title":"Massively parallel enzyme kinetics reveals the substrate recognition landscape of the metalloprotease ADAMTS13","publication_status":"published","status":"public","publisher":"National Academy of Sciences","intvolume":" 112","year":"2015","_id":"866","acknowledgement":"We thank Isabel Wang and Vivian Cheung from the Life Sciences Institute, University of Michigan, for assistance with high- throughput sequencing experiments and valuable discussions. We also thank J. Evan Sadler (Washington University) and Sriram Krishnaswamy (Children’s Hospital of Philadelphia) for helpful discussions. We thank Jeff Weitz (McMaster University), Jim Fredenburgh (McMaster University), and Steve Weiss (University of Michigan) for critical review of the manuscript. C.A.K. was awarded the Judith Graham Pool Fellowship from National Hemophilia Foundation. This work was supported by the National Institutes of Health (R01 HL039693), the National Heart, Lung, and Blood Institute (P01- HL057346), Ministerio de Economía y Competitividad Grants BFU2012- 31329 and Sev-2012-0208, and European Research Council Starting Grant 335980_EinME. D.G. is an investigator of the Howard Hughes Medical In- stitute, and F.A.K. is a Howard Hughes Medical Institute International Early Career Scientist.\n","date_created":"2018-12-11T11:48:55Z","date_updated":"2021-01-12T08:20:26Z","volume":112,"author":[{"last_name":"Kretz","first_name":"Colin","full_name":"Kretz, Colin A"},{"last_name":"Dai","first_name":"Manhong","full_name":"Dai, Manhong"},{"full_name":"Soylemez, Onuralp","first_name":"Onuralp","last_name":"Soylemez"},{"last_name":"Yee","first_name":"Andrew","full_name":"Yee, Andrew"},{"full_name":"Desch, Karl C","first_name":"Karl","last_name":"Desch"},{"full_name":"Siemieniak, David R","last_name":"Siemieniak","first_name":"David"},{"full_name":"Tomberg, Kärt","last_name":"Tomberg","first_name":"Kärt"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov","full_name":"Fyodor Kondrashov"},{"full_name":"Meng, Fan","last_name":"Meng","first_name":"Fan"},{"full_name":"Ginsburg, David B","last_name":"Ginsburg","first_name":"David"}]},{"citation":{"ama":"Kondrashov D, Kondrashov F. Topological features of rugged fitness landscapes in sequence space. Trends in Genetics. 2015;31(1):24-33. doi:10.1016/j.tig.2014.09.009","ista":"Kondrashov D, Kondrashov F. 2015. Topological features of rugged fitness landscapes in sequence space. Trends in Genetics. 31(1), 24–33.","ieee":"D. Kondrashov and F. Kondrashov, “Topological features of rugged fitness landscapes in sequence space,” Trends in Genetics, vol. 31, no. 1. Elsevier, pp. 24–33, 2015.","apa":"Kondrashov, D., & Kondrashov, F. (2015). Topological features of rugged fitness landscapes in sequence space. Trends in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2014.09.009","mla":"Kondrashov, Dmitry, and Fyodor Kondrashov. “Topological Features of Rugged Fitness Landscapes in Sequence Space.” Trends in Genetics, vol. 31, no. 1, Elsevier, 2015, pp. 24–33, doi:10.1016/j.tig.2014.09.009.","short":"D. Kondrashov, F. Kondrashov, Trends in Genetics 31 (2015) 24–33.","chicago":"Kondrashov, Dmitry, and Fyodor Kondrashov. “Topological Features of Rugged Fitness Landscapes in Sequence Space.” Trends in Genetics. Elsevier, 2015. https://doi.org/10.1016/j.tig.2014.09.009."},"publication":"Trends in Genetics","page":"24 - 33","quality_controlled":0,"doi":"10.1016/j.tig.2014.09.009","date_published":"2015-01-01T00:00:00Z","day":"01","month":"01","acknowledgement":"This work has been supported by a grant from the HHMI International Early Career Scientist Program (#55007424), the Spanish Ministry of Economy and Competitiveness (grant #BFU2012-31329) as part of the EMBO YIP program, two grants from the Spanish Ministry of Economy and Competitiveness, Centro de Excelencia Severo Ochoa 2013–2017 (#Sev-2012-0208) and BES-2013-064004 funded by the European Regional Development Fund (ERDF), the European Union, and the European Research Council under grant agreement no 335980_EinME.","_id":"886","year":"2015","intvolume":" 31","publisher":"Elsevier","status":"public","title":"Topological features of rugged fitness landscapes in sequence space","publication_status":"published","author":[{"first_name":"Dmitry","last_name":"Kondrashov","full_name":"Kondrashov, Dmitry A"},{"full_name":"Fyodor Kondrashov","last_name":"Kondrashov","first_name":"Fyodor","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87"}],"volume":31,"date_created":"2018-12-11T11:49:01Z","date_updated":"2021-01-12T08:21:16Z","type":"journal_article","publist_id":"6764","issue":"1","abstract":[{"text":"The factors that determine the tempo and mode of protein evolution continue to be a central question in molecular evolution. Traditionally, studies of protein evolution focused on the rates of amino acid substitutions. More recently, with the availability of sequence data and advanced experimental techniques, the focus of attention has shifted toward the study of evolutionary trajectories and the overall layout of protein fitness landscapes. In this review we describe the effect of epistasis on the topology of evolutionary pathways that are likely to be found in fitness landscapes and develop a simple theory to connect the number of maladapted genotypes to the topology of fitness landscapes with epistatic interactions. Finally, we review recent studies that have probed the extent of epistatic interactions and have begun to chart the fitness landscapes in protein sequence space.","lang":"eng"}],"extern":1},{"article_processing_charge":"No","day":"18","page":"1905-1917","article_type":"original","citation":{"mla":"Richet, Nicolas, et al. “Structural Insight into How the Human Helicase Subunit MCM2 May Act as a Histone Chaperone Together with ASF1 at the Replication Fork.” Nucleic Acids Research, vol. 43, no. 3, Oxford University Press, 2015, pp. 1905–17, doi:10.1093/nar/gkv021.","short":"N. Richet, D. Liu, P. Legrand, C. Velours, A. Corpet, A. Gaubert, M.M. Bakail, G. Moal-Raisin, R. Guerois, C. Compper, A. Besle, B. Guichard, G. Almouzni, F. Ochsenbein, Nucleic Acids Research 43 (2015) 1905–1917.","chicago":"Richet, Nicolas, Danni Liu, Pierre Legrand, Christophe Velours, Armelle Corpet, Albane Gaubert, May M Bakail, et al. “Structural Insight into How the Human Helicase Subunit MCM2 May Act as a Histone Chaperone Together with ASF1 at the Replication Fork.” Nucleic Acids Research. Oxford University Press, 2015. https://doi.org/10.1093/nar/gkv021.","ama":"Richet N, Liu D, Legrand P, et al. Structural insight into how the human helicase subunit MCM2 may act as a histone chaperone together with ASF1 at the replication fork. Nucleic Acids Research. 2015;43(3):1905-1917. doi:10.1093/nar/gkv021","ista":"Richet N, Liu D, Legrand P, Velours C, Corpet A, Gaubert A, Bakail MM, Moal-Raisin G, Guerois R, Compper C, Besle A, Guichard B, Almouzni G, Ochsenbein F. 2015. Structural insight into how the human helicase subunit MCM2 may act as a histone chaperone together with ASF1 at the replication fork. Nucleic Acids Research. 43(3), 1905–1917.","apa":"Richet, N., Liu, D., Legrand, P., Velours, C., Corpet, A., Gaubert, A., … Ochsenbein, F. (2015). Structural insight into how the human helicase subunit MCM2 may act as a histone chaperone together with ASF1 at the replication fork. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gkv021","ieee":"N. Richet et al., “Structural insight into how the human helicase subunit MCM2 may act as a histone chaperone together with ASF1 at the replication fork,” Nucleic Acids Research, vol. 43, no. 3. Oxford University Press, pp. 1905–1917, 2015."},"publication":"Nucleic Acids Research","date_published":"2015-02-18T00:00:00Z","type":"journal_article","issue":"3","abstract":[{"text":"MCM2 is a subunit of the replicative helicase machinery shown to interact with histones H3 and H4 during the replication process through its N-terminal domain. During replication, this interaction has been proposed to assist disassembly and assembly of nucleosomes on DNA. However, how this interaction participates in crosstalk with histone chaperones at the replication fork remains to be elucidated. Here, we solved the crystal structure of the ternary complex between the histone-binding domain of Mcm2 and the histones H3-H4 at 2.9 Å resolution. Histones H3 and H4 assemble as a tetramer in the crystal structure, but MCM2 interacts only with a single molecule of H3-H4. The latter interaction exploits binding surfaces that contact either DNA or H2B when H3-H4 dimers are incorporated in the nucleosome core particle. Upon binding of the ternary complex with the histone chaperone ASF1, the histone tetramer dissociates and both MCM2 and ASF1 interact simultaneously with the histones forming a 1:1:1:1 heteromeric complex. Thermodynamic analysis of the quaternary complex together with structural modeling support that ASF1 and MCM2 could form a chaperoning module for histones H3 and H4 protecting them from promiscuous interactions. This suggests an additional function for MCM2 outside its helicase function as a proper histone chaperone connected to the replication pathway.","lang":"eng"}],"intvolume":" 43","status":"public","title":"Structural insight into how the human helicase subunit MCM2 may act as a histone chaperone together with ASF1 at the replication fork","_id":"9017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication_identifier":{"issn":["1362-4962","0305-1048"]},"month":"02","quality_controlled":"1","external_id":{"pmid":["25618846"]},"language":[{"iso":"eng"}],"doi":"10.1093/nar/gkv021","extern":"1","publisher":"Oxford University Press","publication_status":"published","pmid":1,"year":"2015","volume":43,"date_created":"2021-01-19T11:01:01Z","date_updated":"2023-02-23T13:46:50Z","author":[{"first_name":"Nicolas","last_name":"Richet","full_name":"Richet, Nicolas"},{"full_name":"Liu, Danni","last_name":"Liu","first_name":"Danni"},{"first_name":"Pierre","last_name":"Legrand","full_name":"Legrand, Pierre"},{"last_name":"Velours","first_name":"Christophe","full_name":"Velours, Christophe"},{"full_name":"Corpet, Armelle","last_name":"Corpet","first_name":"Armelle"},{"last_name":"Gaubert","first_name":"Albane","full_name":"Gaubert, Albane"},{"orcid":"0000-0002-9592-1587","id":"FB3C3F8E-522F-11EA-B186-22963DDC885E","last_name":"Bakail","first_name":"May M","full_name":"Bakail, May M"},{"first_name":"Gwenaelle","last_name":"Moal-Raisin","full_name":"Moal-Raisin, Gwenaelle"},{"first_name":"Raphael","last_name":"Guerois","full_name":"Guerois, Raphael"},{"last_name":"Compper","first_name":"Christel","full_name":"Compper, Christel"},{"full_name":"Besle, Arthur","last_name":"Besle","first_name":"Arthur"},{"full_name":"Guichard, Berengère","first_name":"Berengère","last_name":"Guichard"},{"full_name":"Almouzni, Genevieve","last_name":"Almouzni","first_name":"Genevieve"},{"last_name":"Ochsenbein","first_name":"Françoise","full_name":"Ochsenbein, Françoise"}]},{"type":"journal_article","extern":"1","publist_id":"6514","abstract":[{"text":"This paper presents a numerical study of a Capillary Pumped Loop evaporator. A two-dimensional unsteady mathematical model of a flat evaporator is developed to simulate heat and mass transfer in unsaturated porous wick with phase change. The liquid-vapor phase change inside the porous wick is described by Langmuir's law. The governing equations are solved by the Finite Element Method. The results are presented then for a sintered nickel wick and methanol as a working fluid. The heat flux required to the transition from the all-liquid wick to the vapor-liquid wick is calculated. The dynamic and thermodynamic behavior of the working fluid in the capillary structure are discussed in this paper.","lang":"eng"}],"intvolume":" 76","publisher":"Elsevier","title":"Dynamic model of heat and mass transfer in an unsaturated porous wick of capillary pumped loop","publication_status":"published","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"924","acknowledgement":"The work presented in this paper is supported by Alstom Transport, site de Tarbes (Contract number is 11099).","year":"2015","oa_version":"None","volume":76,"date_updated":"2021-01-12T08:21:56Z","date_created":"2018-12-11T11:49:13Z","author":[{"last_name":"Boubaker","first_name":"Riadh","full_name":"Boubaker, Riadh"},{"last_name":"Platel","first_name":"Vincent","full_name":"Platel, Vincent"},{"last_name":"Bergès","first_name":"Alexis","full_name":"Bergès, Alexis"},{"last_name":"Bancelin","first_name":"Mathieu","full_name":"Bancelin, Mathieu"},{"full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561","first_name":"Edouard B","last_name":"Hannezo"}],"article_processing_charge":"No","day":"05","month":"02","page":"1 - 8","citation":{"ista":"Boubaker R, Platel V, Bergès A, Bancelin M, Hannezo EB. 2015. Dynamic model of heat and mass transfer in an unsaturated porous wick of capillary pumped loop. Applied Thermal Engineering. 76, 1–8.","ieee":"R. Boubaker, V. Platel, A. Bergès, M. Bancelin, and E. B. Hannezo, “Dynamic model of heat and mass transfer in an unsaturated porous wick of capillary pumped loop,” Applied Thermal Engineering, vol. 76. Elsevier, pp. 1–8, 2015.","apa":"Boubaker, R., Platel, V., Bergès, A., Bancelin, M., & Hannezo, E. B. (2015). Dynamic model of heat and mass transfer in an unsaturated porous wick of capillary pumped loop. Applied Thermal Engineering. Elsevier. https://doi.org/10.1016/j.applthermaleng.2014.10.009","ama":"Boubaker R, Platel V, Bergès A, Bancelin M, Hannezo EB. Dynamic model of heat and mass transfer in an unsaturated porous wick of capillary pumped loop. Applied Thermal Engineering. 2015;76:1-8. doi:10.1016/j.applthermaleng.2014.10.009","chicago":"Boubaker, Riadh, Vincent Platel, Alexis Bergès, Mathieu Bancelin, and Edouard B Hannezo. “Dynamic Model of Heat and Mass Transfer in an Unsaturated Porous Wick of Capillary Pumped Loop.” Applied Thermal Engineering. Elsevier, 2015. https://doi.org/10.1016/j.applthermaleng.2014.10.009.","mla":"Boubaker, Riadh, et al. “Dynamic Model of Heat and Mass Transfer in an Unsaturated Porous Wick of Capillary Pumped Loop.” Applied Thermal Engineering, vol. 76, Elsevier, 2015, pp. 1–8, doi:10.1016/j.applthermaleng.2014.10.009.","short":"R. Boubaker, V. Platel, A. Bergès, M. Bancelin, E.B. Hannezo, Applied Thermal Engineering 76 (2015) 1–8."},"publication":"Applied Thermal Engineering","language":[{"iso":"eng"}],"date_published":"2015-02-05T00:00:00Z","doi":"10.1016/j.applthermaleng.2014.10.009"},{"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1504762112","date_published":"2015-07-14T00:00:00Z","page":"8620 - 8625","citation":{"chicago":"Hannezo, Edouard B, Bo Dong, Pierre Recho, Jean Joanny, and Shigeo Hayashi. “Cortical Instability Drives Periodic Supracellular Actin Pattern Formation in Epithelial Tubes.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1504762112.","mla":"Hannezo, Edouard B., et al. “Cortical Instability Drives Periodic Supracellular Actin Pattern Formation in Epithelial Tubes.” PNAS, vol. 112, no. 28, National Academy of Sciences, 2015, pp. 8620–25, doi:10.1073/pnas.1504762112.","short":"E.B. Hannezo, B. Dong, P. Recho, J. Joanny, S. Hayashi, PNAS 112 (2015) 8620–8625.","ista":"Hannezo EB, Dong B, Recho P, Joanny J, Hayashi S. 2015. Cortical instability drives periodic supracellular actin pattern formation in epithelial tubes. PNAS. 112(28), 8620–8625.","apa":"Hannezo, E. B., Dong, B., Recho, P., Joanny, J., & Hayashi, S. (2015). Cortical instability drives periodic supracellular actin pattern formation in epithelial tubes. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1504762112","ieee":"E. B. Hannezo, B. Dong, P. Recho, J. Joanny, and S. Hayashi, “Cortical instability drives periodic supracellular actin pattern formation in epithelial tubes,” PNAS, vol. 112, no. 28. National Academy of Sciences, pp. 8620–8625, 2015.","ama":"Hannezo EB, Dong B, Recho P, Joanny J, Hayashi S. Cortical instability drives periodic supracellular actin pattern formation in epithelial tubes. PNAS. 2015;112(28):8620-8625. doi:10.1073/pnas.1504762112"},"publication":"PNAS","article_processing_charge":"No","month":"07","day":"14","oa_version":"None","volume":112,"date_updated":"2021-01-12T08:21:59Z","date_created":"2018-12-11T11:49:15Z","author":[{"last_name":"Hannezo","first_name":"Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"},{"last_name":"Dong","first_name":"Bo","full_name":"Dong, Bo"},{"last_name":"Recho","first_name":"Pierre","full_name":"Recho, Pierre"},{"last_name":"Joanny","first_name":"Jean","full_name":"Joanny, Jean"},{"first_name":"Shigeo","last_name":"Hayashi","full_name":"Hayashi, Shigeo"}],"publisher":"National Academy of Sciences","intvolume":" 112","title":"Cortical instability drives periodic supracellular actin pattern formation in epithelial tubes","status":"public","publication_status":"published","acknowledgement":"We thank H. Oda, R. E. Ward, K. Saigo, T. Nishimura, D. Pinheiro, Y. Bellaiche, the Bloomington Stock Center, Drosophila Genetic Resource Center (Kyoto), and the Developmental Studies Hybridoma Bank for generously providing antibodies and fly stocks; A. Hayashi for sharing phalloidin staining samples; Y. H. Zhang for plasmid and protocol for CBP preparation; and T. Kondo and J. Prost for suggestions and discussion. This work was supported by the Taishan Scholar Program of Shandong and the Fundamental Research Funds for the Central Universities in China (3005000-841412019) (to B.D.) and a Grant-in-Aid for Scientific Research on Innovative Areas from Ministry of Education, Culture, Sports, Science and Technology of Japan (to S.H.). E.H. acknowledges support from the Young Researcher Prize of the Bettencourt-Schueller Foundation.","_id":"929","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","issue":"28","publist_id":"6513","abstract":[{"lang":"eng","text":"An essential question of morphogenesis is how patterns arise without preexisting positional information, as inspired by Turing. In the past few years, cytoskeletal flows in the cell cortex have been identified as a key mechanism of molecular patterning at the subcellular level. Theoretical and in vitro studies have suggested that biological polymers such as actomyosin gels have the property to self-organize, but the applicability of this concept in an in vivo setting remains unclear. Here, we report that the regular spacing pattern of supracellular actin rings in the Drosophila tracheal tubule is governed by a self-organizing principle. We propose a simple biophysical model where pattern formation arises from the interplay of myosin contractility and actin turnover. We validate the hypotheses of the model using photobleaching experiments and report that the formation of actin rings is contractility dependent. Moreover, genetic and pharmacological perturbations of the physical properties of the actomyosin gel modify the spacing of the pattern, as the model predicted. In addition, our model posited a role of cortical friction in stabilizing the spacing pattern of actin rings. Consistently, genetic depletion of apical extracellular matrix caused strikingly dynamic movements of actin rings, mirroring our model prediction of a transition from steady to chaotic actin patterns at low cortical friction. Our results therefore demonstrate quantitatively that a hydrodynamical instability of the actin cortex can trigger regular pattern formation and drive morphogenesis in an in vivo setting. "}],"type":"journal_article"},{"quality_controlled":"1","external_id":{"pmid":["26627719"]},"main_file_link":[{"open_access":"1","url":"https://www.pnas.org/content/pnas/112/50/15314.full.pdf"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1510973112","month":"12","publisher":"National Academy of Sciences","publication_status":"published","pmid":1,"year":"2015","volume":112,"date_updated":"2021-01-12T08:22:01Z","date_created":"2018-12-11T11:49:16Z","author":[{"last_name":"García","first_name":"Simón","full_name":"García, Simón"},{"last_name":"Hannezo","first_name":"Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"},{"last_name":"Elgeti","first_name":"Jens","full_name":"Elgeti, Jens"},{"last_name":"Joanny","first_name":"Jean","full_name":"Joanny, Jean"},{"first_name":"Pascal","last_name":"Silberzan","full_name":"Silberzan, Pascal"},{"first_name":"Nir","last_name":"Gov","full_name":"Gov, Nir"}],"extern":"1","publist_id":"6511","page":"15314 - 15319","citation":{"chicago":"García, Simón, Edouard B Hannezo, Jens Elgeti, Jean Joanny, Pascal Silberzan, and Nir Gov. “Physics of Active Jamming during Collective Cellular Motion in a Monolayer.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1510973112.","short":"S. García, E.B. Hannezo, J. Elgeti, J. Joanny, P. Silberzan, N. Gov, PNAS 112 (2015) 15314–15319.","mla":"García, Simón, et al. “Physics of Active Jamming during Collective Cellular Motion in a Monolayer.” PNAS, vol. 112, no. 50, National Academy of Sciences, 2015, pp. 15314–19, doi:10.1073/pnas.1510973112.","apa":"García, S., Hannezo, E. B., Elgeti, J., Joanny, J., Silberzan, P., & Gov, N. (2015). Physics of active jamming during collective cellular motion in a monolayer. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1510973112","ieee":"S. García, E. B. Hannezo, J. Elgeti, J. Joanny, P. Silberzan, and N. Gov, “Physics of active jamming during collective cellular motion in a monolayer,” PNAS, vol. 112, no. 50. National Academy of Sciences, pp. 15314–15319, 2015.","ista":"García S, Hannezo EB, Elgeti J, Joanny J, Silberzan P, Gov N. 2015. Physics of active jamming during collective cellular motion in a monolayer. PNAS. 112(50), 15314–15319.","ama":"García S, Hannezo EB, Elgeti J, Joanny J, Silberzan P, Gov N. Physics of active jamming during collective cellular motion in a monolayer. PNAS. 2015;112(50):15314-15319. doi:10.1073/pnas.1510973112"},"publication":"PNAS","date_published":"2015-12-15T00:00:00Z","day":"15","intvolume":" 112","status":"public","title":"Physics of active jamming during collective cellular motion in a monolayer","_id":"933","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","type":"journal_article","issue":"50","abstract":[{"lang":"eng","text":"Although collective cell motion plays an important role, for example during wound healing, embryogenesis, or cancer progression, the fundamental rules governing this motion are still not well understood, in particular at high cell density. We study here the motion of human bronchial epithelial cells within a monolayer, over long times. We observe that, as the monolayer ages, the cells slow down monotonously, while the velocity correlation length first increases as the cells slow down but eventually decreases at the slowest motions. By comparing experiments, analytic model, and detailed particle-based simulations, we shed light on this biological amorphous solidification process, demonstrating that the observed dynamics can be explained as a consequence of the combined maturation and strengthening of cell-cell and cell-substrate adhesions. Surprisingly, the increase of cell surface density due to proliferation is only secondary in this process. This analysis is confirmed with two other cell types. The very general relations between the mean cell velocity and velocity correlation lengths, which apply for aggregates of self-propelled particles, as well as motile cells, can possibly be used to discriminate between various parameter changes in vivo, from noninvasive microscopy data."}]},{"type":"journal_article","issue":"24","abstract":[{"lang":"eng","text":"Genomic imprinting, an inherently epigenetic phenomenon defined by parent of origin-dependent gene expression, is observed in mammals and flowering plants. Genome-scale surveys of imprinted expression and the underlying differential epigenetic marks have led to the discovery of hundreds of imprinted plant genes and confirmed DNA and histone methylation as key regulators of plant imprinting. However, the biological roles of the vast majority of imprinted plant genes are unknown, and the evolutionary forces shaping plant imprinting remain rather opaque. Here, we review the mechanisms of plant genomic imprinting and discuss theories of imprinting evolution and biological significance in light of recent findings."}],"_id":"9532","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 29","ddc":["570"],"title":"Evolution and function of genomic imprinting in plants","status":"public","file":[{"access_level":"open_access","file_name":"2015_GenesAndDevelopment_Rodrigues.pdf","creator":"asandaue","content_type":"application/pdf","file_size":1116846,"file_id":"9533","relation":"main_file","success":1,"checksum":"086a88cfca4677646da26ed960cb02e9","date_updated":"2021-06-08T09:55:10Z","date_created":"2021-06-08T09:55:10Z"}],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"15","citation":{"ista":"Rodrigues JA, Zilberman D. 2015. Evolution and function of genomic imprinting in plants. Genes and Development. 29(24), 2517–2531.","ieee":"J. A. Rodrigues and D. Zilberman, “Evolution and function of genomic imprinting in plants,” Genes and Development, vol. 29, no. 24. Cold Spring Harbor Laboratory Press, pp. 2517–2531, 2015.","apa":"Rodrigues, J. A., & Zilberman, D. (2015). Evolution and function of genomic imprinting in plants. Genes and Development. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/gad.269902.115","ama":"Rodrigues JA, Zilberman D. Evolution and function of genomic imprinting in plants. Genes and Development. 2015;29(24):2517–2531. doi:10.1101/gad.269902.115","chicago":"Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of Genomic Imprinting in Plants.” Genes and Development. Cold Spring Harbor Laboratory Press, 2015. https://doi.org/10.1101/gad.269902.115.","mla":"Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of Genomic Imprinting in Plants.” Genes and Development, vol. 29, no. 24, Cold Spring Harbor Laboratory Press, 2015, pp. 2517–2531, doi:10.1101/gad.269902.115.","short":"J.A. Rodrigues, D. Zilberman, Genes and Development 29 (2015) 2517–2531."},"publication":"Genes and Development","page":"2517–2531","article_type":"review","date_published":"2015-12-15T00:00:00Z","file_date_updated":"2021-06-08T09:55:10Z","extern":"1","pmid":1,"year":"2015","publisher":"Cold Spring Harbor Laboratory Press","department":[{"_id":"DaZi"}],"publication_status":"published","author":[{"last_name":"Rodrigues","first_name":"Jessica A.","full_name":"Rodrigues, Jessica A."},{"first_name":"Daniel","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"}],"volume":29,"date_updated":"2021-12-14T07:58:15Z","date_created":"2021-06-08T09:56:24Z","publication_identifier":{"eissn":["1549-5477"],"issn":["0890-9369"]},"month":"12","external_id":{"pmid":["26680300"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"quality_controlled":"1","doi":"10.1101/gad.269902.115","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1088/0965-0393/23/3/035001","date_published":"2015-04-01T00:00:00Z","article_type":"original","quality_controlled":"1","publication":"Modelling and Simulation in Materials Science and Engineering","citation":{"ama":"Leung PSS, Leung HS, Cheng B, Ngan AHW. Size dependence of yield strength simulated by a dislocation-density function dynamics approach. Modelling and Simulation in Materials Science and Engineering. 2015;23(3). doi:10.1088/0965-0393/23/3/035001","apa":"Leung, P. S. S., Leung, H. S., Cheng, B., & Ngan, A. H. W. (2015). Size dependence of yield strength simulated by a dislocation-density function dynamics approach. Modelling and Simulation in Materials Science and Engineering. IOP Publishing. https://doi.org/10.1088/0965-0393/23/3/035001","ieee":"P. S. S. Leung, H. S. Leung, B. Cheng, and A. H. W. Ngan, “Size dependence of yield strength simulated by a dislocation-density function dynamics approach,” Modelling and Simulation in Materials Science and Engineering, vol. 23, no. 3. IOP Publishing, 2015.","ista":"Leung PSS, Leung HS, Cheng B, Ngan AHW. 2015. Size dependence of yield strength simulated by a dislocation-density function dynamics approach. Modelling and Simulation in Materials Science and Engineering. 23(3), 035001.","short":"P.S.S. Leung, H.S. Leung, B. Cheng, A.H.W. Ngan, Modelling and Simulation in Materials Science and Engineering 23 (2015).","mla":"Leung, P. S. S., et al. “Size Dependence of Yield Strength Simulated by a Dislocation-Density Function Dynamics Approach.” Modelling and Simulation in Materials Science and Engineering, vol. 23, no. 3, 035001, IOP Publishing, 2015, doi:10.1088/0965-0393/23/3/035001.","chicago":"Leung, P S S, H S Leung, Bingqing Cheng, and A H W Ngan. “Size Dependence of Yield Strength Simulated by a Dislocation-Density Function Dynamics Approach.” Modelling and Simulation in Materials Science and Engineering. IOP Publishing, 2015. https://doi.org/10.1088/0965-0393/23/3/035001."},"month":"04","day":"01","publication_identifier":{"issn":["0965-0393"],"eissn":["1361-651X"]},"article_processing_charge":"No","scopus_import":"1","date_updated":"2023-02-23T14:04:54Z","date_created":"2021-07-19T09:11:12Z","oa_version":"None","volume":23,"author":[{"first_name":"P S S","last_name":"Leung","full_name":"Leung, P S S"},{"last_name":"Leung","first_name":"H S","full_name":"Leung, H S"},{"first_name":"Bingqing","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"},{"first_name":"A H W","last_name":"Ngan","full_name":"Ngan, A H W"}],"status":"public","title":"Size dependence of yield strength simulated by a dislocation-density function dynamics approach","publication_status":"published","intvolume":" 23","publisher":"IOP Publishing","_id":"9684","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2015","extern":"1","abstract":[{"text":"The size dependence of the strength of nano- and micron-sized crystals is studied using a new simulation approach in which the dynamics of the density functions of dislocations are modeled. Since any quantity of dislocations can be represented by a density, this approach can handle large systems containing large quantities of dislocations, which may handicap discrete dislocation dynamics schemes due to the excessive computation time involved. For this reason, pillar sizes spanning a large range, from the sub-micron to micron regimes, can be simulated. The simulation results reveal the power-law relationship between strength and specimen size up to a certain size, beyond which the strength varies much more slowly with size. For specimens smaller than ~4000b, their strength is found to be controlled by the dislocation depletion condition, in which the total dislocation density remains almost constant throughout the loading process. In specimens larger than ~4000b, the initial dislocation distribution is of critical importance since the presence of dislocation entanglements is found to obstruct deformation in the neighboring regions within a distance of ~2000b. This length scale suggests that the effects of dense dislocation clusters are greater in intermediate-sized specimens (e.g. 4000b and 8000b) than in larger specimens (e.g. 16 000b), according to the weakest-link concept.","lang":"eng"}],"issue":"3","article_number":"035001","type":"journal_article"},{"intvolume":" 11","ddc":["570"],"status":"public","title":"An exploration of the universe of polyglutamine structures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1566","file":[{"file_id":"5207","relation":"main_file","checksum":"8b67d729be663bfc9af04bfd94459655","date_created":"2018-12-12T10:16:21Z","date_updated":"2020-07-14T12:45:02Z","access_level":"open_access","file_name":"IST-2016-478-v1+1_journal.pcbi.1004541.pdf","creator":"system","content_type":"application/pdf","file_size":1412511}],"oa_version":"Published Version","pubrep_id":"478","type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"Deposits of misfolded proteins in the human brain are associated with the development of many neurodegenerative diseases. Recent studies show that these proteins have common traits even at the monomer level. Among them, a polyglutamine region that is present in huntingtin is known to exhibit a correlation between the length of the chain and the severity as well as the earliness of the onset of Huntington disease. Here, we apply bias exchange molecular dynamics to generate structures of polyglutamine expansions of several lengths and characterize the resulting independent conformations. We compare the properties of these conformations to those of the standard proteins, as well as to other homopolymeric tracts. We find that, similar to the previously studied polyvaline chains, the set of possible transient folds is much broader than the set of known-to-date folds, although the conformations have different structures. We show that the mechanical stability is not related to any simple geometrical characteristics of the structures. We demonstrate that long polyglutamine expansions result in higher mechanical stability than the shorter ones. They also have a longer life span and are substantially more prone to form knotted structures. The knotted region has an average length of 35 residues, similar to the typical threshold for most polyglutamine-related diseases. Similarly, changes in shape and mechanical stability appear once the total length of the peptide exceeds this threshold of 35 glutamine residues. We suggest that knotted conformers may also harm the cellular machinery and thus lead to disease."}],"citation":{"ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures. PLoS Computational Biology. 2015;11(10). doi:10.1371/journal.pcbi.1004541","ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures. PLoS Computational Biology. 11(10), e1004541.","apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., & Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004541","ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures,” PLoS Computational Biology, vol. 11, no. 10. Public Library of Science, 2015.","mla":"Gómez Sicilia, Àngel, et al. “An Exploration of the Universe of Polyglutamine Structures.” PLoS Computational Biology, vol. 11, no. 10, e1004541, Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004541.","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, PLoS Computational Biology 11 (2015).","chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures.” PLoS Computational Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004541."},"publication":"PLoS Computational Biology","date_published":"2015-10-23T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"23","publisher":"Public Library of Science","department":[{"_id":"CaHe"}],"publication_status":"published","acknowledgement":"We acknowledge the support by the EU Joint Programme in Neurodegenerative Diseases (JPND AC14/00037) project. The project is supported through the following funding organisations under the aegis of JPND—www.jpnd.eu: Ireland, HRB; Poland, National Science Centre; and Spain, ISCIII. ","year":"2015","volume":11,"date_updated":"2023-02-23T14:05:55Z","date_created":"2018-12-11T11:52:45Z","related_material":{"record":[{"status":"public","relation":"research_data","id":"9714"}]},"author":[{"first_name":"Àngel","last_name":"Gómez Sicilia","full_name":"Gómez Sicilia, Àngel"},{"first_name":"Mateusz K","last_name":"Sikora","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","full_name":"Sikora, Mateusz K"},{"full_name":"Cieplak, Marek","first_name":"Marek","last_name":"Cieplak"},{"last_name":"Carrión Vázquez","first_name":"Mariano","full_name":"Carrión Vázquez, Mariano"}],"article_number":"e1004541","publist_id":"5605","file_date_updated":"2020-07-14T12:45:02Z","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1004541","month":"10"},{"day":"06","month":"11","article_processing_charge":"No","date_published":"2015-11-06T00:00:00Z","doi":"10.1371/journal.pgen.1005639.s001","citation":{"short":"M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, (2015).","mla":"Tugrul, Murat, et al. Other Fitness Models for Comparison & for Interacting TFBSs. Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.s001.","chicago":"Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Other Fitness Models for Comparison & for Interacting TFBSs.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.s001.","ama":"Tugrul M, Paixao T, Barton NH, Tkačik G. Other fitness models for comparison & for interacting TFBSs. 2015. doi:10.1371/journal.pgen.1005639.s001","ieee":"M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Other fitness models for comparison & for interacting TFBSs.” Public Library of Science, 2015.","apa":"Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Other fitness models for comparison & for interacting TFBSs. Public Library of Science. https://doi.org/10.1371/journal.pgen.1005639.s001","ista":"Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Other fitness models for comparison & for interacting TFBSs, Public Library of Science, 10.1371/journal.pgen.1005639.s001."},"type":"research_data_reference","author":[{"id":"37C323C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8523-0758","first_name":"Murat","last_name":"Tugrul","full_name":"Tugrul, Murat"},{"last_name":"Paixao","first_name":"Tiago","orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"}],"related_material":{"record":[{"id":"1666","status":"public","relation":"used_in_publication"}]},"date_created":"2021-07-23T12:00:37Z","date_updated":"2023-02-23T10:09:08Z","oa_version":"Published Version","_id":"9712","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2015","status":"public","title":"Other fitness models for comparison & for interacting TFBSs","department":[{"_id":"NiBa"},{"_id":"CaGu"},{"_id":"GaTk"}],"publisher":"Public Library of Science"},{"year":"2015","_id":"9714","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publisher":"Public Library of Science ","department":[{"_id":"CaHe"}],"title":"An exploration of the universe of polyglutamine structures - submission to PLOS journals","status":"public","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1566"}]},"author":[{"last_name":"Gómez Sicilia","first_name":"Àngel","full_name":"Gómez Sicilia, Àngel"},{"full_name":"Sikora, Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","first_name":"Mateusz K","last_name":"Sikora"},{"last_name":"Cieplak","first_name":"Marek","full_name":"Cieplak, Marek"},{"full_name":"Carrión Vázquez, Mariano","first_name":"Mariano","last_name":"Carrión Vázquez"}],"oa_version":"Published Version","date_created":"2021-07-23T12:05:28Z","date_updated":"2023-02-23T10:04:35Z","type":"research_data_reference","citation":{"mla":"Gómez Sicilia, Àngel, et al. An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals. Public Library of Science , 2015, doi:10.1371/journal.pcbi.1004541.s001.","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015).","chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals.” Public Library of Science , 2015. https://doi.org/10.1371/journal.pcbi.1004541.s001.","ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures - submission to PLOS journals. 2015. doi:10.1371/journal.pcbi.1004541.s001","ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures - submission to PLOS journals, Public Library of Science , 10.1371/journal.pcbi.1004541.s001.","apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., & Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures - submission to PLOS journals. Public Library of Science . https://doi.org/10.1371/journal.pcbi.1004541.s001","ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures - submission to PLOS journals.” Public Library of Science , 2015."},"date_published":"2015-10-23T00:00:00Z","doi":"10.1371/journal.pcbi.1004541.s001","article_processing_charge":"No","month":"10","day":"23"},{"date_published":"2015-05-18T00:00:00Z","doi":"10.1371/journal.pone.0126907.s001","citation":{"chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Mathematical Inference of the Results.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s001.","short":"B. Trubenova, S. Novak, R. Hager, (2015).","mla":"Trubenova, Barbora, et al. Mathematical Inference of the Results. Public Library of Science, 2015, doi:10.1371/journal.pone.0126907.s001.","apa":"Trubenova, B., Novak, S., & Hager, R. (2015). Mathematical inference of the results. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s001","ieee":"B. Trubenova, S. Novak, and R. Hager, “Mathematical inference of the results.” Public Library of Science, 2015.","ista":"Trubenova B, Novak S, Hager R. 2015. Mathematical inference of the results, Public Library of Science, 10.1371/journal.pone.0126907.s001.","ama":"Trubenova B, Novak S, Hager R. Mathematical inference of the results. 2015. doi:10.1371/journal.pone.0126907.s001"},"day":"18","month":"05","article_processing_charge":"No","date_updated":"2023-02-23T10:15:25Z","date_created":"2021-07-23T12:11:30Z","oa_version":"Published Version","author":[{"full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967","id":"42302D54-F248-11E8-B48F-1D18A9856A87","last_name":"Trubenova","first_name":"Barbora"},{"full_name":"Novak, Sebastian","first_name":"Sebastian","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hager","first_name":"Reinmar","full_name":"Hager, Reinmar"}],"related_material":{"record":[{"id":"1809","status":"public","relation":"used_in_publication"}]},"status":"public","title":"Mathematical inference of the results","publisher":"Public Library of Science","department":[{"_id":"NiBa"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9715","year":"2015","type":"research_data_reference"}]