[{"publication_status":"published","publisher":"American Association for the Advancement of Science","department":[{"_id":"MiSi"}],"month":"11","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"}],"quality_controlled":"1","oa_version":"None","date_created":"2018-12-11T11:46:46Z","scopus_import":1,"year":"2011","_id":"491","doi":"10.1126/scisignal.2002617","date_published":"2011-11-08T00:00:00Z","language":[{"iso":"eng"}],"status":"public","title":"Setting the clock for recirculating lymphocytes","article_number":"pe43","issue":"198","intvolume":"         4","date_updated":"2021-01-12T08:01:02Z","author":[{"last_name":"Eichner","first_name":"Alexander","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt"}],"citation":{"short":"A. Eichner, M.K. Sixt, Science Signaling 4 (2011).","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.","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>.","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>","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.","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>"},"type":"journal_article","volume":4,"day":"08","publist_id":"7329","publication":"Science Signaling","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/","open_access":"1"}],"publisher":"Wiley-Blackwell","department":[{"_id":"MiSi"}],"month":"10","scopus_import":1,"page":"4309 - 4322","intvolume":"        30","doi":"10.1038/emboj.2011.301","date_published":"2011-10-19T00:00:00Z","language":[{"iso":"eng"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":30,"quality_controlled":"1","oa_version":"Submitted Version","article_processing_charge":"No","article_type":"original","publication_status":"published","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"}],"date_created":"2018-12-11T11:46:55Z","pmid":1,"year":"2011","_id":"518","issue":"20","title":"CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells","external_id":{"pmid":["21857646"]},"day":"19","publist_id":"7301","publication":"EMBO Journal","oa":1,"date_updated":"2021-01-12T08:01:19Z","citation":{"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.","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."},"author":[{"first_name":"Daniel","last_name":"Schraivogel","full_name":"Schraivogel, Daniel"},{"full_name":"Weinmann, Lasse","last_name":"Weinmann","first_name":"Lasse"},{"full_name":"Beier, Dagmar","last_name":"Beier","first_name":"Dagmar"},{"full_name":"Tabatabai, Ghazaleh","last_name":"Tabatabai","first_name":"Ghazaleh"},{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander","first_name":"Alexander","last_name":"Eichner"},{"first_name":"Jia","last_name":"Zhu","full_name":"Zhu, Jia"},{"first_name":"Martina","last_name":"Anton","full_name":"Anton, Martina"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt"},{"full_name":"Weller, Michael","last_name":"Weller","first_name":"Michael"},{"last_name":"Beier","first_name":"Christoph","full_name":"Beier, Christoph"},{"full_name":"Meister, Gunter","first_name":"Gunter","last_name":"Meister"}]},{"citation":{"short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 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.","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>","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>.","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331.","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>."},"author":[{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu"}],"date_updated":"2021-01-12T08:01:27Z","day":"01","publist_id":"7288","publication":"Formal Methods in System Design","oa":1,"title":"Verification of STM on relaxed memory models","issue":"3","date_created":"2018-12-11T11:47:00Z","year":"2011","_id":"531","publication_status":"published","article_type":"original","abstract":[{"lang":"eng","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."}],"quality_controlled":"1","oa_version":"Published Version","article_processing_charge":"No","type":"journal_article","volume":39,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s10703-011-0131-3","date_published":"2011-12-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","intvolume":"        39","ddc":["000"],"page":"297 - 331","scopus_import":1,"department":[{"_id":"ToHe"}],"publisher":"Springer","month":"12","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf"}]},{"month":"07","publisher":"IST Austria","department":[{"_id":"KrCh"}],"page":"20","status":"public","language":[{"iso":"eng"}],"date_published":"2011-07-11T00:00:00Z","doi":"10.15479/AT:IST-2011-0009","ddc":["000","004"],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","pubrep_id":"15","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","file_date_updated":"2020-07-14T12:46:39Z","abstract":[{"lang":"eng","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."}],"file":[{"date_updated":"2020-07-14T12:46:39Z","file_name":"IST-2011-0009_IST-2011-0009.pdf","file_id":"5504","relation":"main_file","date_created":"2018-12-12T11:53:43Z","access_level":"open_access","creator":"system","checksum":"0b354264229045d982332fd2cb5b9a26","content_type":"application/pdf","file_size":388665}],"related_material":{"record":[{"status":"public","id":"3165","relation":"later_version"}]},"publication_status":"published","article_processing_charge":"No","oa_version":"Published Version","_id":"5379","year":"2011","date_created":"2018-12-12T11:38:59Z","title":"An O(n2) time algorithm for alternating Büchi games","has_accepted_license":"1","date_updated":"2023-02-23T11:15:12Z","citation":{"short":"K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, 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>","ieee":"K. Chatterjee and M. H. Henzinger, <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria, 2011.","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>","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>.","ista":"Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.","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>."},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}],"oa":1,"publication_identifier":{"issn":["2664-1690"]},"day":"11"},{"type":"technical_report","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-02-23T11:22:53Z","citation":{"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.","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>.","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>","ieee":"K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011.","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011."},"pubrep_id":"16","oa":1,"publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11","file_date_updated":"2020-07-14T12:46:39Z","status":"public","title":"Bounded rationality in concurrent parity games","language":[{"iso":"eng"}],"date_published":"2011-07-11T00:00:00Z","doi":"10.15479/AT:IST-2011-0008","ddc":["000"],"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","page":"53","_id":"5380","year":"2011","date_created":"2018-12-12T11:39:00Z","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."}],"file":[{"file_size":500399,"content_type":"application/pdf","checksum":"0fd38186409be819a911c4990fa79d1f","creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:54:22Z","file_id":"5544","file_name":"IST-2011-0008_IST-2011-0008.pdf","date_updated":"2020-07-14T12:46:39Z"}],"month":"07","department":[{"_id":"KrCh"}],"publication_status":"published","publisher":"IST Austria","related_material":{"record":[{"id":"3338","status":"public","relation":"later_version"}]},"oa_version":"Published Version"},{"pubrep_id":"17","type":"technical_report","date_updated":"2023-02-23T11:05:48Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"citation":{"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>.","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. 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>","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.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011."},"publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"05","file_date_updated":"2020-07-14T12:46:39Z","language":[{"iso":"eng"}],"title":"Partial-observation stochastic games: How to win when belief fails","status":"public","doi":"10.15479/AT:IST-2011-0007","date_published":"2011-07-05T00:00:00Z","alternative_title":["IST Austria Technical Report"],"ddc":["000","005"],"has_accepted_license":"1","page":"43","year":"2011","_id":"5381","date_created":"2018-12-12T11:39:00Z","file":[{"creator":"system","access_level":"open_access","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","file_size":574055,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:39Z","file_name":"IST-2011-0007_IST-2011-0007.pdf","relation":"main_file","date_created":"2018-12-12T11:53:27Z","file_id":"5488"}],"abstract":[{"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.","lang":"eng"}],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"related_material":{"record":[{"status":"public","id":"1903","relation":"later_version"},{"relation":"later_version","status":"public","id":"2211"},{"relation":"later_version","status":"public","id":"2955"}]},"publication_status":"published","month":"07","oa_version":"Published Version"},{"status":"public","title":"Robustness of structurally equivalent concurrent parity games","language":[{"iso":"eng"}],"date_published":"2011-06-27T00:00:00Z","doi":"10.15479/AT:IST-2011-0006","ddc":["000","005"],"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","date_updated":"2023-02-23T11:23:01Z","citation":{"short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.","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.","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>.","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>","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>","ieee":"K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria, 2011."},"type":"technical_report","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"}],"pubrep_id":"18","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"file_date_updated":"2020-07-14T12:46:40Z","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"}],"file":[{"creator":"system","access_level":"open_access","checksum":"1322b652d6ab07eb5248298a3f91c1cf","content_type":"application/pdf","file_size":335997,"date_updated":"2020-07-14T12:46:40Z","file_name":"IST-2011-0006_IST-2011-0006.pdf","relation":"main_file","date_created":"2018-12-12T11:54:24Z","file_id":"5546"}],"month":"06","related_material":{"record":[{"status":"public","id":"3341","relation":"later_version"}]},"department":[{"_id":"KrCh"}],"publication_status":"published","publisher":"IST Austria","oa_version":"Published Version","page":"18","_id":"5382","year":"2011","date_created":"2018-12-12T11:39:00Z"},{"status":"public","title":"On an efficient decision procedure for imperative tree data structures","language":[{"iso":"eng"}],"date_published":"2011-04-26T00:00:00Z","doi":"10.15479/AT:IST-2011-0005","alternative_title":["IST Austria Technical Report"],"ddc":["000","006"],"has_accepted_license":"1","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.","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>","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>","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>.","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>.","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011."},"type":"technical_report","author":[{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"full_name":"Muñiz, Marco","last_name":"Muñiz","first_name":"Marco"},{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"}],"date_updated":"2023-02-23T11:22:16Z","pubrep_id":"19","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"day":"26","file_date_updated":"2020-07-14T12:46:40Z","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"}],"file":[{"date_updated":"2020-07-14T12:46:40Z","relation":"main_file","date_created":"2018-12-12T11:53:01Z","file_id":"5462","file_name":"IST-2011-0005_IST-2011-0005.pdf","creator":"system","access_level":"open_access","content_type":"application/pdf","file_size":619053,"checksum":"b20029184c4a819c5f4466a4a3d238b5"}],"month":"04","publisher":"IST Austria","department":[{"_id":"ToHe"}],"related_material":{"record":[{"status":"public","id":"3323","relation":"later_version"}]},"publication_status":"published","oa_version":"Published Version","page":"25","_id":"5383","year":"2011","date_created":"2018-12-12T11:39:01Z"},{"page":"30","year":"2011","_id":"5384","date_created":"2018-12-12T11:39:01Z","file":[{"checksum":"f5a0f664fadc335990f5fcf138df19f1","content_type":"application/pdf","file_size":570827,"creator":"system","access_level":"open_access","file_name":"IST-2011-004_IST-2011-0004.pdf","relation":"main_file","date_created":"2018-12-12T11:54:23Z","file_id":"5545","date_updated":"2020-07-14T12:46:40Z"}],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","publisher":"IST Austria","related_material":{"record":[{"relation":"later_version","status":"public","id":"2957"}]},"department":[{"_id":"KrCh"}],"month":"04","oa_version":"Published Version","pubrep_id":"20","type":"technical_report","date_updated":"2023-02-23T11:05:53Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Mathieu","last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","full_name":"Tracol, Mathieu"}],"citation":{"ista":"Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.","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>.","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."},"publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"11","file_date_updated":"2020-07-14T12:46:40Z","language":[{"iso":"eng"}],"title":"Decidable problems for probabilistic automata on infinite words","status":"public","doi":"10.15479/AT:IST-2011-0004","date_published":"2011-04-11T00:00:00Z","ddc":["000","005"],"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1"},{"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"}],"file":[{"access_level":"open_access","creator":"system","file_size":366281,"content_type":"application/pdf","checksum":"8491d0d48c4911620ecd5350b413c11e","date_updated":"2020-07-14T12:46:41Z","file_id":"5461","date_created":"2018-12-12T11:53:00Z","relation":"main_file","file_name":"IST-2011-0003_IST-2011-0003.pdf"}],"publication_status":"published","related_material":{"record":[{"relation":"later_version","id":"2038","status":"public"},{"status":"public","id":"3356","relation":"later_version"}]},"oa_version":"Published Version","_id":"5385","year":"2011","ec_funded":1,"date_created":"2018-12-12T11:39:02Z","title":"Temporal specifications with accumulative values","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","date_updated":"2023-02-23T11:23:41Z","citation":{"short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","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>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","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>.","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>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","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>"},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"oa":1,"publication_identifier":{"issn":["2664-1690"]},"day":"04","month":"04","publisher":"IST Austria","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"page":"14","status":"public","language":[{"iso":"eng"}],"date_published":"2011-04-04T00:00:00Z","doi":"10.15479/AT:IST-2011-0003","alternative_title":["IST Austria Technical Report"],"ddc":["000","004"],"type":"technical_report","pubrep_id":"21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:41Z"},{"doi":"10.15479/AT:IST-2011-0002","date_published":"2011-03-28T00:00:00Z","language":[{"iso":"eng"}],"status":"public","title":"Enforcing topological constraints in random field image segmentation","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"ddc":["000"],"pubrep_id":"22","date_updated":"2023-02-23T11:22:48Z","type":"technical_report","author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chao"},{"full_name":"Freedman, Daniel","first_name":"Daniel","last_name":"Freedman"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"citation":{"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>.","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>","ieee":"C. Chen, D. Freedman, and C. Lampert, <i>Enforcing topological constraints in random field image segmentation</i>. IST Austria, 2011.","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>","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.","short":"C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random Field Image Segmentation, IST Austria, 2011."},"file_date_updated":"2020-07-14T12:46:41Z","day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"oa":1,"publication_status":"published","publisher":"IST Austria","related_material":{"record":[{"relation":"later_version","id":"3336","status":"public"}]},"department":[{"_id":"ChLa"}],"month":"03","file":[{"checksum":"ad64c2add5fe2ad10e9d5c669f3f9526","content_type":"application/pdf","file_size":26390601,"creator":"system","access_level":"open_access","file_name":"IST-2011-0002_IST-2011-0002.pdf","date_created":"2018-12-12T11:53:34Z","relation":"main_file","file_id":"5495","date_updated":"2020-07-14T12:46:41Z"}],"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"}],"oa_version":"Published Version","page":"69","date_created":"2018-12-12T11:39:02Z","year":"2011","_id":"5386"},{"abstract":[{"text":"We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives. In system design, the parity objective is used to encode ω-regular specifications, and the mean-payoff and energy objectives can be used to model quantitative resource constraints. The energy condition re- quires that the resource level never drops below 0, and the mean-payoff condi- tion requires that the limit-average value of the resource consumption is within a threshold. While these two (energy and mean-payoff) classical conditions are equivalent for two-player games, we show that they differ for MDPs. We show that the problem of deciding whether a state is almost-sure winning (i.e., winning with probability 1) in energy parity MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound.","lang":"eng"}],"file":[{"file_size":329976,"content_type":"application/pdf","checksum":"824d6c70e6d3feb3e836b009e0b3cf73","access_level":"open_access","creator":"system","file_id":"5458","date_created":"2018-12-12T11:52:57Z","relation":"main_file","file_name":"IST-2011-0001_IST-2011-0001.pdf","date_updated":"2020-07-14T12:46:41Z"}],"month":"02","publisher":"IST Austria","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"record":[{"id":"3345","status":"public","relation":"later_version"}]},"oa_version":"Published Version","page":"20","_id":"5387","year":"2011","date_created":"2018-12-12T11:39:02Z","status":"public","title":"Energy and mean-payoff parity Markov decision processes","language":[{"iso":"eng"}],"date_published":"2011-02-16T00:00:00Z","doi":"10.15479/AT:IST-2011-0001","ddc":["000","005"],"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","type":"technical_report","date_updated":"2023-02-23T11:23:11Z","citation":{"short":"K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.","ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">https://doi.org/10.15479/AT:IST-2011-0001</a>.","ama":"Chatterjee K, Doyen L. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">10.15479/AT:IST-2011-0001</a>","ieee":"K. Chatterjee and L. Doyen, <i>Energy and mean-payoff parity Markov decision processes</i>. IST Austria, 2011.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Energy and mean-payoff parity Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">https://doi.org/10.15479/AT:IST-2011-0001</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">10.15479/AT:IST-2011-0001</a>."},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"pubrep_id":"23","oa":1,"publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:41Z","day":"16"},{"external_id":{"pmid":["22098731"]},"title":"Noise underlies switching behavior of the bacterial flagellum","issue":"10","author":[{"full_name":"Park, Heungwon","last_name":"Park","first_name":"Heungwon"},{"last_name":"Oikonomou","first_name":"Panos","full_name":"Oikonomou, Panos"},{"last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"},{"last_name":"Cluzel","first_name":"Philippe","full_name":"Cluzel, Philippe"}],"date_updated":"2021-04-16T11:54:49Z","citation":{"mla":"Park, Heungwon, et al. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” <i>Biophysical Journal</i>, vol. 101, no. 10, Elsevier, 2011, pp. 2336–40, doi:<a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">10.1016/j.bpj.2011.09.040</a>.","apa":"Park, H., Oikonomou, P., Guet, C. C., &#38; Cluzel, P. (2011). Noise underlies switching behavior of the bacterial flagellum. <i>Biophysical Journal</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">https://doi.org/10.1016/j.bpj.2011.09.040</a>","ieee":"H. Park, P. Oikonomou, C. C. Guet, and P. Cluzel, “Noise underlies switching behavior of the bacterial flagellum,” <i>Biophysical Journal</i>, vol. 101, no. 10. Elsevier, pp. 2336–2340, 2011.","ama":"Park H, Oikonomou P, Guet CC, Cluzel P. Noise underlies switching behavior of the bacterial flagellum. <i>Biophysical Journal</i>. 2011;101(10):2336-2340. doi:<a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">10.1016/j.bpj.2011.09.040</a>","chicago":"Park, Heungwon, Panos Oikonomou, Calin C Guet, and Philippe Cluzel. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” <i>Biophysical Journal</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">https://doi.org/10.1016/j.bpj.2011.09.040</a>.","ista":"Park H, Oikonomou P, Guet CC, Cluzel P. 2011. Noise underlies switching behavior of the bacterial flagellum. Biophysical Journal. 101(10), 2336–2340.","short":"H. Park, P. Oikonomou, C.C. Guet, P. Cluzel, Biophysical Journal 101 (2011) 2336–2340."},"day":"16","oa":1,"publication":"Biophysical Journal","publication_identifier":{"issn":["0006-3495"]},"publication_status":"published","abstract":[{"text":"We report the switching behavior of the full bacterial flagellum system that includes the filament and the motor in wild-type Escherichia coli cells. In sorting the motor behavior by the clockwise bias, we find that the distributions of the clockwise (CW) and counterclockwise (CCW) intervals are either exponential or nonexponential with long tails. At low bias, CW intervals are exponentially distributed and CCW intervals exhibit long tails. At intermediate CW bias (0.5) both CW and CCW intervals are mainly exponentially distributed. A simple model suggests that these two distinct switching behaviors are governed by the presence of signaling noise within the chemotaxis network. Low noise yields exponentially distributed intervals, whereas large noise yields nonexponential behavior with long tails. These drastically different motor statistics may play a role in optimizing bacterial behavior for a wide range of environmental conditions.","lang":"eng"}],"quality_controlled":"1","article_processing_charge":"No","oa_version":"Published Version","pmid":1,"date_created":"2019-05-28T11:54:29Z","_id":"6496","year":"2011","date_published":"2011-11-16T00:00:00Z","doi":"10.1016/j.bpj.2011.09.040","status":"public","language":[{"iso":"eng"}],"intvolume":"       101","type":"journal_article","volume":101,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","publisher":"Elsevier","department":[{"_id":"CaGu"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3218319/","open_access":"1"}],"page":"2336-2340","scopus_import":"1"},{"pmid":1,"date_created":"2021-06-07T07:40:38Z","year":"2011","_id":"9483","article_type":"original","publication_status":"published","abstract":[{"text":"Imprinted genes are expressed primarily or exclusively from either the maternal or paternal allele, a phenomenon that occurs in flowering plants and mammals. Flowering plant imprinted gene expression has been described primarily in endosperm, a terminal nutritive tissue consumed by the embryo during seed development or after germination. Imprinted expression in Arabidopsis thaliana endosperm is orchestrated by differences in cytosine DNA methylation between the paternal and maternal genomes as well as by Polycomb group proteins. Currently, only 11 imprinted A. thaliana genes are known. Here, we use extensive sequencing of cDNA libraries to identify 9 paternally expressed and 34 maternally expressed imprinted genes in A. thaliana endosperm that are regulated by the DNA-demethylating glycosylase DEMETER, the DNA methyltransferase MET1, and/or the core Polycomb group protein FIE. These genes encode transcription factors, proteins involved in hormone signaling, components of the ubiquitin protein degradation pathway, regulators of histone and DNA methylation, and small RNA pathway proteins. We also identify maternally expressed genes that may be regulated by unknown mechanisms or deposited from maternal tissues. We did not detect any imprinted genes in the embryo. Our results show that imprinted gene expression is an extensive mechanistically complex phenomenon that likely affects multiple aspects of seed development.","lang":"eng"}],"quality_controlled":"1","oa_version":"Published Version","article_processing_charge":"No","author":[{"full_name":"Hsieh, Tzung-Fu","first_name":"Tzung-Fu","last_name":"Hsieh"},{"full_name":"Shin, Juhyun","first_name":"Juhyun","last_name":"Shin"},{"first_name":"Rie","last_name":"Uzawa","full_name":"Uzawa, Rie"},{"full_name":"Silva, Pedro","first_name":"Pedro","last_name":"Silva"},{"full_name":"Cohen, Stephanie","last_name":"Cohen","first_name":"Stephanie"},{"last_name":"Bauer","first_name":"Matthew J.","full_name":"Bauer, Matthew J."},{"full_name":"Hashimoto, Meryl","first_name":"Meryl","last_name":"Hashimoto"},{"full_name":"Kirkbride, Ryan C.","first_name":"Ryan C.","last_name":"Kirkbride"},{"last_name":"Harada","first_name":"John J.","full_name":"Harada, John J."},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","first_name":"Daniel","last_name":"Zilberman"},{"full_name":"Fischer, Robert L.","first_name":"Robert L.","last_name":"Fischer"}],"citation":{"short":"T.-F. Hsieh, J. Shin, R. Uzawa, P. Silva, S. Cohen, M.J. Bauer, M. Hashimoto, R.C. Kirkbride, J.J. Harada, D. Zilberman, R.L. Fischer, Proceedings of the National Academy of Sciences 108 (2011) 1755–1762.","mla":"Hsieh, Tzung-Fu, et al. “Regulation of Imprinted Gene Expression in Arabidopsis Endosperm.” <i>Proceedings of the National Academy of Sciences</i>, vol. 108, no. 5, National Academy of Sciences, 2011, pp. 1755–62, doi:<a href=\"https://doi.org/10.1073/pnas.1019273108\">10.1073/pnas.1019273108</a>.","ama":"Hsieh T-F, Shin J, Uzawa R, et al. Regulation of imprinted gene expression in Arabidopsis endosperm. <i>Proceedings of the National Academy of Sciences</i>. 2011;108(5):1755-1762. doi:<a href=\"https://doi.org/10.1073/pnas.1019273108\">10.1073/pnas.1019273108</a>","ieee":"T.-F. Hsieh <i>et al.</i>, “Regulation of imprinted gene expression in Arabidopsis endosperm,” <i>Proceedings of the National Academy of Sciences</i>, vol. 108, no. 5. National Academy of Sciences, pp. 1755–1762, 2011.","apa":"Hsieh, T.-F., Shin, J., Uzawa, R., Silva, P., Cohen, S., Bauer, M. J., … Fischer, R. L. (2011). Regulation of imprinted gene expression in Arabidopsis endosperm. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1019273108\">https://doi.org/10.1073/pnas.1019273108</a>","chicago":"Hsieh, Tzung-Fu, Juhyun Shin, Rie Uzawa, Pedro Silva, Stephanie Cohen, Matthew J. Bauer, Meryl Hashimoto, et al. “Regulation of Imprinted Gene Expression in Arabidopsis Endosperm.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1019273108\">https://doi.org/10.1073/pnas.1019273108</a>.","ista":"Hsieh T-F, Shin J, Uzawa R, Silva P, Cohen S, Bauer MJ, Hashimoto M, Kirkbride RC, Harada JJ, Zilberman D, Fischer RL. 2011. Regulation of imprinted gene expression in Arabidopsis endosperm. Proceedings of the National Academy of Sciences. 108(5), 1755–1762."},"date_updated":"2021-12-14T08:33:49Z","day":"01","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"publication":"Proceedings of the National Academy of Sciences","oa":1,"title":"Regulation of imprinted gene expression in Arabidopsis endosperm","external_id":{"pmid":["21257907"]},"issue":"5","page":"1755-1762","scopus_import":"1","publisher":"National Academy of Sciences","department":[{"_id":"DaZi"}],"month":"02","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1019273108","open_access":"1"}],"type":"journal_article","volume":108,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","doi":"10.1073/pnas.1019273108","date_published":"2011-02-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","intvolume":"       108","extern":"1"},{"page":"735-736","main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2011.05.018","open_access":"1"}],"month":"06","department":[{"_id":"DaZi"}],"publisher":"Elsevier","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"other_academic_publication","volume":20,"extern":"1","intvolume":"        20","date_published":"2011-06-14T00:00:00Z","doi":"10.1016/j.devcel.2011.05.018","status":"public","language":[{"iso":"eng"}],"date_created":"2021-06-08T06:23:39Z","pmid":1,"_id":"9522","year":"2011","quality_controlled":"1","article_processing_charge":"No","oa_version":"Published Version","publication_status":"published","abstract":[{"lang":"eng","text":"Little is known about chromatin remodeling events immediately after fertilization. A recent report by Autran et al. (2011) in Cell now shows that chromatin regulatory pathways that silence transposable elements are responsible for global delayed activation of gene expression in the early Arabidopsis embryo."}],"day":"14","oa":1,"publication_identifier":{"issn":["1534-5807"],"eissn":["1878-1551"]},"publication":"Developmental Cell","citation":{"chicago":"Zilberman, Daniel. <i>Balancing Parental Contributions in Plant Embryonic Gene Activation</i>. <i>Developmental Cell</i>. Vol. 20. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">https://doi.org/10.1016/j.devcel.2011.05.018</a>.","ista":"Zilberman D. 2011. Balancing parental contributions in plant embryonic gene activation, Elsevier,p.","mla":"Zilberman, Daniel. “Balancing Parental Contributions in Plant Embryonic Gene Activation.” <i>Developmental Cell</i>, vol. 20, no. 6, Elsevier, 2011, pp. 735–36, doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">10.1016/j.devcel.2011.05.018</a>.","ieee":"D. Zilberman, <i>Balancing parental contributions in plant embryonic gene activation</i>, vol. 20, no. 6. Elsevier, 2011, pp. 735–736.","ama":"Zilberman D. <i>Balancing Parental Contributions in Plant Embryonic Gene Activation</i>. Vol 20. Elsevier; 2011:735-736. doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">10.1016/j.devcel.2011.05.018</a>","apa":"Zilberman, D. (2011). <i>Balancing parental contributions in plant embryonic gene activation</i>. <i>Developmental Cell</i> (Vol. 20, pp. 735–736). Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">https://doi.org/10.1016/j.devcel.2011.05.018</a>","short":"D. Zilberman, Balancing Parental Contributions in Plant Embryonic Gene Activation, Elsevier, 2011."},"date_updated":"2021-12-14T08:34:37Z","author":[{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","first_name":"Daniel","last_name":"Zilberman"}],"issue":"6","external_id":{"pmid":["21664571"]},"title":"Balancing parental contributions in plant embryonic gene activation"},{"title":"Incremental-decremental algorithm for computing AT-models and persistent homology","oa":1,"publication":"Computer Analysis of Images and Patterns","publication_identifier":{"eissn":["16113349"],"isbn":["9783642236716"],"issn":["03029743"]},"day":"01","author":[{"first_name":"Rocio","last_name":"Gonzalez-Diaz","full_name":"Gonzalez-Diaz, Rocio"},{"first_name":"Adrian","last_name":"Ion","id":"29F89302-F248-11E8-B48F-1D18A9856A87","full_name":"Ion, Adrian"},{"full_name":"Jimenez, Maria Jose","first_name":"Maria Jose","last_name":"Jimenez"},{"last_name":"Poyatos","first_name":"Regina","full_name":"Poyatos, Regina"}],"citation":{"mla":"Gonzalez-Diaz, Rocio, et al. “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.” <i>Computer Analysis of Images and Patterns</i>, vol. 6854, Springer Nature, 2011, pp. 286–93, doi:<a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">10.1007/978-3-642-23672-3_35</a>.","apa":"Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., &#38; Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In <i>Computer Analysis of Images and Patterns</i> (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">https://doi.org/10.1007/978-3-642-23672-3_35</a>","ama":"Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm for computing AT-models and persistent homology. In: <i>Computer Analysis of Images and Patterns</i>. Vol 6854. Springer Nature; 2011:286-293. doi:<a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">10.1007/978-3-642-23672-3_35</a>","ieee":"R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental algorithm for computing AT-models and persistent homology,” in <i>Computer Analysis of Images and Patterns</i>, Seville, Spain, 2011, vol. 6854, pp. 286–293.","chicago":"Gonzalez-Diaz, Rocio, Adrian Ion, Maria Jose Jimenez, and Regina Poyatos. “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.” In <i>Computer Analysis of Images and Patterns</i>, 6854:286–93. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">https://doi.org/10.1007/978-3-642-23672-3_35</a>.","ista":"Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental algorithm for computing AT-models and persistent homology. Computer Analysis of Images and Patterns. CAIP: International Conference on Computer Analysis of Images and Patterns, LNCS, vol. 6854, 286–293.","short":"R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis of Images and Patterns, Springer Nature, 2011, pp. 286–293."},"date_updated":"2021-08-12T13:53:17Z","article_processing_charge":"No","oa_version":"Published Version","quality_controlled":"1","abstract":[{"lang":"eng","text":"In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend the persistence computation to a wider setting. Finally, we show how to combine incremental and decremental techniques for persistent homology computation."}],"publication_status":"published","_id":"9648","year":"2011","date_created":"2021-07-11T22:01:19Z","alternative_title":["LNCS"],"intvolume":"      6854","status":"public","language":[{"iso":"eng"}],"date_published":"2011-08-01T00:00:00Z","doi":"10.1007/978-3-642-23672-3_35","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","volume":6854,"type":"conference","main_file_link":[{"url":"http://hdl.handle.net/11441/30766","open_access":"1"}],"month":"08","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"scopus_import":"1","conference":{"location":"Seville, Spain","name":"CAIP: International Conference on Computer Analysis of Images and Patterns","start_date":"2011-08-29","end_date":"2011-08-31"},"page":"286-293"},{"main_file_link":[{"url":"https://doi.org/10.5061/dryad.299h8","open_access":"1"}],"article_processing_charge":"No","oa_version":"Published Version","month":"05","department":[{"_id":"NiBa"}],"publisher":"IST Austria","related_material":{"record":[{"id":"3395","status":"public","relation":"used_in_publication"}]},"abstract":[{"text":"Defining population structure and genetic diversity levels is of the utmost importance for developing efficient conservation strategies. Overfishing has caused mean annual catches of the European spiny lobster (Palinurus elephas) to decrease alarmingly along its distribution area. In this context, there is a need for comprehensive studies to evaluate the genetic health of the exploited populations. The present work is based on a set of 10 nuclear markers amplified in 331 individuals from 10 different localities covering most of P. elephas distribution area. Samples from Atlantic and Mediterranean basins showed small but significant differences, indicating that P. elephas populations do not behave as a single panmictic unit but form two partially-overlapping groups. Despite intense overfishing, our dataset did not recover a recent bottleneck signal, and showed a large and stable historical effective size instead. This result could be accounted for by specific life history traits (reproduction and longevity) and the limitations of molecular markers in covering very recent timescales for non temporal samples. Our study emphasizes the necessity of integrating information on effective population sizes and life history parameters when evaluating population connectivity levels from genetic data.","lang":"eng"}],"date_created":"2021-08-02T07:11:19Z","_id":"9762","year":"2011","date_published":"2011-05-12T00:00:00Z","doi":"10.5061/dryad.299h8","status":"public","title":"Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas)","day":"12","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"id":"3F0E2A22-F248-11E8-B48F-1D18A9856A87","full_name":"Palero, Ferran","orcid":"0000-0002-0343-8329","first_name":"Ferran","last_name":"Palero"},{"full_name":"Abello, Pere","last_name":"Abello","first_name":"Pere"},{"full_name":"Macpherson, Enrique","last_name":"Macpherson","first_name":"Enrique"},{"last_name":"Beaumont","first_name":"Mark","full_name":"Beaumont, Mark"},{"last_name":"Pascual","first_name":"Marta","full_name":"Pascual, Marta"}],"citation":{"short":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, M. Pascual, (2011).","chicago":"Palero, Ferran, Pere Abello, Enrique Macpherson, Mark Beaumont, and Marta Pascual. “Data from: Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster (Palinurus Elephas).” IST Austria, 2011. <a href=\"https://doi.org/10.5061/dryad.299h8\">https://doi.org/10.5061/dryad.299h8</a>.","ista":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. 2011. Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas), IST Austria, <a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>.","mla":"Palero, Ferran, et al. <i>Data from: Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster (Palinurus Elephas)</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>.","apa":"Palero, F., Abello, P., Macpherson, E., Beaumont, M., &#38; Pascual, M. (2011). Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas). IST Austria. <a href=\"https://doi.org/10.5061/dryad.299h8\">https://doi.org/10.5061/dryad.299h8</a>","ieee":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, and M. Pascual, “Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas).” IST Austria, 2011.","ama":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas). 2011. doi:<a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>"},"date_updated":"2023-02-23T11:25:25Z","type":"research_data_reference"},{"conference":{"name":"ISBI: International Symposium on Biomedical Imaging","location":"Chicago, Illinois, USA","start_date":"2011-03-30","end_date":"2011-04-02"},"date_created":"2021-08-19T11:49:58Z","_id":"9943","year":"2011","month":"06","publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"Bio"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Segmentation is the process of partitioning digital images into meaningful regions. The analysis of biological high content images often requires segmentation as a first step. We propose ilastik as an easy-to-use tool which allows the user without expertise in image processing to perform segmentation and classification in a unified way. ilastik learns from labels provided by the user through a convenient mouse interface. Based on these labels, ilastik infers a problem specific segmentation. A random forest classifier is used in the learning step, in which each pixel's neighborhood is characterized by a set of generic (nonlinear) features. ilastik supports up to three spatial plus one spectral dimension and makes use of all dimensions in the feature calculation. ilastik provides realtime feedback that enables the user to interactively refine the segmentation result and hence further fine-tune the classifier. An uncertainty measure guides the user to ambiguous regions in the images. Real time performance is achieved by multi-threading which fully exploits the capabilities of modern multi-core machines. Once a classifier has been trained on a set of representative images, it can be exported and used to automatically process a very large number of images (e.g. using the CellProfiler pipeline). ilastik is an open source project and released under the BSD license at www.ilastik.org."}],"main_file_link":[{"open_access":"1","url":"https://www.researchgate.net/publication/224241106_Ilastik_Interactive_learning_and_segmentation_toolkit"}],"quality_controlled":"1","keyword":["image segmentation","biomedical imaging","three dimensional displays","neurons","retina","observers","image color analysis"],"article_processing_charge":"No","oa_version":"Preprint","citation":{"short":"C.M. Sommer, C. Straehle, U. Köthe, F.A. Hamprecht, in:, 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Micro, Institute of Electrical and Electronics Engineers, 2011.","ista":"Sommer CM, Straehle C, Köthe U, Hamprecht FA. 2011. Ilastik: Interactive learning and segmentation toolkit. 2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro. ISBI: International Symposium on Biomedical Imaging.","chicago":"Sommer, Christoph M, Christoph Straehle, Ullrich Köthe, and Fred A. Hamprecht. “Ilastik: Interactive Learning and Segmentation Toolkit.” In <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Micro</i>. Institute of Electrical and Electronics Engineers, 2011. <a href=\"https://doi.org/10.1109/isbi.2011.5872394\">https://doi.org/10.1109/isbi.2011.5872394</a>.","ieee":"C. M. Sommer, C. Straehle, U. Köthe, and F. A. Hamprecht, “Ilastik: Interactive learning and segmentation toolkit,” in <i>2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro</i>, Chicago, Illinois, USA, 2011.","ama":"Sommer CM, Straehle C, Köthe U, Hamprecht FA. Ilastik: Interactive learning and segmentation toolkit. In: <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Micro</i>. Institute of Electrical and Electronics Engineers; 2011. doi:<a href=\"https://doi.org/10.1109/isbi.2011.5872394\">10.1109/isbi.2011.5872394</a>","apa":"Sommer, C. M., Straehle, C., Köthe, U., &#38; Hamprecht, F. A. (2011). Ilastik: Interactive learning and segmentation toolkit. In <i>2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro</i>. Chicago, Illinois, USA: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/isbi.2011.5872394\">https://doi.org/10.1109/isbi.2011.5872394</a>","mla":"Sommer, Christoph M., et al. “Ilastik: Interactive Learning and Segmentation Toolkit.” <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano to Micro</i>, Institute of Electrical and Electronics Engineers, 2011, doi:<a href=\"https://doi.org/10.1109/isbi.2011.5872394\">10.1109/isbi.2011.5872394</a>."},"type":"conference","author":[{"orcid":"0000-0003-1216-9105","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","full_name":"Sommer, Christoph M","first_name":"Christoph M","last_name":"Sommer"},{"full_name":"Straehle, Christoph","last_name":"Straehle","first_name":"Christoph"},{"full_name":"Köthe, Ullrich","first_name":"Ullrich","last_name":"Köthe"},{"full_name":"Hamprecht, Fred A.","last_name":"Hamprecht","first_name":"Fred A."}],"date_updated":"2023-02-23T14:13:38Z","day":"09","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"issn":["1945-7928"],"isbn":["978-1-4244-4127-3"],"eissn":["1945-8452"]},"publication":"2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro","date_published":"2011-06-09T00:00:00Z","doi":"10.1109/isbi.2011.5872394","status":"public","title":"Ilastik: Interactive learning and segmentation toolkit","language":[{"iso":"eng"}],"extern":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":6355,"type":"conference","intvolume":"      6355","status":"public","language":[{"iso":"eng"}],"date_published":"2010-05-01T00:00:00Z","doi":"10.1007/978-3-642-17511-4_7","scopus_import":"1","acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","place":"Berlin, Heidelberg","page":"103-118","conference":{"end_date":"2010-05-01","location":"Dakar, Senegal","start_date":"2010-04-25","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"month":"05","editor":[{"first_name":"Edmund M","last_name":"Clarke","full_name":"Clarke, Edmund M"},{"full_name":"Voronkov, Andrei","first_name":"Andrei","last_name":"Voronkov"}],"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"oa":1,"publication":"Logic for Programming, Artificial Intelligence, and Reasoning","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642175107"],"eisbn":["9783642175114"],"eissn":["1611-3349"]},"day":"01","date_updated":"2022-06-13T07:44:21Z","citation":{"chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>.","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118."},"author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"}],"title":"ABC: Algebraic Bound Computation for loops","_id":"10908","year":"2010","series_title":"LNCS","date_created":"2022-03-21T08:14:35Z","article_processing_charge":"No","oa_version":"Submitted Version","quality_controlled":"1","abstract":[{"text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts.","lang":"eng"}],"publication_status":"published"},{"author":[{"first_name":"Chao","last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"first_name":"Daniel","last_name":"Freedman","full_name":"Freedman, Daniel"}],"date_updated":"2023-02-23T11:19:46Z","citation":{"short":"C. Chen, D. Freedman, in:, Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2010, pp. 1594–1604.","chicago":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1594–1604. Society for Industrial and Applied Mathematics, 2010. <a href=\"https://doi.org/10.1137/1.9781611973075.129\">https://doi.org/10.1137/1.9781611973075.129</a>.","ista":"Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1594–1604.","mla":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2010, pp. 1594–604, doi:<a href=\"https://doi.org/10.1137/1.9781611973075.129\">10.1137/1.9781611973075.129</a>.","apa":"Chen, C., &#38; Freedman, D. (2010). Hardness results for homology localization. In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973075.129\">https://doi.org/10.1137/1.9781611973075.129</a>","ieee":"C. Chen and D. Freedman, “Hardness results for homology localization,” in <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Austin, TX, United States, 2010, pp. 1594–1604.","ama":"Chen C, Freedman D. Hardness results for homology localization. In: <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2010:1594-1604. doi:<a href=\"https://doi.org/10.1137/1.9781611973075.129\">10.1137/1.9781611973075.129</a>"},"type":"conference","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["9781611973075"]},"publication":"Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms","doi":"10.1137/1.9781611973075.129","date_published":"2010-02-01T00:00:00Z","language":[{"iso":"eng"}],"title":"Hardness results for homology localization","status":"public","page":"1594-1604","conference":{"location":"Austin, TX, United States","start_date":"2010-01-17","name":"SODA: Symposium on Discrete Algorithms","end_date":"2010-01-19"},"date_created":"2022-03-21T08:24:07Z","acknowledgement":"Partially supported by the Austrian Science Fund under grantFSP-S9103-N04 and P20134-N13.","year":"2010","scopus_import":"1","_id":"10909","publication_status":"published","related_material":{"record":[{"id":"3267","status":"public","relation":"later_version"}]},"department":[{"_id":"HeEd"}],"publisher":"Society for Industrial and Applied Mathematics","month":"02","abstract":[{"lang":"eng","text":"We address the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure. We focus on the volume measure, that is, the 1-norm of a cycle. Two main results are presented. First, we prove the problem is NP-hard to approximate within any constant factor. Second, we prove that for homology of dimension two or higher, the problem is NP-hard to approximate even when the Betti number is O(1). A side effect is the inapproximability of the problem of computing the nonbounding cycle with the smallest volume, and computing cycles representing a homology basis with the minimal total volume. We also discuss other geometric measures (diameter and radius) and show their disadvantages in homology localization. Our work is restricted to homology over the ℤ2 field."}],"quality_controlled":"1","oa_version":"None","article_processing_charge":"No"}]