[{"oa":1,"publication":"Heredity","language":[{"iso":"eng"}],"date_published":"2011-02-01T00:00:00Z","title":"Estimating linkage disequilibria","pmid":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Nature Publishing Group","external_id":{"pmid":["20502479"]},"scopus_import":1,"publication_status":"published","type":"journal_article","citation":{"chicago":"Barton, Nicholas H. “Estimating Linkage Disequilibria.” <i>Heredity</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/hdy.2010.67\">https://doi.org/10.1038/hdy.2010.67</a>.","ieee":"N. H. Barton, “Estimating linkage disequilibria,” <i>Heredity</i>, vol. 106, no. 2. Nature Publishing Group, pp. 205–206, 2011.","short":"N.H. Barton, Heredity 106 (2011) 205–206.","mla":"Barton, Nicholas H. “Estimating Linkage Disequilibria.” <i>Heredity</i>, vol. 106, no. 2, Nature Publishing Group, 2011, pp. 205–06, doi:<a href=\"https://doi.org/10.1038/hdy.2010.67\">10.1038/hdy.2010.67</a>.","apa":"Barton, N. H. (2011). Estimating linkage disequilibria. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2010.67\">https://doi.org/10.1038/hdy.2010.67</a>","ama":"Barton NH. Estimating linkage disequilibria. <i>Heredity</i>. 2011;106(2):205-206. doi:<a href=\"https://doi.org/10.1038/hdy.2010.67\">10.1038/hdy.2010.67</a>","ista":"Barton NH. 2011. Estimating linkage disequilibria. Heredity. 106(2), 205–206."},"page":"205 - 206","month":"02","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton"}],"status":"public","intvolume":"       106","date_updated":"2021-01-12T07:52:08Z","date_created":"2018-12-11T12:05:07Z","oa_version":"Submitted Version","publist_id":"2449","department":[{"_id":"NiBa"}],"doi":"10.1038/hdy.2010.67","volume":106,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3183869/","open_access":"1"}],"year":"2011","_id":"3778","issue":"2"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"Advanced stages of Scyllarus phyllosoma larvae were collected by demersal trawling during fishery research surveys in the western Mediterranean Sea in 2003–2005. Nucleotide sequence analysis of the mitochondrial 16S rDNA gene allowed the final-stage phyllosoma of Scyllarus arctus to be identified among these larvae. Its morphology is described and illustrated. This constitutes the second complete description of a Scyllaridae phyllosoma with its specific identity being validated by molecular techniques (the first was S. pygmaeus). These results also solved a long lasting taxonomic anomaly of several species assigned to the ancient genus Phyllosoma Leach, 1814. Detailed examination indicated that the final-stage phyllosoma of S. arctus shows closer affinities with the American scyllarid Scyllarus depressus or with the Australian Scyllarus sp. b (sensu Phillips et al., 1981) than to its sympatric species S. pygmaeus.","lang":"eng"}],"oa":1,"language":[{"iso":"eng"}],"year":"2011","author":[{"orcid":"0000-0002-0343-8329","last_name":"Palero","full_name":"Palero, Ferran","id":"3F0E2A22-F248-11E8-B48F-1D18A9856A87","first_name":"Ferran"},{"first_name":"Guillermo","full_name":"Guerao, Guillermo","last_name":"Guerao"},{"full_name":"Clark, Paul","last_name":"Clark","first_name":"Paul"},{"last_name":"Abello","full_name":"Abello, Pere","first_name":"Pere"}],"page":"485 - 492","oa_version":"Published Version","status":"public","type":"journal_article","quality_controlled":"1","publication_status":"published","scopus_import":1,"publisher":"Cambridge University Press","day":"01","date_published":"2011-03-01T00:00:00Z","title":"Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description","publication":"Journal of the Marine Biological Association of the United Kingdom","main_file_link":[{"open_access":"1","url":"https://digital.csic.es/bitstream/10261/32783/3/Palero_et_al_2011.pdf"}],"volume":91,"doi":"10.1017/S0025315410000287","issue":"2","_id":"3784","month":"03","article_type":"original","citation":{"ista":"Palero F, Guerao G, Clark P, Abello P. 2011. Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. Journal of the Marine Biological Association of the United Kingdom. 91(2), 485–492.","apa":"Palero, F., Guerao, G., Clark, P., &#38; Abello, P. (2011). Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. <i>Journal of the Marine Biological Association of the United Kingdom</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0025315410000287\">https://doi.org/10.1017/S0025315410000287</a>","ama":"Palero F, Guerao G, Clark P, Abello P. Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. <i>Journal of the Marine Biological Association of the United Kingdom</i>. 2011;91(2):485-492. doi:<a href=\"https://doi.org/10.1017/S0025315410000287\">10.1017/S0025315410000287</a>","ieee":"F. Palero, G. Guerao, P. Clark, and P. Abello, “Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description,” <i>Journal of the Marine Biological Association of the United Kingdom</i>, vol. 91, no. 2. Cambridge University Press, pp. 485–492, 2011.","short":"F. Palero, G. Guerao, P. Clark, P. Abello, Journal of the Marine Biological Association of the United Kingdom 91 (2011) 485–492.","mla":"Palero, Ferran, et al. “Scyllarus Arctus (Crustacea: Decapoda: Scyllaridae) Final Stage Phyllosoma Identified by DNA Analysis, with Morphological Description.” <i>Journal of the Marine Biological Association of the United Kingdom</i>, vol. 91, no. 2, Cambridge University Press, 2011, pp. 485–92, doi:<a href=\"https://doi.org/10.1017/S0025315410000287\">10.1017/S0025315410000287</a>.","chicago":"Palero, Ferran, Guillermo Guerao, Paul Clark, and Pere Abello. “Scyllarus Arctus (Crustacea: Decapoda: Scyllaridae) Final Stage Phyllosoma Identified by DNA Analysis, with Morphological Description.” <i>Journal of the Marine Biological Association of the United Kingdom</i>. Cambridge University Press, 2011. <a href=\"https://doi.org/10.1017/S0025315410000287\">https://doi.org/10.1017/S0025315410000287</a>."},"department":[{"_id":"NiBa"}],"publist_id":"2443","date_created":"2018-12-11T12:05:09Z","date_updated":"2021-01-12T07:52:10Z","intvolume":"        91"},{"intvolume":"      6570","date_created":"2018-12-11T12:05:13Z","date_updated":"2021-01-12T07:52:15Z","department":[{"_id":"HeEd"}],"publist_id":"2427","citation":{"ista":"Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.","apa":"Edelsbrunner, H., &#38; Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, &#38; A. Salomaa (Eds.), <i>Rainbow of Computer Science</i> (Vol. 6570, pp. 20–35). Springer. <a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">https://doi.org/10.1007/978-3-642-19391-0_2</a>","ama":"Edelsbrunner H, Kerber M. Covering and packing with spheres by diagonal distortion in R^n. In: Calude C, Rozenberg G, Salomaa A, eds. <i>Rainbow of Computer Science</i>. Vol 6570. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer; 2011:20-35. doi:<a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">10.1007/978-3-642-19391-0_2</a>","ieee":"H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal distortion in R^n,” in <i>Rainbow of Computer Science</i>, vol. 6570, C. Calude, G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.","short":"H. Edelsbrunner, M. Kerber, in:, C. Calude, G. Rozenberg, A. Salomaa (Eds.), Rainbow of Computer Science, Springer, 2011, pp. 20–35.","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” <i>Rainbow of Computer Science</i>, edited by Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:<a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">10.1007/978-3-642-19391-0_2</a>.","chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” In <i>Rainbow of Computer Science</i>, edited by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19391-0_2\">https://doi.org/10.1007/978-3-642-19391-0_2</a>."},"month":"05","_id":"3796","doi":"10.1007/978-3-642-19391-0_2","volume":6570,"file":[{"content_type":"application/pdf","checksum":"aaf22b4d7bd4277ffe8db532119cf474","file_id":"4640","relation":"main_file","date_created":"2018-12-12T10:07:42Z","date_updated":"2020-07-14T12:46:16Z","access_level":"open_access","file_size":436875,"file_name":"IST-2016-539-v1+1_2011-B-01-CoveringPacking.pdf","creator":"system"}],"publication":"Rainbow of Computer Science","date_published":"2011-05-03T00:00:00Z","title":"Covering and packing with spheres by diagonal distortion in R^n","day":"03","publisher":"Springer","type":"book_chapter","quality_controlled":"1","publication_status":"published","alternative_title":["LNCS"],"has_accepted_license":"1","status":"public","series_title":"Dedicated to Hermann Maurer on the Occasion of His 70th Birthday","oa_version":"Submitted Version","editor":[{"last_name":"Calude","full_name":"Calude, Cristian","first_name":"Cristian"},{"first_name":"Grzegorz","last_name":"Rozenberg","full_name":"Rozenberg, Grzegorz"},{"first_name":"Arto","last_name":"Salomaa","full_name":"Salomaa, Arto"}],"page":"20 - 35","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299"}],"year":"2011","pubrep_id":"539","language":[{"iso":"eng"}],"oa":1,"ddc":["000"],"abstract":[{"text":"We address the problem of covering ℝ n with congruent balls, while minimizing the number of balls that contain an average point. Considering the 1-parameter family of lattices defined by stretching or compressing the integer grid in diagonal direction, we give a closed formula for the covering density that depends on the distortion parameter. We observe that our family contains the thinnest lattice coverings in dimensions 2 to 5. We also consider the problem of packing congruent balls in ℝ n , for which we give a closed formula for the packing density as well. Again we observe that our family contains optimal configurations, this time densest packings in dimensions 2 and 3.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:16Z"},{"year":"2011","status":"public","oa_version":"Preprint","author":[{"full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev","orcid":"0000-0002-7183-5203","first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"J G","last_name":"Analytis","full_name":"Analytis, J G"},{"first_name":"J H","last_name":"Chu","full_name":"Chu, J H"},{"full_name":"Fisher, I R","last_name":"Fisher","first_name":"I R"},{"first_name":"A","full_name":"Kapitulnik, A","last_name":"Kapitulnik"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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. ","lang":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["1003.2233"]},"language":[{"iso":"eng"}],"oa":1,"extern":"1","_id":"386","issue":"4","doi":"10.1103/PhysRevB.84.041104","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1003.2233"}],"volume":84,"intvolume":"        84","publist_id":"7443","date_created":"2018-12-11T11:46:10Z","date_updated":"2021-01-12T07:52:44Z","citation":{"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>.","short":"Z. Alpichshev, J.G. Analytis, J.H. Chu, I.R. Fisher, A. Kapitulnik, Physical Review B - Condensed Matter and Materials Physics 84 (2011).","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.","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>","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)."},"article_type":"original","month":"07","publisher":"American Physical Society","type":"journal_article","quality_controlled":"1","publication_status":"published","arxiv":1,"publication":"Physical Review B - Condensed Matter and Materials Physics","day":"21","date_published":"2011-07-21T00:00:00Z","title":"STM imaging of a bound state along a step on the surface of the topological insulator Bi2Te3"},{"intvolume":"        31","status":"public","department":[{"_id":"PeJo"}],"publist_id":"7353","oa_version":"Submitted Version","date_updated":"2021-01-12T08:00:49Z","date_created":"2018-12-11T11:46:39Z","citation":{"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>","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>","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>.","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."},"author":[{"full_name":"Vyleta, Nicholas","last_name":"Vyleta","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas"},{"first_name":"Stephen","last_name":"Smith","full_name":"Smith, Stephen"}],"month":"03","page":"4593 - 4606","year":"2011","_id":"469","issue":"12","doi":"10.1523/JNEUROSCI.6398-10.2011","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/"}],"volume":31,"publication":"European Journal of Neuroscience","language":[{"iso":"eng"}],"day":"23","date_published":"2011-03-23T00:00:00Z","title":"Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor","oa":1,"publisher":"Wiley-Blackwell","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"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. ","lang":"eng"}],"publication_status":"published","quality_controlled":"1","type":"journal_article","scopus_import":1},{"year":"2011","pubrep_id":"947","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"},"status":"public","oa_version":"Published Version","author":[{"full_name":"Schlögl, Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vidaurre, Carmen","last_name":"Vidaurre","first_name":"Carmen"},{"first_name":"Tilmann","last_name":"Sander","full_name":"Sander, Tilmann"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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. "}],"file_date_updated":"2020-07-14T12:46:35Z","article_number":"935364","language":[{"iso":"eng"}],"oa":1,"ddc":["005"],"_id":"490","doi":"10.1155/2011/935364","file":[{"creator":"system","file_size":2863551,"file_name":"IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf","file_id":"4642","checksum":"8263bbf255171f2054f43f3db5f53b6e","date_updated":"2020-07-14T12:46:35Z","access_level":"open_access","date_created":"2018-12-12T10:07:44Z","relation":"main_file","content_type":"application/pdf"}],"volume":2011,"intvolume":"      2011","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"publist_id":"7330","date_created":"2018-12-11T11:46:45Z","date_updated":"2021-01-12T08:01:02Z","citation":{"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>","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>","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.","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>.","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.","short":"A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience 2011 (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>."},"month":"01","publisher":"Hindawi Publishing Corporation","publication_status":"published","type":"journal_article","scopus_import":1,"quality_controlled":"1","has_accepted_license":"1","publication":"Computational Intelligence and Neuroscience","day":"01","title":"BioSig: The free and open source software library for biomedical signal processing","date_published":"2011-01-01T00:00:00Z"},{"publisher":"Wiley-Blackwell","quality_controlled":"1","scopus_import":1,"type":"journal_article","publication_status":"published","publication":"EMBO Journal","day":"19","date_published":"2011-10-19T00:00:00Z","title":"CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells","doi":"10.1038/emboj.2011.301","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/"}],"volume":30,"_id":"518","issue":"20","citation":{"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.","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>.","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.","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.","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>"},"article_type":"original","month":"10","intvolume":"        30","department":[{"_id":"MiSi"}],"publist_id":"7301","date_created":"2018-12-11T11:46:55Z","date_updated":"2021-01-12T08:01:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"external_id":{"pmid":["21857646"]},"oa":1,"language":[{"iso":"eng"}],"pmid":1,"year":"2011","author":[{"last_name":"Schraivogel","full_name":"Schraivogel, Daniel","first_name":"Daniel"},{"first_name":"Lasse","last_name":"Weinmann","full_name":"Weinmann, Lasse"},{"last_name":"Beier","full_name":"Beier, Dagmar","first_name":"Dagmar"},{"first_name":"Ghazaleh","full_name":"Tabatabai, Ghazaleh","last_name":"Tabatabai"},{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","full_name":"Eichner, Alexander","last_name":"Eichner"},{"first_name":"Jia","full_name":"Zhu, Jia","last_name":"Zhu"},{"first_name":"Martina","full_name":"Anton, Martina","last_name":"Anton"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179"},{"last_name":"Weller","full_name":"Weller, Michael","first_name":"Michael"},{"first_name":"Christoph","full_name":"Beier, Christoph","last_name":"Beier"},{"last_name":"Meister","full_name":"Meister, Gunter","first_name":"Gunter"}],"page":"4309 - 4322","status":"public","oa_version":"Submitted Version"},{"publisher":"Springer","publication_status":"published","scopus_import":1,"quality_controlled":"1","type":"journal_article","publication":"Formal Methods in System Design","day":"01","date_published":"2011-12-01T00:00:00Z","title":"Verification of STM on relaxed memory models","_id":"531","issue":"3","doi":"10.1007/s10703-011-0131-3","main_file_link":[{"url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf","open_access":"1"}],"volume":39,"intvolume":"        39","department":[{"_id":"ToHe"}],"publist_id":"7288","date_updated":"2021-01-12T08:01:27Z","date_created":"2018-12-11T11:47:00Z","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>.","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.","short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.","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>.","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>","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331."},"article_type":"original","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"oa":1,"ddc":["000"],"year":"2011","status":"public","oa_version":"Published Version","author":[{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Singh","full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"page":"297 - 331"},{"year":"2011","pubrep_id":"15","publication_identifier":{"issn":["2664-1690"]},"status":"public","oa_version":"Published Version","related_material":{"record":[{"status":"public","relation":"later_version","id":"3165"}]},"page":"20","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"}],"article_processing_charge":"No","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"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","file_date_updated":"2020-07-14T12:46:39Z","language":[{"iso":"eng"}],"oa":1,"ddc":["000","004"],"_id":"5379","doi":"10.15479/AT:IST-2011-0009","file":[{"file_size":388665,"file_name":"IST-2011-0009_IST-2011-0009.pdf","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:53:43Z","relation":"main_file","access_level":"open_access","file_id":"5504","checksum":"0b354264229045d982332fd2cb5b9a26"}],"date_created":"2018-12-12T11:38:59Z","date_updated":"2023-02-23T11:15:12Z","department":[{"_id":"KrCh"}],"citation":{"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>.","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>.","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.","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>","ista":"Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p."},"month":"07","publisher":"IST Austria","publication_status":"published","type":"technical_report","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"date_published":"2011-07-11T00:00:00Z","title":"An O(n2) time algorithm for alternating Büchi games","day":"11"},{"_id":"5380","year":"2011","pubrep_id":"16","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2011-0008","file":[{"date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:54:22Z","access_level":"open_access","relation":"main_file","file_id":"5544","checksum":"0fd38186409be819a911c4990fa79d1f","content_type":"application/pdf","creator":"system","file_size":500399,"file_name":"IST-2011-0008_IST-2011-0008.pdf"}],"status":"public","date_updated":"2023-02-23T11:22:53Z","date_created":"2018-12-12T11:39:00Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","related_material":{"record":[{"id":"3338","relation":"later_version","status":"public"}]},"citation":{"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>.","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.","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>.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.","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>","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>"},"page":"53","month":"07","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"abstract":[{"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.","lang":"eng"}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","publication_status":"published","file_date_updated":"2020-07-14T12:46:39Z","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","language":[{"iso":"eng"}],"title":"Bounded rationality in concurrent parity games","date_published":"2011-07-11T00:00:00Z","day":"11","oa":1,"ddc":["000"]},{"file":[{"creator":"system","file_name":"IST-2011-0007_IST-2011-0007.pdf","file_size":574055,"checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","file_id":"5488","date_created":"2018-12-12T11:53:27Z","access_level":"open_access","date_updated":"2020-07-14T12:46:39Z","relation":"main_file","content_type":"application/pdf"}],"publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2011-0007","pubrep_id":"17","_id":"5381","year":"2011","page":"43","month":"07","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"related_material":{"record":[{"id":"1903","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"2211"},{"id":"2955","status":"public","relation":"later_version"}]},"citation":{"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>.","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.","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>","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>","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p."},"date_created":"2018-12-12T11:39:00Z","date_updated":"2023-02-23T11:05:48Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","status":"public","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:39Z","publication_status":"published","type":"technical_report","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."}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"oa":1,"date_published":"2011-07-05T00:00:00Z","title":"Partial-observation stochastic games: How to win when belief fails","day":"05","language":[{"iso":"eng"}]},{"publication_status":"published","type":"technical_report","abstract":[{"lang":"eng","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)."}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:40Z","title":"Robustness of structurally equivalent concurrent parity games","date_published":"2011-06-27T00:00:00Z","day":"27","language":[{"iso":"eng"}],"ddc":["000","005"],"oa":1,"pubrep_id":"18","year":"2011","_id":"5382","file":[{"content_type":"application/pdf","date_created":"2018-12-12T11:54:24Z","access_level":"open_access","date_updated":"2020-07-14T12:46:40Z","relation":"main_file","checksum":"1322b652d6ab07eb5248298a3f91c1cf","file_id":"5546","file_size":335997,"file_name":"IST-2011-0006_IST-2011-0006.pdf","creator":"system"}],"publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2011-0006","date_created":"2018-12-12T11:39:00Z","date_updated":"2023-02-23T11:23:01Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","status":"public","month":"06","page":"18","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"related_material":{"record":[{"id":"3341","relation":"later_version","status":"public"}]},"citation":{"ieee":"K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria, 2011.","short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, 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>.","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.","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>"}},{"ddc":["000","006"],"oa":1,"date_published":"2011-04-26T00:00:00Z","title":"On an efficient decision procedure for imperative tree data structures","day":"26","language":[{"iso":"eng"}],"has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:40Z","publication_status":"published","type":"technical_report","abstract":[{"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.","lang":"eng"}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"25","month":"04","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Wies, Thomas","last_name":"Wies"},{"last_name":"Muñiz","full_name":"Muñiz, Marco","first_name":"Marco"},{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"}],"related_material":{"record":[{"id":"3323","status":"public","relation":"later_version"}]},"citation":{"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>","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","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>.","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.","ieee":"T. Wies, M. Muñiz, and V. Kuncak, <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria, 2011."},"date_updated":"2023-02-23T11:22:16Z","date_created":"2018-12-12T11:39:01Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","status":"public","file":[{"file_name":"IST-2011-0005_IST-2011-0005.pdf","file_size":619053,"creator":"system","content_type":"application/pdf","file_id":"5462","checksum":"b20029184c4a819c5f4466a4a3d238b5","relation":"main_file","date_updated":"2020-07-14T12:46:40Z","access_level":"open_access","date_created":"2018-12-12T11:53:01Z"}],"publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2011-0005","pubrep_id":"19","_id":"5383","year":"2011"},{"file_date_updated":"2020-07-14T12:46:40Z","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","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."}],"type":"technical_report","publication_status":"published","oa":1,"ddc":["000","005"],"language":[{"iso":"eng"}],"day":"11","date_published":"2011-04-11T00:00:00Z","title":"Decidable problems for probabilistic automata on infinite words","doi":"10.15479/AT:IST-2011-0004","publication_identifier":{"issn":["2664-1690"]},"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:40Z","date_created":"2018-12-12T11:54:23Z","access_level":"open_access","relation":"main_file","checksum":"f5a0f664fadc335990f5fcf138df19f1","file_id":"5545","file_size":570827,"file_name":"IST-2011-004_IST-2011-0004.pdf","creator":"system"}],"_id":"5384","year":"2011","pubrep_id":"20","citation":{"ista":"Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.","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>","ieee":"K. Chatterjee and M. Tracol, <i>Decidable problems for probabilistic automata on infinite words</i>. 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>.","short":"K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.","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>."},"related_material":{"record":[{"status":"public","relation":"later_version","id":"2957"}]},"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu","full_name":"Tracol, Mathieu","last_name":"Tracol"}],"month":"04","page":"30","status":"public","oa_version":"Published Version","department":[{"_id":"KrCh"}],"date_created":"2018-12-12T11:39:01Z","date_updated":"2023-02-23T11:05:53Z"},{"month":"04","citation":{"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>","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>.","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.","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>."},"date_created":"2018-12-12T11:39:02Z","date_updated":"2023-02-23T11:23:41Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:41Z","relation":"main_file","date_created":"2018-12-12T11:53:00Z","file_id":"5461","checksum":"8491d0d48c4911620ecd5350b413c11e","content_type":"application/pdf","creator":"system","file_size":366281,"file_name":"IST-2011-0003_IST-2011-0003.pdf"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.15479/AT:IST-2011-0003","_id":"5385","date_published":"2011-04-04T00:00:00Z","title":"Temporal specifications with accumulative values","day":"04","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","publication_status":"published","type":"technical_report","publisher":"IST Austria","page":"14","author":[{"last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"2038"},{"id":"3356","relation":"later_version","status":"public"}]},"oa_version":"Published Version","status":"public","ec_funded":1,"publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"21","year":"2011","ddc":["000","004"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:41Z","abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2011-0002","file":[{"content_type":"application/pdf","file_id":"5495","checksum":"ad64c2add5fe2ad10e9d5c669f3f9526","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:34Z","date_updated":"2020-07-14T12:46:41Z","file_size":26390601,"file_name":"IST-2011-0002_IST-2011-0002.pdf","creator":"system"}],"_id":"5386","year":"2011","pubrep_id":"22","related_material":{"record":[{"id":"3336","status":"public","relation":"later_version"}]},"citation":{"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>.","short":"C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random Field Image Segmentation, IST Austria, 2011.","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>.","ista":"Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation, IST Austria, 69p.","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>","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>"},"page":"69","month":"03","author":[{"last_name":"Chen","full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao"},{"last_name":"Freedman","full_name":"Freedman, Daniel","first_name":"Daniel"},{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"status":"public","date_updated":"2023-02-23T11:22:48Z","date_created":"2018-12-12T11:39:02Z","department":[{"_id":"ChLa"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:41Z","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"abstract":[{"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.","lang":"eng"}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"technical_report","oa":1,"ddc":["000"],"language":[{"iso":"eng"}],"date_published":"2011-03-28T00:00:00Z","title":"Enforcing topological constraints in random field image segmentation","day":"28"},{"ddc":["570"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Many species have morphologically and genetically differentiated sex chromosomes, such as the XY pair of mammals. Y chromosomes are often highly degenerated and carry few functional genes, so that XY males have only one copy of most Xlinked genes (whereas females have two). As a result, chromosome-wide mechanisms of dosage compensation, such as the mammalian X-inactivation, often evolve to reestablish expression balance. A similar phenomenon is expected in femaleheterogametic species, where ZW females should suffer from imbalances due to W-chromosome degeneration. However, no global dosage compensation mechanisms have been detected in the two independent ZW systems that have been studied systematically (birds and silkworm), leading to the suggestion that lack of global dosage compensation may be a general feature of female-heterogametic species. However, analyses of other independently evolved ZW systems are required to test if this is the case. In this study, we use published genomic and expression data to test for the presence of global dosage compensation in Schistosoma mansoni, a trematode parasite that causes schistosomiasis in humans. We find that Z-linked expression is reduced relative to autosomal expression in females but not males, consistent with incomplete or localized dosage compensation. This gives further support to the theory that female-heterogametic species may not require global mechanisms of dosage compensation.","lang":"eng"}],"author":[{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","last_name":"Vicoso"},{"last_name":"Bachtrog","full_name":"Bachtrog, Doris","first_name":"Doris"}],"page":"230 - 235","oa_version":"Published Version","status":"public","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)"},"year":"2011","day":"11","license":"https://creativecommons.org/licenses/by-nc/4.0/","date_published":"2011-02-11T00:00:00Z","title":"Lack of global dosage compensation in Schistosoma mansoni, a female-heterogametic parasite","publication":"Genome Biology and Evolution","has_accepted_license":"1","type":"journal_article","quality_controlled":"1","publication_status":"published","publisher":"Oxford University Press","month":"02","citation":{"short":"B. Vicoso, D. Bachtrog, Genome Biology and Evolution 3 (2011) 230–235.","mla":"Vicoso, Beatriz, and Doris Bachtrog. “Lack of Global Dosage Compensation in Schistosoma Mansoni, a Female-Heterogametic Parasite.” <i>Genome Biology and Evolution</i>, vol. 3, no. 1, Oxford University Press, 2011, pp. 230–35, doi:<a href=\"https://doi.org/10.1093/gbe/evr010\">10.1093/gbe/evr010</a>.","ieee":"B. Vicoso and D. Bachtrog, “Lack of global dosage compensation in Schistosoma mansoni, a female-heterogametic parasite,” <i>Genome Biology and Evolution</i>, vol. 3, no. 1. Oxford University Press, pp. 230–235, 2011.","chicago":"Vicoso, Beatriz, and Doris Bachtrog. “Lack of Global Dosage Compensation in Schistosoma Mansoni, a Female-Heterogametic Parasite.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2011. <a href=\"https://doi.org/10.1093/gbe/evr010\">https://doi.org/10.1093/gbe/evr010</a>.","ista":"Vicoso B, Bachtrog D. 2011. Lack of global dosage compensation in Schistosoma mansoni, a female-heterogametic parasite. Genome Biology and Evolution. 3(1), 230–235.","ama":"Vicoso B, Bachtrog D. Lack of global dosage compensation in Schistosoma mansoni, a female-heterogametic parasite. <i>Genome Biology and Evolution</i>. 2011;3(1):230-235. doi:<a href=\"https://doi.org/10.1093/gbe/evr010\">10.1093/gbe/evr010</a>","apa":"Vicoso, B., &#38; Bachtrog, D. (2011). Lack of global dosage compensation in Schistosoma mansoni, a female-heterogametic parasite. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evr010\">https://doi.org/10.1093/gbe/evr010</a>"},"publist_id":"4966","date_created":"2018-12-11T11:55:33Z","date_updated":"2021-01-12T06:55:08Z","intvolume":"         3","file":[{"file_name":"2011_GBE_Vicoso.pdf","file_size":212547,"creator":"dernst","content_type":"application/pdf","file_id":"6395","checksum":"7855c134436e4f6a13d63b6606d7e8dd","date_updated":"2020-07-14T12:45:27Z","relation":"main_file","access_level":"open_access","date_created":"2019-05-10T07:41:28Z"}],"volume":3,"doi":"10.1093/gbe/evr010","issue":"1","_id":"2072","extern":"1"},{"publist_id":"4918","date_created":"2018-12-11T11:55:48Z","date_updated":"2021-01-12T06:55:24Z","intvolume":"        80","status":"public","author":[{"last_name":"Maas","full_name":"Jan Maas","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Van Neerven, Jan","last_name":"Van Neerven","first_name":"Jan"}],"page":"463 - 477","month":"06","citation":{"ista":"Maas J, Van Neerven J. 2011.Gradient estimates and domain identification for analytic Ornstein-Uhlenbeck operators. In: Parabolic Problems. vol. 80, 463–477.","ama":"Maas J, Van Neerven J. Gradient estimates and domain identification for analytic Ornstein-Uhlenbeck operators. In: <i>Parabolic Problems</i>. Vol 80. Birkhäuser; 2011:463-477. doi:<a href=\"https://doi.org/10.1007/978-3-0348-0075-4_24\">10.1007/978-3-0348-0075-4_24</a>","apa":"Maas, J., &#38; Van Neerven, J. (2011). Gradient estimates and domain identification for analytic Ornstein-Uhlenbeck operators. In <i>Parabolic Problems</i> (Vol. 80, pp. 463–477). Birkhäuser. <a href=\"https://doi.org/10.1007/978-3-0348-0075-4_24\">https://doi.org/10.1007/978-3-0348-0075-4_24</a>","short":"J. Maas, J. Van Neerven, in:, Parabolic Problems, Birkhäuser, 2011, pp. 463–477.","mla":"Maas, Jan, and Jan Van Neerven. “Gradient Estimates and Domain Identification for Analytic Ornstein-Uhlenbeck Operators.” <i>Parabolic Problems</i>, vol. 80, Birkhäuser, 2011, pp. 463–77, doi:<a href=\"https://doi.org/10.1007/978-3-0348-0075-4_24\">10.1007/978-3-0348-0075-4_24</a>.","ieee":"J. Maas and J. Van Neerven, “Gradient estimates and domain identification for analytic Ornstein-Uhlenbeck operators,” in <i>Parabolic Problems</i>, vol. 80, Birkhäuser, 2011, pp. 463–477.","chicago":"Maas, Jan, and Jan Van Neerven. “Gradient Estimates and Domain Identification for Analytic Ornstein-Uhlenbeck Operators.” In <i>Parabolic Problems</i>, 80:463–77. Birkhäuser, 2011. <a href=\"https://doi.org/10.1007/978-3-0348-0075-4_24\">https://doi.org/10.1007/978-3-0348-0075-4_24</a>."},"acknowledgement":"The authors are supported by VIDI subsidy 639.032.201 (JM) and VICI subsidy 639.033.604 (JvN) of the Netherlands Organisation for Scientific Research (NWO). ","year":"2011","_id":"2116","extern":1,"main_file_link":[{"url":"http://arxiv.org/abs/0911.4336 ","open_access":"1"}],"volume":80,"doi":"10.1007/978-3-0348-0075-4_24","day":"10","title":"Gradient estimates and domain identification for analytic Ornstein-Uhlenbeck operators","date_published":"2011-06-10T00:00:00Z","publication":"Parabolic Problems","oa":1,"quality_controlled":0,"publication_status":"published","type":"book_chapter","publisher":"Birkhäuser","abstract":[{"text":"Let P be the Ornstein-Uhlenbeck semigroup associated with the stochastic Cauchy problem  dU(t)=AU(t)dt+dWH(t), where A is the generator of a C 0-semigroup S on a Banach space E, H is a Hilbert subspace of E, and W H is an H-cylindrical Brownian motion. Assuming that S restricts to a C 0-semigroup on H, we obtain L p -bounds for D H P(t). We show that if P is analytic, then the invariance assumption is fulfilled. As an application we determine the L p -domain of the generator of P explicitly in the case where S restricts to a C 0-semigroup on H which is similar to an analytic contraction semigroup. The results are applied to the 1D stochastic heat equation driven by additive space-time white noise.","lang":"eng"}]},{"citation":{"chicago":"Maas, Jan, Jan Van Neerven, and Pierre Portal. “Conical Square Functions and Non-Tangential Maximal Functions with Respect to the Gaussian Measure.” <i>Publicacions Matemàtiques</i>. Universitat Autònoma de Barcelona, Departament de Matemàtique, 2011. <a href=\"https://doi.org/10.5565/PUBLMAT_55211_03  \">https://doi.org/10.5565/PUBLMAT_55211_03  </a>.","ieee":"J. Maas, J. Van Neerven, and P. Portal, “Conical square functions and non-tangential maximal functions with respect to the Gaussian measure,” <i>Publicacions Matemàtiques</i>, vol. 55, no. 2. Universitat Autònoma de Barcelona, Departament de Matemàtique, pp. 313–341, 2011.","short":"J. Maas, J. Van Neerven, P. Portal, Publicacions Matemàtiques 55 (2011) 313–341.","mla":"Maas, Jan, et al. “Conical Square Functions and Non-Tangential Maximal Functions with Respect to the Gaussian Measure.” <i>Publicacions Matemàtiques</i>, vol. 55, no. 2, Universitat Autònoma de Barcelona, Departament de Matemàtique, 2011, pp. 313–41, doi:<a href=\"https://doi.org/10.5565/PUBLMAT_55211_03  \">10.5565/PUBLMAT_55211_03  </a>.","apa":"Maas, J., Van Neerven, J., &#38; Portal, P. (2011). Conical square functions and non-tangential maximal functions with respect to the Gaussian measure. <i>Publicacions Matemàtiques</i>. Universitat Autònoma de Barcelona, Departament de Matemàtique. <a href=\"https://doi.org/10.5565/PUBLMAT_55211_03  \">https://doi.org/10.5565/PUBLMAT_55211_03  </a>","ama":"Maas J, Van Neerven J, Portal P. Conical square functions and non-tangential maximal functions with respect to the Gaussian measure. <i>Publicacions Matemàtiques</i>. 2011;55(2):313-341. doi:<a href=\"https://doi.org/10.5565/PUBLMAT_55211_03  \">10.5565/PUBLMAT_55211_03  </a>","ista":"Maas J, Van Neerven J, Portal P. 2011. Conical square functions and non-tangential maximal functions with respect to the Gaussian measure. Publicacions Matemàtiques. 55(2), 313–341."},"acknowledgement":"The first named author is supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). The second named author is supported by VICI subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO","author":[{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Maas","full_name":"Jan Maas","orcid":"0000-0002-0845-1338"},{"last_name":"Van Neerven","full_name":"van Neerven, Jan M","first_name":"Jan"},{"first_name":"Pierre","full_name":"Portal, Pierre","last_name":"Portal"}],"month":"07","page":"313 - 341","intvolume":"        55","status":"public","publist_id":"4910","date_updated":"2021-01-12T06:55:26Z","date_created":"2018-12-11T11:55:50Z","doi":"10.5565/PUBLMAT_55211_03\t ","volume":55,"main_file_link":[{"url":"http://arxiv.org/abs/1003.4092","open_access":"1"}],"_id":"2122","extern":1,"year":"2011","issue":"2","oa":1,"publication":"Publicacions Matemàtiques","day":"01","title":"Conical square functions and non-tangential maximal functions with respect to the Gaussian measure","date_published":"2011-07-01T00:00:00Z","publisher":"Universitat Autònoma de Barcelona, Departament de Matemàtique","abstract":[{"text":"We study, in L1(R̃n; γ) with respect to the gaussian measure, non- tangential maximal functions and conical square functions associ- ated with the Ornstein-Uhlenbeck operator by developing a set of techniques which allow us, to some extent, to compensate for the non-doubling character of the gaussian measure. The main result asserts that conical square functions can be controlled in L1-norm by non-tangential maximal functions. Along the way we prove a change of aperture result for the latter. This complements recent results on gaussian Hardy spaces due to Mauceri and Meda.","lang":"eng"}],"type":"journal_article","publication_status":"published","quality_controlled":0},{"language":[{"iso":"eng"}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We prove a Trotter product formula for gradient flows in metric spaces. This result is applied to establish convergence in the L 2-Wasserstein metric of the splitting method for some Fokker-Planck equations and porous medium type equations perturbed by a potential."}],"status":"public","oa_version":"None","related_material":{"link":[{"url":"https://doi.org/10.1007/s00028-012-0173-z","relation":"erratum"}]},"author":[{"first_name":"Philippe","last_name":"Clément","full_name":"Clément, Philippe"},{"full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"page":"405 - 427","year":"2011","publication":"Journal of Evolution Equations","day":"21","title":"A Trotter product formula for gradient flows in metric spaces","date_published":"2011-01-21T00:00:00Z","publisher":"Birkhäuser","type":"journal_article","publication_status":"published","intvolume":"        11","publist_id":"4911","date_created":"2018-12-11T11:55:51Z","date_updated":"2021-11-16T08:05:46Z","citation":{"ieee":"P. Clément and J. Maas, “A Trotter product formula for gradient flows in metric spaces,” <i>Journal of Evolution Equations</i>, vol. 11, no. 2. Birkhäuser, pp. 405–427, 2011.","short":"P. Clément, J. Maas, Journal of Evolution Equations 11 (2011) 405–427.","mla":"Clément, Philippe, and Jan Maas. “A Trotter Product Formula for Gradient Flows in Metric Spaces.” <i>Journal of Evolution Equations</i>, vol. 11, no. 2, Birkhäuser, 2011, pp. 405–27, doi:<a href=\"https://doi.org/10.1007/s00028-010-0096-5\">10.1007/s00028-010-0096-5</a>.","chicago":"Clément, Philippe, and Jan Maas. “A Trotter Product Formula for Gradient Flows in Metric Spaces.” <i>Journal of Evolution Equations</i>. Birkhäuser, 2011. <a href=\"https://doi.org/10.1007/s00028-010-0096-5\">https://doi.org/10.1007/s00028-010-0096-5</a>.","ista":"Clément P, Maas J. 2011. A Trotter product formula for gradient flows in metric spaces. Journal of Evolution Equations. 11(2), 405–427.","apa":"Clément, P., &#38; Maas, J. (2011). A Trotter product formula for gradient flows in metric spaces. <i>Journal of Evolution Equations</i>. Birkhäuser. <a href=\"https://doi.org/10.1007/s00028-010-0096-5\">https://doi.org/10.1007/s00028-010-0096-5</a>","ama":"Clément P, Maas J. A Trotter product formula for gradient flows in metric spaces. <i>Journal of Evolution Equations</i>. 2011;11(2):405-427. doi:<a href=\"https://doi.org/10.1007/s00028-010-0096-5\">10.1007/s00028-010-0096-5</a>"},"acknowledgement":"The second named author is supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","month":"01","extern":"1","_id":"2123","issue":"2","doi":"10.1007/s00028-010-0096-5","volume":11,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1005.0998"}]}]