[{"extern":"1","_id":"383","year":"2016","volume":4,"doi":"https://doi.org/10.1063/1.4961679","oa_version":"None","publist_id":"7446","date_created":"2018-12-11T11:46:09Z","date_updated":"2021-01-12T07:52:30Z","intvolume":"         4","status":"public","author":[{"orcid":"0000-0001-7313-6740","full_name":"Liu, Yu","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"orcid":"0000-0001-5013-2843","last_name":"Ibanez Sabate","full_name":"Ibanez Sabate, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"last_name":"Ortega","full_name":"Ortega, Silvia","first_name":"Silvia"},{"first_name":"Sara","last_name":"Márti Sánchez","full_name":"Márti Sánchez, Sara"},{"last_name":"Dobrozhan","full_name":"Dobrozhan, Oleksander","first_name":"Oleksander"},{"last_name":"Kovalenko","full_name":"Kovalenko, Maksym","first_name":"Maksym"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"month":"08","citation":{"ama":"Liu Y, Cadavid D, Ibáñez M, et al. Thermoelectric properties of semiconductor-metal composites produced by particle blending. <i>Applied Physics Letters</i>. 2016;4. doi:<a href=\"https://doi.org/10.1063/1.4961679\">https://doi.org/10.1063/1.4961679</a>","apa":"Liu, Y., Cadavid, D., Ibáñez, M., Ortega, S., Márti Sánchez, S., Dobrozhan, O., … Cabot, A. (2016). Thermoelectric properties of semiconductor-metal composites produced by particle blending. <i>Applied Physics Letters</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4961679\">https://doi.org/10.1063/1.4961679</a>","ista":"Liu Y, Cadavid D, Ibáñez M, Ortega S, Márti Sánchez S, Dobrozhan O, Kovalenko M, Arbiol J, Cabot A. 2016. Thermoelectric properties of semiconductor-metal composites produced by particle blending. Applied Physics Letters. 4.","chicago":"Liu, Yu, Doris Cadavid, Maria Ibáñez, Silvia Ortega, Sara Márti Sánchez, Oleksander Dobrozhan, Maksym Kovalenko, Jordi Arbiol, and Andreu Cabot. “Thermoelectric Properties of Semiconductor-Metal Composites Produced by Particle Blending.” <i>Applied Physics Letters</i>. American Institute of Physics, 2016. <a href=\"https://doi.org/10.1063/1.4961679\">https://doi.org/10.1063/1.4961679</a>.","mla":"Liu, Yu, et al. “Thermoelectric Properties of Semiconductor-Metal Composites Produced by Particle Blending.” <i>Applied Physics Letters</i>, vol. 4, American Institute of Physics, 2016, doi:<a href=\"https://doi.org/10.1063/1.4961679\">https://doi.org/10.1063/1.4961679</a>.","short":"Y. Liu, D. Cadavid, M. Ibáñez, S. Ortega, S. Márti Sánchez, O. Dobrozhan, M. Kovalenko, J. Arbiol, A. Cabot, Applied Physics Letters 4 (2016).","ieee":"Y. Liu <i>et al.</i>, “Thermoelectric properties of semiconductor-metal composites produced by particle blending,” <i>Applied Physics Letters</i>, vol. 4. American Institute of Physics, 2016."},"type":"journal_article","publication_status":"published","publisher":"American Institute of Physics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In the quest for more efficient thermoelectric material able to convert thermal to electrical energy and vice versa, composites that combine a semiconductor host having a large Seebeck coefficient with metal nanodomains that provide phonon scattering and free charge carriers are particularly appealing. Here, we present our experimental results on the thermal and electrical transport properties of PbS-metal composites produced by a versatile particle blending procedure, and where the metal work function allows injecting electrons to the intrinsic PbS host. We compare the thermoelectric performance of composites with microcrystalline or nanocrystalline structures. The electrical conductivity of the microcrystalline host can be increased several orders of magnitude with the metal inclusion, while relatively high Seebeck coefficient can be simultaneously conserved. On the other hand, in nanostructured materials, the host crystallites are not able to sustain a band bending at its interface with the metal, becoming flooded with electrons. This translates into even higher electrical conductivities than the microcrystalline material, but at the expense of lower Seebeck coefficient values."}],"day":"29","date_published":"2016-08-29T00:00:00Z","title":"Thermoelectric properties of semiconductor-metal composites produced by particle blending","language":[{"iso":"eng"}],"publication":"Applied Physics Letters"},{"intvolume":"        12","status":"public","oa_version":"None","publist_id":"7440","date_updated":"2021-01-12T07:52:59Z","date_created":"2018-12-11T11:46:11Z","citation":{"apa":"Mahmood, F., Chan, C., Alpichshev, Z., Gardner, D., Lee, Y., Lee, P., &#38; Gedik, N. (2016). Selective scattering between Floquet Bloch and Volkov states in a topological insulator. <i>Nature Physics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nphys3609\">https://doi.org/10.1038/nphys3609</a>","ama":"Mahmood F, Chan C, Alpichshev Z, et al. Selective scattering between Floquet Bloch and Volkov states in a topological insulator. <i>Nature Physics</i>. 2016;12(4):306-310. doi:<a href=\"https://doi.org/10.1038/nphys3609\">10.1038/nphys3609</a>","ista":"Mahmood F, Chan C, Alpichshev Z, Gardner D, Lee Y, Lee P, Gedik N. 2016. Selective scattering between Floquet Bloch and Volkov states in a topological insulator. Nature Physics. 12(4), 306–310.","chicago":"Mahmood, Fahad, Ching Chan, Zhanybek Alpichshev, Dillon Gardner, Young Lee, Patrick Lee, and Nuh Gedik. “Selective Scattering between Floquet Bloch and Volkov States in a Topological Insulator.” <i>Nature Physics</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nphys3609\">https://doi.org/10.1038/nphys3609</a>.","ieee":"F. Mahmood <i>et al.</i>, “Selective scattering between Floquet Bloch and Volkov states in a topological insulator,” <i>Nature Physics</i>, vol. 12, no. 4. Nature Publishing Group, pp. 306–310, 2016.","short":"F. Mahmood, C. Chan, Z. Alpichshev, D. Gardner, Y. Lee, P. Lee, N. Gedik, Nature Physics 12 (2016) 306–310.","mla":"Mahmood, Fahad, et al. “Selective Scattering between Floquet Bloch and Volkov States in a Topological Insulator.” <i>Nature Physics</i>, vol. 12, no. 4, Nature Publishing Group, 2016, pp. 306–10, doi:<a href=\"https://doi.org/10.1038/nphys3609\">10.1038/nphys3609</a>."},"acknowledgement":"The authors would like to thank C. Lee for useful discussions. This work is supported by US Department of Energy (DOE), Basic Energy Sciences, Division of Materials Sciences and Engineering (experimental set-up, data acquisition and theory), Army Research Office (electron spectrometer) and by the Gordon and Betty Moore Foundation’s EPiQS Initiative through Grant GBMF4540 (data analysis).","author":[{"last_name":"Mahmood","full_name":"Mahmood, Fahad","first_name":"Fahad"},{"full_name":"Chan, Ching","last_name":"Chan","first_name":"Ching"},{"first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev"},{"last_name":"Gardner","full_name":"Gardner, Dillon","first_name":"Dillon"},{"last_name":"Lee","full_name":"Lee, Young","first_name":"Young"},{"last_name":"Lee","full_name":"Lee, Patrick","first_name":"Patrick"},{"last_name":"Gedik","full_name":"Gedik, Nuh","first_name":"Nuh"}],"month":"04","page":"306 - 310","extern":"1","_id":"389","year":"2016","issue":"4","doi":"10.1038/nphys3609","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.05714"}],"volume":12,"language":[{"iso":"eng"}],"publication":"Nature Physics","day":"01","title":"Selective scattering between Floquet Bloch and Volkov states in a topological insulator","date_published":"2016-04-01T00:00:00Z","oa":1,"publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The coherent optical manipulation of solids is emerging as a promising way to engineer novel quantum states of matter. The strong time-periodic potential of intense laser light can be used to generate hybrid photon-electron states. Interaction of light with Bloch states leads to Floquet-Bloch states, which are essential in realizing new photo-induced quantum phases. Similarly, dressing of free-electron states near the surface of a solid generates Volkov states, which are used to study nonlinear optics in atoms and semiconductors. The interaction of these two dynamic states with each other remains an open experimental problem. Here we use time- and angle-resolved photoemission spectroscopy (Tr-ARPES) to selectively study the transition between these two states on the surface of the topological insulator Bi2Se3. We find that the coupling between the two strongly depends on the electron momentum, providing a route to enhance or inhibit it. Moreover, by controlling the light polarization we can negate Volkov states to generate pure Floquet-Bloch states. This work establishes a systematic path for the coherent manipulation of solids via light-matter interaction.","lang":"eng"}],"publication_status":"published","type":"journal_article"},{"date_updated":"2021-01-12T07:53:03Z","date_created":"2018-12-11T11:46:12Z","publist_id":"7439","oa_version":"None","status":"public","intvolume":"         6","month":"04","author":[{"first_name":"James","full_name":"Hinton, James","last_name":"Hinton"},{"full_name":"Thewalt, E","last_name":"Thewalt","first_name":"E"},{"first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev"},{"last_name":"Mahmood","full_name":"Mahmood, Fahad","first_name":"Fahad"},{"first_name":"Jake","full_name":"Koralek, Jake","last_name":"Koralek"},{"last_name":"Chan","full_name":"Chan, Mun","first_name":"Mun"},{"full_name":"Veit, Michael","last_name":"Veit","first_name":"Michael"},{"first_name":"Chelsey","last_name":"Dorow","full_name":"Dorow, Chelsey"},{"last_name":"Barišić","full_name":"Barišić, Neven","first_name":"Neven"},{"last_name":"Kemper","full_name":"Kemper, Alexander","first_name":"Alexander"},{"full_name":"Bonn, Doug","last_name":"Bonn","first_name":"Doug"},{"last_name":"Hardy","full_name":"Hardy, Walter","first_name":"Walter"},{"first_name":"Ruixing","last_name":"Liang","full_name":"Liang, Ruixing"},{"full_name":"Gedik, Nuh","last_name":"Gedik","first_name":"Nuh"},{"last_name":"Greven","full_name":"Greven, Martin","first_name":"Martin"},{"first_name":"Alessandra","full_name":"Lanzara, Alessandra","last_name":"Lanzara"},{"full_name":"Orenstein, Joseph","last_name":"Orenstein","first_name":"Joseph"}],"citation":{"chicago":"Hinton, James, E Thewalt, Zhanybek Alpichshev, Fahad Mahmood, Jake Koralek, Mun Chan, Michael Veit, et al. “The Rate of Quasiparticle Recombination Probes the Onset of Coherence in Cuprate Superconductors.” <i>Scientific Reports</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/srep23610\">https://doi.org/10.1038/srep23610</a>.","mla":"Hinton, James, et al. “The Rate of Quasiparticle Recombination Probes the Onset of Coherence in Cuprate Superconductors.” <i>Scientific Reports</i>, vol. 6, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/srep23610\">10.1038/srep23610</a>.","short":"J. Hinton, E. Thewalt, Z. Alpichshev, F. Mahmood, J. Koralek, M. Chan, M. Veit, C. Dorow, N. Barišić, A. Kemper, D. Bonn, W. Hardy, R. Liang, N. Gedik, M. Greven, A. Lanzara, J. Orenstein, Scientific Reports 6 (2016).","ieee":"J. Hinton <i>et al.</i>, “The rate of quasiparticle recombination probes the onset of coherence in cuprate superconductors,” <i>Scientific Reports</i>, vol. 6. Nature Publishing Group, 2016.","ama":"Hinton J, Thewalt E, Alpichshev Z, et al. The rate of quasiparticle recombination probes the onset of coherence in cuprate superconductors. <i>Scientific Reports</i>. 2016;6. doi:<a href=\"https://doi.org/10.1038/srep23610\">10.1038/srep23610</a>","apa":"Hinton, J., Thewalt, E., Alpichshev, Z., Mahmood, F., Koralek, J., Chan, M., … Orenstein, J. (2016). The rate of quasiparticle recombination probes the onset of coherence in cuprate superconductors. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep23610\">https://doi.org/10.1038/srep23610</a>","ista":"Hinton J, Thewalt E, Alpichshev Z, Mahmood F, Koralek J, Chan M, Veit M, Dorow C, Barišić N, Kemper A, Bonn D, Hardy W, Liang R, Gedik N, Greven M, Lanzara A, Orenstein J. 2016. The rate of quasiparticle recombination probes the onset of coherence in cuprate superconductors. Scientific Reports. 6."},"_id":"390","year":"2016","extern":"1","volume":6,"doi":"10.1038/srep23610","title":"The rate of quasiparticle recombination probes the onset of coherence in cuprate superconductors","date_published":"2016-04-13T00:00:00Z","day":"13","language":[{"iso":"eng"}],"publication":"Scientific Reports","type":"journal_article","publication_status":"published","abstract":[{"lang":"eng","text":"In the underdoped copper-oxides, high-temperature superconductivity condenses from a nonconventional metallic &quot;pseudogap&quot; phase that exhibits a variety of non-Fermi liquid properties. Recently, it has become clear that a charge density wave (CDW) phase exists within the pseudogap regime. This CDW coexists and competes with superconductivity (SC) below the transition temperature Tc, suggesting that these two orders are intimately related. Here we show that the condensation of the superfluid from this unconventional precursor is reflected in deviations from the predictions of BSC theory regarding the recombination rate of quasiparticles. We report a detailed investigation of the quasiparticle (QP) recombination lifetime, τqp, as a function of temperature and magnetic field in underdoped HgBa2CuO4+δ (Hg-1201) and YBa2Cu3O6+x (YBCO) single crystals by ultrafast time-resolved reflectivity. We find that τqp (T) exhibits a local maximum in a small temperature window near Tc that is prominent in underdoped samples with coexisting charge order and vanishes with application of a small magnetic field. We explain this unusual, non-BCS behavior by positing that Tc marks a transition from phase-fluctuating SC/CDW composite order above to a SC/CDW condensate below. Our results suggest that the superfluid in underdoped cuprates is a condensate of coherently-mixed particle-particle and particle-hole pairs."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Nature Publishing Group"},{"issue":"9","extern":1,"_id":"460","year":"2016","volume":15,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5295629/"}],"doi":"10.1021/acs.jproteome.5b01004","publist_id":"7361","date_updated":"2021-01-12T08:00:24Z","date_created":"2018-12-11T11:46:36Z","intvolume":"        15","status":"public","author":[{"first_name":"Katharina","full_name":"Willmann, Katharina L","last_name":"Willmann"},{"full_name":"Roberto Sacco","last_name":"Sacco","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","first_name":"Roberto"},{"full_name":"Martins, Rui","last_name":"Martins","first_name":"Rui"},{"first_name":"Wojciech","full_name":"Garncarz, Wojciech","last_name":"Garncarz"},{"first_name":"Ana","full_name":"Krolo, Ana","last_name":"Krolo"},{"first_name":"Sylvia","full_name":"Knapp, Sylvia","last_name":"Knapp"},{"first_name":"Keiryn","full_name":"Bennett, Keiryn L","last_name":"Bennett"},{"first_name":"Kaan","last_name":"Boztug","full_name":"Boztug, Kaan"}],"month":"07","page":"2900 - 2909","citation":{"chicago":"Willmann, Katharina, Roberto Sacco, Rui Martins, Wojciech Garncarz, Ana Krolo, Sylvia Knapp, Keiryn Bennett, and Kaan Boztug. “Expanding the Interactome of the Noncanonical NF-ΚB Signaling Pathway.” <i>Journal of Proteome Research</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">https://doi.org/10.1021/acs.jproteome.5b01004</a>.","short":"K. Willmann, R. Sacco, R. Martins, W. Garncarz, A. Krolo, S. Knapp, K. Bennett, K. Boztug, Journal of Proteome Research 15 (2016) 2900–2909.","mla":"Willmann, Katharina, et al. “Expanding the Interactome of the Noncanonical NF-ΚB Signaling Pathway.” <i>Journal of Proteome Research</i>, vol. 15, no. 9, American Chemical Society, 2016, pp. 2900–09, doi:<a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">10.1021/acs.jproteome.5b01004</a>.","ieee":"K. Willmann <i>et al.</i>, “Expanding the interactome of the noncanonical NF-κB signaling pathway,” <i>Journal of Proteome Research</i>, vol. 15, no. 9. American Chemical Society, pp. 2900–2909, 2016.","ama":"Willmann K, Sacco R, Martins R, et al. Expanding the interactome of the noncanonical NF-κB signaling pathway. <i>Journal of Proteome Research</i>. 2016;15(9):2900-2909. doi:<a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">10.1021/acs.jproteome.5b01004</a>","apa":"Willmann, K., Sacco, R., Martins, R., Garncarz, W., Krolo, A., Knapp, S., … Boztug, K. (2016). Expanding the interactome of the noncanonical NF-κB signaling pathway. <i>Journal of Proteome Research</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.jproteome.5b01004\">https://doi.org/10.1021/acs.jproteome.5b01004</a>","ista":"Willmann K, Sacco R, Martins R, Garncarz W, Krolo A, Knapp S, Bennett K, Boztug K. 2016. Expanding the interactome of the noncanonical NF-κB signaling pathway. Journal of Proteome Research. 15(9), 2900–2909."},"acknowledgement":"Austrian Science Fund (FWF) Lise Meitner Program Fellowship (FWF M-1809, to K.L.W.),  FWF Infect-ERA framework (I-1620_B22, to S.K.), European Research Council (ERC StG 310857, to K.B.)\nWe thank Jacques Colinge, André C. Müller, and Peter Májek for fruitful discussions and Elisabeth Salzer and Kate G. Ackermann for critically reading the manuscript. We thank Giulio Superti-Furga for providing pTO-SII-HA-GW plasmids. \n\n","publication_status":"published","quality_controlled":0,"type":"journal_article","publisher":"American Chemical Society","abstract":[{"lang":"eng","text":"NF-κB signaling is a central pathway of immunity and integrates signal transduction upon a wide array of inflammatory stimuli. Noncanonical NF-κB signaling is activated by a small subset of TNF family receptors and characterized by NF-κB2/p52 transcriptional activity. The medical relevance of this pathway has recently re-emerged from the discovery of primary immunodeficiency patients that have loss-of-function mutations in the MAP3K14 gene encoding NIK. Nevertheless, knowledge of protein interactions that regulate noncanonical NF-κB signaling is sparse. Here we report a detailed state-of-the-art mass spectrometry-based protein–protein interaction network including the noncanonical NF-κB signaling nodes TRAF2, TRAF3, IKKα, NIK, and NF-κB2/p100. The value of the data set was confirmed by the identification of interactions already known to regulate this pathway. In addition, a remarkable number of novel interactors were identified. We provide validation of the novel NIK and IKKα interactor FKBP8, which may regulate processes downstream of noncanonical NF-κB signaling. To understand perturbed noncanonical NF-κB signaling in the context of misregulated NIK in disease, we also provide a differential interactome of NIK mutants that cause immunodeficiency. Altogether, this data set not only provides critical insight into how protein–protein interactions can regulate immune signaling but also offers a novel resource on noncanonical NF-κB signaling."}],"day":"15","title":"Expanding the interactome of the noncanonical NF-κB signaling pathway","date_published":"2016-07-15T00:00:00Z","publication":"Journal of Proteome Research","oa":1},{"language":[{"iso":"eng"}],"oa":1,"ddc":["004"],"abstract":[{"text":"Magic: the Gathering is a game about magical combat for any number of players. Formally it is a zero-sum, imperfect information stochastic game that consists of a potentially unbounded number of steps. We consider the problem of deciding if a move is legal in a given single step of Magic. We show that the problem is (a) coNP-complete in general; and (b) in P if either of two small sets of cards are not used. Our lower bound holds even for single-player Magic games. The significant aspects of our results are as follows: First, in most real-life game problems, the task of deciding whether a given move is legal in a single step is trivial, and the computationally hard task is to find the best sequence of legal moves in the presence of multiple players. In contrast, quite uniquely our hardness result holds for single step and with only one-player. Second, we establish efficient algorithms for important special cases of Magic.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:35Z","status":"public","oa_version":"Published Version","page":"1432 - 1439","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"year":"2016","pubrep_id":"950","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"title":"The complexity of deciding legality of a single step of magic: The gathering","date_published":"2016-01-01T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","day":"01","publisher":"IOS Press","publication_status":"published","scopus_import":1,"type":"conference","quality_controlled":"1","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"has_accepted_license":"1","intvolume":"       285","date_created":"2018-12-11T11:46:41Z","date_updated":"2021-01-12T08:00:54Z","publist_id":"7342","department":[{"_id":"KrCh"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">10.3233/978-1-61499-672-9-1432</a>","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">https://doi.org/10.3233/978-1-61499-672-9-1432</a>","ista":"Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">https://doi.org/10.3233/978-1-61499-672-9-1432</a>.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Deciding Legality of a Single Step of Magic: The Gathering</i>. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">10.3233/978-1-61499-672-9-1432</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439."},"month":"01","_id":"478","conference":{"name":"ECAI: European Conference on Artificial Intelligence","end_date":"2016-09-02","location":"The Hague, Netherlands","start_date":"2016-08-29"},"doi":"10.3233/978-1-61499-672-9-1432","volume":285,"file":[{"file_name":"IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf","file_size":2116225,"creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","relation":"main_file","date_created":"2018-12-12T10:07:59Z","access_level":"open_access","file_id":"4658","checksum":"848043c812ace05e459579c923f3d3cf"}]},{"status":"public","oa_version":"None","department":[{"_id":"ToHe"}],"publist_id":"7341","date_created":"2018-12-11T11:46:42Z","date_updated":"2021-01-12T08:00:55Z","citation":{"ieee":"Y. Jiang <i>et al.</i>, “Use runtime verification to improve the quality of medical care practice,” in <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, Austin, TX, USA, 2016, pp. 112–121.","short":"Y. Jiang, H. Liu, H. Kong, R. Wang, M. Hosseini, J. Sun, L. Sha, in:, Proceedings of the 38th International Conference on Software Engineering Companion , IEEE, 2016, pp. 112–121.","mla":"Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical Care Practice.” <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, IEEE, 2016, pp. 112–21, doi:<a href=\"https://doi.org/10.1145/2889160.2889233\">10.1145/2889160.2889233</a>.","chicago":"Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun, and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care Practice.” In <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, 112–21. IEEE, 2016. <a href=\"https://doi.org/10.1145/2889160.2889233\">https://doi.org/10.1145/2889160.2889233</a>.","ista":"Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime verification to improve the quality of medical care practice. Proceedings of the 38th International Conference on Software Engineering Companion . ICSE: International Conference on Software Engineering, Proceedings International Conference on Software Engineering, , 112–121.","apa":"Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., &#38; Sha, L. (2016). Use runtime verification to improve the quality of medical care practice. In <i>Proceedings of the 38th International Conference on Software Engineering Companion </i> (pp. 112–121). Austin, TX, USA: IEEE. <a href=\"https://doi.org/10.1145/2889160.2889233\">https://doi.org/10.1145/2889160.2889233</a>","ama":"Jiang Y, Liu H, Kong H, et al. Use runtime verification to improve the quality of medical care practice. In: <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>. IEEE; 2016:112-121. doi:<a href=\"https://doi.org/10.1145/2889160.2889233\">10.1145/2889160.2889233</a>"},"acknowledgement":"This work is supported by NSF CNS 13-30077, NSF CNS 13-29886, NSF CNS 15-45002, and NSFC 61303014.\r\nThe authors thank Dr.  Bobby and Dr.  Hill at Carle Hospital, Urbana, IL for their help with the discussion on medical  knowledge.\r\n\r\n","author":[{"full_name":"Jiang, Yu","last_name":"Jiang","first_name":"Yu"},{"full_name":"Liu, Han","last_name":"Liu","first_name":"Han"},{"orcid":"0000-0002-3066-6941","last_name":"Kong","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui"},{"first_name":"Rui","last_name":"Wang","full_name":"Wang, Rui"},{"full_name":"Hosseini, Mohamad","last_name":"Hosseini","first_name":"Mohamad"},{"full_name":"Sun, Jiaguang","last_name":"Sun","first_name":"Jiaguang"},{"first_name":"Lui","full_name":"Sha, Lui","last_name":"Sha"}],"month":"05","page":"112 - 121","conference":{"start_date":"2016-05-14","location":"Austin, TX, USA","name":"ICSE: International Conference on Software Engineering","end_date":"2016-05-22"},"_id":"479","year":"2016","doi":"10.1145/2889160.2889233","publication":"Proceedings of the 38th International Conference on Software Engineering Companion ","language":[{"iso":"eng"}],"day":"14","date_published":"2016-05-14T00:00:00Z","title":"Use runtime verification to improve the quality of medical care practice","publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Clinical guidelines and decision support systems (DSS) play an important role in daily practices of medicine. Many text-based guidelines have been encoded for work-flow simulation of DSS to automate health care. During the collaboration with Carle hospital to develop a DSS, we identify that, for some complex and life-critical diseases, it is highly desirable to automatically rigorously verify some complex temporal properties in guidelines, which brings new challenges to current simulation based DSS with limited support of automatical formal verification and real-time data analysis. In this paper, we conduct the first study on applying runtime verification to cooperate with current DSS based on real-time data. Within the proposed technique, a user-friendly domain specific language, named DRTV, is designed to specify vital real-time data sampled by medical devices and temporal properties originated from clinical guidelines. Some interfaces are developed for data acquisition and communication. Then, for medical practice scenarios described in DRTV model, we will automatically generate event sequences and runtime property verifier automata. If a temporal property violates, real-time warnings will be produced by the formal verifier and passed to medical DSS. We have used DRTV to specify different kinds of medical care scenarios, and applied the proposed technique to assist existing DSS. As presented in experiment results, in terms of warning detection, it outperforms the only use of DSS or human inspection, and improves the quality of clinical health care of hospital"}],"scopus_import":1,"type":"conference","quality_controlled":"1","publication_status":"published","alternative_title":["Proceedings International Conference on Software Engineering"]},{"oa_version":"Preprint","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"page":"247 - 256","year":"2016","ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is 1. Previous results presented a semi-decision procedure for -approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements."}],"publist_id":"7340","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:46:42Z","date_updated":"2021-01-12T08:00:56Z","month":"07","citation":{"ieee":"K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives</i>. Vol. 05-08-July-2016, IEEE, 2016, pp. 247–56, doi:<a href=\"https://doi.org/10.1145/2933575.2934513\">10.1145/2933575.2934513</a>.","short":"K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2934513\">https://doi.org/10.1145/2933575.2934513</a>.","ista":"Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.","apa":"Chatterjee, K., &#38; Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2934513\">https://doi.org/10.1145/2933575.2934513</a>","ama":"Chatterjee K, Doyen L. Perfect-information stochastic games with generalized mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:<a href=\"https://doi.org/10.1145/2933575.2934513\">10.1145/2933575.2934513</a>"},"conference":{"location":"New York, NY, USA","start_date":"2016-07-05","name":"LICS: Logic in Computer Science","end_date":"2016-07-08"},"_id":"480","volume":"05-08-July-2016","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06376"}],"doi":"10.1145/2933575.2934513","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"day":"05","title":"Perfect-information stochastic games with generalized mean-payoff objectives","date_published":"2016-07-05T00:00:00Z","scopus_import":1,"publication_status":"published","quality_controlled":"1","type":"conference","publisher":"IEEE","alternative_title":["Proceedings Symposium on Logic in Computer Science"]},{"type":"conference","scopus_import":"1","publication_status":"published","quality_controlled":"1","article_processing_charge":"No","abstract":[{"text":"Nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band is achieved within a crystalline whispering gallery mode resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.","lang":"eng"}],"publisher":"Optica Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["Optics InfoBase Conference Papers"],"date_published":"2016-08-29T00:00:00Z","title":"Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator","day":"29","language":[{"iso":"eng"}],"year":"2016","_id":"482","conference":{"end_date":"2016-09-08","name":"NP: Nonlinear Photonics","start_date":"2016-09-05","location":"Sydney, Australia"},"doi":"10.1364/NP.2016.NTh3A.6","date_created":"2018-12-11T11:46:43Z","date_updated":"2023-10-17T12:16:43Z","oa_version":"None","publist_id":"7339","department":[{"_id":"JoFi"}],"status":"public","month":"08","author":[{"full_name":"Rueda, Alfredo","last_name":"Rueda","first_name":"Alfredo"},{"last_name":"Sedlmeir","full_name":"Sedlmeir, Florian","first_name":"Florian"},{"full_name":"Collodo, Michele","last_name":"Collodo","first_name":"Michele"},{"first_name":"Ulrich","full_name":"Vogl, Ulrich","last_name":"Vogl"},{"last_name":"Stiller","full_name":"Stiller, Birgit","first_name":"Birgit"},{"last_name":"Schunk","full_name":"Schunk, Gerhard","first_name":"Gerhard"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"last_name":"Marquardt","full_name":"Marquardt, Christoph","first_name":"Christoph"},{"full_name":"Fink, Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M"},{"full_name":"Painter, Oskar","last_name":"Painter","first_name":"Oskar"},{"first_name":"Gerd","last_name":"Leuchs","full_name":"Leuchs, Gerd"},{"first_name":"Harald","full_name":"Schwefel, Harald","last_name":"Schwefel"}],"citation":{"chicago":"Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing Group, 2016. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>.","ieee":"A. Rueda <i>et al.</i>, “Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics, Sydney, Australia, 2016.","mla":"Rueda, Alfredo, et al. <i>Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator</i>. Optica Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>.","short":"A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing Group, 2016.","apa":"Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics, Sydney, Australia: Optica Publishing Group. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>","ama":"Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing Group; 2016. doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>","ista":"Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. NP: Nonlinear Photonics, Optics InfoBase Conference Papers, ."}},{"oa":1,"language":[{"iso":"eng"}],"article_number":"e1191734","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted signaling peptides that are primarily involved in the regulation of stem cell homeostasis in different plant meristems. Particularly, the characterization of the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on the potential roles of CLE peptides in vascular development and wood formation. Nevertheless, our knowledge on this gene family in a tree species is limited. In a recent study, we reported on a systematically investigation of the CLE gene family in Populus trichocarpa . The potential roles of PtCLE genes were studied by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members, many PtCLE proteins share identical CLE motifs or contain the same CLE motif as that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression patterns comparing to their Arabidopsis counterparts. These fi ndings indicate the existence of both functional conservation and functional divergence between PtCLEs and their AtCLE orthologues. Our results provide valuable resources for future functional investigations of these critical signaling molecules in woody plants. "}],"author":[{"full_name":"Liu, Zhijun","last_name":"Liu","first_name":"Zhijun"},{"first_name":"Nan","full_name":"Yang, Nan","last_name":"Yang"},{"first_name":"Yanting","full_name":"Lv, Yanting","last_name":"Lv"},{"full_name":"Pan, Lixia","last_name":"Pan","first_name":"Lixia"},{"full_name":"Lv, Shuo","last_name":"Lv","first_name":"Shuo"},{"last_name":"Han","full_name":"Han, Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","first_name":"Huibin"},{"first_name":"Guodong","full_name":"Wang, Guodong","last_name":"Wang"}],"status":"public","oa_version":"Submitted Version","year":"2016","publication":"Plant Signaling & Behavior","day":"02","title":"The CLE gene family in Populus trichocarpa","date_published":"2016-06-02T00:00:00Z","publisher":"Taylor & Francis","publication_status":"published","quality_controlled":"1","scopus_import":"1","type":"journal_article","citation":{"apa":"Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., &#38; Wang, G. (2016). The CLE gene family in Populus trichocarpa. <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/15592324.2016.1191734\">https://doi.org/10.1080/15592324.2016.1191734</a>","ama":"Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. <i>Plant Signaling &#38; Behavior</i>. 2016;11(6). doi:<a href=\"https://doi.org/10.1080/15592324.2016.1191734\">10.1080/15592324.2016.1191734</a>","ista":"Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family in Populus trichocarpa. Plant Signaling &#38; Behavior. 11(6), e1191734.","chicago":"Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/15592324.2016.1191734\">https://doi.org/10.1080/15592324.2016.1191734</a>.","ieee":"Z. Liu <i>et al.</i>, “The CLE gene family in Populus trichocarpa,” <i>Plant Signaling &#38; Behavior</i>, vol. 11, no. 6. Taylor &#38; Francis, 2016.","short":"Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &#38; Behavior 11 (2016).","mla":"Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” <i>Plant Signaling &#38; Behavior</i>, vol. 11, no. 6, e1191734, Taylor &#38; Francis, 2016, doi:<a href=\"https://doi.org/10.1080/15592324.2016.1191734\">10.1080/15592324.2016.1191734</a>."},"acknowledgement":"We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading of the article. Work in our group is supported by the National Natural Science Foundation of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of Higher Education from the Ministry of Education of China (20120202120009), the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China (2014JM3064). ","month":"06","intvolume":"        11","publist_id":"7308","department":[{"_id":"JiFr"}],"date_updated":"2023-10-17T11:13:40Z","date_created":"2018-12-11T11:46:53Z","doi":"10.1080/15592324.2016.1191734","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/","open_access":"1"}],"volume":11,"_id":"510","issue":"6"},{"title":"Rules and self-organizing properties of post-embryonic plant organ cell division patterns","date_published":"2016-02-22T00:00:00Z","day":"22","publication":"Current Biology","type":"journal_article","quality_controlled":0,"publication_status":"published","abstract":[{"text":"Plants form new organs with patterned tissue organization throughout their lifespan. It is unknown whether this robust post-embryonic organ formation results from stereotypic dynamic processes, in which the arrangement of cells follows rigid rules. Here, we combine modeling with empirical observations of whole-organ development to identify the principles governing lateral root formation in Arabidopsis. Lateral roots derive from a small pool of founder cells in which some take a dominant role as seen by lineage tracing. The first division of the founders is asymmetric, tightly regulated, and determines the formation of a layered structure. Whereas the pattern of subsequent cell divisions is not stereotypic between different samples, it is characterized by a regular switch in division plane orientation. This switch is also necessary for the appearance of patterned layers as a result of the apical growth of the primordium. Our data suggest that lateral root morphogenesis is based on a limited set of rules. They determine cell growth and division orientation. The organ-level coupling of the cell behavior ensures the emergence of the lateral root's characteristic features. We propose that self-organizing, non-deterministic modes of development account for the robustness of plant organ morphogenesis.","lang":"eng"}],"publisher":"Cell Press","date_updated":"2021-01-12T08:01:24Z","date_created":"2018-12-11T11:46:58Z","publist_id":"7293","status":"public","intvolume":"        26","month":"02","page":"439 - 449","author":[{"id":"49E91952-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","last_name":"Von Wangenheim","full_name":"Daniel von Wangenheim","orcid":"0000-0002-6862-1247"},{"full_name":"Fangerau, Jens","last_name":"Fangerau","first_name":"Jens"},{"first_name":"Alexander","last_name":"Schmitz","full_name":"Schmitz, Alexander"},{"first_name":"Richard","last_name":"Smith","full_name":"Smith, Richard S"},{"first_name":"Heike","full_name":"Leitte, Heike","last_name":"Leitte"},{"full_name":"Stelzer, Ernst H","last_name":"Stelzer","first_name":"Ernst"},{"full_name":"Maizel, Alexis","last_name":"Maizel","first_name":"Alexis"}],"acknowledgement":"We thank M.J. Bennett, L. Laplaze, and S. Lemke for their helpful comments.\nThis work was supported by the Land Baden-Württemberg, the Chica und Heinz Schaller Stiftung, the CellNetworks cluster of excellence, and the Boehringer Ingelheim Fond (to J.F. and A.M.) and the Cluster of Excellence “Macromolecular Complexes” at the Goethe University Frankfurt am Main (CEF-MC II; DFG Project EXC 115; to D.v.W., A.S., and E.H.K.S.).\n","citation":{"chicago":"Wangenheim, Daniel von, Jens Fangerau, Alexander Schmitz, Richard Smith, Heike Leitte, Ernst Stelzer, and Alexis Maizel. “Rules and Self-Organizing Properties of Post-Embryonic Plant Organ Cell Division Patterns.” <i>Current Biology</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">https://doi.org/10.1016/j.cub.2015.12.047</a>.","mla":"von Wangenheim, Daniel, et al. “Rules and Self-Organizing Properties of Post-Embryonic Plant Organ Cell Division Patterns.” <i>Current Biology</i>, vol. 26, no. 4, Cell Press, 2016, pp. 439–49, doi:<a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">10.1016/j.cub.2015.12.047</a>.","short":"D. von Wangenheim, J. Fangerau, A. Schmitz, R. Smith, H. Leitte, E. Stelzer, A. Maizel, Current Biology 26 (2016) 439–449.","ieee":"D. von Wangenheim <i>et al.</i>, “Rules and self-organizing properties of post-embryonic plant organ cell division patterns,” <i>Current Biology</i>, vol. 26, no. 4. Cell Press, pp. 439–449, 2016.","ama":"von Wangenheim D, Fangerau J, Schmitz A, et al. Rules and self-organizing properties of post-embryonic plant organ cell division patterns. <i>Current Biology</i>. 2016;26(4):439-449. doi:<a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">10.1016/j.cub.2015.12.047</a>","apa":"von Wangenheim, D., Fangerau, J., Schmitz, A., Smith, R., Leitte, H., Stelzer, E., &#38; Maizel, A. (2016). Rules and self-organizing properties of post-embryonic plant organ cell division patterns. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2015.12.047\">https://doi.org/10.1016/j.cub.2015.12.047</a>","ista":"von Wangenheim D, Fangerau J, Schmitz A, Smith R, Leitte H, Stelzer E, Maizel A. 2016. Rules and self-organizing properties of post-embryonic plant organ cell division patterns. Current Biology. 26(4), 439–449."},"issue":"4","extern":1,"_id":"526","year":"2016","volume":26,"doi":"10.1016/j.cub.2015.12.047"},{"acknowledgement":"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 Agreements 291147 and 306457.","citation":{"ista":"Browning TD, Vinogradov I. 2016. Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. Journal of the London Mathematical Society. 94(1), 61–84.","apa":"Browning, T. D., &#38; Vinogradov, I. (2016). Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. <i>Journal of the London Mathematical Society</i>. John Wiley and Sons Ltd. <a href=\"https://doi.org/10.1112/jlms/jdw025\">https://doi.org/10.1112/jlms/jdw025</a>","ama":"Browning TD, Vinogradov I. Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1. <i>Journal of the London Mathematical Society</i>. 2016;94(1):61-84. doi:<a href=\"https://doi.org/10.1112/jlms/jdw025\">10.1112/jlms/jdw025</a>","ieee":"T. D. Browning and I. Vinogradov, “Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1,” <i>Journal of the London Mathematical Society</i>, vol. 94, no. 1. John Wiley and Sons Ltd, pp. 61–84, 2016.","short":"T.D. Browning, I. Vinogradov, Journal of the London Mathematical Society 94 (2016) 61–84.","mla":"Browning, Timothy D., and Ilya Vinogradov. “Effective Ratner Theorem for SL (2, R) ⋉R2 and Gaps in √n modulo 1.” <i>Journal of the London Mathematical Society</i>, vol. 94, no. 1, John Wiley and Sons Ltd, 2016, pp. 61–84, doi:<a href=\"https://doi.org/10.1112/jlms/jdw025\">10.1112/jlms/jdw025</a>.","chicago":"Browning, Timothy D, and Ilya Vinogradov. “Effective Ratner Theorem for SL (2, R) ⋉R2 and Gaps in √n modulo 1.” <i>Journal of the London Mathematical Society</i>. John Wiley and Sons Ltd, 2016. <a href=\"https://doi.org/10.1112/jlms/jdw025\">https://doi.org/10.1112/jlms/jdw025</a>."},"month":"05","page":"61 - 84","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning","last_name":"Browning"},{"first_name":"Ilya","full_name":"Vinogradov, Ilya","last_name":"Vinogradov"}],"status":"public","intvolume":"        94","date_updated":"2021-01-12T06:58:33Z","date_created":"2018-12-11T11:45:29Z","publist_id":"7641","doi":"10.1112/jlms/jdw025","volume":94,"extern":1,"_id":"261","year":"2016","issue":"1","publication":"Journal of the London Mathematical Society","title":"Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1","date_published":"2016-05-24T00:00:00Z","day":"24","abstract":[{"text":"Let G = SL(2, R) ⋉R2 and Γ = SL(2, Z) ⋉Z2. Building on recent work of Strömbergsson, we prove a rate of equidistribution for the orbits of a certain one-dimensional unipotent flow of Γ\\G, which projects to a closed horocycle in the unit tangent bundle to the modular surface. We use this to answer a question of Elkies and McMullen by making effective the convergence of the gap distribution of √n mod 1.","lang":"eng"}],"publisher":"John Wiley and Sons Ltd","publication_status":"published","quality_controlled":0,"type":"journal_article"},{"publisher":"Cambridge University Press","abstract":[{"lang":"eng","text":"For any number field we calculate the exact proportion of rational numbers which are everywhere locally a norm but not globally a norm from the number field."}],"publication_status":"published","type":"journal_article","quality_controlled":0,"oa":1,"publication":"Mathematika","day":"22","title":"The proportion of failures of the Hasse norm principle","date_published":"2016-01-22T00:00:00Z","doi":"10.1112/S0025579315000261","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.7775"}],"volume":62,"_id":"262","year":"2016","extern":1,"issue":"2","citation":{"ista":"Browning TD, Newton R. 2016. The proportion of failures of the Hasse norm principle. Mathematika. 62(2), 337–347.","apa":"Browning, T. D., &#38; Newton, R. (2016). The proportion of failures of the Hasse norm principle. <i>Mathematika</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0025579315000261\">https://doi.org/10.1112/S0025579315000261</a>","ama":"Browning TD, Newton R. The proportion of failures of the Hasse norm principle. <i>Mathematika</i>. 2016;62(2):337-347. doi:<a href=\"https://doi.org/10.1112/S0025579315000261\">10.1112/S0025579315000261</a>","ieee":"T. D. Browning and R. Newton, “The proportion of failures of the Hasse norm principle,” <i>Mathematika</i>, vol. 62, no. 2. Cambridge University Press, pp. 337–347, 2016.","short":"T.D. Browning, R. Newton, Mathematika 62 (2016) 337–347.","mla":"Browning, Timothy D., and Rachel Newton. “The Proportion of Failures of the Hasse Norm Principle.” <i>Mathematika</i>, vol. 62, no. 2, Cambridge University Press, 2016, pp. 337–47, doi:<a href=\"https://doi.org/10.1112/S0025579315000261\">10.1112/S0025579315000261</a>.","chicago":"Browning, Timothy D, and Rachel Newton. “The Proportion of Failures of the Hasse Norm Principle.” <i>Mathematika</i>. Cambridge University Press, 2016. <a href=\"https://doi.org/10.1112/S0025579315000261\">https://doi.org/10.1112/S0025579315000261</a>."},"acknowledgement":"While working on this paper the first author was supported by ERC grant 306457.","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning","full_name":"Timothy Browning","orcid":"0000-0002-8314-0177"},{"first_name":"Rachel","last_name":"Newton","full_name":"Newton, Rachel"}],"page":"337 - 347","month":"01","intvolume":"        62","status":"public","publist_id":"7640","date_created":"2018-12-11T11:45:29Z","date_updated":"2021-01-12T06:58:37Z"},{"publisher":"Springer Nature","abstract":[{"lang":"eng","text":"We count rational points of bounded height on the Cayley ruled cubic surface and interpret the result in the context of general conjectures due to Batyrev and Tschinkel."}],"quality_controlled":0,"type":"journal_article","publication_status":"published","oa":1,"publication":"European Journal of Mathematics","day":"01","title":"Counting rational points on the Cayley ruled cubic","date_published":"2016-03-01T00:00:00Z","doi":"10.1007/s40879-015-0049-1","main_file_link":[{"url":"https://arxiv.org/abs/1410.3855","open_access":"1"}],"volume":2,"_id":"263","extern":1,"year":"2016","issue":"1","citation":{"ista":"De La Bretèche R, Browning TD, Salberger P. 2016. Counting rational points on the Cayley ruled cubic. European Journal of Mathematics. 2(1), 55–72.","apa":"De La Bretèche, R., Browning, T. D., &#38; Salberger, P. (2016). Counting rational points on the Cayley ruled cubic. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-015-0049-1\">https://doi.org/10.1007/s40879-015-0049-1</a>","ama":"De La Bretèche R, Browning TD, Salberger P. Counting rational points on the Cayley ruled cubic. <i>European Journal of Mathematics</i>. 2016;2(1):55-72. doi:<a href=\"https://doi.org/10.1007/s40879-015-0049-1\">10.1007/s40879-015-0049-1</a>","ieee":"R. De La Bretèche, T. D. Browning, and P. Salberger, “Counting rational points on the Cayley ruled cubic,” <i>European Journal of Mathematics</i>, vol. 2, no. 1. Springer Nature, pp. 55–72, 2016.","short":"R. De La Bretèche, T.D. Browning, P. Salberger, European Journal of Mathematics 2 (2016) 55–72.","mla":"De La Bretèche, Régis, et al. “Counting Rational Points on the Cayley Ruled Cubic.” <i>European Journal of Mathematics</i>, vol. 2, no. 1, Springer Nature, 2016, pp. 55–72, doi:<a href=\"https://doi.org/10.1007/s40879-015-0049-1\">10.1007/s40879-015-0049-1</a>.","chicago":"De La Bretèche, Régis, Timothy D Browning, and Per Salberger. “Counting Rational Points on the Cayley Ruled Cubic.” <i>European Journal of Mathematics</i>. Springer Nature, 2016. <a href=\"https://doi.org/10.1007/s40879-015-0049-1\">https://doi.org/10.1007/s40879-015-0049-1</a>."},"acknowledgement":"While working on this paper the first author was supported by an IUF Junior and the second author was supported by ERC grant 306457. ","author":[{"first_name":"Régis","full_name":"de la Bretèche, Régis","last_name":"De La Bretèche"},{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","full_name":"Timothy Browning","orcid":"0000-0002-8314-0177"},{"full_name":"Salberger, Per","last_name":"Salberger","first_name":"Per"}],"month":"03","page":"55 - 72","intvolume":"         2","status":"public","publist_id":"7639","date_updated":"2021-01-12T06:58:41Z","date_created":"2018-12-11T11:45:30Z"},{"year":"2016","_id":"264","extern":1,"issue":"7","doi":"10.1112/S0010437X16007405","volume":152,"main_file_link":[{"url":"https://arxiv.org/abs/1506.01817","open_access":"1"}],"status":"public","intvolume":"       152","date_updated":"2021-01-12T06:58:45Z","date_created":"2018-12-11T11:45:30Z","publist_id":"7638","acknowledgement":"While working on this paper the second author was supported by ERC grant 306457.","citation":{"ista":"Bright M, Browning TD, Loughran D. 2016. Failures of weak approximation in families. Compositio Mathematica. 152(7), 1435–1475.","apa":"Bright, M., Browning, T. D., &#38; Loughran, D. (2016). Failures of weak approximation in families. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X16007405\">https://doi.org/10.1112/S0010437X16007405</a>","ama":"Bright M, Browning TD, Loughran D. Failures of weak approximation in families. <i>Compositio Mathematica</i>. 2016;152(7):1435-1475. doi:<a href=\"https://doi.org/10.1112/S0010437X16007405\">10.1112/S0010437X16007405</a>","ieee":"M. Bright, T. D. Browning, and D. Loughran, “Failures of weak approximation in families,” <i>Compositio Mathematica</i>, vol. 152, no. 7. Cambridge University Press, pp. 1435–1475, 2016.","mla":"Bright, Maritn, et al. “Failures of Weak Approximation in Families.” <i>Compositio Mathematica</i>, vol. 152, no. 7, Cambridge University Press, 2016, pp. 1435–75, doi:<a href=\"https://doi.org/10.1112/S0010437X16007405\">10.1112/S0010437X16007405</a>.","short":"M. Bright, T.D. Browning, D. Loughran, Compositio Mathematica 152 (2016) 1435–1475.","chicago":"Bright, Maritn, Timothy D Browning, and Daniel Loughran. “Failures of Weak Approximation in Families.” <i>Compositio Mathematica</i>. Cambridge University Press, 2016. <a href=\"https://doi.org/10.1112/S0010437X16007405\">https://doi.org/10.1112/S0010437X16007405</a>."},"page":"1435 - 1475","month":"07","author":[{"full_name":"Bright, Maritn J","last_name":"Bright","first_name":"Maritn"},{"last_name":"Browning","full_name":"Timothy Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"first_name":"Daniel","full_name":"Loughran, Daniel","last_name":"Loughran"}],"abstract":[{"text":"Given a family of varieties over a number field, we determine conditions under which there is a Brauer-Manin obstruction to weak approximation for 100% of the fibres which are everywhere locally soluble.","lang":"eng"}],"publisher":"Cambridge University Press","quality_controlled":0,"type":"journal_article","publication_status":"published","publication":"Compositio Mathematica","title":"Failures of weak approximation in families","date_published":"2016-07-01T00:00:00Z","day":"01","oa":1},{"language":[{"iso":"eng"}],"day":"01","date_published":"2016-12-01T00:00:00Z","title":"Relevant sparse codes with variational information bottleneck","oa":1,"publisher":"Neural Information Processing Systems","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximises information about a relevance variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximising a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm to recover features that are both relevant and sparse. Finally, we demonstrate how kernelised versions of the algorithm can be used to address a broad range of problems with non-linear relation between X and Y.","lang":"eng"}],"scopus_import":1,"quality_controlled":"1","type":"conference","publication_status":"published","alternative_title":["Advances in Neural Information Processing Systems"],"intvolume":"        29","status":"public","publist_id":"6298","oa_version":"Preprint","department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T06:48:09Z","date_created":"2018-12-11T11:50:03Z","citation":{"ama":"Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.","apa":"Chalk, M. J., Marre, O., &#38; Tkačik, G. (2016). Relevant sparse codes with variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems.","ista":"Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational information bottleneck. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 1965–1973.","chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing Systems, 2016.","short":"M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 1965–1973.","mla":"Chalk, Matthew J., et al. <i>Relevant Sparse Codes with Variational Information Bottleneck</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73.","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational information bottleneck,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973."},"related_material":{"link":[{"url":"https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck","relation":"other"}]},"author":[{"first_name":"Matthew J","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7782-4436","full_name":"Chalk, Matthew J","last_name":"Chalk"},{"last_name":"Marre","full_name":"Marre, Olivier","first_name":"Olivier"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","full_name":"Tkacik, Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455"}],"page":"1965-1973","month":"12","conference":{"name":"NIPS: Neural Information Processing Systems","end_date":"2016-12-10","location":"Barcelona, Spain","start_date":"2016-12-05"},"year":"2016","_id":"1082","main_file_link":[{"url":"https://arxiv.org/abs/1605.07332","open_access":"1"}],"volume":29},{"doi":"10.1093/cercor/bhw090","volume":27,"_id":"1083","year":"2016","issue":"3","citation":{"apa":"Booker, S., Althof, D., Gross, A., Loreth, D., Müller, J., Unger, A., … Kulik, Á. (2016). KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>","ama":"Booker S, Althof D, Gross A, et al. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. 2016;27(3):2318-2334. doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>","ista":"Booker S, Althof D, Gross A, Loreth D, Müller J, Unger A, Fakler B, Varro A, Watanabe M, Gassmann M, Bettler B, Shigemoto R, Vida I, Kulik Á. 2016. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. Cerebral Cortex. 27(3), 2318–2334.","chicago":"Booker, Sam, Daniel Althof, Anna Gross, Desiree Loreth, Johanna Müller, Andreas Unger, Bernd Fakler, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>.","ieee":"S. Booker <i>et al.</i>, “KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons,” <i>Cerebral Cortex</i>, vol. 27, no. 3. Oxford University Press, pp. 2318–2334, 2016.","short":"S. Booker, D. Althof, A. Gross, D. Loreth, J. Müller, A. Unger, B. Fakler, A. Varro, M. Watanabe, M. Gassmann, B. Bettler, R. Shigemoto, I. Vida, Á. Kulik, Cerebral Cortex 27 (2016) 2318–2334.","mla":"Booker, Sam, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>, vol. 27, no. 3, Oxford University Press, 2016, pp. 2318–34, doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>."},"acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG SFB 780 A2, A.K.; SFB TR3 I.V. and EXC 257, I.V.; FOR 2143, A.K. and I.V.), Spemann Graduate School (D.A.), BIOSS-2 (A6, A.K.), the Swiss National Science Foundation (3100A0-117816, B.B.), The McNaught Bequest (S.A.B. and I.V.), and Tenovus Scotland (I.V.).\r\n\r\n\r\nWe thank Cheryl Hutton and Chinmaya Sadangi for their contributions to neuronal reconstruction as well as Natalie Wernet, Sigrun Nestel, Anikó Schneider, Ina Wolter, and Ulrich Noeller for their excellent technical support. VGAT-Venus transgenic rats were generated by Drs Y. Yanagawa, M. Hirabayashi, and Y. Kawaguchi in National Institute for Physiological Sciences, Okazaki, Japan, using pCS2-Venus provided by Dr A. Miyawaki. The monoclonal mouse CCK antibody was generously provided by Dr G.V. Ohning, CURE Center, UCLA, CA. ","author":[{"full_name":"Booker, Sam","last_name":"Booker","first_name":"Sam"},{"first_name":"Daniel","last_name":"Althof","full_name":"Althof, Daniel"},{"first_name":"Anna","full_name":"Gross, Anna","last_name":"Gross"},{"first_name":"Desiree","full_name":"Loreth, Desiree","last_name":"Loreth"},{"full_name":"Müller, Johanna","last_name":"Müller","first_name":"Johanna"},{"last_name":"Unger","full_name":"Unger, Andreas","first_name":"Andreas"},{"full_name":"Fakler, Bernd","last_name":"Fakler","first_name":"Bernd"},{"full_name":"Varro, Andrea","last_name":"Varro","first_name":"Andrea"},{"full_name":"Watanabe, Masahiko","last_name":"Watanabe","first_name":"Masahiko"},{"first_name":"Martin","last_name":"Gassmann","full_name":"Gassmann, Martin"},{"full_name":"Bettler, Bernhard","last_name":"Bettler","first_name":"Bernhard"},{"last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Imre","last_name":"Vida","full_name":"Vida, Imre"},{"full_name":"Kulik, Ákos","last_name":"Kulik","first_name":"Ákos"}],"page":"2318 - 2334","month":"04","intvolume":"        27","status":"public","oa_version":"None","department":[{"_id":"RySh"}],"publist_id":"6297","date_updated":"2021-01-12T06:48:09Z","date_created":"2018-12-11T11:50:03Z","publisher":"Oxford University Press","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":" Cholecystokinin-expressing interneurons (CCK-INs) mediate behavior state-dependent inhibition in cortical circuits and themselves receive strong GABAergic input. However, it remains unclear to what extent GABABreceptors (GABABRs) contribute to their inhibitory control. Using immunoelectron microscopy, we found that CCK-INs in the rat hippocampus possessed high levels of dendritic GABABRs and KCTD12 auxiliary proteins, whereas postsynaptic effector Kir3 channels were present at lower levels. Consistently, whole-cell recordings revealed slow GABABR-mediated inhibitory postsynaptic currents (IPSCs) in most CCK-INs. In spite of the higher surface density of GABABRs in CCK-INs than in CA1 principal cells, the amplitudes of IPSCs were comparable, suggesting that the expression of Kir3 channels is the limiting factor for the GABABR currents in these INs. Morphological analysis showed that CCK-INs were diverse, comprising perisomatic-targeting basket cells (BCs), as well as dendrite-targeting (DT) interneurons, including a previously undescribed DT type. GABABR-mediated IPSCs in CCK-INs were large in BCs, but small in DT subtypes. In response to prolonged activation, GABABR-mediated currents displayed strong desensitization, which was absent in KCTD12-deficient mice. This study highlights that GABABRs differentially control CCK-IN subtypes, and the kinetics and desensitization of GABABR-mediated currents are modulated by KCTD12 proteins. ","lang":"eng"}],"quality_controlled":"1","type":"journal_article","publication_status":"published","publication":"Cerebral Cortex","language":[{"iso":"eng"}],"day":"12","date_published":"2016-04-12T00:00:00Z","title":"KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons"},{"publication":"BioArchitecture","language":[{"iso":"eng"}],"day":"27","title":"Geometric control and modeling of genome reprogramming","date_published":"2016-07-27T00:00:00Z","publisher":"Taylor & Francis","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Cell geometry is tightly coupled to gene expression patterns within the tissue microenvironment. This perspective synthesizes evidence that the 3D organization of chromosomes is a critical intermediate for geometric control of genomic programs. Using a combination of experiments and modeling we outline approaches to decipher the mechano-genomic code that governs cellular homeostasis and reprogramming."}],"publication_status":"published","quality_controlled":"1","type":"journal_article","intvolume":"         6","status":"public","oa_version":"None","publist_id":"6289","date_created":"2018-12-11T11:50:05Z","date_updated":"2021-01-12T06:48:11Z","citation":{"apa":"Uhler, C., &#38; Shivashankar, G. V. (2016). Geometric control and modeling of genome reprogramming. <i>BioArchitecture</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/19490992.2016.1201620\">https://doi.org/10.1080/19490992.2016.1201620</a>","ama":"Uhler C, Shivashankar GV. Geometric control and modeling of genome reprogramming. <i>BioArchitecture</i>. 2016;6(4):76-84. doi:<a href=\"https://doi.org/10.1080/19490992.2016.1201620\">10.1080/19490992.2016.1201620</a>","ista":"Uhler C, Shivashankar GV. 2016. Geometric control and modeling of genome reprogramming. BioArchitecture. 6(4), 76–84.","chicago":"Uhler, Caroline, and G V Shivashankar. “Geometric Control and Modeling of Genome Reprogramming.” <i>BioArchitecture</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/19490992.2016.1201620\">https://doi.org/10.1080/19490992.2016.1201620</a>.","ieee":"C. Uhler and G. V. Shivashankar, “Geometric control and modeling of genome reprogramming,” <i>BioArchitecture</i>, vol. 6, no. 4. Taylor &#38; Francis, pp. 76–84, 2016.","short":"C. Uhler, G.V. Shivashankar, BioArchitecture 6 (2016) 76–84.","mla":"Uhler, Caroline, and G. V. Shivashankar. “Geometric Control and Modeling of Genome Reprogramming.” <i>BioArchitecture</i>, vol. 6, no. 4, Taylor &#38; Francis, 2016, pp. 76–84, doi:<a href=\"https://doi.org/10.1080/19490992.2016.1201620\">10.1080/19490992.2016.1201620</a>."},"author":[{"full_name":"Uhler, Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Shivashankar","full_name":"Shivashankar, G V","first_name":"G V"}],"page":"76 - 84","month":"07","year":"2016","_id":"1088","extern":"1","issue":"4","doi":"10.1080/19490992.2016.1201620","volume":6},{"alternative_title":["LIPIcs"],"has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":1,"publication_status":"published","type":"conference","quality_controlled":"1","day":"01","date_published":"2016-08-01T00:00:00Z","title":"Nested weighted limit-average automata of bounded width","doi":"10.4230/LIPIcs.MFCS.2016.24","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"file":[{"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:17:31Z","date_updated":"2018-12-12T10:17:31Z","file_id":"5286","content_type":"application/pdf","creator":"system","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf","file_size":564560}],"volume":58,"conference":{"end_date":"2016-08-26","name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2016-08-22","location":"Krakow; Poland"},"_id":"1090","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Limit-Average Automata of Bounded Width</i>. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>."},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under grant 2014/15/D/ST6/04543.","month":"08","intvolume":"        58","publist_id":"6286","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T11:50:05Z","date_updated":"2021-01-12T06:48:12Z","file_date_updated":"2018-12-12T10:17:31Z","article_number":"24","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":" While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness.","lang":"eng"}],"oa":1,"ddc":["004"],"language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"year":"2016","pubrep_id":"795","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"status":"public","oa_version":"Published Version"},{"file_date_updated":"2018-12-12T10:11:39Z","article_number":"20","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results. "}],"oa":1,"ddc":["004"],"language":[{"iso":"eng"}],"ec_funded":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","pubrep_id":"794","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1155"}]},"author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"last_name":"Petrov","full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana"}],"status":"public","oa_version":"Published Version","has_accepted_license":"1","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","publication_status":"published","quality_controlled":"1","scopus_import":1,"day":"01","date_published":"2016-08-01T00:00:00Z","title":"Linear distances between Markov chains","doi":"10.4230/LIPIcs.CONCUR.2016.20","project":[{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"file":[{"creator":"system","file_size":501827,"file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf","date_created":"2018-12-12T10:11:39Z","date_updated":"2018-12-12T10:11:39Z","access_level":"open_access","relation":"main_file","file_id":"4895","content_type":"application/pdf"}],"volume":59,"conference":{"start_date":"2016-08-23","location":"Quebec City; Canada","end_date":"2016-08-26","name":"CONCUR: Concurrency Theory"},"_id":"1093","citation":{"apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.","mla":"Daca, Przemyslaw, et al. <i>Linear Distances between Markov Chains</i>. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF) under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award), by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced Postdoc. Mobility Fellowship – grant number P300P2_161067.","month":"08","intvolume":"        59","department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"publist_id":"6283","date_updated":"2023-09-07T11:58:33Z","date_created":"2018-12-11T11:50:06Z"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledged_ssus":[{"_id":"EM-Fac"}],"abstract":[{"lang":"eng","text":"Immunogold labeling of freeze-fracture replicas has recently been used for high-resolution visualization of protein localization in electron microscopy. This method has higher labeling efficiency than conventional immunogold methods for membrane molecules allowing precise quantitative measurements. However, one of the limitations of freeze-fracture replica immunolabeling is difficulty in keeping structural orientation and identifying labeled profiles in complex tissues like brain. The difficulty is partly due to fragmentation of freeze-fracture replica preparations during labeling procedures and limited morphological clues on the replica surface. To overcome these issues, we introduce here a grid-glued replica method combined with SEM observation. This method allows histological staining before dissolving the tissue and easy handling of replicas during immunogold labeling, and keeps the whole replica surface intact without fragmentation. The procedure described here is also useful for matched double-replica analysis allowing further identification of labeled profiles in corresponding P-face and E-face."}],"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2016","ec_funded":1,"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"]},"oa_version":"None","status":"public","author":[{"full_name":"Harada, Harumi","last_name":"Harada","orcid":"0000-0001-7429-7896","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Harumi"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"}],"page":"203 - 216","publication_status":"published","type":"book_chapter","quality_controlled":"1","publisher":"Springer","alternative_title":["Methods in Molecular Biology"],"day":"12","title":"Immunogold protein localization on grid-glued freeze-fracture replicas","date_published":"2016-08-12T00:00:00Z","publication":"High-Resolution Imaging of Cellular Proteins","_id":"1094","volume":1474,"doi":"10.1007/978-1-4939-6352-2_12","project":[{"_id":"25CD3DD2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"604102","name":"Localization of ion channels and receptors by two and three-dimensional immunoelectron microscopic approaches"}],"department":[{"_id":"RySh"}],"publist_id":"6281","date_updated":"2023-09-05T14:09:01Z","date_created":"2018-12-11T11:50:06Z","intvolume":"      1474","month":"08","citation":{"ieee":"H. Harada and R. Shigemoto, “Immunogold protein localization on grid-glued freeze-fracture replicas,” in <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–216.","short":"H. Harada, R. Shigemoto, in:, High-Resolution Imaging of Cellular Proteins, Springer, 2016, pp. 203–216.","mla":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–16, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>.","chicago":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” In <i>High-Resolution Imaging of Cellular Proteins</i>, 1474:203–16. Springer, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>.","ista":"Harada H, Shigemoto R. 2016.Immunogold protein localization on grid-glued freeze-fracture replicas. In: High-Resolution Imaging of Cellular Proteins. Methods in Molecular Biology, vol. 1474, 203–216.","apa":"Harada, H., &#38; Shigemoto, R. (2016). Immunogold protein localization on grid-glued freeze-fracture replicas. In <i>High-Resolution Imaging of Cellular Proteins</i> (Vol. 1474, pp. 203–216). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>","ama":"Harada H, Shigemoto R. Immunogold protein localization on grid-glued freeze-fracture replicas. In: <i>High-Resolution Imaging of Cellular Proteins</i>. Vol 1474. Springer; 2016:203-216. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>"},"acknowledgement":"We thank Prof. Elek Molnár for providing us a pan-AMPAR anti-body used in Fig.2 and Dr. Ludek Lovicar for technical assistance in scanning electron microscope imaging. This work was supported by the European Union (HBP—Project Ref. 604102). "}]