[{"oa":1,"publist_id":"7443","external_id":{"arxiv":["1003.2233"]},"intvolume":"        84","quality_controlled":"1","article_processing_charge":"No","status":"public","date_created":"2018-12-11T11:46:10Z","day":"21","publication":"Physical Review B - Condensed Matter and Materials Physics","article_type":"original","month":"07","language":[{"iso":"eng"}],"publication_status":"published","author":[{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev","first_name":"Zhanybek"},{"last_name":"Analytis","first_name":"J G","full_name":"Analytis, J G"},{"full_name":"Chu, J H","first_name":"J H","last_name":"Chu"},{"first_name":"I R","last_name":"Fisher","full_name":"Fisher, I R"},{"full_name":"Kapitulnik, A","first_name":"A","last_name":"Kapitulnik"}],"doi":"10.1103/PhysRevB.84.041104","publisher":"American Physical Society","arxiv":1,"extern":"1","_id":"386","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:44Z","issue":"4","main_file_link":[{"url":"https://arxiv.org/abs/1003.2233","open_access":"1"}],"date_published":"2011-07-21T00:00:00Z","abstract":[{"lang":"eng","text":"We present a detailed study of the local density of states (LDOS) associated with the surface-state band near a step edge of the strong topological insulator Bi2Te3 and reveal a one-dimensional bound state that runs parallel to the step edge and is bound to it at some characteristic distance. This bound state is clearly observed in the bulk gap region, while it becomes entangled with the oscillations of the warped surface band at high energy, and with the valence-band states near the Dirac point. We obtain excellent fits to theoretical predictions [Alpichshev, 2011] that properly incorporate the three-dimensional nature of the problem to the surface state. Fitting the data at different energies, we can recalculate the LDOS originating from the Dirac band without the contribution of the bulk bands or incoherent tunneling effects. "}],"title":"STM imaging of a bound state along a step on the surface of the topological insulator Bi2Te3","year":"2011","volume":84,"type":"journal_article","oa_version":"Preprint","citation":{"mla":"Alpichshev, Zhanybek, et al. “STM Imaging of a Bound State along a Step on the Surface of the Topological Insulator Bi2Te3.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 84, no. 4, American Physical Society, 2011, doi:<a href=\"https://doi.org/10.1103/PhysRevB.84.041104\">10.1103/PhysRevB.84.041104</a>.","ieee":"Z. Alpichshev, J. G. Analytis, J. H. Chu, I. R. Fisher, and A. Kapitulnik, “STM imaging of a bound state along a step on the surface of the topological insulator Bi2Te3,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 84, no. 4. American Physical Society, 2011.","short":"Z. Alpichshev, J.G. Analytis, J.H. Chu, I.R. Fisher, A. Kapitulnik, Physical Review B - Condensed Matter and Materials Physics 84 (2011).","ama":"Alpichshev Z, Analytis JG, Chu JH, Fisher IR, Kapitulnik A. STM imaging of a bound state along a step on the surface of the topological insulator Bi2Te3. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2011;84(4). doi:<a href=\"https://doi.org/10.1103/PhysRevB.84.041104\">10.1103/PhysRevB.84.041104</a>","apa":"Alpichshev, Z., Analytis, J. G., Chu, J. H., Fisher, I. R., &#38; Kapitulnik, A. (2011). STM imaging of a bound state along a step on the surface of the topological insulator Bi2Te3. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.84.041104\">https://doi.org/10.1103/PhysRevB.84.041104</a>","chicago":"Alpichshev, Zhanybek, J G Analytis, J H Chu, I R Fisher, and A Kapitulnik. “STM Imaging of a Bound State along a Step on the Surface of the Topological Insulator Bi2Te3.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2011. <a href=\"https://doi.org/10.1103/PhysRevB.84.041104\">https://doi.org/10.1103/PhysRevB.84.041104</a>.","ista":"Alpichshev Z, Analytis JG, Chu JH, Fisher IR, Kapitulnik A. 2011. STM imaging of a bound state along a step on the surface of the topological insulator Bi2Te3. Physical Review B - Condensed Matter and Materials Physics. 84(4)."}},{"date_published":"2011-05-01T00:00:00Z","date_created":"2018-12-11T12:06:09Z","issue":"2.2","date_updated":"2021-01-12T07:53:31Z","status":"public","publication":"Journal of Experimental Algorithmics","title":"Computing elevation maxima by searching the Gauss sphere","page":"1 - 13","day":"01","abstract":[{"text":"The elevation function on a smoothly embedded 2-manifold in R-3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in identifying coarse docking configurations for protein pairs. Transporting the concept from the smooth to the piecewise linear category, this paper describes an algorithm for finding all local maxima. While its worst-case running time is the same as of the algorithm used in prior work, its performance in practice is orders of magnitudes superior. We cast light on this improvement by relating the running time to the total absolute Gaussian curvature of the 2-manifold.","lang":"eng"}],"type":"journal_article","month":"05","scopus_import":1,"year":"2011","volume":16,"oa_version":"None","citation":{"ista":"Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.","chicago":"Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation Maxima by Searching the Gauss Sphere.” <i>Journal of Experimental Algorithmics</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1963190.1970375\">https://doi.org/10.1145/1963190.1970375</a>.","ama":"Wang B, Edelsbrunner H, Morozov D. Computing elevation maxima by searching the Gauss sphere. <i>Journal of Experimental Algorithmics</i>. 2011;16(2.2):1-13. doi:<a href=\"https://doi.org/10.1145/1963190.1970375\">10.1145/1963190.1970375</a>","apa":"Wang, B., Edelsbrunner, H., &#38; Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. <i>Journal of Experimental Algorithmics</i>. ACM. <a href=\"https://doi.org/10.1145/1963190.1970375\">https://doi.org/10.1145/1963190.1970375</a>","short":"B. Wang, H. Edelsbrunner, D. Morozov, Journal of Experimental Algorithmics 16 (2011) 1–13.","mla":"Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.” <i>Journal of Experimental Algorithmics</i>, vol. 16, no. 2.2, ACM, 2011, pp. 1–13, doi:<a href=\"https://doi.org/10.1145/1963190.1970375\">10.1145/1963190.1970375</a>.","ieee":"B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching the Gauss sphere,” <i>Journal of Experimental Algorithmics</i>, vol. 16, no. 2.2. ACM, pp. 1–13, 2011."},"language":[{"iso":"eng"}],"publication_status":"published","author":[{"full_name":"Wang, Bei","first_name":"Bei","last_name":"Wang"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Morozov","first_name":"Dmitriy","full_name":"Morozov, Dmitriy"}],"department":[{"_id":"HeEd"}],"publisher":"ACM","doi":"10.1145/1963190.1970375","publist_id":"2161","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3965","quality_controlled":"1","intvolume":"        16"},{"scopus_import":1,"volume":31,"year":"2011","type":"journal_article","month":"03","language":[{"iso":"eng"}],"citation":{"apa":"Vyleta, N., &#38; Smith, S. (2011). Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>","ama":"Vyleta N, Smith S. Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. <i>European Journal of Neuroscience</i>. 2011;31(12):4593-4606. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">10.1523/JNEUROSCI.6398-10.2011</a>","short":"N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606.","mla":"Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European Journal of Neuroscience</i>, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">10.1523/JNEUROSCI.6398-10.2011</a>.","ieee":"N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor,” <i>European Journal of Neuroscience</i>, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.","ista":"Vyleta N, Smith S. 2011. Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. European Journal of Neuroscience. 31(12), 4593–4606.","chicago":"Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>."},"oa_version":"Submitted Version","date_updated":"2021-01-12T08:00:49Z","status":"public","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/"}],"date_published":"2011-03-23T00:00:00Z","issue":"12","date_created":"2018-12-11T11:46:39Z","day":"23","abstract":[{"lang":"eng","text":"Spontaneous release of glutamate is important for maintaining synaptic strength and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report that external Ca2+ triggers spontaneous glutamate release more weakly than evoked release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement of spontaneous release by extracellular calcium is insensitive to chelation of intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR), a G-protein-coupled receptor present in nerve terminals, by several specific agonists increased spontaneous glutamate release. The frequency of spontaneous synaptic transmission was decreased in CaSR mutant neurons. The concentration-effect relationship for extracellular calcium regulation of spontaneous release was well described by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these results indicate that extracellular Ca2+ does not trigger spontaneous glutamate release by simply increasing calcium influx but stimulates CaSR and thereby promotes resting spontaneous glutamate release. "}],"title":"Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor","publication":"European Journal of Neuroscience","page":"4593 - 4606","intvolume":"        31","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"469","department":[{"_id":"PeJo"}],"author":[{"full_name":"Vyleta, Nicholas","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas","last_name":"Vyleta"},{"full_name":"Smith, Stephen","last_name":"Smith","first_name":"Stephen"}],"oa":1,"publication_status":"published","doi":"10.1523/JNEUROSCI.6398-10.2011","publist_id":"7353","publisher":"Wiley-Blackwell"},{"oa":1,"publist_id":"7330","has_accepted_license":"1","file":[{"content_type":"application/pdf","creator":"system","checksum":"8263bbf255171f2054f43f3db5f53b6e","date_updated":"2020-07-14T12:46:35Z","file_id":"4642","access_level":"open_access","date_created":"2018-12-12T10:07:44Z","file_name":"IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf","file_size":2863551,"relation":"main_file"}],"intvolume":"      2011","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","status":"public","date_created":"2018-12-11T11:46:45Z","day":"01","publication":"Computational Intelligence and Neuroscience","pubrep_id":"947","month":"01","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"publication_status":"published","author":[{"first_name":"Alois","last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vidaurre","first_name":"Carmen","full_name":"Vidaurre, Carmen"},{"first_name":"Tilmann","last_name":"Sander","full_name":"Sander, Tilmann"}],"doi":"10.1155/2011/935364","publisher":"Hindawi Publishing Corporation","_id":"490","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:01:02Z","ddc":["005"],"date_published":"2011-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"BioSig is an open source software library for biomedical signal processing. The aim of the BioSig project is to foster research in biomedical signal processing by providing free and open source software tools for many different application areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research. Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram (ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG), or respiration signals is a very relevant element of the BioSig project. Specifically, BioSig provides solutions for data acquisition, artifact processing, quality control, feature extraction, classification, modeling, and data visualization, to name a few. In this paper, we highlight several methods to help students and researchers to work more efficiently with biomedical signals. "}],"article_number":"935364","title":"BioSig: The free and open source software library for biomedical signal processing","year":"2011","volume":2011,"scopus_import":1,"type":"journal_article","oa_version":"Published Version","citation":{"short":"A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience 2011 (2011).","ieee":"A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source software library for biomedical signal processing,” <i>Computational Intelligence and Neuroscience</i>, vol. 2011. Hindawi Publishing Corporation, 2011.","mla":"Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>, vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:<a href=\"https://doi.org/10.1155/2011/935364\">10.1155/2011/935364</a>.","ama":"Schlögl A, Vidaurre C, Sander T. BioSig: The free and open source software library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>. 2011;2011. doi:<a href=\"https://doi.org/10.1155/2011/935364\">10.1155/2011/935364</a>","apa":"Schlögl, A., Vidaurre, C., &#38; Sander, T. (2011). BioSig: The free and open source software library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>. Hindawi Publishing Corporation. <a href=\"https://doi.org/10.1155/2011/935364\">https://doi.org/10.1155/2011/935364</a>","chicago":"Schlögl, Alois, Carmen Vidaurre, and Tilmann Sander. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>. Hindawi Publishing Corporation, 2011. <a href=\"https://doi.org/10.1155/2011/935364\">https://doi.org/10.1155/2011/935364</a>.","ista":"Schlögl A, Vidaurre C, Sander T. 2011. BioSig: The free and open source software library for biomedical signal processing. Computational Intelligence and Neuroscience. 2011, 935364."}},{"scopus_import":1,"year":"2011","volume":4,"type":"journal_article","month":"11","language":[{"iso":"eng"}],"oa_version":"None","citation":{"chicago":"Eichner, Alexander, and Michael K Sixt. “Setting the Clock for Recirculating Lymphocytes.” <i>Science Signaling</i>. American Association for the Advancement of Science, 2011. <a href=\"https://doi.org/10.1126/scisignal.2002617\">https://doi.org/10.1126/scisignal.2002617</a>.","ista":"Eichner A, Sixt MK. 2011. Setting the clock for recirculating lymphocytes. Science Signaling. 4(198), pe43.","short":"A. Eichner, M.K. Sixt, Science Signaling 4 (2011).","mla":"Eichner, Alexander, and Michael K. Sixt. “Setting the Clock for Recirculating Lymphocytes.” <i>Science Signaling</i>, vol. 4, no. 198, pe43, American Association for the Advancement of Science, 2011, doi:<a href=\"https://doi.org/10.1126/scisignal.2002617\">10.1126/scisignal.2002617</a>.","ieee":"A. Eichner and M. K. Sixt, “Setting the clock for recirculating lymphocytes,” <i>Science Signaling</i>, vol. 4, no. 198. American Association for the Advancement of Science, 2011.","ama":"Eichner A, Sixt MK. Setting the clock for recirculating lymphocytes. <i>Science Signaling</i>. 2011;4(198). doi:<a href=\"https://doi.org/10.1126/scisignal.2002617\">10.1126/scisignal.2002617</a>","apa":"Eichner, A., &#38; Sixt, M. K. (2011). Setting the clock for recirculating lymphocytes. <i>Science Signaling</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scisignal.2002617\">https://doi.org/10.1126/scisignal.2002617</a>"},"date_updated":"2021-01-12T08:01:02Z","status":"public","date_published":"2011-11-08T00:00:00Z","issue":"198","date_created":"2018-12-11T11:46:46Z","day":"08","abstract":[{"text":"In their search for antigens, lymphocytes continuously shuttle among blood vessels, lymph vessels, and lymphatic tissues. Chemokines mediate entry of lymphocytes into lymphatic tissues, and sphingosine 1-phosphate (S1P) promotes localization of lymphocytes to the vasculature. Both signals are sensed through G protein-coupled receptors (GPCRs). Most GPCRs undergo ligand-dependent homologous receptor desensitization, a process that decreases their signaling output after previous exposure to high ligand concentration. Such desensitization can explain why lymphocytes do not take an intermediate position between two signals but rather oscillate between them. The desensitization of S1P receptor 1 (S1PR1) is mediated by GPCR kinase 2 (GRK2). Deletion of GRK2 in lymphocytes compromises desensitization by high vascular S1P concentrations, thereby reducing responsiveness to the chemokine signal and trapping the cells in the vascular compartment. The desensitization kinetics of S1PR1 allows lymphocytes to dynamically shuttle between vasculature and lymphatic tissue, although the positional information in both compartments is static.","lang":"eng"}],"title":"Setting the clock for recirculating lymphocytes","article_number":"pe43","publication":"Science Signaling","intvolume":"         4","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"491","quality_controlled":"1","department":[{"_id":"MiSi"}],"publication_status":"published","author":[{"last_name":"Eichner","first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander"},{"first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1126/scisignal.2002617","publist_id":"7329","publisher":"American Association for the Advancement of Science"},{"issue":"20","date_published":"2011-10-19T00:00:00Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/","open_access":"1"}],"date_updated":"2021-01-12T08:01:19Z","title":"CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells","abstract":[{"lang":"eng","text":"Cancer stem cells or cancer initiating cells are believed to contribute to cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with fundamental roles in gene regulation. The role of miRNAs in cancer stem cells is only poorly understood. Here, we report miRNA expression profiles of glioblastoma stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore, inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is a putative transcription factor, which induces the expression of the anti-proliferative cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9 * and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival. Our findings could provide a basis for novel strategies of glioblastoma therapy."}],"type":"journal_article","volume":30,"year":"2011","scopus_import":1,"oa_version":"Submitted Version","citation":{"short":"D. Schraivogel, L. Weinmann, D. Beier, G. Tabatabai, A. Eichner, J. Zhu, M. Anton, M.K. Sixt, M. Weller, C. Beier, G. Meister, EMBO Journal 30 (2011) 4309–4322.","mla":"Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>, vol. 30, no. 20, Wiley-Blackwell, 2011, pp. 4309–22, doi:<a href=\"https://doi.org/10.1038/emboj.2011.301\">10.1038/emboj.2011.301</a>.","ieee":"D. Schraivogel <i>et al.</i>, “CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells,” <i>EMBO Journal</i>, vol. 30, no. 20. Wiley-Blackwell, pp. 4309–4322, 2011.","apa":"Schraivogel, D., Weinmann, L., Beier, D., Tabatabai, G., Eichner, A., Zhu, J., … Meister, G. (2011). CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2011.301\">https://doi.org/10.1038/emboj.2011.301</a>","ama":"Schraivogel D, Weinmann L, Beier D, et al. CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. 2011;30(20):4309-4322. doi:<a href=\"https://doi.org/10.1038/emboj.2011.301\">10.1038/emboj.2011.301</a>","chicago":"Schraivogel, Daniel, Lasse Weinmann, Dagmar Beier, Ghazaleh Tabatabai, Alexander Eichner, Jia Zhu, Martina Anton, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1038/emboj.2011.301\">https://doi.org/10.1038/emboj.2011.301</a>.","ista":"Schraivogel D, Weinmann L, Beier D, Tabatabai G, Eichner A, Zhu J, Anton M, Sixt MK, Weller M, Beier C, Meister G. 2011. CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 30(20), 4309–4322."},"author":[{"full_name":"Schraivogel, Daniel","last_name":"Schraivogel","first_name":"Daniel"},{"full_name":"Weinmann, Lasse","first_name":"Lasse","last_name":"Weinmann"},{"first_name":"Dagmar","last_name":"Beier","full_name":"Beier, Dagmar"},{"first_name":"Ghazaleh","last_name":"Tabatabai","full_name":"Tabatabai, Ghazaleh"},{"full_name":"Eichner, Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Eichner"},{"full_name":"Zhu, Jia","last_name":"Zhu","first_name":"Jia"},{"last_name":"Anton","first_name":"Martina","full_name":"Anton, Martina"},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"},{"first_name":"Michael","last_name":"Weller","full_name":"Weller, Michael"},{"last_name":"Beier","first_name":"Christoph","full_name":"Beier, Christoph"},{"full_name":"Meister, Gunter","first_name":"Gunter","last_name":"Meister"}],"publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Wiley-Blackwell","doi":"10.1038/emboj.2011.301","pmid":1,"_id":"518","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:55Z","status":"public","page":"4309 - 4322","publication":"EMBO Journal","day":"19","month":"10","article_type":"original","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["21857646"]},"publist_id":"7301","article_processing_charge":"No","quality_controlled":"1","intvolume":"        30"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"531","publisher":"Springer","doi":"10.1007/s10703-011-0131-3","author":[{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu"}],"publication_status":"published","department":[{"_id":"ToHe"}],"oa_version":"Published Version","citation":{"chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>.","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” <i>Formal Methods in System Design</i>, vol. 39, no. 3. Springer, pp. 297–331, 2011.","mla":"Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>.","short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2011). Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>","ama":"Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. 2011;39(3):297-331. doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>"},"type":"journal_article","scopus_import":1,"year":"2011","volume":39,"title":"Verification of STM on relaxed memory models","abstract":[{"text":"Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We describe RML, a simple language for expressing concurrent programs. We develop a semantics of RML parametrized by a relaxed memory model. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm restricted to two threads and two variables, and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the restricted STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order for two threads and two variables. Finally, we extend the verification results for DSTM and TL2 to an arbitrary number of threads and variables by manually proving that the structural properties of STMs are satisfied at the hardware level of atomicity under the considered relaxed memory models.","lang":"eng"}],"date_published":"2011-12-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf"}],"ddc":["000"],"issue":"3","date_updated":"2021-01-12T08:01:27Z","quality_controlled":"1","article_processing_charge":"No","intvolume":"        39","publist_id":"7288","oa":1,"language":[{"iso":"eng"}],"article_type":"original","month":"12","publication":"Formal Methods in System Design","page":"297 - 331","day":"01","date_created":"2018-12-11T11:47:00Z","status":"public"},{"doi":"10.15479/AT:IST-2011-0009","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"publication_status":"published","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"5379","abstract":[{"text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is ̃O(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the ̃O(n·m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3 an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem.","lang":"eng"}],"title":"An O(n2) time algorithm for alternating Büchi games","date_updated":"2023-02-23T11:15:12Z","date_published":"2011-07-11T00:00:00Z","ddc":["000","004"],"citation":{"short":"K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.","ieee":"K. Chatterjee and M. H. Henzinger, <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>.","ama":"Chatterjee K, Henzinger MH. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2011). <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>.","ista":"Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p."},"oa_version":"Published Version","year":"2011","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","file":[{"creator":"system","content_type":"application/pdf","file_id":"5504","checksum":"0b354264229045d982332fd2cb5b9a26","date_updated":"2020-07-14T12:46:39Z","file_size":388665,"file_name":"IST-2011-0009_IST-2011-0009.pdf","date_created":"2018-12-12T11:53:43Z","access_level":"open_access","relation":"main_file"}],"oa":1,"file_date_updated":"2020-07-14T12:46:39Z","article_processing_charge":"No","day":"11","related_material":{"record":[{"status":"public","id":"3165","relation":"later_version"}]},"page":"20","status":"public","date_created":"2018-12-12T11:38:59Z","language":[{"iso":"eng"}],"pubrep_id":"15","month":"07"},{"publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"}],"oa":1,"department":[{"_id":"KrCh"}],"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"file":[{"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2011-0008_IST-2011-0008.pdf","date_created":"2018-12-12T11:54:22Z","file_size":500399,"checksum":"0fd38186409be819a911c4990fa79d1f","date_updated":"2020-07-14T12:46:39Z","file_id":"5544","relation":"main_file"}],"doi":"10.15479/AT:IST-2011-0008","has_accepted_license":"1","_id":"5380","file_date_updated":"2020-07-14T12:46:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_created":"2018-12-12T11:39:00Z","date_published":"2011-07-11T00:00:00Z","status":"public","date_updated":"2023-02-23T11:22:53Z","page":"53","title":"Bounded rationality in concurrent parity games","related_material":{"record":[{"status":"public","relation":"later_version","id":"3338"}]},"abstract":[{"lang":"eng","text":"We consider 2-player games played on a finite state space for an infinite number of rounds.  The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives.  We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies.  In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision;  and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies.  We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games."}],"day":"11","publication_identifier":{"issn":["2664-1690"]},"month":"07","type":"technical_report","year":"2011","pubrep_id":"16","citation":{"ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.","chicago":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>.","apa":"Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>","ama":"Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.","ieee":"K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>."},"oa_version":"Published Version","language":[{"iso":"eng"}]},{"ddc":["000","005"],"date_created":"2018-12-12T11:39:00Z","date_published":"2011-07-05T00:00:00Z","date_updated":"2023-02-23T11:05:48Z","status":"public","page":"43","title":"Partial-observation stochastic games: How to win when belief fails","related_material":{"record":[{"status":"public","relation":"later_version","id":"1903"},{"id":"2211","relation":"later_version","status":"public"},{"relation":"later_version","id":"2955","status":"public"}]},"abstract":[{"lang":"eng","text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"day":"05","publication_identifier":{"issn":["2664-1690"]},"month":"07","type":"technical_report","pubrep_id":"17","year":"2011","citation":{"ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p."},"oa_version":"Published Version","language":[{"iso":"eng"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"oa":1,"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"IST Austria","file":[{"relation":"main_file","creator":"system","content_type":"application/pdf","file_size":574055,"access_level":"open_access","file_name":"IST-2011-0007_IST-2011-0007.pdf","date_created":"2018-12-12T11:53:27Z","file_id":"5488","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","date_updated":"2020-07-14T12:46:39Z"}],"alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2011-0007","has_accepted_license":"1","_id":"5381","file_date_updated":"2020-07-14T12:46:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"publication_status":"published","department":[{"_id":"KrCh"}],"file":[{"relation":"main_file","content_type":"application/pdf","creator":"system","file_name":"IST-2011-0006_IST-2011-0006.pdf","date_created":"2018-12-12T11:54:24Z","access_level":"open_access","file_size":335997,"date_updated":"2020-07-14T12:46:40Z","checksum":"1322b652d6ab07eb5248298a3f91c1cf","file_id":"5546"}],"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","doi":"10.15479/AT:IST-2011-0006","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:40Z","_id":"5382","date_published":"2011-06-27T00:00:00Z","ddc":["000","005"],"date_created":"2018-12-12T11:39:00Z","status":"public","date_updated":"2023-02-23T11:23:01Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"3341"}]},"title":"Robustness of structurally equivalent concurrent parity games","page":"18","day":"27","abstract":[{"text":"We consider two-player stochastic games played on a finite state space for an infinite num- ber of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with ω-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity games with respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition func- tion is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal).","lang":"eng"}],"type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"month":"06","year":"2011","pubrep_id":"18","citation":{"chicago":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">https://doi.org/10.15479/AT:IST-2011-0006</a>.","ista":"Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.","short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.","ieee":"K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria, 2011.","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">10.15479/AT:IST-2011-0006</a>.","apa":"Chatterjee, K. (2011). <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">https://doi.org/10.15479/AT:IST-2011-0006</a>","ama":"Chatterjee K. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">10.15479/AT:IST-2011-0006</a>"},"oa_version":"Published Version","language":[{"iso":"eng"}]},{"_id":"5383","file_date_updated":"2020-07-14T12:46:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publication_status":"published","oa":1,"author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas"},{"full_name":"Muñiz, Marco","last_name":"Muñiz","first_name":"Marco"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"}],"has_accepted_license":"1","doi":"10.15479/AT:IST-2011-0005","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"file":[{"date_updated":"2020-07-14T12:46:40Z","checksum":"b20029184c4a819c5f4466a4a3d238b5","file_id":"5462","file_name":"IST-2011-0005_IST-2011-0005.pdf","date_created":"2018-12-12T11:53:01Z","access_level":"open_access","file_size":619053,"content_type":"application/pdf","creator":"system","relation":"main_file"}],"year":"2011","pubrep_id":"19","publication_identifier":{"issn":["2664-1690"]},"month":"04","type":"technical_report","language":[{"iso":"eng"}],"citation":{"ieee":"T. Wies, M. Muñiz, and V. Kuncak, <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria, 2011.","mla":"Wies, Thomas, et al. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>.","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","ama":"Wies T, Muñiz M, Kuncak V. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>","apa":"Wies, T., Muñiz, M., &#38; Kuncak, V. (2011). <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>.","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p."},"oa_version":"Published Version","date_updated":"2023-02-23T11:22:16Z","status":"public","date_created":"2018-12-12T11:39:01Z","ddc":["000","006"],"date_published":"2011-04-26T00:00:00Z","abstract":[{"lang":"eng","text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures."}],"day":"26","page":"25","title":"On an efficient decision procedure for imperative tree data structures","related_material":{"record":[{"status":"public","id":"3323","relation":"later_version"}]}},{"has_accepted_license":"1","doi":"10.15479/AT:IST-2011-0004","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"file":[{"relation":"main_file","checksum":"f5a0f664fadc335990f5fcf138df19f1","date_updated":"2020-07-14T12:46:40Z","file_id":"5545","date_created":"2018-12-12T11:54:23Z","file_name":"IST-2011-004_IST-2011-0004.pdf","access_level":"open_access","file_size":570827,"content_type":"application/pdf","creator":"system"}],"department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathieu","last_name":"Tracol","full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"publication_status":"published","_id":"5384","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:40Z","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether for every ε > 0 there is a word that is accepted with probability at least 1 − ε. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions."}],"day":"11","page":"30","title":"Decidable problems for probabilistic automata on infinite words","related_material":{"record":[{"relation":"later_version","id":"2957","status":"public"}]},"status":"public","date_updated":"2023-02-23T11:05:53Z","date_created":"2018-12-12T11:39:01Z","ddc":["000","005"],"date_published":"2011-04-11T00:00:00Z","language":[{"iso":"eng"}],"citation":{"short":"K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">10.15479/AT:IST-2011-0004</a>.","ieee":"K. Chatterjee and M. Tracol, <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria, 2011.","apa":"Chatterjee, K., &#38; Tracol, M. (2011). <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">https://doi.org/10.15479/AT:IST-2011-0004</a>","ama":"Chatterjee K, Tracol M. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">10.15479/AT:IST-2011-0004</a>","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">https://doi.org/10.15479/AT:IST-2011-0004</a>.","ista":"Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p."},"oa_version":"Published Version","pubrep_id":"20","year":"2011","publication_identifier":{"issn":["2664-1690"]},"month":"04","type":"technical_report"},{"date_created":"2018-12-12T11:39:02Z","status":"public","page":"14","related_material":{"record":[{"relation":"later_version","id":"2038","status":"public"},{"id":"3356","relation":"later_version","status":"public"}]},"day":"04","month":"04","pubrep_id":"21","language":[{"iso":"eng"}],"oa":1,"file":[{"relation":"main_file","creator":"system","content_type":"application/pdf","file_id":"5461","date_updated":"2020-07-14T12:46:41Z","checksum":"8491d0d48c4911620ecd5350b413c11e","file_size":366281,"file_name":"IST-2011-0003_IST-2011-0003.pdf","date_created":"2018-12-12T11:53:00Z","access_level":"open_access"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:41Z","ddc":["000","004"],"date_published":"2011-04-04T00:00:00Z","date_updated":"2023-02-23T11:23:41Z","title":"Temporal specifications with accumulative values","abstract":[{"text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable.","lang":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"type":"technical_report","year":"2011","oa_version":"Published Version","citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011."},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"ec_funded":1,"doi":"10.15479/AT:IST-2011-0003","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"_id":"5385","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"has_accepted_license":"1","doi":"10.15479/AT:IST-2011-0002","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"file":[{"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2011-0002_IST-2011-0002.pdf","date_created":"2018-12-12T11:53:34Z","file_size":26390601,"checksum":"ad64c2add5fe2ad10e9d5c669f3f9526","date_updated":"2020-07-14T12:46:41Z","file_id":"5495","relation":"main_file"}],"department":[{"_id":"ChLa"}],"oa":1,"author":[{"first_name":"Chao","last_name":"Chen","full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Freedman, Daniel","first_name":"Daniel","last_name":"Freedman"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"publication_status":"published","_id":"5386","file_date_updated":"2020-07-14T12:46:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce TopoCut: a new way to integrate knowledge about topological properties (TPs) into random field image segmentation model. Instead of including TPs as additional constraints during minimization of the energy function, we devise an efficient algorithm for modifying the unary potentials such that the resulting segmentation is guaranteed with the desired properties. Our method is more flexible in the sense that it handles more topology constraints than previous methods, which were only able to enforce pairwise or global connectivity. In particular, our method is very fast, making it for the first time possible to enforce global topological properties in practical image segmentation tasks."}],"day":"28","page":"69","title":"Enforcing topological constraints in random field image segmentation","related_material":{"record":[{"status":"public","relation":"later_version","id":"3336"}]},"status":"public","date_updated":"2023-02-23T11:22:48Z","ddc":["000"],"date_created":"2018-12-12T11:39:02Z","date_published":"2011-03-28T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"ama":"Chen C, Freedman D, Lampert C. <i>Enforcing Topological Constraints in Random Field Image Segmentation</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">10.15479/AT:IST-2011-0002</a>","apa":"Chen, C., Freedman, D., &#38; Lampert, C. (2011). <i>Enforcing topological constraints in random field image segmentation</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">https://doi.org/10.15479/AT:IST-2011-0002</a>","short":"C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random Field Image Segmentation, IST Austria, 2011.","ieee":"C. Chen, D. Freedman, and C. Lampert, <i>Enforcing topological constraints in random field image segmentation</i>. IST Austria, 2011.","mla":"Chen, Chao, et al. <i>Enforcing Topological Constraints in Random Field Image Segmentation</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">10.15479/AT:IST-2011-0002</a>.","ista":"Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation, IST Austria, 69p.","chicago":"Chen, Chao, Daniel Freedman, and Christoph Lampert. <i>Enforcing Topological Constraints in Random Field Image Segmentation</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">https://doi.org/10.15479/AT:IST-2011-0002</a>."},"pubrep_id":"22","year":"2011","month":"03","publication_identifier":{"issn":["2664-1690"]},"type":"technical_report"},{"language":[{"iso":"eng"}],"month":"07","article_type":"original","day":"15","publication":"Development","page":"2409-2416","status":"public","date_created":"2023-01-16T09:21:54Z","intvolume":"       137","acknowledgement":"We thank the following for providing mutant lines and reagents: Hong Ma, De Ye, Sacco De Vries, and Rod Scott for providing the pA9::Barnase lines and information on A9 expression patterns. Carla Galinha and Paolo Piazza gave valuable help with in situ hybridisation and qRT-PCR, respectively, and we acknowledge Qing Zhang, Helen Prescott and Matthew Dicks for providing excellent technical assistance. We are indebted to Miltos Tsiantis and Angela Hay for helpful discussion, and the research was funded by Oxford University through a Clarendon Scholarship to X.F., with additional financial support from Magdalen College (Oxford).","quality_controlled":"1","article_processing_charge":"No","external_id":{"pmid":["20570940"]},"citation":{"chicago":"Feng, Xiaoqi, and Hugh G. Dickinson. “Tapetal Cell Fate, Lineage and Proliferation in the Arabidopsis Anther.” <i>Development</i>. The Company of Biologists, 2010. <a href=\"https://doi.org/10.1242/dev.049320\">https://doi.org/10.1242/dev.049320</a>.","ista":"Feng X, Dickinson HG. 2010. Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. Development. 137(14), 2409–2416.","short":"X. Feng, H.G. Dickinson, Development 137 (2010) 2409–2416.","ieee":"X. Feng and H. G. Dickinson, “Tapetal cell fate, lineage and proliferation in the Arabidopsis anther,” <i>Development</i>, vol. 137, no. 14. The Company of Biologists, pp. 2409–2416, 2010.","mla":"Feng, Xiaoqi, and Hugh G. Dickinson. “Tapetal Cell Fate, Lineage and Proliferation in the Arabidopsis Anther.” <i>Development</i>, vol. 137, no. 14, The Company of Biologists, 2010, pp. 2409–16, doi:<a href=\"https://doi.org/10.1242/dev.049320\">10.1242/dev.049320</a>.","apa":"Feng, X., &#38; Dickinson, H. G. (2010). Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. <i>Development</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/dev.049320\">https://doi.org/10.1242/dev.049320</a>","ama":"Feng X, Dickinson HG. Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. <i>Development</i>. 2010;137(14):2409-2416. doi:<a href=\"https://doi.org/10.1242/dev.049320\">10.1242/dev.049320</a>"},"keyword":["Developmental Biology","Molecular Biology","Anther Tapetum","Arabidopsis","Cell Fate Establishment","EMS1","Reproductive Cell Lineage"],"oa_version":"None","scopus_import":"1","volume":137,"year":"2010","type":"journal_article","publication_identifier":{"issn":["1477-9129","0950-1991"]},"abstract":[{"lang":"eng","text":"The four microsporangia of the flowering plant anther develop from archesporial cells in the L2 of the primordium. Within each microsporangium, developing microsporocytes are surrounded by concentric monolayers of tapetal, middle layer and endothecial cells. How this intricate array of tissues, each containing relatively few cells, is established in an organ possessing no formal meristems is poorly understood. We describe here the pivotal role of the LRR receptor kinase EXCESS MICROSPOROCYTES 1 (EMS1) in forming the monolayer of tapetal nurse cells in Arabidopsis. Unusually for plants, tapetal cells are specified very early in development, and are subsequently stimulated to proliferate by a receptor-like kinase (RLK) complex that includes EMS1. Mutations in members of this EMS1 signalling complex and its putative ligand result in male-sterile plants in which tapetal initials fail to proliferate. Surprisingly, these cells continue to develop, isolated at the locular periphery. Mutant and wild-type microsporangia expand at similar rates and the ‘tapetal’ space at the periphery of mutant locules becomes occupied by microsporocytes. However, induction of late expression of EMS1 in the few tapetal initials in ems1 plants results in their proliferation to generate a functional tapetum, and this proliferation suppresses microsporocyte number. Our experiments also show that integrity of the tapetal monolayer is crucial for the maintenance of the polarity of divisions within it. This unexpected autonomy of the tapetal ‘lineage’ is discussed in the context of tissue development in complex plant organs, where constancy in size, shape and cell number is crucial."}],"title":"Tapetal cell fate, lineage and proliferation in the Arabidopsis anther","date_updated":"2023-05-08T10:57:11Z","date_published":"2010-07-15T00:00:00Z","issue":"14","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12199","pmid":1,"doi":"10.1242/dev.049320","publisher":"The Company of Biologists","department":[{"_id":"XiFe"}],"publication_status":"published","author":[{"last_name":"Feng","first_name":"Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi"},{"full_name":"Dickinson, Hugh G.","first_name":"Hugh G.","last_name":"Dickinson"}]},{"title":"Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther","abstract":[{"lang":"eng","text":"Key steps in the evolution of the angiosperm anther include the patterning of the concentrically organized microsporangium and the incorporation of four such microsporangia into a leaf-like structure. Mutant studies in the model plant Arabidopsis thaliana are leading to an increasingly accurate picture of (i) the cell lineages culminating in the different cell types present in the microsporangium (the microsporocytes, the tapetum, and the middle and endothecial layers), and (ii) some of the genes responsible for specifying their fates. However, the processes that confer polarity on the developing anther and position the microsporangia within it remain unclear. Certainly, data from a range of experimental strategies suggest that hormones play a central role in establishing polarity and the patterning of the anther initial, and may be responsible for locating the microsporangia. But the fact that microsporangia were originally positioned externally suggests that their development is likely to be autonomous, perhaps with the reproductive cells generating signals controlling the growth and division of the investing anther epidermis. These possibilities are discussed in the context of the expression of genes which initiate and maintain male and female reproductive development, and in the perspective of our current views of anther evolution."}],"issue":"2","date_published":"2010-03-22T00:00:00Z","date_updated":"2023-05-08T10:57:59Z","keyword":["Biochemistry","Anther Development","Arabidopsis","Cell Fate","Microsporangium","Polarity","Receptor Kinase"],"oa_version":"None","citation":{"mla":"Feng, Xiaoqi, and Hugh G. Dickinson. “Cell–Cell Interactions during Patterning of the <i>Arabidopsis</i> Anther.” <i>Biochemical Society Transactions</i>, vol. 38, no. 2, Portland Press Ltd., 2010, pp. 571–76, doi:<a href=\"https://doi.org/10.1042/bst0380571\">10.1042/bst0380571</a>.","ieee":"X. Feng and H. G. Dickinson, “Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther,” <i>Biochemical Society Transactions</i>, vol. 38, no. 2. Portland Press Ltd., pp. 571–576, 2010.","short":"X. Feng, H.G. Dickinson, Biochemical Society Transactions 38 (2010) 571–576.","apa":"Feng, X., &#38; Dickinson, H. G. (2010). Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. <i>Biochemical Society Transactions</i>. Portland Press Ltd. <a href=\"https://doi.org/10.1042/bst0380571\">https://doi.org/10.1042/bst0380571</a>","ama":"Feng X, Dickinson HG. Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. <i>Biochemical Society Transactions</i>. 2010;38(2):571-576. doi:<a href=\"https://doi.org/10.1042/bst0380571\">10.1042/bst0380571</a>","chicago":"Feng, Xiaoqi, and Hugh G. Dickinson. “Cell–Cell Interactions during Patterning of the <i>Arabidopsis</i> Anther.” <i>Biochemical Society Transactions</i>. Portland Press Ltd., 2010. <a href=\"https://doi.org/10.1042/bst0380571\">https://doi.org/10.1042/bst0380571</a>.","ista":"Feng X, Dickinson HG. 2010. Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. Biochemical Society Transactions. 38(2), 571–576."},"publication_identifier":{"issn":["0300-5127","1470-8752"]},"type":"journal_article","volume":38,"year":"2010","scopus_import":"1","publisher":"Portland Press Ltd.","doi":"10.1042/bst0380571","author":[{"id":"e0164712-22ee-11ed-b12a-d80fcdf35958","full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","last_name":"Feng","first_name":"Xiaoqi"},{"full_name":"Dickinson, Hugh G.","last_name":"Dickinson","first_name":"Hugh G."}],"publication_status":"published","department":[{"_id":"XiFe"}],"_id":"12200","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","pmid":1,"page":"571-576","publication":"Biochemical Society Transactions","day":"22","date_created":"2023-01-16T09:22:18Z","status":"public","language":[{"iso":"eng"}],"article_type":"original","month":"03","external_id":{"pmid":["20298223"]},"article_processing_charge":"No","quality_controlled":"1","intvolume":"        38"},{"article_processing_charge":"No","quality_controlled":"1","intvolume":"        46","oa":1,"language":[{"iso":"eng"}],"article_type":"original","month":"10","publication":"Water Resources Research","day":"01","date_created":"2023-02-20T08:18:27Z","status":"public","_id":"12653","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","publisher":"American Geophysical Union","doi":"10.1029/2009wr009039","author":[{"last_name":"Pellicciotti","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"},{"last_name":"Bauder","first_name":"A.","full_name":"Bauder, A."},{"full_name":"Parola, M.","last_name":"Parola","first_name":"M."}],"publication_status":"published","keyword":["Water Science and Technology"],"oa_version":"Published Version","citation":{"short":"F. Pellicciotti, A. Bauder, M. Parola, Water Resources Research 46 (2010).","mla":"Pellicciotti, Francesca, et al. “Effect of Glaciers on Streamflow Trends in the Swiss Alps.” <i>Water Resources Research</i>, vol. 46, no. 10, W10522, American Geophysical Union, 2010, doi:<a href=\"https://doi.org/10.1029/2009wr009039\">10.1029/2009wr009039</a>.","ieee":"F. Pellicciotti, A. Bauder, and M. Parola, “Effect of glaciers on streamflow trends in the Swiss Alps,” <i>Water Resources Research</i>, vol. 46, no. 10. American Geophysical Union, 2010.","ama":"Pellicciotti F, Bauder A, Parola M. Effect of glaciers on streamflow trends in the Swiss Alps. <i>Water Resources Research</i>. 2010;46(10). doi:<a href=\"https://doi.org/10.1029/2009wr009039\">10.1029/2009wr009039</a>","apa":"Pellicciotti, F., Bauder, A., &#38; Parola, M. (2010). Effect of glaciers on streamflow trends in the Swiss Alps. <i>Water Resources Research</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2009wr009039\">https://doi.org/10.1029/2009wr009039</a>","chicago":"Pellicciotti, Francesca, A. Bauder, and M. Parola. “Effect of Glaciers on Streamflow Trends in the Swiss Alps.” <i>Water Resources Research</i>. American Geophysical Union, 2010. <a href=\"https://doi.org/10.1029/2009wr009039\">https://doi.org/10.1029/2009wr009039</a>.","ista":"Pellicciotti F, Bauder A, Parola M. 2010. Effect of glaciers on streamflow trends in the Swiss Alps. Water Resources Research. 46(10), W10522."},"publication_identifier":{"issn":["0043-1397"],"eissn":["1944-7973"]},"type":"journal_article","volume":46,"year":"2010","scopus_import":"1","title":"Effect of glaciers on streamflow trends in the Swiss Alps","article_number":"W10522","abstract":[{"lang":"eng","text":"Daily streamflow from stations close to five Swiss glaciers is analyzed for trends with the Mann-Kendall test. We consider a common period of record (1974–2004) and longer periods based on data availability. The trend statistical significance is tested on annual and seasonal bases. We also examine changes in precipitation, temperature, and snow cover characteristics. Highly glacierized basins show statistically significant positive trends in annual streamflow caused by increasing streamflow in spring and summer. Trends are more numerous and stronger at lower and mid than at the upper quantiles. The basin characterized by lower glacier coverage, conversely, does not exhibit consistently statistically significant trends. Changes in precipitation are not sufficient to explain the observed streamflow trends. Air temperature sees an increase in mean, minimum, and maximum values at all sites. Variations in the seasonal snow accumulation and ablation process are evident. Solid precipitation is decreasing at all sites and trends may be due to a shift from snowfall into rainfall. Mean snow depth is also decreasing, and its duration is getting shorter because of a decrease in solid precipitation and enhanced melting. Trend magnitude attenuates with longer time series. Contrasting trends are detected for different subperiods in the last 70 years: statistically significant negative trends are observed in the periods 1944–1974 and 1954–1984 for Aletschgletscher, in contrast with the results for the common period. These trends are explained by different rates of ice volume changes, and the sign of trends is clearly related to phases of positive or negative glacier mass balance."}],"issue":"10","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2009WR009039"}],"date_published":"2010-10-01T00:00:00Z","date_updated":"2023-02-20T09:39:29Z"},{"intvolume":"       468","extern":1,"_id":"1300","quality_controlled":0,"doi":"10.1038/nature09545","publist_id":"5970","publisher":"Nature Publishing Group","author":[{"last_name":"Jösch","first_name":"Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Maximilian Jösch","orcid":"0000-0002-3937-1330"},{"last_name":"Schnell","first_name":"Bettina","full_name":"Schnell, Bettina"},{"first_name":"Shamprasad","last_name":"Raghu","full_name":"Raghu, Shamprasad V"},{"full_name":"Reiff, Dierk F","last_name":"Reiff","first_name":"Dierk"},{"full_name":"Borst, Alexander","last_name":"Borst","first_name":"Alexander"}],"publication_status":"published","citation":{"short":"M.A. Jösch, B. Schnell, S. Raghu, D. Reiff, A. Borst, Nature 468 (2010) 300–304.","mla":"Jösch, Maximilian A., et al. “ON and off Pathways in Drosophila Motion Vision.” <i>Nature</i>, vol. 468, no. 7321, Nature Publishing Group, 2010, pp. 300–04, doi:<a href=\"https://doi.org/10.1038/nature09545\">10.1038/nature09545</a>.","ieee":"M. A. Jösch, B. Schnell, S. Raghu, D. Reiff, and A. Borst, “ON and off pathways in Drosophila motion vision,” <i>Nature</i>, vol. 468, no. 7321. Nature Publishing Group, pp. 300–304, 2010.","ama":"Jösch MA, Schnell B, Raghu S, Reiff D, Borst A. ON and off pathways in Drosophila motion vision. <i>Nature</i>. 2010;468(7321):300-304. doi:<a href=\"https://doi.org/10.1038/nature09545\">10.1038/nature09545</a>","apa":"Jösch, M. A., Schnell, B., Raghu, S., Reiff, D., &#38; Borst, A. (2010). ON and off pathways in Drosophila motion vision. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature09545\">https://doi.org/10.1038/nature09545</a>","chicago":"Jösch, Maximilian A, Bettina Schnell, Shamprasad Raghu, Dierk Reiff, and Alexander Borst. “ON and off Pathways in Drosophila Motion Vision.” <i>Nature</i>. Nature Publishing Group, 2010. <a href=\"https://doi.org/10.1038/nature09545\">https://doi.org/10.1038/nature09545</a>.","ista":"Jösch MA, Schnell B, Raghu S, Reiff D, Borst A. 2010. ON and off pathways in Drosophila motion vision. Nature. 468(7321), 300–304."},"year":"2010","volume":468,"type":"journal_article","month":"11","day":"11","abstract":[{"text":"Motion vision is a major function of all visual systems, yet the underlying neural mechanisms and circuits are still elusive. In the lamina, the first optic neuropile of Drosophila melanogaster, photoreceptor signals split into five parallel pathways, L1-L5. Here we examine how these pathways contribute to visual motion detection by combining genetic block and reconstitution of neural activity in different lamina cell types with whole-cell recordings from downstream motion-sensitive neurons. We find reduced responses to moving gratings if L1 or L2 is blocked; however, reconstitution of photoreceptor input to only L1 or L2 results in wild-type responses. Thus, the first experiment indicates the necessity of both pathways, whereas the second indicates sufficiency of each single pathway. This contradiction can be explained by electrical coupling between L1 and L2, allowing for activation of both pathways even when only one of them receives photoreceptor input. A fundamental difference between the L1 pathway and the L2 pathway is uncovered when blocking L1 or L2 output while presenting moving edges of positive (ON) or negative (OFF) contrast polarity: blocking L1 eliminates the response to moving ON edges, whereas blocking L2 eliminates the response to moving OFF edges. Thus, similar to the segregation of photoreceptor signals in ON and OFF bipolar cell pathways in the vertebrate retina, photoreceptor signals segregate into ON-L1 and OFF-L2 channels in the lamina of Drosophila.","lang":"eng"}],"title":"ON and off pathways in Drosophila motion vision","publication":"Nature","page":"300 - 304","status":"public","date_updated":"2021-01-12T06:49:44Z","date_published":"2010-11-11T00:00:00Z","issue":"7321","date_created":"2018-12-11T11:51:14Z"},{"doi":"10.1152/jn.00950.2009","publisher":"American Physiological Society","author":[{"first_name":"Bettina","last_name":"Schnell","full_name":"Schnell, Bettina"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch","first_name":"Maximilian A"},{"full_name":"Förstner, Friedrich","first_name":"Friedrich","last_name":"Förstner"},{"first_name":"Shamprasad","last_name":"Raghu","full_name":"Raghu, Shamprasad"},{"full_name":"Otsuna, Hideo","first_name":"Hideo","last_name":"Otsuna"},{"first_name":"Kei","last_name":"Ito","full_name":"Ito, Kei"},{"full_name":"Borst, Alexander","last_name":"Borst","first_name":"Alexander"},{"full_name":"Reiff, Dierk","first_name":"Dierk","last_name":"Reiff"}],"publication_status":"published","extern":"1","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"1301","pmid":1,"abstract":[{"lang":"eng","text":"Motion vision is essential for navigating through the environment. Due to its genetic amenability, the fruit fly Drosophila has been serving for a lengthy period as a model organism for studying optomotor behavior as elicited by large-field horizontal motion. However, the neurons underlying the control of this behavior have not been studied in Drosophila so far. Here we report the first whole cell recordings from three cells of the horizontal system (HSN, HSE, and HSS) in the lobula plate of Drosophila. All three HS cells are tuned to large-field horizontal motion in a direction-selective way; they become excited by front-to-back motion and inhibited by back-to-front motion in the ipsilateral field of view. The response properties of HS cells such as contrast and velocity dependence are in accordance with the correlation-type model of motion detection. Neurobiotin injection suggests extensive coupling among ipsilateral HS cells and additional coupling to tangential cells that have their dendrites in the contralateral hemisphere of the brain. This connectivity scheme accounts for the complex layout of their receptive fields and explains their sensitivity both to ipsilateral and to contralateral motion. Thus the main response properties of Drosophila HS cells are strikingly similar to the responses of their counterparts in the blowfly Calliphora, although we found substantial differences with respect to their dendritic structure and connectivity. This long-awaited functional characterization of HS cells in Drosophila provides the basis for the future dissection of optomotor behavior and the underlying neural circuitry by combining genetics, physiology, and behavior."}],"title":"Processing of horizontal optic flow in three visual interneurons of the Drosophila brain","date_updated":"2021-01-12T06:49:44Z","date_published":"2010-03-01T00:00:00Z","issue":"3","citation":{"chicago":"Schnell, Bettina, Maximilian A Jösch, Friedrich Förstner, Shamprasad Raghu, Hideo Otsuna, Kei Ito, Alexander Borst, and Dierk Reiff. “Processing of Horizontal Optic Flow in Three Visual Interneurons of the Drosophila Brain.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2010. <a href=\"https://doi.org/10.1152/jn.00950.2009\">https://doi.org/10.1152/jn.00950.2009</a>.","ista":"Schnell B, Jösch MA, Förstner F, Raghu S, Otsuna H, Ito K, Borst A, Reiff D. 2010. Processing of horizontal optic flow in three visual interneurons of the Drosophila brain. Journal of Neurophysiology. 103(3), 1646–1657.","short":"B. Schnell, M.A. Jösch, F. Förstner, S. Raghu, H. Otsuna, K. Ito, A. Borst, D. Reiff, Journal of Neurophysiology 103 (2010) 1646–1657.","mla":"Schnell, Bettina, et al. “Processing of Horizontal Optic Flow in Three Visual Interneurons of the Drosophila Brain.” <i>Journal of Neurophysiology</i>, vol. 103, no. 3, American Physiological Society, 2010, pp. 1646–57, doi:<a href=\"https://doi.org/10.1152/jn.00950.2009\">10.1152/jn.00950.2009</a>.","ieee":"B. Schnell <i>et al.</i>, “Processing of horizontal optic flow in three visual interneurons of the Drosophila brain,” <i>Journal of Neurophysiology</i>, vol. 103, no. 3. American Physiological Society, pp. 1646–1657, 2010.","apa":"Schnell, B., Jösch, M. A., Förstner, F., Raghu, S., Otsuna, H., Ito, K., … Reiff, D. (2010). Processing of horizontal optic flow in three visual interneurons of the Drosophila brain. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.00950.2009\">https://doi.org/10.1152/jn.00950.2009</a>","ama":"Schnell B, Jösch MA, Förstner F, et al. Processing of horizontal optic flow in three visual interneurons of the Drosophila brain. <i>Journal of Neurophysiology</i>. 2010;103(3):1646-1657. doi:<a href=\"https://doi.org/10.1152/jn.00950.2009\">10.1152/jn.00950.2009</a>"},"oa_version":"None","volume":103,"year":"2010","type":"journal_article","publication_identifier":{"issn":[" 0022-3077"],"eissn":["1522-1598"]},"publist_id":"5971","external_id":{"pmid":["20089816"]},"intvolume":"       103","acknowledgement":"This work was supported by the Max-Planck-Society and by a Human Frontier Science Program grant to K. Ito, A. Borst, and B. Nelson.","article_processing_charge":"No","quality_controlled":"1","day":"01","publication":"Journal of Neurophysiology","page":"1646 - 1657","status":"public","date_created":"2018-12-11T11:51:14Z","language":[{"iso":"eng"}],"article_type":"original","month":"03"}]