[{"doi":"10.1007/s10703-011-0131-3","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf","open_access":"1"}],"quality_controlled":"1","month":"12","author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T08:01:27Z","date_created":"2018-12-11T11:47:00Z","volume":39,"year":"2011","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"publist_id":"7288","date_published":"2011-12-01T00:00:00Z","publication":"Formal Methods in System Design","citation":{"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.” Formal Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design. Springer, 2011. https://doi.org/10.1007/s10703-011-0131-3.","ama":"Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. Formal Methods in System Design. 2011;39(3):297-331. doi:10.1007/s10703-011-0131-3","apa":"Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-011-0131-3","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.","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","page":"297 - 331","day":"01","article_processing_charge":"No","scopus_import":1,"oa_version":"Published Version","_id":"531","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"status":"public","title":"Verification of STM on relaxed memory models","intvolume":" 39","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."}],"issue":"3","type":"journal_article"},{"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."}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2011-0009_IST-2011-0009.pdf","creator":"system","file_size":388665,"content_type":"application/pdf","file_id":"5504","relation":"main_file","checksum":"0b354264229045d982332fd2cb5b9a26","date_created":"2018-12-12T11:53:43Z","date_updated":"2020-07-14T12:46:39Z"}],"pubrep_id":"15","status":"public","ddc":["000","004"],"title":"An O(n2) time algorithm for alternating Büchi games","_id":"5379","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"11","article_processing_charge":"No","has_accepted_license":"1","date_published":"2011-07-11T00:00:00Z","page":"20","citation":{"chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0009.","short":"K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.","ista":"Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.","ieee":"K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.","apa":"Chatterjee, K., & Henzinger, M. H. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009","ama":"Chatterjee K, Henzinger MH. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0009"},"file_date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:38:59Z","date_updated":"2023-02-23T11:15:12Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"3165"}]},"publication_status":"published","publisher":"IST Austria","department":[{"_id":"KrCh"}],"year":"2011","month":"07","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2011-0009","oa":1},{"oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.","ieee":"K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.","apa":"Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","ama":"Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007"},"page":"43","doi":"10.15479/AT:IST-2011-0007","date_published":"2011-07-05T00:00:00Z","language":[{"iso":"eng"}],"month":"07","day":"05","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"_id":"5381","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Partial-observation stochastic games: How to win when belief fails","publication_status":"published","status":"public","ddc":["000","005"],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"id":"1903","relation":"later_version","status":"public"},{"id":"2211","relation":"later_version","status":"public"},{"id":"2955","relation":"later_version","status":"public"}]},"pubrep_id":"17","date_created":"2018-12-12T11:39:00Z","date_updated":"2023-02-23T11:05:48Z","file":[{"checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","date_created":"2018-12-12T11:53:27Z","date_updated":"2020-07-14T12:46:39Z","relation":"main_file","file_id":"5488","content_type":"application/pdf","file_size":574055,"creator":"system","access_level":"open_access","file_name":"IST-2011-0007_IST-2011-0007.pdf"}],"oa_version":"Published Version","type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:39Z","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."}]},{"file_date_updated":"2020-07-14T12:46:39Z","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"}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","date_updated":"2023-02-23T11:22:53Z","date_created":"2018-12-12T11:39:00Z","file":[{"checksum":"0fd38186409be819a911c4990fa79d1f","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:54:22Z","file_id":"5544","relation":"main_file","creator":"system","file_size":500399,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2011-0008_IST-2011-0008.pdf"}],"oa_version":"Published Version","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"3338"}]},"pubrep_id":"16","ddc":["000"],"publication_status":"published","status":"public","title":"Bounded rationality in concurrent parity games","department":[{"_id":"KrCh"}],"publisher":"IST Austria","_id":"5380","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","day":"11","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2011-07-11T00:00:00Z","doi":"10.15479/AT:IST-2011-0008","page":"53","oa":1,"citation":{"apa":"Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0008","ieee":"K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.","ama":"Chatterjee K. Bounded Rationality in Concurrent Parity Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0008","chicago":"Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.","mla":"Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0008."}},{"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","day":"27","month":"06","language":[{"iso":"eng"}],"date_published":"2011-06-27T00:00:00Z","doi":"10.15479/AT:IST-2011-0006","page":"18","oa":1,"citation":{"ista":"Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.","ieee":"K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.","apa":"Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006","ama":"Chatterjee K. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0006","chicago":"Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.","mla":"Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0006.","short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011."},"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_date_updated":"2020-07-14T12:46:40Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","oa_version":"Published Version","file":[{"checksum":"1322b652d6ab07eb5248298a3f91c1cf","date_created":"2018-12-12T11:54:24Z","date_updated":"2020-07-14T12:46:40Z","file_id":"5546","relation":"main_file","creator":"system","file_size":335997,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2011-0006_IST-2011-0006.pdf"}],"date_updated":"2023-02-23T11:23:01Z","date_created":"2018-12-12T11:39:00Z","pubrep_id":"18","related_material":{"record":[{"status":"public","relation":"later_version","id":"3341"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","publication_status":"published","title":"Robustness of structurally equivalent concurrent parity games","ddc":["000","005"],"status":"public","_id":"5382","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011"},{"month":"07","day":"11","language":[{"iso":"eng"}],"date_published":"2011-07-11T00:00:00Z","page":"1 - 51","publication":"arXiv","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2146"}],"citation":{"ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .","ieee":"K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.","apa":"Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.","ama":"Chatterjee K. Bounded rationality in concurrent parity games. arXiv. 2011:1-51.","chicago":"Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.","mla":"Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv, ArXiv, 2011, pp. 1–51.","short":"K. Chatterjee, ArXiv (2011) 1–51."},"external_id":{"arxiv":["1107.2146"]},"oa":1,"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 inde- pendently 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, respec- tively. 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 power- ful 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."}],"publist_id":"3287","type":"preprint","date_created":"2018-12-11T12:02:45Z","date_updated":"2023-02-23T12:23:40Z","oa_version":"Preprint","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"related_material":{"record":[{"id":"5380","status":"public","relation":"earlier_version"}]},"status":"public","publication_status":"published","title":"Bounded rationality in concurrent parity games","publisher":"ArXiv","department":[{"_id":"KrCh"}],"_id":"3338","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011"},{"related_material":{"record":[{"id":"2038","relation":"later_version","status":"public"},{"id":"5385","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"date_updated":"2023-02-23T12:23:54Z","date_created":"2018-12-11T12:02:52Z","year":"2011","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IEEE","publication_status":"published","publist_id":"3259","ec_funded":1,"file_date_updated":"2020-07-14T12:46:09Z","article_number":"5970226","doi":"10.1109/LICS.2011.33","conference":{"name":"LICS: Logic in Computer Science","end_date":"2011-06-24","location":"Toronto, Canada","start_date":"2011-06-21"},"language":[{"iso":"eng"}],"oa":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","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"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"month":"06","pubrep_id":"83","file":[{"file_size":225426,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","checksum":"792128f5455f0f40f1105f0398e05fa9","date_updated":"2020-07-14T12:46:09Z","date_created":"2018-12-12T10:12:42Z","relation":"main_file","file_id":"4960"}],"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3356","title":"Temporal specifications with accumulative values","ddc":["000","004"],"status":"public","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"}],"type":"conference","date_published":"2011-06-21T00:00:00Z","citation":{"ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","mla":"Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33."},"has_accepted_license":"1","day":"21","scopus_import":1},{"has_accepted_license":"1","day":"04","page":"14","citation":{"chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.","mla":"Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003"},"date_published":"2011-04-04T00:00:00Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","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."}],"ddc":["000","004"],"status":"public","title":"Temporal specifications with accumulative values","_id":"5385","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5461","checksum":"8491d0d48c4911620ecd5350b413c11e","date_updated":"2020-07-14T12:46:41Z","date_created":"2018-12-12T11:53:00Z","access_level":"open_access","file_name":"IST-2011-0003_IST-2011-0003.pdf","content_type":"application/pdf","file_size":366281,"creator":"system"}],"pubrep_id":"21","publication_identifier":{"issn":["2664-1690"]},"month":"04","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2011-0003","ec_funded":1,"file_date_updated":"2020-07-14T12:46:41Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IST Austria","publication_status":"published","year":"2011","date_updated":"2023-02-23T11:23:41Z","date_created":"2018-12-12T11:39:02Z","related_material":{"record":[{"id":"2038","status":"public","relation":"later_version"},{"relation":"later_version","status":"public","id":"3356"}]},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}]},{"file_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"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"pubrep_id":"22","related_material":{"record":[{"relation":"later_version","status":"public","id":"3336"}]},"author":[{"last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"full_name":"Freedman, Daniel","last_name":"Freedman","first_name":"Daniel"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2011-0002_IST-2011-0002.pdf","file_size":26390601,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5495","checksum":"ad64c2add5fe2ad10e9d5c669f3f9526","date_updated":"2020-07-14T12:46:41Z","date_created":"2018-12-12T11:53:34Z"}],"date_updated":"2023-02-23T11:22:48Z","date_created":"2018-12-12T11:39:02Z","year":"2011","_id":"5386","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"publisher":"IST Austria","ddc":["000"],"status":"public","title":"Enforcing topological constraints in random field image segmentation","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"28","month":"03","date_published":"2011-03-28T00:00:00Z","doi":"10.15479/AT:IST-2011-0002","language":[{"iso":"eng"}],"citation":{"apa":"Chen, C., Freedman, D., & Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. IST Austria. https://doi.org/10.15479/AT:IST-2011-0002","ieee":"C. Chen, D. Freedman, and C. Lampert, Enforcing topological constraints in random field image segmentation. IST Austria, 2011.","ista":"Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation, IST Austria, 69p.","ama":"Chen C, Freedman D, Lampert C. Enforcing Topological Constraints in Random Field Image Segmentation. IST Austria; 2011. doi:10.15479/AT:IST-2011-0002","chicago":"Chen, Chao, Daniel Freedman, and Christoph Lampert. Enforcing Topological Constraints in Random Field Image Segmentation. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0002.","short":"C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random Field Image Segmentation, IST Austria, 2011.","mla":"Chen, Chao, et al. Enforcing Topological Constraints in Random Field Image Segmentation. IST Austria, 2011, doi:10.15479/AT:IST-2011-0002."},"oa":1,"page":"69"},{"type":"technical_report","alternative_title":["IST Austria Technical Report"],"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"}],"_id":"5383","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","006"],"status":"public","publication_status":"published","title":"On an efficient decision procedure for imperative tree data structures","department":[{"_id":"ToHe"}],"publisher":"IST Austria","author":[{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"},{"full_name":"Muñiz, Marco","first_name":"Marco","last_name":"Muñiz"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"3323"}]},"pubrep_id":"19","date_created":"2018-12-12T11:39:01Z","date_updated":"2023-02-23T11:22:16Z","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":619053,"creator":"system","access_level":"open_access","file_name":"IST-2011-0005_IST-2011-0005.pdf","checksum":"b20029184c4a819c5f4466a4a3d238b5","date_updated":"2020-07-14T12:46:40Z","date_created":"2018-12-12T11:53:01Z","relation":"main_file","file_id":"5462"}],"month":"04","day":"26","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"citation":{"apa":"Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005","ieee":"T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","ama":"Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","mla":"Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005."},"oa":1,"page":"25","date_published":"2011-04-26T00:00:00Z","doi":"10.15479/AT:IST-2011-0005","language":[{"iso":"eng"}]},{"doi":"10.15479/AT:IST-2011-0004","date_published":"2011-04-11T00:00:00Z","language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0004.","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011, doi:10.15479/AT:IST-2011-0004.","short":"K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.","ista":"Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.","apa":"Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004","ieee":"K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.","ama":"Chatterjee K, Tracol M. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria; 2011. doi:10.15479/AT:IST-2011-0004"},"oa":1,"page":"30","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"04","day":"11","related_material":{"record":[{"relation":"later_version","status":"public","id":"2957"}]},"pubrep_id":"20","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Tracol, Mathieu","last_name":"Tracol","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":570827,"creator":"system","access_level":"open_access","file_name":"IST-2011-004_IST-2011-0004.pdf","checksum":"f5a0f664fadc335990f5fcf138df19f1","date_updated":"2020-07-14T12:46:40Z","date_created":"2018-12-12T11:54:23Z","relation":"main_file","file_id":"5545"}],"date_created":"2018-12-12T11:39:01Z","date_updated":"2023-02-23T11:05:53Z","year":"2011","_id":"5384","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","department":[{"_id":"KrCh"}],"ddc":["000","005"],"publication_status":"published","title":"Decidable problems for probabilistic automata on infinite words","status":"public","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."}],"file_date_updated":"2020-07-14T12:46:40Z","type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"language":[{"iso":"eng"}],"date_published":"2011-07-22T00:00:00Z","doi":"10.1109/CVPR.2011.5995503","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","location":"Colorado Springs, CO, United States","start_date":"2011-06-20","end_date":"2011-06-25"},"page":"2089 - 2096","quality_controlled":"1","citation":{"ieee":"C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition, Colorado Springs, CO, United States, 2011, pp. 2089–2096.","apa":"Chen, C., Freedman, D., & Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. In CVPR: Computer Vision and Pattern Recognition (pp. 2089–2096). Colorado Springs, CO, United States: IEEE. https://doi.org/10.1109/CVPR.2011.5995503","ista":"Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.","ama":"Chen C, Freedman D, Lampert C. Enforcing topological constraints in random field image segmentation. In: CVPR: Computer Vision and Pattern Recognition. IEEE; 2011:2089-2096. doi:10.1109/CVPR.2011.5995503","chicago":"Chen, Chao, Daniel Freedman, and Christoph Lampert. “Enforcing Topological Constraints in Random Field Image Segmentation.” In CVPR: Computer Vision and Pattern Recognition, 2089–96. IEEE, 2011. https://doi.org/10.1109/CVPR.2011.5995503.","short":"C. Chen, D. Freedman, C. Lampert, in:, CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–2096.","mla":"Chen, Chao, et al. “Enforcing Topological Constraints in Random Field Image Segmentation.” CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–96, doi:10.1109/CVPR.2011.5995503."},"publication":"CVPR: Computer Vision and Pattern Recognition","publication_identifier":{"isbn":["978-1-4577-0394-2"],"eisbn":["978-1-4577-0395-9"]},"article_processing_charge":"No","day":"22","month":"07","scopus_import":"1","oa_version":"None","date_updated":"2023-02-23T12:23:56Z","date_created":"2018-12-11T12:02:45Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5386"}]},"author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen"},{"first_name":"Daniel","last_name":"Freedman","full_name":"Freedman, Daniel"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"department":[{"_id":"HeEd"},{"_id":"ChLa"}],"publisher":"IEEE","publication_status":"published","status":"public","title":"Enforcing topological constraints in random field image segmentation","_id":"3336","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The first author is supported by the Austrian Science Fund (FWF) grant No. P20134-N13. The authors would like to thank Sebastian Nowozin for helpful discussions.","publist_id":"3294","abstract":[{"lang":"eng","text":"We introduce TopoCut: a new way to integrate knowledge about topological properties (TPs) into random field image segmentation model. Instead of including TPs as additional constraints during minimization of the energy function, we devise an efficient algorithm for modifying the unary potentials such that the resulting segmentation is guaranteed with the desired properties. Our method is more flexible in the sense that it handles more topology constraints than previous methods, which were only able to enforce pairwise or global connectivity. In particular, our method is very fast, making it for the first time possible to enforce global topological properties in practical image segmentation tasks."}],"type":"conference"},{"_id":"3323","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2011","intvolume":" 6803","department":[{"_id":"ToHe"}],"publisher":"Springer","title":"An efficient decision procedure for imperative tree data structures","status":"public","publication_status":"published","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5383"}]},"author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas"},{"last_name":"Muñiz","first_name":"Marco","full_name":"Muñiz, Marco"},{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"}],"oa_version":"None","volume":6803,"date_updated":"2023-02-23T12:23:48Z","date_created":"2018-12-11T12:02:40Z","type":"conference","alternative_title":["LNAI "],"publist_id":"3312","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"}],"citation":{"short":"T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.","mla":"Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.","ama":"Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36","ieee":"T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.","apa":"Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36","ista":"Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491."},"page":"476 - 491","quality_controlled":"1","date_published":"2011-07-19T00:00:00Z","doi":"10.1007/978-3-642-22438-6_36","conference":{"name":"CADE 23: Automated Deduction ","end_date":"2011-08-05","location":"Wrocław, Poland","start_date":"2011-07-31"},"language":[{"iso":"eng"}],"scopus_import":1,"month":"07","day":"19"},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized "specification free", in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. ","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3366","status":"public","ddc":["000","004"],"title":"Quantitative synthesis for concurrent programs","intvolume":" 6806","pubrep_id":"76","file":[{"file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","access_level":"open_access","content_type":"application/pdf","file_size":508946,"creator":"system","relation":"main_file","file_id":"5174","date_created":"2018-12-12T10:15:51Z","date_updated":"2020-07-14T12:46:10Z","checksum":"c033689355f45742dc7c99b5af13ce7a"}],"oa_version":"Submitted Version","day":"21","article_processing_charge":"No","has_accepted_license":"1","citation":{"ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:10.1007/978-3-642-22110-1_20","ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20","mla":"Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20."},"page":"243 - 259","date_published":"2011-04-21T00:00:00Z","file_date_updated":"2020-07-14T12:46:10Z","publist_id":"3247","ec_funded":1,"year":"2011","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","editor":[{"last_name":"Gopalakrishnan","first_name":"Ganesh","full_name":"Gopalakrishnan, Ganesh"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5388"}]},"date_updated":"2023-02-23T12:24:01Z","date_created":"2018-12-11T12:02:55Z","volume":6806,"month":"04","oa":1,"quality_controlled":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2011-07-20","location":"Snowbird, USA","start_date":"2011-07-14"},"doi":"10.1007/978-3-642-22110-1_20","language":[{"iso":"eng"}]},{"date_created":"2018-12-11T12:02:48Z","date_updated":"2023-02-23T12:23:59Z","volume":6907,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5387"}]},"publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"year":"2011","publist_id":"3276","language":[{"iso":"eng"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2011-08-26","location":"Warsaw, Poland","start_date":"2011-08-22"},"doi":"10.1007/978-3-642-22993-0_21","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"external_id":{"arxiv":["1104.2909"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2909"}],"month":"09","oa_version":"Preprint","title":"Energy and mean-payoff parity Markov Decision Processes","status":"public","intvolume":" 6907","_id":"3345","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"alternative_title":["LNCS"],"type":"conference","date_published":"2011-09-28T00:00:00Z","page":"206 - 218","citation":{"short":"K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.","ama":"Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi:10.1007/978-3-642-22993-0_21","apa":"Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21","ieee":"K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.","ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218."},"day":"28","scopus_import":1},{"_id":"5387","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publisher":"IST Austria","status":"public","ddc":["000","005"],"publication_status":"published","title":"Energy and mean-payoff parity Markov decision processes","related_material":{"record":[{"id":"3345","status":"public","relation":"later_version"}]},"pubrep_id":"23","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"oa_version":"Published Version","file":[{"file_id":"5458","relation":"main_file","date_created":"2018-12-12T11:52:57Z","date_updated":"2020-07-14T12:46:41Z","checksum":"824d6c70e6d3feb3e836b009e0b3cf73","file_name":"IST-2011-0001_IST-2011-0001.pdf","access_level":"open_access","creator":"system","file_size":329976,"content_type":"application/pdf"}],"date_updated":"2023-02-23T11:23:11Z","date_created":"2018-12-12T11:39:02Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"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_date_updated":"2020-07-14T12:46:41Z","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0001.","short":"K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011, doi:10.15479/AT:IST-2011-0001.","apa":"Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001","ieee":"K. Chatterjee and 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.","ama":"Chatterjee K, Doyen L. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria; 2011. doi:10.15479/AT:IST-2011-0001"},"oa":1,"page":"20","doi":"10.15479/AT:IST-2011-0001","date_published":"2011-02-16T00:00:00Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"02","day":"16"},{"day":"08","month":"06","page":"170 - 171","quality_controlled":0,"citation":{"short":"O. Hosten, Nature 474 (2011) 170–171.","mla":"Hosten, Onur. “Quantum Physics: How to Catch a Wave.” Nature, vol. 474, no. 7350, Nature Publishing Group, 2011, pp. 170–71, doi:10.1038/474170a.","chicago":"Hosten, Onur. “Quantum Physics: How to Catch a Wave.” Nature. Nature Publishing Group, 2011. https://doi.org/10.1038/474170a.","ama":"Hosten O. Quantum physics: How to catch a wave. Nature. 2011;474(7350):170-171. doi:10.1038/474170a","ieee":"O. Hosten, “Quantum physics: How to catch a wave,” Nature, vol. 474, no. 7350. Nature Publishing Group, pp. 170–171, 2011.","apa":"Hosten, O. (2011). Quantum physics: How to catch a wave. Nature. Nature Publishing Group. https://doi.org/10.1038/474170a","ista":"Hosten O. 2011. Quantum physics: How to catch a wave. Nature. 474(7350), 170–171."},"publication":"Nature","doi":"10.1038/474170a","date_published":"2011-06-08T00:00:00Z","type":"journal_article","extern":1,"publist_id":"7224","issue":"7350","publisher":"Nature Publishing Group","intvolume":" 474","publication_status":"published","title":"Quantum physics: How to catch a wave","status":"public","_id":"580","year":"2011","volume":474,"date_updated":"2021-01-12T08:03:34Z","date_created":"2018-12-11T11:47:18Z","author":[{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","first_name":"Onur","last_name":"Hosten","full_name":"Onur Hosten"}]},{"day":"01","month":"01","citation":{"ama":"Schmid D, Hazrat S, Rangarajan R, Hosten O, Quint S, Kwiat P. Methods towards achieving precise birefringent focusing. In: OSA; 2011. doi:10.1364/CLEO_AT.2011.JThB130","ista":"Schmid D, Hazrat S, Rangarajan R, Hosten O, Quint S, Kwiat P. 2011. Methods towards achieving precise birefringent focusing. QELS: Quantum Electronics and Laser Science, Optics InfoBase Conference Papers, .","apa":"Schmid, D., Hazrat, S., Rangarajan, R., Hosten, O., Quint, S., & Kwiat, P. (2011). Methods towards achieving precise birefringent focusing. Presented at the QELS: Quantum Electronics and Laser Science, OSA. https://doi.org/10.1364/CLEO_AT.2011.JThB130","ieee":"D. Schmid, S. Hazrat, R. Rangarajan, O. Hosten, S. Quint, and P. Kwiat, “Methods towards achieving precise birefringent focusing,” presented at the QELS: Quantum Electronics and Laser Science, 2011.","mla":"Schmid, David, et al. Methods towards Achieving Precise Birefringent Focusing. OSA, 2011, doi:10.1364/CLEO_AT.2011.JThB130.","short":"D. Schmid, S. Hazrat, R. Rangarajan, O. Hosten, S. Quint, P. Kwiat, in:, OSA, 2011.","chicago":"Schmid, David, Shiraz Hazrat, Radhika Rangarajan, Onur Hosten, Stephan Quint, and Paul Kwiat. “Methods towards Achieving Precise Birefringent Focusing.” OSA, 2011. https://doi.org/10.1364/CLEO_AT.2011.JThB130."},"quality_controlled":0,"conference":{"name":"QELS: Quantum Electronics and Laser Science"},"doi":"10.1364/CLEO_AT.2011.JThB130","date_published":"2011-01-01T00:00:00Z","type":"conference","alternative_title":["Optics InfoBase Conference Papers"],"abstract":[{"lang":"eng","text":"We present two independent schemes for the precise focusing of orthogonal polarizations of light at arbitrary relative locations. The first scheme uses a polarization Sagnac interferometer, the second a set of three birefringent elements.\n\n"}],"publist_id":"7220","extern":1,"year":"2011","_id":"585","publication_status":"published","title":"Methods towards achieving precise birefringent focusing","status":"public","publisher":"OSA","author":[{"full_name":"Schmid, David","first_name":"David","last_name":"Schmid"},{"first_name":"Shiraz","last_name":"Hazrat","full_name":"Hazrat, Shiraz"},{"last_name":"Rangarajan","first_name":"Radhika","full_name":"Rangarajan, Radhika"},{"last_name":"Hosten","first_name":"Onur","orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Onur Hosten"},{"last_name":"Quint","first_name":"Stephan","full_name":"Quint, Stephan"},{"full_name":"Kwiat, Paul G","last_name":"Kwiat","first_name":"Paul"}],"date_created":"2018-12-11T11:47:20Z","date_updated":"2021-01-12T08:03:44Z"},{"date_published":"2011-08-04T00:00:00Z","doi":"10.1103/PhysRevLett.107.063904","quality_controlled":0,"publication":"Physical Review Letters","citation":{"ista":"Vrijsen G, Hosten O, Lee J, Bernon S, Kasevich M. 2011. Raman lasing with a cold atom gain medium in a high-finesse optical cavity. Physical Review Letters. 107(6).","ieee":"G. Vrijsen, O. Hosten, J. Lee, S. Bernon, and M. Kasevich, “Raman lasing with a cold atom gain medium in a high-finesse optical cavity,” Physical Review Letters, vol. 107, no. 6. American Physical Society, 2011.","apa":"Vrijsen, G., Hosten, O., Lee, J., Bernon, S., & Kasevich, M. (2011). Raman lasing with a cold atom gain medium in a high-finesse optical cavity. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.107.063904","ama":"Vrijsen G, Hosten O, Lee J, Bernon S, Kasevich M. Raman lasing with a cold atom gain medium in a high-finesse optical cavity. Physical Review Letters. 2011;107(6). doi:10.1103/PhysRevLett.107.063904","chicago":"Vrijsen, Geert, Onur Hosten, Jongmin Lee, Simon Bernon, and Mark Kasevich. “Raman Lasing with a Cold Atom Gain Medium in a High-Finesse Optical Cavity.” Physical Review Letters. American Physical Society, 2011. https://doi.org/10.1103/PhysRevLett.107.063904.","mla":"Vrijsen, Geert, et al. “Raman Lasing with a Cold Atom Gain Medium in a High-Finesse Optical Cavity.” Physical Review Letters, vol. 107, no. 6, American Physical Society, 2011, doi:10.1103/PhysRevLett.107.063904.","short":"G. Vrijsen, O. Hosten, J. Lee, S. Bernon, M. Kasevich, Physical Review Letters 107 (2011)."},"month":"08","day":"04","date_created":"2018-12-11T11:47:20Z","date_updated":"2021-01-12T08:05:05Z","volume":107,"author":[{"full_name":"Vrijsen, Geert","last_name":"Vrijsen","first_name":"Geert"},{"orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","last_name":"Hosten","first_name":"Onur","full_name":"Onur Hosten"},{"first_name":"Jongmin","last_name":"Lee","full_name":"Lee, Jongmin"},{"full_name":"Bernon, Simon","last_name":"Bernon","first_name":"Simon"},{"full_name":"Kasevich, Mark A","last_name":"Kasevich","first_name":"Mark"}],"title":"Raman lasing with a cold atom gain medium in a high-finesse optical cavity","status":"public","publication_status":"published","intvolume":" 107","publisher":"American Physical Society","year":"2011","_id":"586","extern":1,"abstract":[{"lang":"eng","text":"We demonstrate a Raman laser using cold Rb87 atoms as the gain medium in a high-finesse optical cavity. We observe robust continuous wave lasing in the atypical regime where single atoms can considerably affect the cavity field. Consequently, we discover unusual lasing threshold behavior in the system causing jumps in lasing power, and propose a model to explain the effect. We also measure the intermode laser linewidth, and observe values as low as 80Hz. The tunable gain properties of this laser suggest multiple directions for future research."}],"issue":"6","publist_id":"7223","type":"journal_article"},{"type":"journal_article","publist_id":"7209","issue":"3","abstract":[{"text":"The macromolecular assembly required to initiate transcription of protein-coding genes, known as the Pre-Initiation Complex (PIC), consists of multiple protein complexes and is approximately 3.5 MDa in size. At the heart of this assembly is the Mediator complex, which helps regulate PIC activity and interacts with the RNA polymerase II (pol II) enzyme. The structure of the human Mediator-pol II interface is not well-characterized, whereas attempts to structurally define the Mediator-pol II interaction in yeast have relied on incomplete assemblies of Mediator and/or pol II and have yielded inconsistent interpretations. We have assembled the complete, 1.9 MDa human Mediator-pol II-TFIIF complex from purified components and have characterized its structural organization using cryo-electron microscopy and single-particle reconstruction techniques. The orientation of pol II within this assembly was determined by crystal structure docking and further validated with projection matching experiments, allowing the structural organization of the entire human PIC to be envisioned. Significantly, pol II orientation within the Mediator-pol II-TFIIF assembly can be reconciled with past studies that determined the location of other PIC components relative to pol II itself. Pol II surfaces required for interacting with TFIIB, TFIIE, and promoter DNA (i.e., the pol II cleft) are exposed within the Mediator-pol II-TFIIF structure; RNA exit is unhindered along the RPB4/7 subunits; upstream and downstream DNA is accessible for binding additional factors; and no major structural re-organization is necessary to accommodate the large, multi-subunit TFIIH or TFIID complexes. The data also reveal how pol II binding excludes Mediator-CDK8 subcomplex interactions and provide a structural basis for Mediator-dependent control of PIC assembly and function. Finally, parallel structural analysis of Mediator-pol II complexes lacking TFIIF reveal that TFIIF plays a key role in stabilizing pol II orientation within the assembly.","lang":"eng"}],"extern":"1","year":"2011","_id":"597","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9","publisher":"Public Library of Science","title":"Molecular architecture of the human Mediator-RNA polymerase II-TFIIF assembly","publication_status":"published","status":"public","author":[{"full_name":"Bernecky, Carrie A","first_name":"Carrie A","last_name":"Bernecky","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0893-7036"},{"full_name":"Grob, Patricia","last_name":"Grob","first_name":"Patricia"},{"full_name":"Ebmeier, Christopher","last_name":"Ebmeier","first_name":"Christopher"},{"full_name":"Nogales, Eva","last_name":"Nogales","first_name":"Eva"},{"full_name":"Taatjes, Dylan","first_name":"Dylan","last_name":"Taatjes"}],"oa_version":"None","volume":9,"date_updated":"2021-01-12T08:05:25Z","date_created":"2018-12-11T11:47:24Z","article_processing_charge":"No","day":"01","month":"03","citation":{"ama":"Bernecky C, Grob P, Ebmeier C, Nogales E, Taatjes D. Molecular architecture of the human Mediator-RNA polymerase II-TFIIF assembly. PLoS Biology. 2011;9(3). doi:10.1371/journal.pbio.1000603","ieee":"C. Bernecky, P. Grob, C. Ebmeier, E. Nogales, and D. Taatjes, “Molecular architecture of the human Mediator-RNA polymerase II-TFIIF assembly,” PLoS Biology, vol. 9, no. 3. Public Library of Science, 2011.","apa":"Bernecky, C., Grob, P., Ebmeier, C., Nogales, E., & Taatjes, D. (2011). Molecular architecture of the human Mediator-RNA polymerase II-TFIIF assembly. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1000603","ista":"Bernecky C, Grob P, Ebmeier C, Nogales E, Taatjes D. 2011. Molecular architecture of the human Mediator-RNA polymerase II-TFIIF assembly. PLoS Biology. 9(3).","short":"C. Bernecky, P. Grob, C. Ebmeier, E. Nogales, D. Taatjes, PLoS Biology 9 (2011).","mla":"Bernecky, Carrie, et al. “Molecular Architecture of the Human Mediator-RNA Polymerase II-TFIIF Assembly.” PLoS Biology, vol. 9, no. 3, Public Library of Science, 2011, doi:10.1371/journal.pbio.1000603.","chicago":"Bernecky, Carrie, Patricia Grob, Christopher Ebmeier, Eva Nogales, and Dylan Taatjes. “Molecular Architecture of the Human Mediator-RNA Polymerase II-TFIIF Assembly.” PLoS Biology. Public Library of Science, 2011. https://doi.org/10.1371/journal.pbio.1000603."},"publication":"PLoS Biology","doi":"10.1371/journal.pbio.1000603","date_published":"2011-03-01T00:00:00Z","language":[{"iso":"eng"}]},{"oa_version":"Published Version","file":[{"file_name":"2011_PLOS_Arellano-Carbajal.PDF","access_level":"open_access","file_size":5625063,"content_type":"application/pdf","creator":"kschuh","relation":"main_file","file_id":"6141","date_updated":"2020-07-14T12:47:20Z","date_created":"2019-03-20T15:18:11Z","checksum":"c609b2ce616d7dafbb617ec5d022f1ea"}],"status":"public","title":"Macoilin, a conserved nervous system–specific ER membrane protein that regulates neuronal excitability","ddc":["570"],"intvolume":" 7","_id":"6140","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Genome sequence comparisons have highlighted many novel gene families that are conserved across animal phyla but whose biological function is unknown. Here, we functionally characterize a member of one such family, the macoilins. Macoilins are characterized by several highly conserved predicted transmembrane domains towards the N-terminus and by coiled-coil regions C-terminally. They are found throughout Eumetazoa but not in other organisms. Mutants for the single Caenorhabditis elegans macoilin, maco-1, exhibit a constellation of behavioral phenotypes, including defects in aggregation, O2 responses, and swimming. MACO-1 protein is expressed broadly and specifically in the nervous system and localizes to the rough endoplasmic reticulum; it is excluded from dendrites and axons. Apart from subtle synapse defects, nervous system development appears wild-type in maco-1 mutants. However, maco-1 animals are resistant to the cholinesterase inhibitor aldicarb and sensitive to levamisole, suggesting pre-synaptic defects. Using in vivo imaging, we show that macoilin is required to evoke Ca2+ transients, at least in some neurons: in maco-1 mutants the O2-sensing neuron PQR is unable to generate a Ca2+ response to a rise in O2. By genetically disrupting neurotransmission, we show that pre-synaptic input is not necessary for PQR to respond to O2, indicating that the response is mediated by cell-intrinsic sensory transduction and amplification. Disrupting the sodium leak channels NCA-1/NCA-2, or the N-,P/Q,R-type voltage-gated Ca2+ channels, also fails to disrupt Ca2+ responses in the PQR cell body to O2 stimuli. By contrast, mutations in egl-19, which encodes the only Caenorhabditis elegans L-type voltage-gated Ca2+ channel α1 subunit, recapitulate the Ca2+ response defect we see in maco-1 mutants, although we do not see defects in localization of EGL-19. Together, our data suggest that macoilin acts in the ER to regulate assembly or traffic of ion channels or ion channel regulators."}],"issue":"3","type":"journal_article","date_published":"2011-03-17T00:00:00Z","publication":"PLoS Genetics","citation":{"ama":"Arellano-Carbajal F, Briseño-Roa L, Couto A, Cheung BHH, Labouesse M, de Bono M. Macoilin, a conserved nervous system–specific ER membrane protein that regulates neuronal excitability. PLoS Genetics. 2011;7(3). doi:10.1371/journal.pgen.1001341","ieee":"F. Arellano-Carbajal, L. Briseño-Roa, A. Couto, B. H. H. Cheung, M. Labouesse, and M. de Bono, “Macoilin, a conserved nervous system–specific ER membrane protein that regulates neuronal excitability,” PLoS Genetics, vol. 7, no. 3. Public Library of Science, 2011.","apa":"Arellano-Carbajal, F., Briseño-Roa, L., Couto, A., Cheung, B. H. H., Labouesse, M., & de Bono, M. (2011). Macoilin, a conserved nervous system–specific ER membrane protein that regulates neuronal excitability. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1001341","ista":"Arellano-Carbajal F, Briseño-Roa L, Couto A, Cheung BHH, Labouesse M, de Bono M. 2011. Macoilin, a conserved nervous system–specific ER membrane protein that regulates neuronal excitability. PLoS Genetics. 7(3), e1001341.","short":"F. Arellano-Carbajal, L. Briseño-Roa, A. Couto, B.H.H. Cheung, M. Labouesse, M. de Bono, PLoS Genetics 7 (2011).","mla":"Arellano-Carbajal, Fausto, et al. “Macoilin, a Conserved Nervous System–Specific ER Membrane Protein That Regulates Neuronal Excitability.” PLoS Genetics, vol. 7, no. 3, e1001341, Public Library of Science, 2011, doi:10.1371/journal.pgen.1001341.","chicago":"Arellano-Carbajal, Fausto, Luis Briseño-Roa, Africa Couto, Benny H. H. Cheung, Michel Labouesse, and Mario de Bono. “Macoilin, a Conserved Nervous System–Specific ER Membrane Protein That Regulates Neuronal Excitability.” PLoS Genetics. Public Library of Science, 2011. https://doi.org/10.1371/journal.pgen.1001341."},"day":"17","has_accepted_license":"1","date_updated":"2021-01-12T08:06:19Z","date_created":"2019-03-20T15:08:23Z","volume":7,"author":[{"first_name":"Fausto","last_name":"Arellano-Carbajal","full_name":"Arellano-Carbajal, Fausto"},{"full_name":"Briseño-Roa, Luis","first_name":"Luis","last_name":"Briseño-Roa"},{"first_name":"Africa","last_name":"Couto","full_name":"Couto, Africa"},{"full_name":"Cheung, Benny H. H.","first_name":"Benny H. H.","last_name":"Cheung"},{"last_name":"Labouesse","first_name":"Michel","full_name":"Labouesse, Michel"},{"full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono","first_name":"Mario"}],"publication_status":"published","publisher":"Public Library of Science","year":"2011","pmid":1,"extern":"1","file_date_updated":"2020-07-14T12:47:20Z","article_number":"e1001341","language":[{"iso":"eng"}],"doi":"10.1371/journal.pgen.1001341","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["21437263"]},"month":"03","publication_identifier":{"issn":["1553-7404"]}},{"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3251049/"}],"oa":1,"external_id":{"pmid":["22135454"]},"quality_controlled":"1","doi":"10.1073/pnas.1106134109","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0027-8424","1091-6490"]},"month":"12","pmid":1,"year":"2011","publisher":"National Academy of Sciences","publication_status":"published","author":[{"full_name":"Milward, K.","last_name":"Milward","first_name":"K."},{"last_name":"Busch","first_name":"K. E.","full_name":"Busch, K. E."},{"first_name":"R. J.","last_name":"Murphy","full_name":"Murphy, R. J."},{"first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario"},{"first_name":"B.","last_name":"Olofsson","full_name":"Olofsson, B."}],"volume":108,"date_updated":"2021-01-12T08:06:18Z","date_created":"2019-03-20T14:30:06Z","extern":"1","citation":{"chicago":"Milward, K., K. E. Busch, R. J. Murphy, Mario de Bono, and B. Olofsson. “Neuronal and Molecular Substrates for Optimal Foraging in Caenorhabditis Elegans.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2011. https://doi.org/10.1073/pnas.1106134109.","mla":"Milward, K., et al. “Neuronal and Molecular Substrates for Optimal Foraging in Caenorhabditis Elegans.” Proceedings of the National Academy of Sciences, vol. 108, no. 51, National Academy of Sciences, 2011, pp. 20672–77, doi:10.1073/pnas.1106134109.","short":"K. Milward, K.E. Busch, R.J. Murphy, M. de Bono, B. Olofsson, Proceedings of the National Academy of Sciences 108 (2011) 20672–20677.","ista":"Milward K, Busch KE, Murphy RJ, de Bono M, Olofsson B. 2011. Neuronal and molecular substrates for optimal foraging in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. 108(51), 20672–20677.","ieee":"K. Milward, K. E. Busch, R. J. Murphy, M. de Bono, and B. Olofsson, “Neuronal and molecular substrates for optimal foraging in Caenorhabditis elegans,” Proceedings of the National Academy of Sciences, vol. 108, no. 51. National Academy of Sciences, pp. 20672–20677, 2011.","apa":"Milward, K., Busch, K. E., Murphy, R. J., de Bono, M., & Olofsson, B. (2011). Neuronal and molecular substrates for optimal foraging in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1106134109","ama":"Milward K, Busch KE, Murphy RJ, de Bono M, Olofsson B. Neuronal and molecular substrates for optimal foraging in Caenorhabditis elegans. Proceedings of the National Academy of Sciences. 2011;108(51):20672-20677. doi:10.1073/pnas.1106134109"},"publication":"Proceedings of the National Academy of Sciences","page":"20672-20677","date_published":"2011-12-20T00:00:00Z","day":"20","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6137","intvolume":" 108","status":"public","title":"Neuronal and molecular substrates for optimal foraging in Caenorhabditis elegans","oa_version":"Submitted Version","type":"journal_article","issue":"51","abstract":[{"lang":"eng","text":"Variation in food quality and abundance requires animals to decide whether to stay on a poor food patch or leave in search of better food. An important question in behavioral ecology asks when is it optimal for an animal to leave a food patch it is depleting. Although optimal foraging is central to evolutionary success, the neural and molecular mechanisms underlying it are poorly understood. Here we investigate the neuronal basis for adaptive food-leaving behavior in response to resource depletion in Caenorhabditis elegans, and identify several of the signaling pathways involved. The ASE neurons, previously implicated in salt chemoattraction, promote food-leaving behavior via a cGMP pathway as food becomes limited. High ambient O2 promotes food-leaving via the O2-sensing neurons AQR, PQR, and URX. Ectopic activation of these neurons using channelrhodopsin is sufficient to induce high food-leaving behavior. In contrast, the neuropeptide receptor NPR-1, which regulates social behavior on food, acts in the ASE neurons, the nociceptive ASH neurons, and in the RMG interneuron to repress food-leaving. Finally, we show that neuroendocrine signaling by TGF-β/DAF-7 and neuronal insulin signaling are necessary for adaptive food-leaving behavior. We suggest that animals integrate information about their nutritional state with ambient oxygen and gustatory stimuli to formulate optimal foraging strategies."}]},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["21435556"]},"oa":1,"quality_controlled":"1","doi":"10.1016/j.neuron.2011.02.023","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"issn":["0896-6273"]},"year":"2011","pmid":1,"publication_status":"published","publisher":"Elsevier BV","author":[{"last_name":"Bretscher","first_name":"Andrew Jonathan","full_name":"Bretscher, Andrew Jonathan"},{"first_name":"Eiji","last_name":"Kodama-Namba","full_name":"Kodama-Namba, Eiji"},{"last_name":"Busch","first_name":"Karl Emanuel","full_name":"Busch, Karl Emanuel"},{"full_name":"Murphy, Robin Joseph","last_name":"Murphy","first_name":"Robin Joseph"},{"last_name":"Soltesz","first_name":"Zoltan","full_name":"Soltesz, Zoltan"},{"first_name":"Patrick","last_name":"Laurent","full_name":"Laurent, Patrick"},{"orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono","first_name":"Mario","full_name":"de Bono, Mario"}],"date_updated":"2021-01-12T08:06:18Z","date_created":"2019-03-20T15:01:41Z","volume":69,"file_date_updated":"2020-07-14T12:47:20Z","extern":"1","publication":"Neuron","citation":{"ista":"Bretscher AJ, Kodama-Namba E, Busch KE, Murphy RJ, Soltesz Z, Laurent P, de Bono M. 2011. Temperature, oxygen, and salt-sensing neurons in C. elegans are carbon dioxide sensors that control avoidance behavior. Neuron. 69(6), 1099–1113.","apa":"Bretscher, A. J., Kodama-Namba, E., Busch, K. E., Murphy, R. J., Soltesz, Z., Laurent, P., & de Bono, M. (2011). Temperature, oxygen, and salt-sensing neurons in C. elegans are carbon dioxide sensors that control avoidance behavior. Neuron. Elsevier BV. https://doi.org/10.1016/j.neuron.2011.02.023","ieee":"A. J. Bretscher et al., “Temperature, oxygen, and salt-sensing neurons in C. elegans are carbon dioxide sensors that control avoidance behavior,” Neuron, vol. 69, no. 6. Elsevier BV, pp. 1099–1113, 2011.","ama":"Bretscher AJ, Kodama-Namba E, Busch KE, et al. Temperature, oxygen, and salt-sensing neurons in C. elegans are carbon dioxide sensors that control avoidance behavior. Neuron. 2011;69(6):1099-1113. doi:10.1016/j.neuron.2011.02.023","chicago":"Bretscher, Andrew Jonathan, Eiji Kodama-Namba, Karl Emanuel Busch, Robin Joseph Murphy, Zoltan Soltesz, Patrick Laurent, and Mario de Bono. “Temperature, Oxygen, and Salt-Sensing Neurons in C. Elegans Are Carbon Dioxide Sensors That Control Avoidance Behavior.” Neuron. Elsevier BV, 2011. https://doi.org/10.1016/j.neuron.2011.02.023.","mla":"Bretscher, Andrew Jonathan, et al. “Temperature, Oxygen, and Salt-Sensing Neurons in C. Elegans Are Carbon Dioxide Sensors That Control Avoidance Behavior.” Neuron, vol. 69, no. 6, Elsevier BV, 2011, pp. 1099–113, doi:10.1016/j.neuron.2011.02.023.","short":"A.J. Bretscher, E. Kodama-Namba, K.E. Busch, R.J. Murphy, Z. Soltesz, P. Laurent, M. de Bono, Neuron 69 (2011) 1099–1113."},"page":"1099-1113","date_published":"2011-03-24T00:00:00Z","day":"24","has_accepted_license":"1","_id":"6138","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"title":"Temperature, oxygen, and salt-sensing neurons in C. elegans are carbon dioxide sensors that control avoidance behavior","status":"public","intvolume":" 69","file":[{"file_id":"6139","relation":"main_file","date_created":"2019-03-20T15:06:32Z","date_updated":"2020-07-14T12:47:20Z","checksum":"547cffd123f4c508ae927c9244b8f92a","file_name":"2011_Cell_Bretscher.pdf","access_level":"open_access","creator":"kschuh","file_size":2448332,"content_type":"application/pdf"}],"oa_version":"Published Version","type":"journal_article","issue":"6"},{"extern":"1","abstract":[{"lang":"eng","text":"Tumor necrosis factor-stimulated gene-6 (TSG-6) is a hyalu-ronan (HA)-binding protein that plays important roles ininflammation and ovulation. TSG-6-mediated cross-linking ofHA has been proposed as a functional mechanism (e.g.for regu-lating leukocyte adhesion), but direct evidence for cross-linkingis lacking, and we know very little about its impact on HA ultra-structure. Here we used films of polymeric and oligomeric HAchains, end-grafted to a solid support, and a combination ofsurface-sensitive biophysical techniques to quantify the bindingof TSG-6 into HA films and to correlate binding to morpholog-ical changes. We find that full-length TSG-6 binds with pro-nounced positive cooperativity and demonstrate that it cancross-link HA at physiologically relevant concentrations. Ourdata indicate that cooperative binding of full-length TSG-6arises from HA-induced protein oligomerization and that theTSG-6 oligomers act as cross-linkers. In contrast, the HA-bind-ing domain of TSG-6 (the Link module) alone binds withoutpositive cooperativity and weaker than the full-length protein.Both the Link module and full-length TSG-6 condensed andrigidified HA films, and the degree of condensation scaled withthe affinity between the TSG-6 constructs and HA. We proposethat condensation is the result of protein-mediated HA cross-linking. Our findings firmly establish that TSG-6 is a potent HAcross-linking agent and might hence have important implica-tions for the mechanistic understanding of the biological func-tion of TSG-6 (e.g.in inflammation)."}],"issue":"29","type":"journal_article","date_created":"2019-04-11T20:57:43Z","date_updated":"2021-01-12T08:06:58Z","oa_version":"Published Version","volume":286,"author":[{"full_name":"Baranova, Natalia","orcid":"0000-0002-3086-9124","id":"38661662-F248-11E8-B48F-1D18A9856A87","last_name":"Baranova","first_name":"Natalia"},{"last_name":"Nilebäck","first_name":"Erik","full_name":"Nilebäck, Erik"},{"first_name":"F. Michael","last_name":"Haller","full_name":"Haller, F. Michael"},{"last_name":"Briggs","first_name":"David C.","full_name":"Briggs, David C."},{"last_name":"Svedhem","first_name":"Sofia","full_name":"Svedhem, Sofia"},{"last_name":"Day","first_name":"Anthony J.","full_name":"Day, Anthony J."},{"last_name":"Richter","first_name":"Ralf P.","full_name":"Richter, Ralf P."}],"title":"The inflammation-associated protein TSG-6 cross-links hyaluronan via hyaluronan-induced TSG-6 oligomers","publication_status":"published","status":"public","publisher":"American Society for Biochemistry & Molecular Biology","intvolume":" 286","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6298","year":"2011","month":"07","day":"22","publication_identifier":{"issn":["0021-9258","1083-351X"]},"language":[{"iso":"eng"}],"date_published":"2011-07-22T00:00:00Z","doi":"10.1074/jbc.m111.247395","quality_controlled":"1","page":"25675-25686","publication":"Journal of Biological Chemistry","oa":1,"citation":{"apa":"Baranova, N. S., Nilebäck, E., Haller, F. M., Briggs, D. C., Svedhem, S., Day, A. J., & Richter, R. P. (2011). The inflammation-associated protein TSG-6 cross-links hyaluronan via hyaluronan-induced TSG-6 oligomers. Journal of Biological Chemistry. American Society for Biochemistry & Molecular Biology. https://doi.org/10.1074/jbc.m111.247395","ieee":"N. S. Baranova et al., “The inflammation-associated protein TSG-6 cross-links hyaluronan via hyaluronan-induced TSG-6 oligomers,” Journal of Biological Chemistry, vol. 286, no. 29. American Society for Biochemistry & Molecular Biology, pp. 25675–25686, 2011.","ista":"Baranova NS, Nilebäck E, Haller FM, Briggs DC, Svedhem S, Day AJ, Richter RP. 2011. The inflammation-associated protein TSG-6 cross-links hyaluronan via hyaluronan-induced TSG-6 oligomers. Journal of Biological Chemistry. 286(29), 25675–25686.","ama":"Baranova NS, Nilebäck E, Haller FM, et al. The inflammation-associated protein TSG-6 cross-links hyaluronan via hyaluronan-induced TSG-6 oligomers. Journal of Biological Chemistry. 2011;286(29):25675-25686. doi:10.1074/jbc.m111.247395","chicago":"Baranova, Natalia S., Erik Nilebäck, F. Michael Haller, David C. Briggs, Sofia Svedhem, Anthony J. Day, and Ralf P. Richter. “The Inflammation-Associated Protein TSG-6 Cross-Links Hyaluronan via Hyaluronan-Induced TSG-6 Oligomers.” Journal of Biological Chemistry. American Society for Biochemistry & Molecular Biology, 2011. https://doi.org/10.1074/jbc.m111.247395.","short":"N.S. Baranova, E. Nilebäck, F.M. Haller, D.C. Briggs, S. Svedhem, A.J. Day, R.P. Richter, Journal of Biological Chemistry 286 (2011) 25675–25686.","mla":"Baranova, Natalia S., et al. “The Inflammation-Associated Protein TSG-6 Cross-Links Hyaluronan via Hyaluronan-Induced TSG-6 Oligomers.” Journal of Biological Chemistry, vol. 286, no. 29, American Society for Biochemistry & Molecular Biology, 2011, pp. 25675–86, doi:10.1074/jbc.m111.247395."},"main_file_link":[{"open_access":"1","url":"http://www.jbc.org/content/286/29/25675.full.pdf"}]},{"publication_identifier":{"issn":["0006-3495"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1016/j.bpj.2011.09.040","quality_controlled":"1","external_id":{"pmid":["22098731"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3218319/"}],"volume":101,"date_created":"2019-05-28T11:54:29Z","date_updated":"2021-04-16T11:54:49Z","author":[{"full_name":"Park, Heungwon","first_name":"Heungwon","last_name":"Park"},{"last_name":"Oikonomou","first_name":"Panos","full_name":"Oikonomou, Panos"},{"full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cluzel, Philippe","last_name":"Cluzel","first_name":"Philippe"}],"publisher":"Elsevier","department":[{"_id":"CaGu"}],"publication_status":"published","pmid":1,"year":"2011","article_processing_charge":"No","day":"16","scopus_import":"1","date_published":"2011-11-16T00:00:00Z","page":"2336-2340","citation":{"mla":"Park, Heungwon, et al. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” Biophysical Journal, vol. 101, no. 10, Elsevier, 2011, pp. 2336–40, doi:10.1016/j.bpj.2011.09.040.","short":"H. Park, P. Oikonomou, C.C. Guet, P. Cluzel, Biophysical Journal 101 (2011) 2336–2340.","chicago":"Park, Heungwon, Panos Oikonomou, Calin C Guet, and Philippe Cluzel. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” Biophysical Journal. Elsevier, 2011. https://doi.org/10.1016/j.bpj.2011.09.040.","ama":"Park H, Oikonomou P, Guet CC, Cluzel P. Noise underlies switching behavior of the bacterial flagellum. Biophysical Journal. 2011;101(10):2336-2340. doi:10.1016/j.bpj.2011.09.040","ista":"Park H, Oikonomou P, Guet CC, Cluzel P. 2011. Noise underlies switching behavior of the bacterial flagellum. Biophysical Journal. 101(10), 2336–2340.","apa":"Park, H., Oikonomou, P., Guet, C. C., & Cluzel, P. (2011). Noise underlies switching behavior of the bacterial flagellum. Biophysical Journal. Elsevier. https://doi.org/10.1016/j.bpj.2011.09.040","ieee":"H. Park, P. Oikonomou, C. C. Guet, and P. Cluzel, “Noise underlies switching behavior of the bacterial flagellum,” Biophysical Journal, vol. 101, no. 10. Elsevier, pp. 2336–2340, 2011."},"publication":"Biophysical Journal","issue":"10","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"}],"type":"journal_article","oa_version":"Published Version","intvolume":" 101","status":"public","title":"Noise underlies switching behavior of the bacterial flagellum","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6496"},{"date_published":"2011-09-13T00:00:00Z","page":"127-177","citation":{"chicago":"Mondelli, Marco, and Adina Ciomaga. “Finite Difference Schemes for MCM and AMSS.” Image Processing On Line. IPOL Image Processing On Line, 2011. https://doi.org/10.5201/ipol.2011.cm_fds.","short":"M. Mondelli, A. Ciomaga, Image Processing On Line 1 (2011) 127–177.","mla":"Mondelli, Marco, and Adina Ciomaga. “Finite Difference Schemes for MCM and AMSS.” Image Processing On Line, vol. 1, IPOL Image Processing On Line, 2011, pp. 127–77, doi:10.5201/ipol.2011.cm_fds.","ieee":"M. Mondelli and A. Ciomaga, “Finite difference schemes for MCM and AMSS,” Image Processing On Line, vol. 1. IPOL Image Processing On Line, pp. 127–177, 2011.","apa":"Mondelli, M., & Ciomaga, A. (2011). Finite difference schemes for MCM and AMSS. Image Processing On Line. IPOL Image Processing On Line. https://doi.org/10.5201/ipol.2011.cm_fds","ista":"Mondelli M, Ciomaga A. 2011. Finite difference schemes for MCM and AMSS. Image Processing On Line. 1, 127–177.","ama":"Mondelli M, Ciomaga A. Finite difference schemes for MCM and AMSS. Image Processing On Line. 2011;1:127-177. doi:10.5201/ipol.2011.cm_fds"},"publication":"Image Processing On Line","has_accepted_license":"1","day":"13","oa_version":"Published Version","file":[{"file_id":"6751","relation":"main_file","date_updated":"2020-07-14T12:47:39Z","date_created":"2019-08-01T06:34:21Z","checksum":"910710811224c633202791e0c217d05d","file_name":"2011_IPOL_Mondelli.pdf","access_level":"open_access","creator":"dernst","file_size":2793903,"content_type":"application/pdf"}],"intvolume":" 1","status":"public","title":"Finite difference schemes for MCM and AMSS","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6749","abstract":[{"lang":"eng","text":"This article refers to algorithms based on finite difference schemes for computing mean and affine curvature evolutions of digital images, introduced by Alvarez and Morel [L. Alvarez, J.M. Morel, “Formalization and computational aspects of image analysis”, Acta Numerica, pp. 159, 1994]. We discuss consistency, stability and convergence. Our analysis focuses on some possible choices of the parameters, choices that generate multiple variants in the implementations. Meaningful visual examples on how the algorithms actually work are provided."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.5201/ipol.2011.cm_fds","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"publication_identifier":{"issn":["2105-1232"]},"month":"09","volume":1,"date_updated":"2021-01-12T08:08:50Z","date_created":"2019-07-31T09:44:24Z","author":[{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"},{"last_name":"Ciomaga","first_name":"Adina","full_name":"Ciomaga, Adina"}],"publisher":"IPOL Image Processing On Line","publication_status":"published","year":"2011","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","extern":"1","file_date_updated":"2020-07-14T12:47:39Z"},{"day":"01","month":"01","publication_identifier":{"isbn":["978-973-703-602-5"]},"quality_controlled":"1","page":"137-156","publication":"Proceedings of the International Student Conference on Pure and Applied Mathematics","citation":{"ama":"Mondelli M, Ciomaga A. On finite difference schemes for curvature motions. In: Proceedings of the International Student Conference on Pure and Applied Mathematics. Editura Universitãtii „Alexandru Ioan Cuza” Iasi; 2011:137-156. doi:10.13140/2.1.1862.4646","ieee":"M. Mondelli and A. Ciomaga, “On finite difference schemes for curvature motions,” in Proceedings of the International Student Conference on Pure and Applied Mathematics, Iasi, Romania, 2011, pp. 137–156.","apa":"Mondelli, M., & Ciomaga, A. (2011). On finite difference schemes for curvature motions. In Proceedings of the International Student Conference on Pure and Applied Mathematics (pp. 137–156). Iasi, Romania: Editura Universitãtii „Alexandru Ioan Cuza” Iasi. https://doi.org/10.13140/2.1.1862.4646","ista":"Mondelli M, Ciomaga A. 2011. On finite difference schemes for curvature motions. Proceedings of the International Student Conference on Pure and Applied Mathematics. ISCOPAM: International Student Conference on Pure and Applied Mathematics, 137–156.","short":"M. Mondelli, A. Ciomaga, in:, Proceedings of the International Student Conference on Pure and Applied Mathematics, Editura Universitãtii „Alexandru Ioan Cuza” Iasi, 2011, pp. 137–156.","mla":"Mondelli, Marco, and Adina Ciomaga. “On Finite Difference Schemes for Curvature Motions.” Proceedings of the International Student Conference on Pure and Applied Mathematics, Editura Universitãtii „Alexandru Ioan Cuza” Iasi, 2011, pp. 137–56, doi:10.13140/2.1.1862.4646.","chicago":"Mondelli, Marco, and Adina Ciomaga. “On Finite Difference Schemes for Curvature Motions.” In Proceedings of the International Student Conference on Pure and Applied Mathematics, 137–56. Editura Universitãtii „Alexandru Ioan Cuza” Iasi, 2011. https://doi.org/10.13140/2.1.1862.4646."},"language":[{"iso":"eng"}],"conference":{"name":"ISCOPAM: International Student Conference on Pure and Applied Mathematics","location":"Iasi, Romania","start_date":"2010-07-12","end_date":"2010-07-16"},"date_published":"2011-01-01T00:00:00Z","doi":"10.13140/2.1.1862.4646","type":"conference","extern":"1","abstract":[{"text":"In the present paper we give a thorough analysis of two finite difference schemes for the Mean Curvature Motion and its affine variant, the Affine Morphological Scale Space, schemes introduced in the Image Processing framework. This analysis brings in a series of parameters that allow us to compute an accurate discrete evolution of curvature motions.\r\nThe choice of these parameters is based on intrinsic geometric properties of the evolution equations for linear, radial and elliptical functions. In the last part we present several examples, underlining the main advantages of the algorithms (the removal of pixelization effects and JPEG artifacts) as well as their major drawbacks (absence of contrast invariance and grid dependence). A detailed explanatory report, the ANSI C implementations and an on-line demo can be found at http://www.ipol.im/.","lang":"eng"}],"title":"On finite difference schemes for curvature motions","publication_status":"published","status":"public","publisher":"Editura Universitãtii „Alexandru Ioan Cuza” Iasi","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6767","year":"2011","date_updated":"2021-01-12T08:08:56Z","date_created":"2019-08-05T12:20:58Z","oa_version":"None","author":[{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"full_name":"Ciomaga, Adina","first_name":"Adina","last_name":"Ciomaga"}]},{"author":[{"full_name":"Salje, E K H","last_name":"Salje","first_name":"E K H"},{"full_name":"Safarik, D J","last_name":"Safarik","first_name":"D J"},{"full_name":"Taylor, R D","last_name":"Taylor","first_name":"R D"},{"last_name":"Pasternak","first_name":"M P","full_name":"Pasternak, M P"},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A"},{"full_name":"Groat, L A","first_name":"L A","last_name":"Groat"},{"full_name":"Lashley, J C","first_name":"J C","last_name":"Lashley"}],"volume":23,"oa_version":"None","date_created":"2019-11-19T13:39:30Z","date_updated":"2021-01-12T08:11:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7076","year":"2011","publisher":"IOP Publishing","intvolume":" 23","publication_status":"published","status":"public","title":"Determination of iron sites and the amount of amorphization in radiation-damaged titanite (CaSiTiO5)","issue":"10","abstract":[{"lang":"eng","text":"Iron is a ubiquitous impurity in metamict (radiation-damaged and partially amorphized) materials such as titanite (CaSiTiO5). Using 57Fe Mössbauer spectroscopy we find that iron in metamict titanite is partitioned between amorphous and crystalline regions based on valence. Trivalent iron exists in the crystalline titanite matrix whereas divalent iron exists almost exclusively in radiation-amorphized regions. We find that the relative abundances of the oxidation states correlate with the volume fraction of amorphous and crystalline regions. Our data also show that oxidation of iron proceeds along with the recrystallization of the amorphized regions. Recrystallization is confirmed to occur over the range 700 °C < T < 925 °C, and no further structural changes are observed at higher temperatures. It is surprising that our Mössbauer measurements show divalent iron to be surrounded by titanite with a high degree of short-range structural order in the amorphized regions. This observation is fundamentally different from other metamict materials such as zircon (ZrSiO4), where amorphized regions show no short-range order."}],"extern":"1","type":"journal_article","article_number":"105402","date_published":"2011-02-21T00:00:00Z","doi":"10.1088/0953-8984/23/10/105402","language":[{"iso":"eng"}],"citation":{"mla":"Salje, E. K. H., et al. “Determination of Iron Sites and the Amount of Amorphization in Radiation-Damaged Titanite (CaSiTiO5).” Journal of Physics: Condensed Matter, vol. 23, no. 10, 105402, IOP Publishing, 2011, doi:10.1088/0953-8984/23/10/105402.","short":"E.K.H. Salje, D.J. Safarik, R.D. Taylor, M.P. Pasternak, K.A. Modic, L.A. Groat, J.C. Lashley, Journal of Physics: Condensed Matter 23 (2011).","chicago":"Salje, E K H, D J Safarik, R D Taylor, M P Pasternak, Kimberly A Modic, L A Groat, and J C Lashley. “Determination of Iron Sites and the Amount of Amorphization in Radiation-Damaged Titanite (CaSiTiO5).” Journal of Physics: Condensed Matter. IOP Publishing, 2011. https://doi.org/10.1088/0953-8984/23/10/105402.","ama":"Salje EKH, Safarik DJ, Taylor RD, et al. Determination of iron sites and the amount of amorphization in radiation-damaged titanite (CaSiTiO5). Journal of Physics: Condensed Matter. 2011;23(10). doi:10.1088/0953-8984/23/10/105402","ista":"Salje EKH, Safarik DJ, Taylor RD, Pasternak MP, Modic KA, Groat LA, Lashley JC. 2011. Determination of iron sites and the amount of amorphization in radiation-damaged titanite (CaSiTiO5). Journal of Physics: Condensed Matter. 23(10), 105402.","apa":"Salje, E. K. H., Safarik, D. J., Taylor, R. D., Pasternak, M. P., Modic, K. A., Groat, L. A., & Lashley, J. C. (2011). Determination of iron sites and the amount of amorphization in radiation-damaged titanite (CaSiTiO5). Journal of Physics: Condensed Matter. IOP Publishing. https://doi.org/10.1088/0953-8984/23/10/105402","ieee":"E. K. H. Salje et al., “Determination of iron sites and the amount of amorphization in radiation-damaged titanite (CaSiTiO5),” Journal of Physics: Condensed Matter, vol. 23, no. 10. IOP Publishing, 2011."},"publication":"Journal of Physics: Condensed Matter","article_type":"original","quality_controlled":"1","publication_identifier":{"issn":["0953-8984","1361-648X"]},"article_processing_charge":"No","month":"02","day":"21"},{"publication_identifier":{"issn":["0925-8388"]},"article_processing_charge":"No","day":"03","month":"02","citation":{"chicago":"Capps, J., B. Ma, T. Drye, C. Nucklos, S. Lindsey, D. Rhodes, Q. Zhang, Kimberly A Modic, S. Cawthorne, and F. Drymiotis. “The Effect of Ag Concentration on the Structural, Electrical and Thermal Transport Behavior of Pb:Te:Ag:Se Mixtures and Improvement of Thermoelectric Performance via Cu Doping.” Journal of Alloys and Compounds. Elsevier, 2011. https://doi.org/10.1016/j.jallcom.2010.10.187.","mla":"Capps, J., et al. “The Effect of Ag Concentration on the Structural, Electrical and Thermal Transport Behavior of Pb:Te:Ag:Se Mixtures and Improvement of Thermoelectric Performance via Cu Doping.” Journal of Alloys and Compounds, vol. 509, no. 5, Elsevier, 2011, pp. 1544–49, doi:10.1016/j.jallcom.2010.10.187.","short":"J. Capps, B. Ma, T. Drye, C. Nucklos, S. Lindsey, D. Rhodes, Q. Zhang, K.A. Modic, S. Cawthorne, F. Drymiotis, Journal of Alloys and Compounds 509 (2011) 1544–1549.","ista":"Capps J, Ma B, Drye T, Nucklos C, Lindsey S, Rhodes D, Zhang Q, Modic KA, Cawthorne S, Drymiotis F. 2011. The effect of Ag concentration on the structural, electrical and thermal transport behavior of Pb:Te:Ag:Se mixtures and improvement of thermoelectric performance via Cu doping. Journal of Alloys and Compounds. 509(5), 1544–1549.","ieee":"J. Capps et al., “The effect of Ag concentration on the structural, electrical and thermal transport behavior of Pb:Te:Ag:Se mixtures and improvement of thermoelectric performance via Cu doping,” Journal of Alloys and Compounds, vol. 509, no. 5. Elsevier, pp. 1544–1549, 2011.","apa":"Capps, J., Ma, B., Drye, T., Nucklos, C., Lindsey, S., Rhodes, D., … Drymiotis, F. (2011). The effect of Ag concentration on the structural, electrical and thermal transport behavior of Pb:Te:Ag:Se mixtures and improvement of thermoelectric performance via Cu doping. Journal of Alloys and Compounds. Elsevier. https://doi.org/10.1016/j.jallcom.2010.10.187","ama":"Capps J, Ma B, Drye T, et al. The effect of Ag concentration on the structural, electrical and thermal transport behavior of Pb:Te:Ag:Se mixtures and improvement of thermoelectric performance via Cu doping. Journal of Alloys and Compounds. 2011;509(5):1544-1549. doi:10.1016/j.jallcom.2010.10.187"},"publication":"Journal of Alloys and Compounds","page":"1544-1549","article_type":"original","quality_controlled":"1","doi":"10.1016/j.jallcom.2010.10.187","date_published":"2011-02-03T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"Pb, Te, Ag and Se, when reacted in a 1:1:x:1 (x = 1.9, 2.0, 2.01) molar ratio, form a two phase composite which consists of a phase which crystallizes in the fcc cubic PbSe structure and a phase that crystallizes in the Ag2Te structure. In this article, we demonstrate that by varying the Ag concentration, we can manipulate which variant of the Ag2Te structure stabilizes at room temperature (monoclinic α-Ag2Te or cubic β-Ag1.9Te) and can consequently manipulate the electrical and thermal transport behavior of the composite and hence the thermoelectric performance. Additionally, we show that Cu-doping results in an overall improvement in thermoelectric performance. Our results suggest that formation of composites is a viable path for achieving a phonon-glass-electron-crystal (PGEC) alloy."}],"extern":"1","year":"2011","_id":"7077","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","intvolume":" 509","publication_status":"published","status":"public","title":"The effect of Ag concentration on the structural, electrical and thermal transport behavior of Pb:Te:Ag:Se mixtures and improvement of thermoelectric performance via Cu doping","author":[{"full_name":"Capps, J.","last_name":"Capps","first_name":"J."},{"first_name":"B.","last_name":"Ma","full_name":"Ma, B."},{"full_name":"Drye, T.","last_name":"Drye","first_name":"T."},{"last_name":"Nucklos","first_name":"C.","full_name":"Nucklos, C."},{"full_name":"Lindsey, S.","last_name":"Lindsey","first_name":"S."},{"full_name":"Rhodes, D.","first_name":"D.","last_name":"Rhodes"},{"full_name":"Zhang, Q.","last_name":"Zhang","first_name":"Q."},{"full_name":"Modic, Kimberly A","last_name":"Modic","first_name":"Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"last_name":"Cawthorne","first_name":"S.","full_name":"Cawthorne, S."},{"full_name":"Drymiotis, F.","last_name":"Drymiotis","first_name":"F."}],"oa_version":"None","volume":509,"date_created":"2019-11-19T13:45:37Z","date_updated":"2021-01-12T08:11:44Z"},{"extern":"1","abstract":[{"text":"Li-ion batteries have transformed portable electronics and will play a key role in the electrification of transport. However, the highest energy storage possible for Li-ion batteries is insufficient for the long-term needs of society, for example, extended-range electric vehicles. To go beyond the horizon of Li-ion batteries is a formidable challenge; there are few options. Here we consider two: Li–air (O2) and Li–S. The energy that can be stored in Li–air (based on aqueous or non-aqueous electrolytes) and Li–S cells is compared with Li-ion; the operation of the cells is discussed, as are the significant hurdles that will have to be overcome if such batteries are to succeed. Fundamental scientific advances in understanding the reactions occurring in the cells as well as new materials are key to overcoming these obstacles. The potential benefits of Li–air and Li–S justify the continued research effort that will be needed.","lang":"eng"}],"issue":"1","type":"journal_article","date_created":"2020-01-15T12:20:01Z","date_updated":"2021-01-12T08:12:59Z","oa_version":"None","volume":11,"author":[{"full_name":"Bruce, Peter G.","last_name":"Bruce","first_name":"Peter G."},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander"},{"last_name":"Hardwick","first_name":"Laurence J.","full_name":"Hardwick, Laurence J."},{"first_name":"Jean-Marie","last_name":"Tarascon","full_name":"Tarascon, Jean-Marie"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/nmat3237","relation":"erratum"}]},"publication_status":"published","status":"public","title":"Li–O2 and Li–S batteries with high energy storage","publisher":"Springer Nature","intvolume":" 11","_id":"7313","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","month":"12","publication_identifier":{"issn":["1476-1122","1476-4660"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2011-12-15T00:00:00Z","doi":"10.1038/nmat3191","article_type":"original","quality_controlled":"1","page":"19-29","publication":"Nature Materials","citation":{"ista":"Bruce PG, Freunberger SA, Hardwick LJ, Tarascon J-M. 2011. Li–O2 and Li–S batteries with high energy storage. Nature Materials. 11(1), 19–29.","apa":"Bruce, P. G., Freunberger, S. A., Hardwick, L. J., & Tarascon, J.-M. (2011). Li–O2 and Li–S batteries with high energy storage. Nature Materials. Springer Nature. https://doi.org/10.1038/nmat3191","ieee":"P. G. Bruce, S. A. Freunberger, L. J. Hardwick, and J.-M. Tarascon, “Li–O2 and Li–S batteries with high energy storage,” Nature Materials, vol. 11, no. 1. Springer Nature, pp. 19–29, 2011.","ama":"Bruce PG, Freunberger SA, Hardwick LJ, Tarascon J-M. Li–O2 and Li–S batteries with high energy storage. Nature Materials. 2011;11(1):19-29. doi:10.1038/nmat3191","chicago":"Bruce, Peter G., Stefan Alexander Freunberger, Laurence J. Hardwick, and Jean-Marie Tarascon. “Li–O2 and Li–S Batteries with High Energy Storage.” Nature Materials. Springer Nature, 2011. https://doi.org/10.1038/nmat3191.","mla":"Bruce, Peter G., et al. “Li–O2 and Li–S Batteries with High Energy Storage.” Nature Materials, vol. 11, no. 1, Springer Nature, 2011, pp. 19–29, doi:10.1038/nmat3191.","short":"P.G. Bruce, S.A. Freunberger, L.J. Hardwick, J.-M. Tarascon, Nature Materials 11 (2011) 19–29."}},{"day":"05","month":"09","article_processing_charge":"No","publication_identifier":{"issn":["1433-7851"]},"date_published":"2011-09-05T00:00:00Z","doi":"10.1002/anie.201102357","language":[{"iso":"eng"}],"publication":"Angewandte Chemie International Edition","citation":{"ama":"Freunberger SA, Chen Y, Drewett NE, Hardwick LJ, Bardé F, Bruce PG. The Lithium-Oxygen battery with ether-based electrolytes. Angewandte Chemie International Edition. 2011;50(37):8609-8613. doi:10.1002/anie.201102357","ista":"Freunberger SA, Chen Y, Drewett NE, Hardwick LJ, Bardé F, Bruce PG. 2011. The Lithium-Oxygen battery with ether-based electrolytes. Angewandte Chemie International Edition. 50(37), 8609–8613.","ieee":"S. A. Freunberger, Y. Chen, N. E. Drewett, L. J. Hardwick, F. Bardé, and P. G. Bruce, “The Lithium-Oxygen battery with ether-based electrolytes,” Angewandte Chemie International Edition, vol. 50, no. 37. Wiley, pp. 8609–8613, 2011.","apa":"Freunberger, S. A., Chen, Y., Drewett, N. E., Hardwick, L. J., Bardé, F., & Bruce, P. G. (2011). The Lithium-Oxygen battery with ether-based electrolytes. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201102357","mla":"Freunberger, Stefan Alexander, et al. “The Lithium-Oxygen Battery with Ether-Based Electrolytes.” Angewandte Chemie International Edition, vol. 50, no. 37, Wiley, 2011, pp. 8609–13, doi:10.1002/anie.201102357.","short":"S.A. Freunberger, Y. Chen, N.E. Drewett, L.J. Hardwick, F. Bardé, P.G. Bruce, Angewandte Chemie International Edition 50 (2011) 8609–8613.","chicago":"Freunberger, Stefan Alexander, Yuhui Chen, Nicholas E. Drewett, Laurence J. Hardwick, Fanny Bardé, and Peter G. Bruce. “The Lithium-Oxygen Battery with Ether-Based Electrolytes.” Angewandte Chemie International Edition. Wiley, 2011. https://doi.org/10.1002/anie.201102357."},"quality_controlled":"1","article_type":"original","page":"8609-8613","abstract":[{"text":"The electrolyte is one of the greatest challenges facing the development of the non‐aqueous Li–O2 battery. Although ether‐based electrolytes do from Li2O2 on the first discharge, it is shown by various techniques that they also decompose and that decomposition increases while Li2O2 decreases on cycling (see picture). Thus, these electrolytes are not suitable. ","lang":"eng"}],"issue":"37","extern":"1","type":"journal_article","author":[{"orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander"},{"full_name":"Chen, Yuhui","first_name":"Yuhui","last_name":"Chen"},{"last_name":"Drewett","first_name":"Nicholas E.","full_name":"Drewett, Nicholas E."},{"first_name":"Laurence J.","last_name":"Hardwick","full_name":"Hardwick, Laurence J."},{"full_name":"Bardé, Fanny","first_name":"Fanny","last_name":"Bardé"},{"full_name":"Bruce, Peter G.","last_name":"Bruce","first_name":"Peter G."}],"date_created":"2020-01-15T12:20:19Z","date_updated":"2021-01-12T08:12:59Z","volume":50,"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7314","year":"2011","publication_status":"published","title":"The Lithium-Oxygen battery with ether-based electrolytes","status":"public","publisher":"Wiley","intvolume":" 50"},{"author":[{"last_name":"Trahey","first_name":"L.","full_name":"Trahey, L."},{"last_name":"Johnson","first_name":"C. S.","full_name":"Johnson, C. S."},{"full_name":"Vaughey, J. T.","last_name":"Vaughey","first_name":"J. T."},{"first_name":"S.-H.","last_name":"Kang","full_name":"Kang, S.-H."},{"first_name":"L. J.","last_name":"Hardwick","full_name":"Hardwick, L. J."},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander"},{"full_name":"Bruce, P. G.","first_name":"P. G.","last_name":"Bruce"},{"last_name":"Thackeray","first_name":"M. M.","full_name":"Thackeray, M. M."}],"date_updated":"2021-01-12T08:13:00Z","date_created":"2020-01-15T12:20:54Z","volume":14,"oa_version":"None","_id":"7317","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Activated Lithium-Metal-Oxides as catalytic electrodes for Li–O2 cells","publication_status":"published","intvolume":" 14","publisher":"The Electrochemical Society","abstract":[{"text":"Lithium-metal oxides with a high formal Li2O content, such as Li5FeO4 (5Li2O•Fe2O3) and a Li2MnO3•LiFeO2 composite ({Li2O•MnO2}•{Li2O•Fe2O3}) have been explored as electrocatalysts for primary and rechargeable Li-O2 cells. Activation occurs predominantly by Li2O removal, either electrochemically or chemically by acid-treatment. Superior electrochemical behavior is obtained if activation occurs by acid-treatment; Li2MnO3•LiFeO2 catalysts provide 2516 mAh/g (carbon) corresponding to 931 mAh/g (electrocatalyst + carbon) during the initial discharge. The reaction is reasonably reversible during the early cycles. The approach has implications for designing electrocatalysts that participate through electrochemical Li2O extraction/reformation reactions, offering exceptionally high capacities.","lang":"eng"}],"issue":"5","extern":"1","article_number":"A64","type":"journal_article","date_published":"2011-03-02T00:00:00Z","doi":"10.1149/1.3555366","language":[{"iso":"eng"}],"publication":"Electrochemical and Solid-State Letters","citation":{"chicago":"Trahey, L., C. S. Johnson, J. T. Vaughey, S.-H. Kang, L. J. Hardwick, Stefan Alexander Freunberger, P. G. Bruce, and M. M. Thackeray. “Activated Lithium-Metal-Oxides as Catalytic Electrodes for Li–O2 Cells.” Electrochemical and Solid-State Letters. The Electrochemical Society, 2011. https://doi.org/10.1149/1.3555366.","mla":"Trahey, L., et al. “Activated Lithium-Metal-Oxides as Catalytic Electrodes for Li–O2 Cells.” Electrochemical and Solid-State Letters, vol. 14, no. 5, A64, The Electrochemical Society, 2011, doi:10.1149/1.3555366.","short":"L. Trahey, C.S. Johnson, J.T. Vaughey, S.-H. Kang, L.J. Hardwick, S.A. Freunberger, P.G. Bruce, M.M. Thackeray, Electrochemical and Solid-State Letters 14 (2011).","ista":"Trahey L, Johnson CS, Vaughey JT, Kang S-H, Hardwick LJ, Freunberger SA, Bruce PG, Thackeray MM. 2011. Activated Lithium-Metal-Oxides as catalytic electrodes for Li–O2 cells. Electrochemical and Solid-State Letters. 14(5), A64.","ieee":"L. Trahey et al., “Activated Lithium-Metal-Oxides as catalytic electrodes for Li–O2 cells,” Electrochemical and Solid-State Letters, vol. 14, no. 5. The Electrochemical Society, 2011.","apa":"Trahey, L., Johnson, C. S., Vaughey, J. T., Kang, S.-H., Hardwick, L. J., Freunberger, S. A., … Thackeray, M. M. (2011). Activated Lithium-Metal-Oxides as catalytic electrodes for Li–O2 cells. Electrochemical and Solid-State Letters. The Electrochemical Society. https://doi.org/10.1149/1.3555366","ama":"Trahey L, Johnson CS, Vaughey JT, et al. Activated Lithium-Metal-Oxides as catalytic electrodes for Li–O2 cells. Electrochemical and Solid-State Letters. 2011;14(5). doi:10.1149/1.3555366"},"quality_controlled":"1","article_type":"original","month":"03","day":"02","article_processing_charge":"No","publication_identifier":{"issn":["1099-0062"]}},{"language":[{"iso":"eng"}],"date_published":"2011-04-27T00:00:00Z","doi":"10.1021/ja2021747","page":"8040-8047","article_type":"original","quality_controlled":"1","citation":{"ama":"Freunberger SA, Chen Y, Peng Z, et al. Reactions in the rechargeable Lithium–O2 battery with alkyl carbonate electrolytes. Journal of the American Chemical Society. 2011;133(20):8040-8047. doi:10.1021/ja2021747","apa":"Freunberger, S. A., Chen, Y., Peng, Z., Griffin, J. M., Hardwick, L. J., Bardé, F., … Bruce, P. G. (2011). Reactions in the rechargeable Lithium–O2 battery with alkyl carbonate electrolytes. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja2021747","ieee":"S. A. Freunberger et al., “Reactions in the rechargeable Lithium–O2 battery with alkyl carbonate electrolytes,” Journal of the American Chemical Society, vol. 133, no. 20. ACS, pp. 8040–8047, 2011.","ista":"Freunberger SA, Chen Y, Peng Z, Griffin JM, Hardwick LJ, Bardé F, Novák P, Bruce PG. 2011. Reactions in the rechargeable Lithium–O2 battery with alkyl carbonate electrolytes. Journal of the American Chemical Society. 133(20), 8040–8047.","short":"S.A. Freunberger, Y. Chen, Z. Peng, J.M. Griffin, L.J. Hardwick, F. Bardé, P. Novák, P.G. Bruce, Journal of the American Chemical Society 133 (2011) 8040–8047.","mla":"Freunberger, Stefan Alexander, et al. “Reactions in the Rechargeable Lithium–O2 Battery with Alkyl Carbonate Electrolytes.” Journal of the American Chemical Society, vol. 133, no. 20, ACS, 2011, pp. 8040–47, doi:10.1021/ja2021747.","chicago":"Freunberger, Stefan Alexander, Yuhui Chen, Zhangquan Peng, John M. Griffin, Laurence J. Hardwick, Fanny Bardé, Petr Novák, and Peter G. Bruce. “Reactions in the Rechargeable Lithium–O2 Battery with Alkyl Carbonate Electrolytes.” Journal of the American Chemical Society. ACS, 2011. https://doi.org/10.1021/ja2021747."},"publication":"Journal of the American Chemical Society","article_processing_charge":"No","publication_identifier":{"issn":["0002-7863","1520-5126"]},"day":"27","month":"04","volume":133,"oa_version":"None","date_created":"2020-01-15T12:20:43Z","date_updated":"2021-01-12T08:13:00Z","author":[{"first_name":"Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander"},{"last_name":"Chen","first_name":"Yuhui","full_name":"Chen, Yuhui"},{"first_name":"Zhangquan","last_name":"Peng","full_name":"Peng, Zhangquan"},{"last_name":"Griffin","first_name":"John M.","full_name":"Griffin, John M."},{"full_name":"Hardwick, Laurence J.","first_name":"Laurence J.","last_name":"Hardwick"},{"last_name":"Bardé","first_name":"Fanny","full_name":"Bardé, Fanny"},{"first_name":"Petr","last_name":"Novák","full_name":"Novák, Petr"},{"first_name":"Peter G.","last_name":"Bruce","full_name":"Bruce, Peter G."}],"publisher":"ACS","intvolume":" 133","title":"Reactions in the rechargeable Lithium–O2 battery with alkyl carbonate electrolytes","publication_status":"published","status":"public","_id":"7316","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","issue":"20","abstract":[{"lang":"eng","text":"The nonaqueous rechargeable lithium–O2 battery containing an alkyl carbonate electrolyte discharges by formation of C3H6(OCO2Li)2, Li2CO3, HCO2Li, CH3CO2Li, CO2, and H2O at the cathode, due to electrolyte decomposition. Charging involves oxidation of C3H6(OCO2Li)2, Li2CO3, HCO2Li, CH3CO2Li accompanied by CO2 and H2O evolution. Mechanisms are proposed for the reactions on discharge and charge. The different pathways for discharge and charge are consistent with the widely observed voltage gap in Li–O2 cells. Oxidation of C3H6(OCO2Li)2 involves terminal carbonate groups leaving behind the OC3H6O moiety that reacts to form a thick gel on the Li anode. Li2CO3, HCO2Li, CH3CO2Li, and C3H6(OCO2Li)2 accumulate in the cathode on cycling correlating with capacity fading and cell failure. The latter is compounded by continuous consumption of the electrolyte on each discharge."}],"type":"journal_article"},{"issue":"28","abstract":[{"lang":"eng","text":"Spectroscopic data (see picture) provide direct evidence that in non‐aqueous Li+ electrolyte, O2 is reduced to O2−, which then forms LiO2 on the electrode surface which disproportionates to Li2O2. On charging, Li2O2 decomposes directly, in a one‐step reaction to evolve O2 and does not pass through LiO2 as an intermediate. "}],"extern":"1","type":"journal_article","author":[{"first_name":"Zhangquan","last_name":"Peng","full_name":"Peng, Zhangquan"},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander"},{"full_name":"Hardwick, Laurence J.","last_name":"Hardwick","first_name":"Laurence J."},{"first_name":"Yuhui","last_name":"Chen","full_name":"Chen, Yuhui"},{"full_name":"Giordani, Vincent","last_name":"Giordani","first_name":"Vincent"},{"full_name":"Bardé, Fanny","first_name":"Fanny","last_name":"Bardé"},{"full_name":"Novák, Petr","first_name":"Petr","last_name":"Novák"},{"first_name":"Duncan","last_name":"Graham","full_name":"Graham, Duncan"},{"full_name":"Tarascon, Jean-Marie","first_name":"Jean-Marie","last_name":"Tarascon"},{"full_name":"Bruce, Peter G.","last_name":"Bruce","first_name":"Peter G."}],"oa_version":"None","volume":50,"date_created":"2020-01-15T12:20:31Z","date_updated":"2021-01-12T08:12:59Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7315","year":"2011","publisher":"Wiley","intvolume":" 50","status":"public","publication_status":"published","title":"Oxygen reactions in a non-aqueous Li+ electrolyte","article_processing_charge":"No","publication_identifier":{"issn":["1433-7851"]},"day":"04","month":"07","doi":"10.1002/anie.201100879","date_published":"2011-07-04T00:00:00Z","language":[{"iso":"eng"}],"citation":{"chicago":"Peng, Zhangquan, Stefan Alexander Freunberger, Laurence J. Hardwick, Yuhui Chen, Vincent Giordani, Fanny Bardé, Petr Novák, Duncan Graham, Jean-Marie Tarascon, and Peter G. Bruce. “Oxygen Reactions in a Non-Aqueous Li+ Electrolyte.” Angewandte Chemie International Edition. Wiley, 2011. https://doi.org/10.1002/anie.201100879.","mla":"Peng, Zhangquan, et al. “Oxygen Reactions in a Non-Aqueous Li+ Electrolyte.” Angewandte Chemie International Edition, vol. 50, no. 28, Wiley, 2011, pp. 6351–55, doi:10.1002/anie.201100879.","short":"Z. Peng, S.A. Freunberger, L.J. Hardwick, Y. Chen, V. Giordani, F. Bardé, P. Novák, D. Graham, J.-M. Tarascon, P.G. Bruce, Angewandte Chemie International Edition 50 (2011) 6351–6355.","ista":"Peng Z, Freunberger SA, Hardwick LJ, Chen Y, Giordani V, Bardé F, Novák P, Graham D, Tarascon J-M, Bruce PG. 2011. Oxygen reactions in a non-aqueous Li+ electrolyte. Angewandte Chemie International Edition. 50(28), 6351–6355.","apa":"Peng, Z., Freunberger, S. A., Hardwick, L. J., Chen, Y., Giordani, V., Bardé, F., … Bruce, P. G. (2011). Oxygen reactions in a non-aqueous Li+ electrolyte. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201100879","ieee":"Z. Peng et al., “Oxygen reactions in a non-aqueous Li+ electrolyte,” Angewandte Chemie International Edition, vol. 50, no. 28. Wiley, pp. 6351–6355, 2011.","ama":"Peng Z, Freunberger SA, Hardwick LJ, et al. Oxygen reactions in a non-aqueous Li+ electrolyte. Angewandte Chemie International Edition. 2011;50(28):6351-6355. doi:10.1002/anie.201100879"},"publication":"Angewandte Chemie International Edition","page":"6351-6355","article_type":"original"},{"page":"41 - 52","citation":{"chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms,” 6522 LNCS:41–52. Springer, 2011. https://doi.org/10.1007/978-3-642-17679-1_4.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2011, pp. 41–52.","mla":"Alistarh, Dan-Adrian, et al. Generating Fast Indulgent Algorithms. Vol. 6522 LNCS, Springer, 2011, pp. 41–52, doi:10.1007/978-3-642-17679-1_4.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating fast indulgent algorithms,” presented at the ICDCN: International Conference on Distributed Computing and Networking, 2011, vol. 6522 LNCS, pp. 41–52.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2011). Generating fast indulgent algorithms (Vol. 6522 LNCS, pp. 41–52). Presented at the ICDCN: International Conference on Distributed Computing and Networking, Springer. https://doi.org/10.1007/978-3-642-17679-1_4","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2011. Generating fast indulgent algorithms. ICDCN: International Conference on Distributed Computing and Networking, LNCS, vol. 6522 LNCS, 41–52.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Generating fast indulgent algorithms. In: Vol 6522 LNCS. Springer; 2011:41-52. doi:10.1007/978-3-642-17679-1_4"},"language":[{"iso":"eng"}],"date_published":"2011-01-01T00:00:00Z","doi":"10.1007/978-3-642-17679-1_4","conference":{"name":"ICDCN: International Conference on Distributed Computing and Networking"},"article_processing_charge":"No","month":"01","day":"01","publisher":"Springer","status":"public","publication_status":"published","title":"Generating fast indulgent algorithms","acknowledgement":"The authors would like to thank Prof. Hagit Attiya and Nikola\r\nKneˇ\r\nzevi ́\r\nc for their help on previous drafts of this paper, and the anonymous reviewers\r\nfor their useful feedback.","_id":"757","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":"6522 LNCS","date_created":"2018-12-11T11:48:20Z","date_updated":"2023-02-23T13:11:09Z","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Gilbert","first_name":"Seth","full_name":"Gilbert, Seth"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Corentin","last_name":"Travers","full_name":"Travers, Corentin"}],"alternative_title":["LNCS"],"type":"conference","extern":"1","publist_id":"6898","abstract":[{"text":"Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficiently transform an algorithm that relies on synchronization into an algorithm that tolerates asynchronous executions. We introduce a transformation technique from synchronous algorithms to indulgent algorithms [1], which induces only a constant overhead in terms of time complexity in well-behaved executions. Our technique is based on a new abstraction we call an asynchrony detector, which the participating processes implement collectively. The resulting transformation works for a large class of colorless tasks, including consensus and set agreement. Interestingly, we also show that our technique is relevant for colored tasks, by applying it to the renaming problem, to obtain the first indulgent renaming algorithm.","lang":"eng"}]},{"_id":"759","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to thank Hagit Attiya and Keren\r\nCensor-Hillel for discussions and feedback on earlier versions of this paper, and the anonymous reviewers for their\r\nvery useful suggestions.","year":"2011","publisher":"IEEE","publication_status":"published","status":"public","title":"The complexity of renaming","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Aspnes, James","first_name":"James","last_name":"Aspnes"},{"full_name":"Gilbert, Seth","first_name":"Seth","last_name":"Gilbert"},{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"}],"oa_version":"None","date_created":"2018-12-11T11:48:21Z","date_updated":"2023-02-23T13:11:40Z","type":"conference","publist_id":"6895","abstract":[{"text":"We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Ω(k) process steps for deterministic renaming into any namespace of size sub-exponential in k, where k is the number of participants. This bound is tight: it draws an exponential separation between deterministic and randomized solutions, and implies new tight bounds for deterministic fetch-and-increment registers, queues and stacks. The proof of the bound is interesting in its own right, for it relies on the first reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. We complement our individual bound with a global lower bound of Ω(k log (k/c)) on the total step complexity of renaming into a namespace of size ck, for any c ≥ 1. This applies to randomized algorithms against a strong adversary, and helps derive new global lower bounds for randomized approximate counter and fetch-and-increment implementations, all tight within logarithmic factors.","lang":"eng"}],"extern":"1","citation":{"chicago":"Alistarh, Dan-Adrian, James Aspnes, Seth Gilbert, and Rachid Guerraoui. “The Complexity of Renaming,” 718–27. IEEE, 2011. https://doi.org/10.1109/FOCS.2011.66.","short":"D.-A. Alistarh, J. Aspnes, S. Gilbert, R. Guerraoui, in:, IEEE, 2011, pp. 718–727.","mla":"Alistarh, Dan-Adrian, et al. The Complexity of Renaming. IEEE, 2011, pp. 718–27, doi:10.1109/FOCS.2011.66.","ieee":"D.-A. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, “The complexity of renaming,” presented at the FOCS: Foundations of Computer Science, 2011, pp. 718–727.","apa":"Alistarh, D.-A., Aspnes, J., Gilbert, S., & Guerraoui, R. (2011). The complexity of renaming (pp. 718–727). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2011.66","ista":"Alistarh D-A, Aspnes J, Gilbert S, Guerraoui R. 2011. The complexity of renaming. FOCS: Foundations of Computer Science, 718–727.","ama":"Alistarh D-A, Aspnes J, Gilbert S, Guerraoui R. The complexity of renaming. In: IEEE; 2011:718-727. doi:10.1109/FOCS.2011.66"},"page":"718 - 727","date_published":"2011-01-01T00:00:00Z","doi":"10.1109/FOCS.2011.66","conference":{"name":"FOCS: Foundations of Computer Science"},"language":[{"iso":"eng"}],"article_processing_charge":"No","day":"01","month":"01"},{"month":"01","day":"01","article_processing_charge":"No","citation":{"short":"D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, M. Zadimoghaddam, in:, ACM, 2011, pp. 239–248.","mla":"Alistarh, Dan-Adrian, et al. Optimal-Time Adaptive Strong Renaming, with Applications to Counting. ACM, 2011, pp. 239–48, doi:10.1145/1993806.1993850.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Morteza Zadimoghaddam. “Optimal-Time Adaptive Strong Renaming, with Applications to Counting,” 239–48. ACM, 2011. https://doi.org/10.1145/1993806.1993850.","ama":"Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. Optimal-time adaptive strong renaming, with applications to counting. In: ACM; 2011:239-248. doi:10.1145/1993806.1993850","ieee":"D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and M. Zadimoghaddam, “Optimal-time adaptive strong renaming, with applications to counting,” presented at the PODC: Principles of Distributed Computing, 2011, pp. 239–248.","apa":"Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., & Zadimoghaddam, M. (2011). Optimal-time adaptive strong renaming, with applications to counting (pp. 239–248). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/1993806.1993850","ista":"Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. 2011. Optimal-time adaptive strong renaming, with applications to counting. PODC: Principles of Distributed Computing, 239–248."},"page":"239 - 248","conference":{"name":"PODC: Principles of Distributed Computing"},"date_published":"2011-01-01T00:00:00Z","doi":"10.1145/1993806.1993850","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"We give two new randomized algorithms for strong renaming, both of which work against an adaptive adversary in asynchronous shared memory. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of n processes with step complexity O(log3 n). The second transforms any sorting network into a strong adaptive renaming protocol, with an expected cost equal to the depth of the sorting network. Using an AKS sorting network, this gives a strong adaptive renaming algorithm with step complexity O(log k), where k is the contention in the current execution. We show this to be optimal based on a classic lower bound of Jayanti. We also show that any such strong renaming protocol can be used to build a monotone-consistent counter with logarithmic step complexity (at the cost of adding a max register) or a linearizable fetch-and-increment register (at the cost of increasing the step complexity by a logarithmic factor)."}],"publist_id":"6897","extern":"1","_id":"761","acknowledgement":"We would like to thank Hagit Attiya, Rachid Guerraoui\r\nand Prasad Jayanti for useful discussions and support. We\r\nwould also like to thank the anonymous reviewers for many\r\nuseful comments.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","title":"Optimal-time adaptive strong renaming, with applications to counting","publication_status":"published","status":"public","publisher":"ACM","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"first_name":"Keren","last_name":"Censor Hillel","full_name":"Censor Hillel, Keren"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"first_name":"Morteza","last_name":"Zadimoghaddam","full_name":"Zadimoghaddam, Morteza"}],"date_updated":"2023-02-23T13:12:17Z","date_created":"2018-12-11T11:48:22Z","oa_version":"None"},{"extern":"1","abstract":[{"text":"A randomized implementation is given of a test-and-set register with O(log log n) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complexity improvement over previous solutions designed to work against a strong adversary.","lang":"eng"}],"publist_id":"6896","alternative_title":["LNCS"],"type":"conference","date_created":"2018-12-11T11:48:21Z","date_updated":"2023-02-23T13:12:01Z","volume":"6950 LNCS","oa_version":"None","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"}],"status":"public","publication_status":"published","title":"Sub-logarithmic test-and-set against a weak adversary","publisher":"Springer","_id":"760","acknowledgement":"The work of Dan Alistarh was supported by the NCCR MICS Project. The work of James Aspnes was supported in part by NSF grant CCF-0916389.","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","day":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"conference":{"name":"DISC: Distributed Computing"},"date_published":"2011-01-01T00:00:00Z","doi":"10.1007/978-3-642-24100-0_7","page":"97 - 109","citation":{"ama":"Alistarh D-A, Aspnes J. Sub-logarithmic test-and-set against a weak adversary. In: Vol 6950 LNCS. Springer; 2011:97-109. doi:10.1007/978-3-642-24100-0_7","ieee":"D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS, pp. 97–109.","apa":"Alistarh, D.-A., & Aspnes, J. (2011). Sub-logarithmic test-and-set against a weak adversary (Vol. 6950 LNCS, pp. 97–109). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-24100-0_7","ista":"Alistarh D-A, Aspnes J. 2011. Sub-logarithmic test-and-set against a weak adversary. DISC: Distributed Computing, LNCS, vol. 6950 LNCS, 97–109.","short":"D.-A. Alistarh, J. Aspnes, in:, Springer, 2011, pp. 97–109.","mla":"Alistarh, Dan-Adrian, and James Aspnes. Sub-Logarithmic Test-and-Set against a Weak Adversary. Vol. 6950 LNCS, Springer, 2011, pp. 97–109, doi:10.1007/978-3-642-24100-0_7.","chicago":"Alistarh, Dan-Adrian, and James Aspnes. “Sub-Logarithmic Test-and-Set against a Weak Adversary,” 6950 LNCS:97–109. Springer, 2011. https://doi.org/10.1007/978-3-642-24100-0_7."}},{"month":"11","day":"01","publication_identifier":{"issn":["1465-7279","1045-2249"]},"article_processing_charge":"No","publication":"Behavioral Ecology","citation":{"ama":"Robinson MR. Understanding intrasexual competition and sexual selection requires an evolutionary ecology framework. Behavioral Ecology. 2011;22(6):1143-1144. doi:10.1093/beheco/arr110","ista":"Robinson MR. 2011. Understanding intrasexual competition and sexual selection requires an evolutionary ecology framework. Behavioral Ecology. 22(6), 1143–1144.","apa":"Robinson, M. R. (2011). Understanding intrasexual competition and sexual selection requires an evolutionary ecology framework. Behavioral Ecology. Oxford University Press. https://doi.org/10.1093/beheco/arr110","ieee":"M. R. Robinson, “Understanding intrasexual competition and sexual selection requires an evolutionary ecology framework,” Behavioral Ecology, vol. 22, no. 6. Oxford University Press, pp. 1143–1144, 2011.","mla":"Robinson, Matthew Richard. “Understanding Intrasexual Competition and Sexual Selection Requires an Evolutionary Ecology Framework.” Behavioral Ecology, vol. 22, no. 6, Oxford University Press, 2011, pp. 1143–44, doi:10.1093/beheco/arr110.","short":"M.R. Robinson, Behavioral Ecology 22 (2011) 1143–1144.","chicago":"Robinson, Matthew Richard. “Understanding Intrasexual Competition and Sexual Selection Requires an Evolutionary Ecology Framework.” Behavioral Ecology. Oxford University Press, 2011. https://doi.org/10.1093/beheco/arr110."},"quality_controlled":"1","article_type":"original","page":"1143-1144","doi":"10.1093/beheco/arr110","date_published":"2011-11-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"6","extern":"1","_id":"7750","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","publication_status":"published","title":"Understanding intrasexual competition and sexual selection requires an evolutionary ecology framework","status":"public","intvolume":" 22","publisher":"Oxford University Press","author":[{"first_name":"Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard"}],"date_updated":"2021-01-12T08:15:16Z","date_created":"2020-04-30T11:01:43Z","volume":22,"oa_version":"None"},{"article_type":"original","page":"17872-17886","publication":"Journal of Neuroscience","citation":{"chicago":"Woodruff, A. R., L. M. McGarry, Tim P Vogels, M. Inan, S. A. Anderson, and R. Yuste. “State-Dependent Function of Neocortical Chandelier Cells.” Journal of Neuroscience. Society for Neuroscience, 2011. https://doi.org/10.1523/jneurosci.3894-11.2011.","short":"A.R. Woodruff, L.M. McGarry, T.P. Vogels, M. Inan, S.A. Anderson, R. Yuste, Journal of Neuroscience 31 (2011) 17872–17886.","mla":"Woodruff, A. R., et al. “State-Dependent Function of Neocortical Chandelier Cells.” Journal of Neuroscience, vol. 31, no. 49, Society for Neuroscience, 2011, pp. 17872–86, doi:10.1523/jneurosci.3894-11.2011.","ieee":"A. R. Woodruff, L. M. McGarry, T. P. Vogels, M. Inan, S. A. Anderson, and R. Yuste, “State-dependent function of neocortical chandelier cells,” Journal of Neuroscience, vol. 31, no. 49. Society for Neuroscience, pp. 17872–17886, 2011.","apa":"Woodruff, A. R., McGarry, L. M., Vogels, T. P., Inan, M., Anderson, S. A., & Yuste, R. (2011). State-dependent function of neocortical chandelier cells. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/jneurosci.3894-11.2011","ista":"Woodruff AR, McGarry LM, Vogels TP, Inan M, Anderson SA, Yuste R. 2011. State-dependent function of neocortical chandelier cells. Journal of Neuroscience. 31(49), 17872–17886.","ama":"Woodruff AR, McGarry LM, Vogels TP, Inan M, Anderson SA, Yuste R. State-dependent function of neocortical chandelier cells. Journal of Neuroscience. 2011;31(49):17872-17886. doi:10.1523/jneurosci.3894-11.2011"},"date_published":"2011-12-07T00:00:00Z","day":"7","article_processing_charge":"No","status":"public","title":"State-dependent function of neocortical chandelier cells","intvolume":" 31","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"8025","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Chandelier (axoaxonic) cells (ChCs) are a distinct group of GABAergic interneurons that innervate the axon initial segments of pyramidal cells. However, their circuit role and the function of their clearly defined anatomical specificity remain unclear. Recent work has demonstrated that chandelier cells can produce depolarizing GABAergic PSPs, occasionally driving postsynaptic targets to spike. On the other hand, other work suggests that ChCs are hyperpolarizing and may have an inhibitory role. These disparate functional effects may reflect heterogeneity among ChCs. Here, using brain slices from transgenic mouse strains, we first demonstrate that, across different neocortical areas and genetic backgrounds, upper Layer 2/3 ChCs belong to a single electrophysiologically and morphologically defined population, extensively sampling Layer 1 inputs with asymmetric dendrites. Consistent with being a single cell type, we find electrical coupling between ChCs. We then investigate the effect of chandelier cell activation on pyramidal neuron spiking in several conditions, ranging from the resting membrane potential to stimuli designed to approximate in vivo membrane potential dynamics. We find that under quiescent conditions, chandelier cells are capable of both promoting and inhibiting spike generation, depending on the postsynaptic membrane potential. However, during in vivo-like membrane potential fluctuations, the dominant postsynaptic effect was a strong inhibition. Thus, neocortical chandelier cells, even from within a homogeneous population, appear to play a dual role in the circuit, helping to activate quiescent pyramidal neurons, while at the same time inhibiting active ones."}],"issue":"49","quality_controlled":"1","oa":1,"external_id":{"pmid":["22159102"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4071969/"}],"language":[{"iso":"eng"}],"doi":"10.1523/jneurosci.3894-11.2011","month":"12","publication_identifier":{"issn":["0270-6474","1529-2401"]},"publication_status":"published","publisher":"Society for Neuroscience","year":"2011","pmid":1,"date_created":"2020-06-25T13:09:49Z","date_updated":"2021-01-12T08:16:36Z","volume":31,"author":[{"full_name":"Woodruff, A. R.","first_name":"A. R.","last_name":"Woodruff"},{"last_name":"McGarry","first_name":"L. M.","full_name":"McGarry, L. M."},{"full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","first_name":"Tim P"},{"last_name":"Inan","first_name":"M.","full_name":"Inan, M."},{"full_name":"Anderson, S. A.","last_name":"Anderson","first_name":"S. A."},{"full_name":"Yuste, R.","last_name":"Yuste","first_name":"R."}],"extern":"1"},{"month":"12","publication_identifier":{"issn":["0036-8075","1095-9203"]},"quality_controlled":"1","external_id":{"pmid":["22075724"]},"language":[{"iso":"eng"}],"doi":"10.1126/science.1211095","extern":"1","publication_status":"published","publisher":"American Association for the Advancement of Science","year":"2011","pmid":1,"date_updated":"2021-06-02T14:57:22Z","date_created":"2020-06-30T13:26:17Z","volume":334,"author":[{"orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","first_name":"Tim P","full_name":"Vogels, Tim P"},{"full_name":"Sprekeler, H.","first_name":"H.","last_name":"Sprekeler"},{"full_name":"Zenke, F.","last_name":"Zenke","first_name":"F."},{"full_name":"Clopath, C.","last_name":"Clopath","first_name":"C."},{"last_name":"Gerstner","first_name":"W.","full_name":"Gerstner, W."}],"related_material":{"link":[{"url":"https://doi.org/10.1126/science.336.6083.802-c","relation":"erratum"}]},"scopus_import":"1","day":"16","article_processing_charge":"No","article_type":"original","page":"1569-1573","publication":"Science","citation":{"ama":"Vogels TP, Sprekeler H, Zenke F, Clopath C, Gerstner W. Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks. Science. 2011;334(6062):1569-1573. doi:10.1126/science.1211095","ieee":"T. P. Vogels, H. Sprekeler, F. Zenke, C. Clopath, and W. Gerstner, “Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks,” Science, vol. 334, no. 6062. American Association for the Advancement of Science, pp. 1569–1573, 2011.","apa":"Vogels, T. P., Sprekeler, H., Zenke, F., Clopath, C., & Gerstner, W. (2011). Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1211095","ista":"Vogels TP, Sprekeler H, Zenke F, Clopath C, Gerstner W. 2011. Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks. Science. 334(6062), 1569–1573.","short":"T.P. Vogels, H. Sprekeler, F. Zenke, C. Clopath, W. Gerstner, Science 334 (2011) 1569–1573.","mla":"Vogels, Tim P., et al. “Inhibitory Plasticity Balances Excitation and Inhibition in Sensory Pathways and Memory Networks.” Science, vol. 334, no. 6062, American Association for the Advancement of Science, 2011, pp. 1569–73, doi:10.1126/science.1211095.","chicago":"Vogels, Tim P, H. Sprekeler, F. Zenke, C. Clopath, and W. Gerstner. “Inhibitory Plasticity Balances Excitation and Inhibition in Sensory Pathways and Memory Networks.” Science. American Association for the Advancement of Science, 2011. https://doi.org/10.1126/science.1211095."},"date_published":"2011-12-16T00:00:00Z","type":"journal_article","abstract":[{"text":"Cortical neurons receive balanced excitatory and inhibitory synaptic currents. Such a balance could be established and maintained in an experience-dependent manner by synaptic plasticity at inhibitory synapses. We show that this mechanism provides an explanation for the sparse firing patterns observed in response to natural stimuli and fits well with a recently observed interaction of excitatory and inhibitory receptive field plasticity. The introduction of inhibitory plasticity in suitable recurrent networks provides a homeostatic mechanism that leads to asynchronous irregular network states. Further, it can accommodate synaptic memories with activity patterns that become indiscernible from the background state but can be reactivated by external stimuli. Our results suggest an essential role of inhibitory plasticity in the formation and maintenance of functional cortical circuitry.","lang":"eng"}],"issue":"6062","title":"Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks","status":"public","intvolume":" 334","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"8074","oa_version":"None"},{"abstract":[{"lang":"eng","text":"The accurate experimental determination of dipolar-coupling constants for one-bond heteronuclear dipolar couplings in solids is a key for the quantification of the amplitudes of motional processes. Averaging of the dipolar coupling reports on motions on time scales up to the inverse of the coupling constant, in our case tens of microseconds. Combining dipolar-coupling derived order parameters that characterize the amplitudes of the motion with relaxation data leads to a more precise characterization of the dynamical parameters and helps to disentangle the amplitudes and the time scales of the motional processes, which impact relaxation rates in a highly correlated way. Here. we describe and characterize an improved experimental protocol – based on REDOR – to measure these couplings in perdeuterated proteins with a reduced sensitivity to experimental missettings. Because such effects are presently the dominant source of systematic errors in experimental dipolar-coupling measurements, these compensated experiments should help to significantly improve the precision of such data. A detailed comparison with other commonly used pulse sequences (T-MREV, phase-inverted CP,R18 5/2, and R18 7/1) is provided."}],"issue":"2","extern":"1","type":"journal_article","author":[{"orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","last_name":"Schanda","first_name":"Paul","full_name":"Schanda, Paul"},{"first_name":"Beat H.","last_name":"Meier","full_name":"Meier, Beat H."},{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"}],"date_updated":"2021-01-12T08:19:29Z","date_created":"2020-09-18T10:10:50Z","oa_version":"None","volume":210,"_id":"8469","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR","publication_status":"published","publisher":"Elsevier","intvolume":" 210","month":"06","day":"01","article_processing_charge":"No","publication_identifier":{"issn":["1090-7807"]},"keyword":["Nuclear and High Energy Physics","Biophysics","Biochemistry","Condensed Matter Physics"],"doi":"10.1016/j.jmr.2011.03.015","date_published":"2011-06-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Journal of Magnetic Resonance","citation":{"ama":"Schanda P, Meier BH, Ernst M. Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR. Journal of Magnetic Resonance. 2011;210(2):246-259. doi:10.1016/j.jmr.2011.03.015","apa":"Schanda, P., Meier, B. H., & Ernst, M. (2011). Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR. Journal of Magnetic Resonance. Elsevier. https://doi.org/10.1016/j.jmr.2011.03.015","ieee":"P. Schanda, B. H. Meier, and M. Ernst, “Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR,” Journal of Magnetic Resonance, vol. 210, no. 2. Elsevier, pp. 246–259, 2011.","ista":"Schanda P, Meier BH, Ernst M. 2011. Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR. Journal of Magnetic Resonance. 210(2), 246–259.","short":"P. Schanda, B.H. Meier, M. Ernst, Journal of Magnetic Resonance 210 (2011) 246–259.","mla":"Schanda, Paul, et al. “Accurate Measurement of One-Bond H–X Heteronuclear Dipolar Couplings in MAS Solid-State NMR.” Journal of Magnetic Resonance, vol. 210, no. 2, Elsevier, 2011, pp. 246–59, doi:10.1016/j.jmr.2011.03.015.","chicago":"Schanda, Paul, Beat H. Meier, and Matthias Ernst. “Accurate Measurement of One-Bond H–X Heteronuclear Dipolar Couplings in MAS Solid-State NMR.” Journal of Magnetic Resonance. Elsevier, 2011. https://doi.org/10.1016/j.jmr.2011.03.015."},"article_type":"original","quality_controlled":"1","page":"246-259"},{"type":"journal_article","extern":"1","issue":"5","abstract":[{"text":"Adding a new dimension: 4D or 3D proton‐detected spectra of perdeuterated protein samples with 1H labelled amides and methyl groups permit collecting unambiguous distance restraints with high sensitivity and determining protein structure by solid‐state NMR (see picture).","lang":"eng"}],"intvolume":" 12","publisher":"Wiley","status":"public","title":"A proton-detected 4D solid-state NMR experiment for protein structure determination","publication_status":"published","_id":"8470","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","oa_version":"None","volume":12,"date_updated":"2021-01-12T08:19:30Z","date_created":"2020-09-18T10:10:56Z","author":[{"last_name":"Huber","first_name":"Matthias","full_name":"Huber, Matthias"},{"last_name":"Hiller","first_name":"Sebastian","full_name":"Hiller, Sebastian"},{"full_name":"Schanda, Paul","last_name":"Schanda","first_name":"Paul","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"},{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"},{"full_name":"Böckmann, Anja","last_name":"Böckmann","first_name":"Anja"},{"last_name":"Verel","first_name":"René","full_name":"Verel, René"},{"first_name":"Beat H.","last_name":"Meier","full_name":"Meier, Beat H."}],"keyword":["Physical and Theoretical Chemistry","Atomic and Molecular Physics","and Optics"],"publication_identifier":{"issn":["1439-4235"]},"article_processing_charge":"No","day":"15","month":"02","page":"915-918","quality_controlled":"1","article_type":"original","citation":{"apa":"Huber, M., Hiller, S., Schanda, P., Ernst, M., Böckmann, A., Verel, R., & Meier, B. H. (2011). A proton-detected 4D solid-state NMR experiment for protein structure determination. ChemPhysChem. Wiley. https://doi.org/10.1002/cphc.201100062","ieee":"M. Huber et al., “A proton-detected 4D solid-state NMR experiment for protein structure determination,” ChemPhysChem, vol. 12, no. 5. Wiley, pp. 915–918, 2011.","ista":"Huber M, Hiller S, Schanda P, Ernst M, Böckmann A, Verel R, Meier BH. 2011. A proton-detected 4D solid-state NMR experiment for protein structure determination. ChemPhysChem. 12(5), 915–918.","ama":"Huber M, Hiller S, Schanda P, et al. A proton-detected 4D solid-state NMR experiment for protein structure determination. ChemPhysChem. 2011;12(5):915-918. doi:10.1002/cphc.201100062","chicago":"Huber, Matthias, Sebastian Hiller, Paul Schanda, Matthias Ernst, Anja Böckmann, René Verel, and Beat H. Meier. “A Proton-Detected 4D Solid-State NMR Experiment for Protein Structure Determination.” ChemPhysChem. Wiley, 2011. https://doi.org/10.1002/cphc.201100062.","short":"M. Huber, S. Hiller, P. Schanda, M. Ernst, A. Böckmann, R. Verel, B.H. Meier, ChemPhysChem 12 (2011) 915–918.","mla":"Huber, Matthias, et al. “A Proton-Detected 4D Solid-State NMR Experiment for Protein Structure Determination.” ChemPhysChem, vol. 12, no. 5, Wiley, 2011, pp. 915–18, doi:10.1002/cphc.201100062."},"publication":"ChemPhysChem","language":[{"iso":"eng"}],"date_published":"2011-02-15T00:00:00Z","doi":"10.1002/cphc.201100062"},{"author":[{"full_name":"Schanda, Paul","last_name":"Schanda","first_name":"Paul","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"},{"full_name":"Huber, Matthias","first_name":"Matthias","last_name":"Huber"},{"last_name":"Boisbouvier","first_name":"Jérôme","full_name":"Boisbouvier, Jérôme"},{"first_name":"Beat H.","last_name":"Meier","full_name":"Meier, Beat H."},{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"}],"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1002/anie.201206663"}]},"date_updated":"2021-01-12T08:19:27Z","date_created":"2020-09-18T10:09:40Z","oa_version":"None","volume":50,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8464","year":"2011","publication_status":"published","title":"Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion","status":"public","publisher":"Wiley","intvolume":" 50","abstract":[{"lang":"eng","text":"Nonsymmetric motion: Solid‐state NMR measurements of dipolar coupling tensors provide insight into protein dynamics. The hitherto ignored asymmetry of the dipolar coupling tensor contains valuable information about motional asymmetry, which was used in the first direct site‐resolved measurement of such tensors. Important motions such as rotamer jumps can now be directly detected in the solid state."}],"issue":"46","extern":"1","type":"journal_article","doi":"10.1002/anie.201103944","date_published":"2011-09-14T00:00:00Z","language":[{"iso":"eng"}],"publication":"Angewandte Chemie International Edition","citation":{"chicago":"Schanda, Paul, Matthias Huber, Jérôme Boisbouvier, Beat H. Meier, and Matthias Ernst. “Solid-State NMR Measurements of Asymmetric Dipolar Couplings Provide Insight into Protein Side-Chain Motion.” Angewandte Chemie International Edition. Wiley, 2011. https://doi.org/10.1002/anie.201103944.","mla":"Schanda, Paul, et al. “Solid-State NMR Measurements of Asymmetric Dipolar Couplings Provide Insight into Protein Side-Chain Motion.” Angewandte Chemie International Edition, vol. 50, no. 46, Wiley, 2011, pp. 11005–09, doi:10.1002/anie.201103944.","short":"P. Schanda, M. Huber, J. Boisbouvier, B.H. Meier, M. Ernst, Angewandte Chemie International Edition 50 (2011) 11005–11009.","ista":"Schanda P, Huber M, Boisbouvier J, Meier BH, Ernst M. 2011. Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion. Angewandte Chemie International Edition. 50(46), 11005–11009.","apa":"Schanda, P., Huber, M., Boisbouvier, J., Meier, B. H., & Ernst, M. (2011). Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201103944","ieee":"P. Schanda, M. Huber, J. Boisbouvier, B. H. Meier, and M. Ernst, “Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion,” Angewandte Chemie International Edition, vol. 50, no. 46. Wiley, pp. 11005–11009, 2011.","ama":"Schanda P, Huber M, Boisbouvier J, Meier BH, Ernst M. Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion. Angewandte Chemie International Edition. 2011;50(46):11005-11009. doi:10.1002/anie.201103944"},"quality_controlled":"1","article_type":"original","page":"11005-11009","day":"14","month":"09","article_processing_charge":"No","publication_identifier":{"issn":["1433-7851"]}},{"oa_version":"None","volume":51,"date_updated":"2021-01-12T08:19:29Z","date_created":"2020-09-18T10:10:43Z","author":[{"last_name":"Lalli","first_name":"Daniela","full_name":"Lalli, Daniela"},{"full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"},{"full_name":"Chowdhury, Anup","first_name":"Anup","last_name":"Chowdhury"},{"full_name":"Retel, Joren","first_name":"Joren","last_name":"Retel"},{"full_name":"Hiller, Matthias","last_name":"Hiller","first_name":"Matthias"},{"last_name":"Higman","first_name":"Victoria A.","full_name":"Higman, Victoria A."},{"full_name":"Handel, Lieselotte","last_name":"Handel","first_name":"Lieselotte"},{"first_name":"Vipin","last_name":"Agarwal","full_name":"Agarwal, Vipin"},{"last_name":"Reif","first_name":"Bernd","full_name":"Reif, Bernd"},{"full_name":"van Rossum, Barth","first_name":"Barth","last_name":"van Rossum"},{"last_name":"Akbey","first_name":"Ümit","full_name":"Akbey, Ümit"},{"first_name":"Hartmut","last_name":"Oschkinat","full_name":"Oschkinat, Hartmut"}],"publisher":"Springer Nature","intvolume":" 51","status":"public","publication_status":"published","title":"Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins","year":"2011","_id":"8468","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","issue":"4","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s10858-011-9578-1","date_published":"2011-10-25T00:00:00Z","page":"477-485","article_type":"original","quality_controlled":"1","citation":{"short":"D. Lalli, P. Schanda, A. Chowdhury, J. Retel, M. Hiller, V.A. Higman, L. Handel, V. Agarwal, B. Reif, B. van Rossum, Ü. Akbey, H. Oschkinat, Journal of Biomolecular NMR 51 (2011) 477–485.","mla":"Lalli, Daniela, et al. “Three-Dimensional Deuterium-Carbon Correlation Experiments for High-Resolution Solid-State MAS NMR Spectroscopy of Large Proteins.” Journal of Biomolecular NMR, vol. 51, no. 4, Springer Nature, 2011, pp. 477–85, doi:10.1007/s10858-011-9578-1.","chicago":"Lalli, Daniela, Paul Schanda, Anup Chowdhury, Joren Retel, Matthias Hiller, Victoria A. Higman, Lieselotte Handel, et al. “Three-Dimensional Deuterium-Carbon Correlation Experiments for High-Resolution Solid-State MAS NMR Spectroscopy of Large Proteins.” Journal of Biomolecular NMR. Springer Nature, 2011. https://doi.org/10.1007/s10858-011-9578-1.","ama":"Lalli D, Schanda P, Chowdhury A, et al. Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins. Journal of Biomolecular NMR. 2011;51(4):477-485. doi:10.1007/s10858-011-9578-1","ieee":"D. Lalli et al., “Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins,” Journal of Biomolecular NMR, vol. 51, no. 4. Springer Nature, pp. 477–485, 2011.","apa":"Lalli, D., Schanda, P., Chowdhury, A., Retel, J., Hiller, M., Higman, V. A., … Oschkinat, H. (2011). Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins. Journal of Biomolecular NMR. Springer Nature. https://doi.org/10.1007/s10858-011-9578-1","ista":"Lalli D, Schanda P, Chowdhury A, Retel J, Hiller M, Higman VA, Handel L, Agarwal V, Reif B, van Rossum B, Akbey Ü, Oschkinat H. 2011. Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins. Journal of Biomolecular NMR. 51(4), 477–485."},"publication":"Journal of Biomolecular NMR","article_processing_charge":"No","publication_identifier":{"issn":["0925-2738","1573-5001"]},"day":"25","month":"10"},{"day":"01","month":"01","quality_controlled":0,"citation":{"chicago":"Koblik, Evgeniy, Yaroslav Red’Kin, Margarita Meer, Romain Derelle, Sofia Golenkina, Fyodor Kondrashov, and Vladimir Arkhipov. “Acrocephalus Orinus: A Case of Mistaken Identity.” PLoS One. Public Library of Science, 2011. https://doi.org/10.1371/journal.pone.0017716.","mla":"Koblik, Evgeniy, et al. “Acrocephalus Orinus: A Case of Mistaken Identity.” PLoS One, vol. 6, no. 4, Public Library of Science, 2011, doi:10.1371/journal.pone.0017716.","short":"E. Koblik, Y. Red’Kin, M. Meer, R. Derelle, S. Golenkina, F. Kondrashov, V. Arkhipov, PLoS One 6 (2011).","ista":"Koblik E, Red’Kin Y, Meer M, Derelle R, Golenkina S, Kondrashov F, Arkhipov V. 2011. Acrocephalus orinus: A case of Mistaken identity. PLoS One. 6(4).","ieee":"E. Koblik et al., “Acrocephalus orinus: A case of Mistaken identity,” PLoS One, vol. 6, no. 4. Public Library of Science, 2011.","apa":"Koblik, E., Red’Kin, Y., Meer, M., Derelle, R., Golenkina, S., Kondrashov, F., & Arkhipov, V. (2011). Acrocephalus orinus: A case of Mistaken identity. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0017716","ama":"Koblik E, Red’Kin Y, Meer M, et al. Acrocephalus orinus: A case of Mistaken identity. PLoS One. 2011;6(4). doi:10.1371/journal.pone.0017716"},"publication":"PLoS One","date_published":"2011-01-01T00:00:00Z","doi":"10.1371/journal.pone.0017716","type":"journal_article","extern":1,"publist_id":"6760","issue":"4","abstract":[{"lang":"eng","text":"Recent discovery of the Large-billed Reed Warbler (Acrocephalus orinus) in museums and in the wild significantly expanded our knowledge of its morphological traits and genetic variability, and revealed new data on geographical distribution of the breeding grounds, migration routes and wintering locations of this species. It is now certain that A. orinus is breeding in Central Asia; however, the precise area of distribution remains unclear. The difficulty in the further study of this species lies in the small number of known specimens, with only 13 currently available in museums, and in the relative uncertainty of the breeding area and habitat of this species. Following morphological and genetic analyses from Svensson, et al, we describe 14 new A. orinus specimens from collections of Zoological Museums of the former USSR from the territory of Central Asian states. All of these specimens were erroneously labeled as Blyth's Reed Warbler (A. dumetorum), which is thought to be a breeding species in these areas. The 14 new A. orinus specimens were collected during breeding season while most of the 85 A. dumetorum specimens from the same area were collected during the migration period. Our data indicate that the Central Asian territory previously attributed as breeding grounds of A. dumetorum is likely to constitute the breeding territory of A. orinus. This rare case of a re-description of the breeding territory of a lost species emphasizes the importance of maintenance of museum collections around the world. If the present data on the breeding grounds of A. orinus are confirmed with field observations and collections, the literature on the biology of A. dumetorum from the southern part of its range may have to be reconsidered."}],"intvolume":" 6","publisher":"Public Library of Science","title":"Acrocephalus orinus: A case of Mistaken identity","publication_status":"published","status":"public","_id":"890","year":"2011","acknowledgement":"The work was supported by the Plan Nacional grant number BFU2009-09271 from the Spanish Ministry of Science and Innovation.\nWe extend our thanks to A.M. Peklo and I.V. Fadeev for granting us access to ornithological collections, to V.S. Shishkin, M.V. Kalyakin, R.D. Kashkarov, O.V. Belyalov and V.M. Loskot for valuable insights and to L. Svensson for extensive feedback on the manuscript. We thank E.I. Rogaev for access to ancient DNA facility.\n","volume":6,"date_created":"2018-12-11T11:49:02Z","date_updated":"2021-01-12T08:21:18Z","author":[{"full_name":"Koblik, Evgeniy A","first_name":"Evgeniy","last_name":"Koblik"},{"first_name":"Yaroslav","last_name":"Red'Kin","full_name":"Red'Kin, Yaroslav A"},{"first_name":"Margarita","last_name":"Meer","full_name":"Meer, Margarita S"},{"full_name":"Derelle, Romain","last_name":"Derelle","first_name":"Romain"},{"last_name":"Golenkina","first_name":"Sofia","full_name":"Golenkina, Sofia A"},{"last_name":"Kondrashov","first_name":"Fyodor","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov"},{"full_name":"Arkhipov, Vladimir Y","first_name":"Vladimir","last_name":"Arkhipov"}]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"90","year":"2011","pmid":1,"status":"public","publication_status":"published","title":"Evidence of the harmonic Faraday instability in ultrasonic atomization experiments with a deep, inviscid fluid","publisher":"Acoustical Society of America","intvolume":" 130","author":[{"full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2607-2363","first_name":"Andrew P","last_name":"Higginbotham"},{"last_name":"Guillen","first_name":"A","full_name":"Guillen, A"},{"first_name":"Nick","last_name":"Jones","full_name":"Jones, Nick"},{"last_name":"Donnelly","first_name":"Tom","full_name":"Donnelly, Tom"},{"full_name":"Bernoff, Andrew","last_name":"Bernoff","first_name":"Andrew"}],"date_created":"2018-12-11T11:44:34Z","date_updated":"2021-01-12T08:21:44Z","volume":130,"oa_version":"None","type":"journal_article","abstract":[{"text":"A popular method for generating micron-sized aerosols is to submerge ultrasonic (ω ∼ MHz) piezoelectric oscillators in a water bath. The submerged oscillator atomizes the fluid, creating droplets with radii proportional to the wavelength of the standing wave at the fluid surface. Classical theory for the Faraday instability predicts a parametric instability driving a capillary wave at the subharmonic (ω / 2) frequency. For many applications it is desirable to reduce the size of the droplets; however, using higher frequency oscillators becomes impractical beyond a few MHz. Observations are presented that demonstrate that smaller droplets may also be created by increasing the driving amplitude of the oscillator, and that this effect becomes more pronounced for large driving frequencies. It is shown that these observations are consistent with a transition from droplets associated with subharmonic (ω/2) capillary waves to harmonic (ω) capillary waves induced by larger driving frequencies and amplitudes, as predicted by a stability analysis of the capillary waves.","lang":"eng"}],"issue":"5","publist_id":"7964","extern":"1","publication":"Journal of the Acoustical Society of America","citation":{"ama":"Higginbotham AP, Guillen A, Jones N, Donnelly T, Bernoff A. Evidence of the harmonic Faraday instability in ultrasonic atomization experiments with a deep, inviscid fluid. Journal of the Acoustical Society of America. 2011;130(5):2694-2699. doi:10.1121/1.3643816","ista":"Higginbotham AP, Guillen A, Jones N, Donnelly T, Bernoff A. 2011. Evidence of the harmonic Faraday instability in ultrasonic atomization experiments with a deep, inviscid fluid. Journal of the Acoustical Society of America. 130(5), 2694–2699.","apa":"Higginbotham, A. P., Guillen, A., Jones, N., Donnelly, T., & Bernoff, A. (2011). Evidence of the harmonic Faraday instability in ultrasonic atomization experiments with a deep, inviscid fluid. Journal of the Acoustical Society of America. Acoustical Society of America. https://doi.org/10.1121/1.3643816","ieee":"A. P. Higginbotham, A. Guillen, N. Jones, T. Donnelly, and A. Bernoff, “Evidence of the harmonic Faraday instability in ultrasonic atomization experiments with a deep, inviscid fluid,” Journal of the Acoustical Society of America, vol. 130, no. 5. Acoustical Society of America, pp. 2694–2699, 2011.","mla":"Higginbotham, Andrew P., et al. “Evidence of the Harmonic Faraday Instability in Ultrasonic Atomization Experiments with a Deep, Inviscid Fluid.” Journal of the Acoustical Society of America, vol. 130, no. 5, Acoustical Society of America, 2011, pp. 2694–99, doi:10.1121/1.3643816.","short":"A.P. Higginbotham, A. Guillen, N. Jones, T. Donnelly, A. Bernoff, Journal of the Acoustical Society of America 130 (2011) 2694–2699.","chicago":"Higginbotham, Andrew P, A Guillen, Nick Jones, Tom Donnelly, and Andrew Bernoff. “Evidence of the Harmonic Faraday Instability in Ultrasonic Atomization Experiments with a Deep, Inviscid Fluid.” Journal of the Acoustical Society of America. Acoustical Society of America, 2011. https://doi.org/10.1121/1.3643816."},"external_id":{"pmid":[" 22087897"]},"quality_controlled":"1","page":"2694 - 2699","doi":"10.1121/1.3643816","date_published":"2011-11-16T00:00:00Z","language":[{"iso":"eng"}],"day":"16","month":"11"},{"date_published":"2011-06-01T00:00:00Z","citation":{"mla":"Muller, Caroline J., et al. “Intensification of Precipitation Extremes with Warming in a Cloud-Resolving Model.” Journal of Climate, vol. 24, no. 11, American Meteorological Society, 2011, pp. 2784–800, doi:10.1175/2011jcli3876.1.","short":"C.J. Muller, P.A. O’Gorman, L.E. Back, Journal of Climate 24 (2011) 2784–2800.","chicago":"Muller, Caroline J, Paul A. O’Gorman, and Larissa E. Back. “Intensification of Precipitation Extremes with Warming in a Cloud-Resolving Model.” Journal of Climate. American Meteorological Society, 2011. https://doi.org/10.1175/2011jcli3876.1.","ama":"Muller CJ, O’Gorman PA, Back LE. Intensification of precipitation extremes with warming in a cloud-resolving model. Journal of Climate. 2011;24(11):2784-2800. doi:10.1175/2011jcli3876.1","ista":"Muller CJ, O’Gorman PA, Back LE. 2011. Intensification of precipitation extremes with warming in a cloud-resolving model. Journal of Climate. 24(11), 2784–2800.","apa":"Muller, C. J., O’Gorman, P. A., & Back, L. E. (2011). Intensification of precipitation extremes with warming in a cloud-resolving model. Journal of Climate. American Meteorological Society. https://doi.org/10.1175/2011jcli3876.1","ieee":"C. J. Muller, P. A. O’Gorman, and L. E. Back, “Intensification of precipitation extremes with warming in a cloud-resolving model,” Journal of Climate, vol. 24, no. 11. American Meteorological Society, pp. 2784–2800, 2011."},"publication":"Journal of Climate","page":"2784-2800","article_type":"original","article_processing_charge":"No","day":"01","keyword":["Atmospheric Science"],"oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9144","intvolume":" 24","title":"Intensification of precipitation extremes with warming in a cloud-resolving model","status":"public","issue":"11","abstract":[{"lang":"eng","text":"A cloud-resolving model is used to investigate the effect of warming on high percentiles of precipitation (precipitation extremes) in the idealized setting of radiative-convective equilibrium. While this idealized setting does not allow for several factors that influence precipitation in the tropics, it does allow for an evaluation of the response of precipitation extremes to warming in simulations with resolved rather than parameterized convection. The methodology developed should also be applicable to less idealized simulations.\r\n\r\nModeled precipitation extremes are found to increase in magnitude in response to an increase in sea surface temperature. A dry static energy budget is used to relate the changes in precipitation extremes to changes in atmospheric temperature, vertical velocity, and precipitation efficiency. To first order, the changes in precipitation extremes are captured by changes in the mean temperature structure of the atmosphere. Changes in vertical velocities play a secondary role and tend to weaken the strength of precipitation extremes, despite an intensification of updraft velocities in the upper troposphere. The influence of changes in condensate transports on precipitation extremes is quantified in terms of a precipitation efficiency; it does not change greatly with warming.\r\n\r\nTropical precipitation extremes have previously been found to increase at a greater fractional rate than the amount of atmospheric water vapor in observations of present-day variability and in some climate model simulations with parameterized convection. But the fractional increases in precipitation extremes in the cloud-resolving simulations are comparable in magnitude to those in surface water vapor concentrations (owing to a partial cancellation between dynamical and thermodynamical changes), and are substantially less than the fractional increases in column water vapor."}],"type":"journal_article","doi":"10.1175/2011jcli3876.1","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1175/2011JCLI3876.1","open_access":"1"}],"oa":1,"quality_controlled":"1","publication_identifier":{"eissn":["1520-0442"],"issn":["0894-8755"]},"month":"06","author":[{"first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J"},{"first_name":"Paul A.","last_name":"O’Gorman","full_name":"O’Gorman, Paul A."},{"full_name":"Back, Larissa E.","last_name":"Back","first_name":"Larissa E."}],"volume":24,"date_created":"2021-02-15T14:39:57Z","date_updated":"2022-01-24T13:52:46Z","year":"2011","publisher":"American Meteorological Society","publication_status":"published","extern":"1"},{"month":"07","day":"24","article_processing_charge":"No","publication_identifier":{"issn":["1758-678X","1758-6798"]},"language":[{"iso":"eng"}],"doi":"10.1038/nclimate1169","date_published":"2011-07-24T00:00:00Z","article_type":"original","quality_controlled":"1","page":"266-271","publication":"Nature Climate Change","citation":{"ieee":"C. J. Muller and P. A. O’Gorman, “An energetic perspective on the regional response of precipitation to climate change,” Nature Climate Change, vol. 1, no. 5. Springer Nature, pp. 266–271, 2011.","apa":"Muller, C. J., & O’Gorman, P. A. (2011). An energetic perspective on the regional response of precipitation to climate change. Nature Climate Change. Springer Nature. https://doi.org/10.1038/nclimate1169","ista":"Muller CJ, O’Gorman PA. 2011. An energetic perspective on the regional response of precipitation to climate change. Nature Climate Change. 1(5), 266–271.","ama":"Muller CJ, O’Gorman PA. An energetic perspective on the regional response of precipitation to climate change. Nature Climate Change. 2011;1(5):266-271. doi:10.1038/nclimate1169","chicago":"Muller, Caroline J, and P. A. O’Gorman. “An Energetic Perspective on the Regional Response of Precipitation to Climate Change.” Nature Climate Change. Springer Nature, 2011. https://doi.org/10.1038/nclimate1169.","short":"C.J. Muller, P.A. O’Gorman, Nature Climate Change 1 (2011) 266–271.","mla":"Muller, Caroline J., and P. A. O’Gorman. “An Energetic Perspective on the Regional Response of Precipitation to Climate Change.” Nature Climate Change, vol. 1, no. 5, Springer Nature, 2011, pp. 266–71, doi:10.1038/nclimate1169."},"extern":"1","abstract":[{"text":"Understanding and predicting the response of the hydrological cycle to climate change is a major challenge with important societal implications. Much progress has been made in understanding the response of global average precipitation by considering the energy balances of the atmosphere and the surface1,2,3,4,5,6. This energetic perspective reveals that changes in temperature, greenhouse gases, aerosols, solar forcing and cloud feedbacks can all affect the global average rate of precipitation5,7,8,9,10,11. Local precipitation changes have conventionally been analysed using the water vapour budget, but here we show that the energetic approach can be extended to local changes in precipitation by including changes in horizontal energy transport. In simulations of twenty-first century climate change, this energy transport accounts for much of the spatial variability in precipitation change. We show that changes in radiative and surface sensible heat fluxes are a guide to the local precipitation response over land and at large scales, but not at small scales over the ocean, where cloud and water vapour radiative feedbacks dampen the response. The energetic approach described here helps bridge the gap between our understanding of global and regional precipitation changes. It could be applied to better understand the response of regional precipitation to different radiative forcings, including geo-engineering schemes, as well as to understand the differences between the fast and slow responses of regional precipitation to such forcings.","lang":"eng"}],"issue":"5","type":"journal_article","date_created":"2021-02-15T14:39:29Z","date_updated":"2022-01-24T13:52:11Z","oa_version":"None","volume":1,"author":[{"first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J"},{"last_name":"O’Gorman","first_name":"P. A.","full_name":"O’Gorman, P. A."}],"publication_status":"published","title":"An energetic perspective on the regional response of precipitation to climate change","status":"public","intvolume":" 1","publisher":"Springer Nature","year":"2011","_id":"9143","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"author":[{"first_name":"Silvia","last_name":"Fré","full_name":"Fré, Silvia"},{"full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B"},{"full_name":"Šale, Sanja","first_name":"Sanja","last_name":"Šale"},{"full_name":"Huyghe, Mathilde","first_name":"Mathilde","last_name":"Huyghe"},{"last_name":"Lafkas","first_name":"Daniel","full_name":"Lafkas, Daniel"},{"last_name":"Kissel","first_name":"Holger","full_name":"Kissel, Holger"},{"first_name":"Angeliki","last_name":"Louvi","full_name":"Louvi, Angeliki"},{"first_name":"Jeffrey","last_name":"Greve","full_name":"Greve, Jeffrey"},{"last_name":"Louvard","first_name":"Daniel","full_name":"Louvard, Daniel"},{"full_name":"Artavanis Tsakonas, Spyros","last_name":"Artavanis Tsakonas","first_name":"Spyros"}],"volume":6,"date_created":"2018-12-11T11:49:13Z","date_updated":"2021-01-12T08:21:56Z","year":"2011","publisher":"Public Library of Science","publication_status":"published","publist_id":"6520","file_date_updated":"2020-07-14T12:48:15Z","extern":"1","article_number":"e25785","doi":"10.1371/journal.pone.0025785","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","month":"10","oa_version":"Published Version","file":[{"checksum":"b4e864125dfcb9fa57a9e01688838081","date_updated":"2020-07-14T12:48:15Z","date_created":"2019-05-10T11:20:26Z","file_id":"6401","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":2860615,"access_level":"open_access","file_name":"2011_PLOS1_Fre.PDF"}],"_id":"923","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 6","ddc":["570"],"status":"public","title":"Notch lineages and activity in intestinal stem cells determined by a new set of knock in mice","issue":"10","abstract":[{"lang":"eng","text":"The conserved role of Notch signaling in controlling intestinal cell fate specification and homeostasis has been extensively studied. Nevertheless, the precise identity of the cells in which Notch signaling is active and the role of different Notch receptor paralogues in the intestine remain ambiguous, due to the lack of reliable tools to investigate Notch expression and function in vivo. We generated a new series of transgenic mice that allowed us, by lineage analysis, to formally prove that Notch1 and Notch2 are specifically expressed in crypt stem cells. In addition, a novel Notch reporter mouse, Hes1-EmGFP SAT, demonstrated exclusive Notch activity in crypt stem cells and absorptive progenitors. This roster of knock-in and reporter mice represents a valuable resource to functionally explore the Notch pathway in vivo in virtually all tissues."}],"type":"journal_article","date_published":"2011-10-03T00:00:00Z","citation":{"chicago":"Fré, Silvia, Edouard B Hannezo, Sanja Šale, Mathilde Huyghe, Daniel Lafkas, Holger Kissel, Angeliki Louvi, Jeffrey Greve, Daniel Louvard, and Spyros Artavanis Tsakonas. “Notch Lineages and Activity in Intestinal Stem Cells Determined by a New Set of Knock in Mice.” PLoS One. Public Library of Science, 2011. https://doi.org/10.1371/journal.pone.0025785.","mla":"Fré, Silvia, et al. “Notch Lineages and Activity in Intestinal Stem Cells Determined by a New Set of Knock in Mice.” PLoS One, vol. 6, no. 10, e25785, Public Library of Science, 2011, doi:10.1371/journal.pone.0025785.","short":"S. Fré, E.B. Hannezo, S. Šale, M. Huyghe, D. Lafkas, H. Kissel, A. Louvi, J. Greve, D. Louvard, S. Artavanis Tsakonas, PLoS One 6 (2011).","ista":"Fré S, Hannezo EB, Šale S, Huyghe M, Lafkas D, Kissel H, Louvi A, Greve J, Louvard D, Artavanis Tsakonas S. 2011. Notch lineages and activity in intestinal stem cells determined by a new set of knock in mice. PLoS One. 6(10), e25785.","apa":"Fré, S., Hannezo, E. B., Šale, S., Huyghe, M., Lafkas, D., Kissel, H., … Artavanis Tsakonas, S. (2011). Notch lineages and activity in intestinal stem cells determined by a new set of knock in mice. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0025785","ieee":"S. Fré et al., “Notch lineages and activity in intestinal stem cells determined by a new set of knock in mice,” PLoS One, vol. 6, no. 10. Public Library of Science, 2011.","ama":"Fré S, Hannezo EB, Šale S, et al. Notch lineages and activity in intestinal stem cells determined by a new set of knock in mice. PLoS One. 2011;6(10). doi:10.1371/journal.pone.0025785"},"publication":"PLoS One","has_accepted_license":"1","day":"03"}]