[{"month":"01","date_published":"2011-01-01T00:00:00Z","publisher":"IEEE","date_updated":"2021-01-12T07:42:45Z","title":"Learning anticipation policies for robot table tennis","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Wang, Zhikun","last_name":"Wang","first_name":"Zhikun"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"first_name":"Katharina","last_name":"Mülling","full_name":"Mülling, Katharina"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Peters, Jan","last_name":"Peters","first_name":"Jan"}],"page":"332 - 337","publist_id":"3293","conference":{"name":"IROS: RSJ International Conference on Intelligent Robots and Systems","start_date":"2011-09-25","end_date":"2011-09-30","location":"San Francisco, USA"},"department":[{"_id":"ChLa"}],"language":[{"iso":"eng"}],"year":"2011","citation":{"mla":"Wang, Zhikun, et al. <i>Learning Anticipation Policies for Robot Table Tennis</i>. IEEE, 2011, pp. 332–37, doi:<a href=\"https://doi.org/10.1109/IROS.2011.6094892\">10.1109/IROS.2011.6094892</a>.","apa":"Wang, Z., Lampert, C., Mülling, K., Schölkopf, B., &#38; Peters, J. (2011). Learning anticipation policies for robot table tennis (pp. 332–337). Presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA: IEEE. <a href=\"https://doi.org/10.1109/IROS.2011.6094892\">https://doi.org/10.1109/IROS.2011.6094892</a>","chicago":"Wang, Zhikun, Christoph Lampert, Katharina Mülling, Bernhard Schölkopf, and Jan Peters. “Learning Anticipation Policies for Robot Table Tennis,” 332–37. IEEE, 2011. <a href=\"https://doi.org/10.1109/IROS.2011.6094892\">https://doi.org/10.1109/IROS.2011.6094892</a>.","short":"Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, J. Peters, in:, IEEE, 2011, pp. 332–337.","ista":"Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. 2011. Learning anticipation policies for robot table tennis. IROS: RSJ International Conference on Intelligent Robots and Systems, 332–337.","ieee":"Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, and J. Peters, “Learning anticipation policies for robot table tennis,” presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA, 2011, pp. 332–337.","ama":"Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. Learning anticipation policies for robot table tennis. In: IEEE; 2011:332-337. doi:<a href=\"https://doi.org/10.1109/IROS.2011.6094892\">10.1109/IROS.2011.6094892</a>"},"type":"conference","scopus_import":1,"abstract":[{"text":"Playing table tennis is a difficult task for robots, especially due to their limitations of acceleration. A key bottleneck is the amount of time needed to reach the desired hitting position and velocity of the racket for returning the incoming ball. Here, it often does not suffice to simply extrapolate the ball's trajectory after the opponent returns it but more information is needed. Humans are able to predict the ball's trajectory based on the opponent's moves and, thus, have a considerable advantage. Hence, we propose to incorporate an anticipation system into robot table tennis players, which enables the robot to react earlier while the opponent is performing the striking movement. Based on visual observation of the opponent's racket movement, the robot can predict the aim of the opponent and adjust its movement generation accordingly. The policies for deciding how and when to react are obtained by reinforcement learning. We conduct experiments with an existing robot player to show that the learned reaction policy can significantly improve the performance of the overall system.","lang":"eng"}],"date_created":"2018-12-11T12:02:45Z","_id":"3337","quality_controlled":"1","status":"public","day":"01","publication_status":"published","doi":"10.1109/IROS.2011.6094892","oa_version":"None"},{"department":[{"_id":"KrCh"}],"publist_id":"3287","page":"1 - 51","external_id":{"arxiv":["1107.2146"]},"year":"2011","language":[{"iso":"eng"}],"publisher":"ArXiv","date_published":"2011-07-11T00:00:00Z","month":"07","title":"Bounded rationality in concurrent parity games","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"date_updated":"2023-02-23T12:23:40Z","publication":"arXiv","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2146"}],"publication_status":"published","oa_version":"Preprint","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5380"}]},"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 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.","lang":"eng"}],"arxiv":1,"type":"preprint","citation":{"apa":"Chatterjee, K. (2011). Bounded rationality in concurrent parity games. <i>arXiv</i>. ArXiv.","mla":"Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” <i>ArXiv</i>, ArXiv, 2011, pp. 1–51.","ama":"Chatterjee K. Bounded rationality in concurrent parity games. <i>arXiv</i>. 2011:1-51.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .","ieee":"K. Chatterjee, “Bounded rationality in concurrent parity games,” <i>arXiv</i>. ArXiv, pp. 1–51, 2011.","short":"K. Chatterjee, ArXiv (2011) 1–51.","chicago":"Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” <i>ArXiv</i>. ArXiv, 2011."},"status":"public","day":"11","date_created":"2018-12-11T12:02:45Z","_id":"3338"},{"page":"17","external_id":{"arxiv":["1107.2132"]},"department":[{"_id":"KrCh"}],"publist_id":"3286","language":[{"iso":"eng"}],"year":"2011","date_published":"2011-07-11T00:00:00Z","month":"07","publisher":"ArXiv","date_updated":"2021-01-12T07:42:46Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"full_name":"Pritam, Roy","first_name":"Roy","last_name":"Pritam"}],"title":"Magnifying lens abstraction for stochastic games with discounted and long-run average objectives","oa":1,"publication":"arXiv","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2132"}],"oa_version":"Preprint","citation":{"short":"K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).","ieee":"K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” <i>arXiv</i>. ArXiv, 2011.","ista":"Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, .","ama":"Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. <i>arXiv</i>. 2011.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” <i>ArXiv</i>. ArXiv, 2011.","apa":"Chatterjee, K., De Alfaro, L., &#38; Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. <i>arXiv</i>. ArXiv.","mla":"Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” <i>ArXiv</i>, ArXiv, 2011."},"arxiv":1,"abstract":[{"lang":"eng","text":"Turn-based stochastic games and its important subclass Markov decision processes (MDPs) provide models for systems with both probabilistic and nondeterministic behaviors. We consider turn-based stochastic games with two classical quantitative objectives: discounted-sum and long-run average objectives. The game models and the quantitative objectives are widely used in probabilistic verification, planning, optimal inventory control, network protocol and performance analysis. Games and MDPs that model realistic systems often have very large state spaces, and probabilistic abstraction techniques are necessary to handle the state-space explosion. The commonly used full-abstraction techniques do not yield space-savings for systems that have many states with similar value, but does not necessarily have similar transition structure. A semi-abstraction technique, namely Magnifying-lens abstractions (MLA), that clusters states based on value only, disregarding differences in their transition relation was proposed for qualitative objectives (reachability and safety objectives). In this paper we extend the MLA technique to solve stochastic games with discounted-sum and long-run average objectives. We present the MLA technique based abstraction-refinement algorithm for stochastic games and MDPs with discounted-sum objectives. For long-run average objectives, our solution works for all MDPs and a sub-class of stochastic games where every state has the same value. "}],"type":"preprint","_id":"3339","date_created":"2018-12-11T12:02:46Z","day":"11","status":"public"},{"year":"2011","external_id":{"arxiv":["1104.3348"]},"page":"260 - 276","conference":{"end_date":"2011-07-20","start_date":"2011-07-14","name":"CAV: Computer Aided Verification","location":"Snowbird, USA"},"date_updated":"2023-02-23T11:00:13Z","oa":1,"date_published":"2011-08-11T00:00:00Z","alternative_title":["LNCS"],"intvolume":"      6806","month":"08","related_material":{"record":[{"status":"public","relation":"later_version","id":"2831"}]},"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1104.3348","open_access":"1"}],"doi":"10.1007/978-3-642-22110-1_21","date_created":"2018-12-11T12:02:47Z","status":"public","day":"11","volume":6806,"language":[{"iso":"eng"}],"article_processing_charge":"No","publist_id":"3282","department":[{"_id":"KrCh"}],"title":"Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Manas","last_name":"Joglekar","full_name":"Joglekar, Manas"},{"full_name":"Nisarg, Shah","last_name":"Nisarg","first_name":"Shah"}],"publisher":"Springer","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"publication_status":"published","_id":"3342","editor":[{"full_name":"Gopalakrishnan, Ganesh","first_name":"Ganesh","last_name":"Gopalakrishnan"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">10.1007/978-3-642-22110-1_21</a>.","apa":"Chatterjee, K., Henzinger, M. H., Joglekar, M., &#38; Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">https://doi.org/10.1007/978-3-642-22110-1_21</a>","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">https://doi.org/10.1007/978-3-642-22110-1_21</a>.","short":"K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.","ista":"Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.","ieee":"K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.","ama":"Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">10.1007/978-3-642-22110-1_21</a>"},"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with ω-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for Büchi objectives (a special case of parity objectives). Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs with Büchi objectives; our algorithm takes O(nm)  symbolic steps as compared to the previous known algorithm that takes O(n 2) symbolic steps, where n is the number of states and m is the number of edges of the MDP. In practice MDPs often have constant out-degree, and then our symbolic algorithm takes O(nn)  symbolic steps, as compared to the previous known O(n 2) symbolic steps algorithm. Second, we present a new algorithm, namely win-lose algorithm, with the following two properties: (a) the algorithm iteratively computes subsets of the almost-sure winning set and its complement, as compared to all previous algorithms that discover the almost-sure winning set upon termination; and (b) requires O(nK)  symbolic steps, where K is the maximal number of edges of strongly connected components (scc’s) of the MDP. The win-lose algorithm requires symbolic computation of scc’s. Third, we improve the algorithm for symbolic scc computation; the previous known algorithm takes linear symbolic steps, and our new algorithm improves the constants associated with the linear number of steps. In the worst case the previous known algorithm takes 5·n symbolic steps, whereas our new algorithm takes 4 ·n symbolic steps."}],"arxiv":1,"type":"conference"},{"title":"Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"date_updated":"2023-02-14T10:36:10Z","publisher":"SIAM","date_published":"2011-01-01T00:00:00Z","month":"01","year":"2011","language":[{"iso":"eng"}],"conference":{"location":"San Francisco, SA, United States","name":"SODA: Symposium on Discrete Algorithms","start_date":"2011-01-23","end_date":"2011-01-25"},"department":[{"_id":"KrCh"}],"publist_id":"3278","article_processing_charge":"No","page":"1318 - 1336","day":"01","status":"public","quality_controlled":"1","date_created":"2018-12-11T12:02:47Z","_id":"3343","scopus_import":"1","abstract":[{"text":"We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the almost sure winning set for reachability and parity objectives in MDPs. We achieve the following running time for static algorithms in MDPs with graphs of n vertices and m edges: (1) O(m · min{ √m, n2/3 }) for the mec decomposition, improving the longstanding O(m·n) bound; (2) O(m·n2/3) for reachability objectives, improving the previous O(m · √m) bound for m &gt; n4/3; and (3) O(m · min{ √m, n2/3 } · log(d)) for parity objectives with d priorities, improving the previous O(m · √m · d) bound. We also give incremental and decremental algorithms in linear time for mec decomposition and reachability objectives and O(m · log d) time for parity ob jectives.","lang":"eng"}],"type":"conference","citation":{"short":"K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.","ieee":"K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.","ista":"Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.","ama":"Chatterjee K, Henzinger MH. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:<a href=\"https://doi.org/10.1137/1.9781611973082.101\">10.1137/1.9781611973082.101</a>","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. <a href=\"https://doi.org/10.1137/1.9781611973082.101\">https://doi.org/10.1137/1.9781611973082.101</a>.","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973082.101\">https://doi.org/10.1137/1.9781611973082.101</a>","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. <i>Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification</i>. SIAM, 2011, pp. 1318–36, doi:<a href=\"https://doi.org/10.1137/1.9781611973082.101\">10.1137/1.9781611973082.101</a>."},"oa_version":"Submitted Version","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/21/"}],"doi":"10.1137/1.9781611973082.101"},{"publisher":"Springer","alternative_title":["LNCS"],"date_published":"2011-10-15T00:00:00Z","month":"10","intvolume":"      6945","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"title":"Graph games with reachability objectives","date_updated":"2021-01-12T07:42:48Z","conference":{"location":"Genoa, Italy","end_date":"2011-09-30","start_date":"2011-09-28","name":"RP: Reachability Problems"},"publist_id":"3277","department":[{"_id":"KrCh"}],"page":"1 - 1","year":"2011","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Games played on graphs provide the mathematical framework to analyze several important problems in computer science as well as mathematics, such as the synthesis problem of Church, model checking of open reactive systems and many others. On the basis of mode of interaction of the players these games can be classified as follows: (a) turn-based (players make moves in turns); and (b) concurrent (players make moves simultaneously). On the basis of the information available to the players these games can be classified as follows: (a) perfect-information (players have perfect view of the game); and (b) partial-information (players have partial view of the game). In this talk we will consider all these classes of games with reachability objectives, where the goal of one player is to reach a set of target vertices of the graph, and the goal of the opponent player is to prevent the player from reaching the target. We will survey the results for various classes of games, and the results range from linear time decision algorithms to EXPTIME-complete problems to undecidable problems."}],"type":"conference","volume":6945,"citation":{"ieee":"K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.","short":"K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.","ista":"Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.","ama":"Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:<a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">10.1007/978-3-642-24288-5_1</a>","chicago":"Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">https://doi.org/10.1007/978-3-642-24288-5_1</a>.","apa":"Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno &#38; I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">https://doi.org/10.1007/978-3-642-24288-5_1</a>","mla":"Chatterjee, Krishnendu. <i>Graph Games with Reachability Objectives</i>. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:<a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">10.1007/978-3-642-24288-5_1</a>."},"status":"public","quality_controlled":"1","day":"15","_id":"3344","date_created":"2018-12-11T12:02:47Z","editor":[{"full_name":"Delzanno, Giorgo","last_name":"Delzanno","first_name":"Giorgo"},{"first_name":"Igor","last_name":"Potapov","full_name":"Potapov, Igor"}],"publication_status":"published","doi":"10.1007/978-3-642-24288-5_1","oa_version":"None"},{"volume":6658,"date_created":"2022-03-21T08:08:35Z","day":"01","status":"public","doi":"10.1007/978-3-642-20844-7_22","publication":"Graph-Based Representations in Pattern Recognition","oa_version":"None","month":"06","intvolume":"      6658","alternative_title":["LNCS"],"date_published":"2011-06-01T00:00:00Z","acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","date_updated":"2023-09-05T14:10:15Z","series_title":"LNIP","page":"215-224","conference":{"location":"Münster, Germany","end_date":"2011-05-20","start_date":"2011-05-18","name":"GbRPR: Graph-based Representations in Pattern Recognition"},"year":"2011","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642208430"],"eisbn":["9783642208447"]},"citation":{"mla":"Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>.","apa":"Artner, N. M., Ion, A., &#38; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &#38; A. Torsello (Eds.), <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>","chicago":"Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>.","ista":"Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.","ieee":"N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in <i>Graph-Based Representations in Pattern Recognition</i>, Münster, Germany, 2011, vol. 6658, pp. 215–224.","short":"N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.","ama":"Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. <i>Graph-Based Representations in Pattern Recognition</i>. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>"},"type":"conference","scopus_import":"1","abstract":[{"text":"This paper presents a method to create a model of an articulated object using the planar motion in an initialization video. The model consists of rigid parts connected by points of articulation. The rigid parts are described by the positions of salient feature-points tracked throughout the video. Following a filtering step that identifies points that belong to different objects, rigid parts are found by a grouping process in a graph pyramid. Valid articulation points are selected by verifying multiple hypotheses for each pair of parts.","lang":"eng"}],"editor":[{"full_name":"Jiang, Xiaoyi","last_name":"Jiang","first_name":"Xiaoyi"},{"full_name":"Ferrer, Miquel","last_name":"Ferrer","first_name":"Miquel"},{"full_name":"Torsello, Andrea","last_name":"Torsello","first_name":"Andrea"}],"_id":"10907","quality_controlled":"1","publication_status":"published","place":"Berlin, Heidelberg","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Spatio-temporal extraction of articulated models in a graph pyramid","author":[{"last_name":"Artner","first_name":"Nicole M.","full_name":"Artner, Nicole M."},{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","last_name":"Ion","full_name":"Ion, Adrian"},{"last_name":"Kropatsch","first_name":"Walter G.","full_name":"Kropatsch, Walter G."}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}]},{"page":"27-37","external_id":{"pmid":["21727197"]},"year":"2011","month":"07","intvolume":"       194","date_published":"2011-07-04T00:00:00Z","date_updated":"2022-07-18T08:53:46Z","keyword":["Cell Biology"],"issue":"1","oa":1,"doi":"10.1083/jcb.201012154","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1083/jcb.201012154"}],"publication":"Journal of Cell Biology","oa_version":"Published Version","pmid":1,"volume":194,"date_created":"2022-04-07T07:52:18Z","status":"public","day":"04","article_processing_charge":"No","language":[{"iso":"eng"}],"article_type":"original","publisher":"Rockefeller University Press","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","author":[{"full_name":"Talamas, Jessica A.","first_name":"Jessica A.","last_name":"Talamas"},{"full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"title":"POM121 and Sun1 play a role in early steps of interphase NPC assembly","publication_status":"published","extern":"1","publication_identifier":{"issn":["0021-9525"],"eissn":["1540-8140"]},"citation":{"ama":"Talamas JA, Hetzer M. POM121 and Sun1 play a role in early steps of interphase NPC assembly. <i>Journal of Cell Biology</i>. 2011;194(1):27-37. doi:<a href=\"https://doi.org/10.1083/jcb.201012154\">10.1083/jcb.201012154</a>","short":"J.A. Talamas, M. Hetzer, Journal of Cell Biology 194 (2011) 27–37.","ieee":"J. A. Talamas and M. Hetzer, “POM121 and Sun1 play a role in early steps of interphase NPC assembly,” <i>Journal of Cell Biology</i>, vol. 194, no. 1. Rockefeller University Press, pp. 27–37, 2011.","ista":"Talamas JA, Hetzer M. 2011. POM121 and Sun1 play a role in early steps of interphase NPC assembly. Journal of Cell Biology. 194(1), 27–37.","chicago":"Talamas, Jessica A., and Martin Hetzer. “POM121 and Sun1 Play a Role in Early Steps of Interphase NPC Assembly.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2011. <a href=\"https://doi.org/10.1083/jcb.201012154\">https://doi.org/10.1083/jcb.201012154</a>.","apa":"Talamas, J. A., &#38; Hetzer, M. (2011). POM121 and Sun1 play a role in early steps of interphase NPC assembly. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201012154\">https://doi.org/10.1083/jcb.201012154</a>","mla":"Talamas, Jessica A., and Martin Hetzer. “POM121 and Sun1 Play a Role in Early Steps of Interphase NPC Assembly.” <i>Journal of Cell Biology</i>, vol. 194, no. 1, Rockefeller University Press, 2011, pp. 27–37, doi:<a href=\"https://doi.org/10.1083/jcb.201012154\">10.1083/jcb.201012154</a>."},"type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","text":"Nuclear pore complexes (NPCs) assemble at the end of mitosis during nuclear envelope (NE) reformation and into an intact NE as cells progress through interphase. Although recent studies have shown that NPC formation occurs by two different molecular mechanisms at two distinct cell cycle stages, little is known about the molecular players that mediate the fusion of the outer and inner nuclear membranes to form pores. In this paper, we provide evidence that the transmembrane nucleoporin (Nup), POM121, but not the Nup107–160 complex, is present at new pore assembly sites at a time that coincides with inner nuclear membrane (INM) and outer nuclear membrane (ONM) fusion. Overexpression of POM121 resulted in juxtaposition of the INM and ONM. Additionally, Sun1, an INM protein that is known to interact with the cytoskeleton, was specifically required for interphase assembly and localized with POM121 at forming pores. We propose a model in which POM121 and Sun1 interact transiently to promote early steps of interphase NPC assembly."}],"_id":"11094","quality_controlled":"1"},{"volume":23,"pmid":1,"status":"public","day":"01","date_created":"2022-04-07T07:52:27Z","publication":"Current Opinion in Cell Biology","doi":"10.1016/j.ceb.2011.04.013","oa_version":"None","date_published":"2011-06-01T00:00:00Z","intvolume":"        23","month":"06","issue":"3","keyword":["Cell Biology"],"date_updated":"2022-07-18T08:39:40Z","page":"255-257","external_id":{"pmid":["21592757"]},"year":"2011","scopus_import":"1","type":"journal_article","publication_identifier":{"issn":["0955-0674"]},"citation":{"mla":"Hetzer, Martin, and Giacomo Cavalli. “Editorial Overview.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 3, Elsevier, 2011, pp. 255–57, doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">10.1016/j.ceb.2011.04.013</a>.","apa":"Hetzer, M., &#38; Cavalli, G. (2011). Editorial overview. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">https://doi.org/10.1016/j.ceb.2011.04.013</a>","chicago":"Hetzer, Martin, and Giacomo Cavalli. “Editorial Overview.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">https://doi.org/10.1016/j.ceb.2011.04.013</a>.","short":"M. Hetzer, G. Cavalli, Current Opinion in Cell Biology 23 (2011) 255–257.","ieee":"M. Hetzer and G. Cavalli, “Editorial overview,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 3. Elsevier, pp. 255–257, 2011.","ista":"Hetzer M, Cavalli G. 2011. Editorial overview. Current Opinion in Cell Biology. 23(3), 255–257.","ama":"Hetzer M, Cavalli G. Editorial overview. <i>Current Opinion in Cell Biology</i>. 2011;23(3):255-257. doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">10.1016/j.ceb.2011.04.013</a>"},"extern":"1","quality_controlled":"1","_id":"11095","publication_status":"published","publisher":"Elsevier","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","title":"Editorial overview","author":[{"full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X"},{"first_name":"Giacomo","last_name":"Cavalli","full_name":"Cavalli, Giacomo"}],"article_processing_charge":"No","article_type":"letter_note","language":[{"iso":"eng"}]},{"oa_version":"None","doi":"10.1016/j.ceb.2010.09.008","publication":"Current Opinion in Cell Biology","date_created":"2022-04-07T07:52:37Z","day":"01","status":"public","pmid":1,"volume":23,"year":"2011","page":"65-70","external_id":{"pmid":["21030234"]},"date_updated":"2022-07-18T08:53:48Z","keyword":["Cell Biology"],"issue":"1","intvolume":"        23","month":"02","date_published":"2011-02-01T00:00:00Z","publication_status":"published","_id":"11096","quality_controlled":"1","extern":"1","publication_identifier":{"issn":["0955-0674"]},"citation":{"apa":"Liang, Y., &#38; Hetzer, M. (2011). Functional interactions between nucleoporins and chromatin. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">https://doi.org/10.1016/j.ceb.2010.09.008</a>","mla":"Liang, Yun, and Martin Hetzer. “Functional Interactions between Nucleoporins and Chromatin.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 1, Elsevier, 2011, pp. 65–70, doi:<a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">10.1016/j.ceb.2010.09.008</a>.","ista":"Liang Y, Hetzer M. 2011. Functional interactions between nucleoporins and chromatin. Current Opinion in Cell Biology. 23(1), 65–70.","short":"Y. Liang, M. Hetzer, Current Opinion in Cell Biology 23 (2011) 65–70.","ieee":"Y. Liang and M. Hetzer, “Functional interactions between nucleoporins and chromatin,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 1. Elsevier, pp. 65–70, 2011.","ama":"Liang Y, Hetzer M. Functional interactions between nucleoporins and chromatin. <i>Current Opinion in Cell Biology</i>. 2011;23(1):65-70. doi:<a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">10.1016/j.ceb.2010.09.008</a>","chicago":"Liang, Yun, and Martin Hetzer. “Functional Interactions between Nucleoporins and Chromatin.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">https://doi.org/10.1016/j.ceb.2010.09.008</a>."},"type":"journal_article","abstract":[{"text":"As the gatekeepers of the eukaryotic cell nucleus, nuclear pore complexes (NPCs) mediate all molecular trafficking between the nucleoplasm and the cytoplasm. In recent years, transport-independent functions of NPC components, nucleoporins, have been identified including roles in chromatin organization and gene regulation. Here, we summarize our current view of the NPC as a dynamic hub for the integration of chromatin regulation and nuclear trafficking and discuss the functional interplay between nucleoporins and the nuclear genome.","lang":"eng"}],"scopus_import":"1","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","title":"Functional interactions between nucleoporins and chromatin","author":[{"full_name":"Liang, Yun","last_name":"Liang","first_name":"Yun"},{"full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"publisher":"Elsevier"},{"doi":"10.1101/sqb.2010.75.059","publication":"Cold Spring Harbor Symposia on Quantitative Biology","oa_version":"None","pmid":1,"volume":75,"day":"18","status":"public","date_created":"2022-04-07T07:53:18Z","page":"585-597","external_id":{"pmid":["21502404"]},"year":"2011","intvolume":"        75","month":"04","date_published":"2011-04-18T00:00:00Z","date_updated":"2022-07-18T08:54:23Z","keyword":["Genetics","Molecular Biology","Biochemistry"],"publication_status":"published","type":"journal_article","scopus_import":"1","abstract":[{"text":"Eukaryotic cell function depends on the physical separation of nucleoplasmic and cytoplasmic components by the nuclear envelope (NE). Molecular communication between the two compartments involves active, signal-mediated trafficking, a function that is exclusively performed by nuclear pore complexes (NPCs). The individual NPC components and the mechanisms that are involved in nuclear trafficking are well documented and have become textbook knowledge. However, in addition to their roles as nuclear gatekeepers, NPC components-nucleoporins-have been shown to have critical roles in chromatin organization and gene regulation. These findings have sparked new enthusiasm to study the roles of this multiprotein complex in nuclear organization and explore novel functions that in some cases appear to go beyond a role in transport. Here, we discuss our present view of NPC biogenesis, which is tightly linked to proper cell cycle progression and cell differentiation. In addition, we summarize new data suggesting that NPCs represent dynamic hubs for the integration of gene regulation and nuclear transport processes.","lang":"eng"}],"publication_identifier":{"issn":["0091-7451","1943-4456"],"isbn":["9781936113071"]},"citation":{"ama":"Capelson M, Doucet C, Hetzer M. Nuclear pore complexes: Guardians of the nuclear genome. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. 2011;75:585-597. doi:<a href=\"https://doi.org/10.1101/sqb.2010.75.059\">10.1101/sqb.2010.75.059</a>","ista":"Capelson M, Doucet C, Hetzer M. 2011. Nuclear pore complexes: Guardians of the nuclear genome. Cold Spring Harbor Symposia on Quantitative Biology. 75, 585–597.","short":"M. Capelson, C. Doucet, M. Hetzer, Cold Spring Harbor Symposia on Quantitative Biology 75 (2011) 585–597.","ieee":"M. Capelson, C. Doucet, and M. Hetzer, “Nuclear pore complexes: Guardians of the nuclear genome,” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 75. Cold Spring Harbor Laboratory Press, pp. 585–597, 2011.","chicago":"Capelson, M., C. Doucet, and Martin Hetzer. “Nuclear Pore Complexes: Guardians of the Nuclear Genome.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press, 2011. <a href=\"https://doi.org/10.1101/sqb.2010.75.059\">https://doi.org/10.1101/sqb.2010.75.059</a>.","apa":"Capelson, M., Doucet, C., &#38; Hetzer, M. (2011). Nuclear pore complexes: Guardians of the nuclear genome. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/sqb.2010.75.059\">https://doi.org/10.1101/sqb.2010.75.059</a>","mla":"Capelson, M., et al. “Nuclear Pore Complexes: Guardians of the Nuclear Genome.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 75, Cold Spring Harbor Laboratory Press, 2011, pp. 585–97, doi:<a href=\"https://doi.org/10.1101/sqb.2010.75.059\">10.1101/sqb.2010.75.059</a>."},"extern":"1","quality_controlled":"1","_id":"11100","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Cold Spring Harbor Laboratory Press","author":[{"full_name":"Capelson, M.","last_name":"Capelson","first_name":"M."},{"full_name":"Doucet, C.","last_name":"Doucet","first_name":"C."},{"first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","last_name":"HETZER","full_name":"HETZER, Martin W"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","title":"Nuclear pore complexes: Guardians of the nuclear genome"},{"publisher":"American Physical Society","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Droplet and cluster formation in freely falling granular streams","author":[{"orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R","full_name":"Waitukaitis, Scott R"},{"full_name":"Grütjen, Helge","last_name":"Grütjen","first_name":"Helge"},{"first_name":"John","last_name":"Royer","full_name":"Royer, John"},{"last_name":"Jaeger","first_name":"Heinrich","full_name":"Jaeger, Heinrich"}],"publist_id":"7942","language":[{"iso":"eng"}],"citation":{"mla":"Waitukaitis, Scott R., et al. “Droplet and Cluster Formation in Freely Falling Granular Streams.” <i>Physical Review E</i>, vol. 83, no. 5, 051302, American Physical Society, 2011, doi:<a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">10.1103/PhysRevE.83.051302</a>.","apa":"Waitukaitis, S. R., Grütjen, H., Royer, J., &#38; Jaeger, H. (2011). Droplet and cluster formation in freely falling granular streams. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">https://doi.org/10.1103/PhysRevE.83.051302</a>","chicago":"Waitukaitis, Scott R, Helge Grütjen, John Royer, and Heinrich Jaeger. “Droplet and Cluster Formation in Freely Falling Granular Streams.” <i>Physical Review E</i>. American Physical Society, 2011. <a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">https://doi.org/10.1103/PhysRevE.83.051302</a>.","ama":"Waitukaitis SR, Grütjen H, Royer J, Jaeger H. Droplet and cluster formation in freely falling granular streams. <i>Physical Review E</i>. 2011;83(5). doi:<a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">10.1103/PhysRevE.83.051302</a>","ista":"Waitukaitis SR, Grütjen H, Royer J, Jaeger H. 2011. Droplet and cluster formation in freely falling granular streams. Physical Review E. 83(5), 051302.","short":"S.R. Waitukaitis, H. Grütjen, J. Royer, H. Jaeger, Physical Review E 83 (2011).","ieee":"S. R. Waitukaitis, H. Grütjen, J. Royer, and H. Jaeger, “Droplet and cluster formation in freely falling granular streams,” <i>Physical Review E</i>, vol. 83, no. 5. American Physical Society, 2011."},"extern":"1","type":"journal_article","arxiv":1,"abstract":[{"lang":"eng","text":"Particle beams are important tools for probing atomic and molecular interactions. Here we demonstrate that particle beams also offer a unique opportunity to investigate interactions in macroscopic systems, such as granular media. Motivated by recent experiments on streams of grains that exhibit liquid-like breakup into droplets, we use molecular dynamics simulations to investigate the evolution of a dense stream of macroscopic spheres accelerating out of an opening at the bottom of a reservoir. We show how nanoscale details associated with energy dissipation during collisions modify the stream\\'s macroscopic behavior. We find that inelastic collisions collimate the stream, while the presence of short-range attractive interactions drives structure formation. Parameterizing the collision dynamics by the coefficient of restitution (i.e., the ratio of relative velocities before and after impact) and the strength of the cohesive interaction, we map out a spectrum of behaviors that ranges from gaslike jets in which all grains drift apart to liquid-like streams that break into large droplets containing hundreds of grains. We also find a new, intermediate regime in which small aggregates form by capture from the gas phase, similar to what can be observed in molecular beams. Our results show that nearly all aspects of stream behavior are closely related to the velocity gradient associated with vertical free fall. Led by this observation, we propose a simple energy balance model to explain the droplet formation process. The qualitative as well as many quantitative features of the simulations and the model compare well with available experimental data and provide a first quantitative measure of the role of attractions in freely cooling granular streams."}],"_id":"112","quality_controlled":"1","publication_status":"published","month":"05","intvolume":"        83","date_published":"2011-05-12T00:00:00Z","article_number":"051302","acknowledgement":"This work was supported by the NSF through CBET-0933242. We acknowledge use of shared facilities provided by the Keck Facility for Ultrafast Imaging at the University of Chicago and by the Chicago MRSEC through NSF DMR-0820054. Software support by Itasca Consulting Group, Inc., under the Itasca Educational Partnership is gratefully acknowledged. H.G. thanks the German-American Fulbright Commission for fellowship support during his stay at the University of Chicago.","date_updated":"2021-01-12T06:48:25Z","issue":"5","oa":1,"external_id":{"arxiv":["1006.1371"]},"year":"2011","volume":83,"date_created":"2018-12-11T11:44:41Z","day":"12","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1006.1371","open_access":"1"}],"doi":"10.1103/PhysRevE.83.051302","publication":"Physical Review E","oa_version":"Preprint"},{"author":[{"full_name":"Baykan, Eda","last_name":"Baykan","first_name":"Eda"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Marian","first_name":"Ludmila","full_name":"Marian, Ludmila"},{"first_name":"Ingmar","last_name":"Weber","full_name":"Weber, Ingmar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A comprehensive study of features and algorithms for URL-based topic classification","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","_id":"11673","quality_controlled":"1","citation":{"ista":"Baykan E, Henzinger MH, Marian L, Weber I. 2011. A comprehensive study of features and algorithms for URL-based topic classification. ACM Transactions on the Web. 5(3), 15.","short":"E. Baykan, M.H. Henzinger, L. Marian, I. Weber, ACM Transactions on the Web 5 (2011).","ieee":"E. Baykan, M. H. Henzinger, L. Marian, and I. Weber, “A comprehensive study of features and algorithms for URL-based topic classification,” <i>ACM Transactions on the Web</i>, vol. 5, no. 3. Association for Computing Machinery, 2011.","ama":"Baykan E, Henzinger MH, Marian L, Weber I. A comprehensive study of features and algorithms for URL-based topic classification. <i>ACM Transactions on the Web</i>. 2011;5(3). doi:<a href=\"https://doi.org/10.1145/1993053.1993057\">10.1145/1993053.1993057</a>","chicago":"Baykan, Eda, Monika H Henzinger, Ludmila Marian, and Ingmar Weber. “A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.” <i>ACM Transactions on the Web</i>. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1993053.1993057\">https://doi.org/10.1145/1993053.1993057</a>.","apa":"Baykan, E., Henzinger, M. H., Marian, L., &#38; Weber, I. (2011). A comprehensive study of features and algorithms for URL-based topic classification. <i>ACM Transactions on the Web</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1993053.1993057\">https://doi.org/10.1145/1993053.1993057</a>","mla":"Baykan, Eda, et al. “A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.” <i>ACM Transactions on the Web</i>, vol. 5, no. 3, 15, Association for Computing Machinery, 2011, doi:<a href=\"https://doi.org/10.1145/1993053.1993057\">10.1145/1993053.1993057</a>."},"extern":"1","publication_identifier":{"eissn":["1559-114X"],"issn":["1559-1131"]},"type":"journal_article","abstract":[{"lang":"eng","text":"Given only the URL of a Web page, can we identify its topic? We study this problem in detail by exploring a large number of different feature sets and algorithms on several datasets. We also show that the inherent overlap between topics and the sparsity of the information in URLs makes this a very challenging problem. Web page classification without a page’s content is desirable when the content is not available at all, when a classification is needed before obtaining the content, or when classification speed is of utmost importance. For our experiments we used five different corpora comprising a total of about 3 million (URL, classification) pairs. We evaluated several techniques for feature generation and classification algorithms. The individual binary classifiers were then combined via boosting into metabinary classifiers. We achieve typical F-measure values between 80 and 85, and a typical precision of around 86. The precision can be pushed further over 90 while maintaining a typical level of recall between 30 and 40."}],"scopus_import":"1","publication_status":"published","date_updated":"2022-09-12T08:46:56Z","keyword":["Topic classification","URL","ODP"],"issue":"3","month":"07","intvolume":"         5","date_published":"2011-07-01T00:00:00Z","article_number":"15","year":"2011","date_created":"2022-07-27T13:48:11Z","status":"public","day":"01","volume":5,"oa_version":"None","doi":"10.1145/1993053.1993057","publication":"ACM Transactions on the Web"},{"article_type":"original","year":"2011","language":[{"iso":"eng"}],"article_processing_charge":"No","page":"178-183","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Offline file assignments for online load balancing","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Weber, Ingmar","first_name":"Ingmar","last_name":"Weber"}],"issue":"4","date_updated":"2022-09-12T09:38:05Z","publisher":"Elsevier","date_published":"2011-01-15T00:00:00Z","intvolume":"       111","month":"01","oa_version":"None","publication":"Information Processing Letters","publication_status":"published","doi":"10.1016/j.ipl.2010.11.022","day":"15","status":"public","quality_controlled":"1","date_created":"2022-08-08T11:33:03Z","_id":"11760","scopus_import":"1","abstract":[{"lang":"eng","text":"We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased\r\nby this. We present simple deterministic algorithms for this problem and exhibit an interesting trade-off between the available space to make file copies and the obtainable makespan. We also give non-trivial lower bounds for a large class of deterministic algorithms and present a randomized algorithm that beats these bounds with high probability."}],"type":"journal_article","volume":111,"citation":{"ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” <i>Information Processing Letters</i>, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.","ista":"Dütting P, Henzinger MH, Weber I. 2011. Offline file assignments for online load balancing. Information Processing Letters. 111(4), 178–183.","short":"P. Dütting, M.H. Henzinger, I. Weber, Information Processing Letters 111 (2011) 178–183.","ama":"Dütting P, Henzinger MH, Weber I. Offline file assignments for online load balancing. <i>Information Processing Letters</i>. 2011;111(4):178-183. doi:<a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">10.1016/j.ipl.2010.11.022</a>","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Offline File Assignments for Online Load Balancing.” <i>Information Processing Letters</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">https://doi.org/10.1016/j.ipl.2010.11.022</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2011). Offline file assignments for online load balancing. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">https://doi.org/10.1016/j.ipl.2010.11.022</a>","mla":"Dütting, Paul, et al. “Offline File Assignments for Online Load Balancing.” <i>Information Processing Letters</i>, vol. 111, no. 4, Elsevier, 2011, pp. 178–83, doi:<a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">10.1016/j.ipl.2010.11.022</a>."},"publication_identifier":{"issn":["0020-0190"]},"extern":"1"},{"_id":"11796","date_created":"2022-08-11T11:51:39Z","quality_controlled":"1","status":"public","day":"01","volume":6942,"publication_identifier":{"isbn":["9783642237188"],"issn":["1611-3349"]},"extern":"1","citation":{"ama":"Henzinger MH, Vidali A. Multi-parameter mechanism design under budget and matroid constraints. In: <i>19th Annual European Symposium on Algorithms</i>. Vol 6942. Springer Nature; 2011:192–202. doi:<a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">10.1007/978-3-642-23719-5_17</a>","short":"M.H. Henzinger, A. Vidali, in:, 19th Annual European Symposium on Algorithms, Springer Nature, 2011, pp. 192–202.","ista":"Henzinger MH, Vidali A. 2011. Multi-parameter mechanism design under budget and matroid constraints. 19th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 6942, 192–202.","ieee":"M. H. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget and matroid constraints,” in <i>19th Annual European Symposium on Algorithms</i>, Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.","chicago":"Henzinger, Monika H, and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” In <i>19th Annual European Symposium on Algorithms</i>, 6942:192–202. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">https://doi.org/10.1007/978-3-642-23719-5_17</a>.","apa":"Henzinger, M. H., &#38; Vidali, A. (2011). Multi-parameter mechanism design under budget and matroid constraints. In <i>19th Annual European Symposium on Algorithms</i> (Vol. 6942, pp. 192–202). Saarbrücken, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">https://doi.org/10.1007/978-3-642-23719-5_17</a>","mla":"Henzinger, Monika H., and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” <i>19th Annual European Symposium on Algorithms</i>, vol. 6942, Springer Nature, 2011, pp. 192–202, doi:<a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">10.1007/978-3-642-23719-5_17</a>."},"scopus_import":"1","abstract":[{"lang":"eng","text":"The design of truthful auctions that approximate the optimal expected revenue is a central problem in algorithmic mechanism design. 30 years after Myerson’s characterization of Bayesian optimal auctions in single-parameter domains [8], characterizing but also providing efficient mechanisms for multi-parameter domains still remains a very important unsolved problem. Our work improves upon recent results in this area, introducing new techniques for tackling the problem, while also combining and extending recently introduced tools.\r\n\r\nIn particular we give the first approximation algorithms for Bayesian auctions with multiple heterogeneous items when bidders have additive valuations, budget constraints and general matroid feasibility constraints."}],"type":"conference","oa_version":"None","publication":"19th Annual European Symposium on Algorithms","publication_status":"published","doi":"10.1007/978-3-642-23719-5_17","date_updated":"2023-02-13T11:32:41Z","author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"full_name":"Vidali, Angelina","last_name":"Vidali","first_name":"Angelina"}],"title":"Multi-parameter mechanism design under budget and matroid constraints","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2011-09-01T00:00:00Z","alternative_title":["LNCS"],"intvolume":"      6942","month":"09","publisher":"Springer Nature","language":[{"iso":"eng"}],"year":"2011","article_processing_charge":"No","page":"192–202","conference":{"end_date":"2011-09-09","start_date":"2011-09-05","name":"ESA: European Symposium on Algorithms","location":"Saarbrücken, Germany"}},{"pmid":1,"volume":31,"day":"7","status":"public","date_created":"2020-06-25T13:09:49Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4071969/","open_access":"1"}],"doi":"10.1523/jneurosci.3894-11.2011","publication":"Journal of Neuroscience","oa_version":"Published Version","intvolume":"        31","month":"12","date_published":"2011-12-07T00:00:00Z","issue":"49","oa":1,"date_updated":"2021-01-12T08:16:36Z","external_id":{"pmid":["22159102"]},"page":"17872-17886","year":"2011","type":"journal_article","abstract":[{"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.","lang":"eng"}],"citation":{"mla":"Woodruff, A. R., et al. “State-Dependent Function of Neocortical Chandelier Cells.” <i>Journal of Neuroscience</i>, vol. 31, no. 49, Society for Neuroscience, 2011, pp. 17872–86, doi:<a href=\"https://doi.org/10.1523/jneurosci.3894-11.2011\">10.1523/jneurosci.3894-11.2011</a>.","apa":"Woodruff, A. R., McGarry, L. M., Vogels, T. P., Inan, M., Anderson, S. A., &#38; Yuste, R. (2011). State-dependent function of neocortical chandelier cells. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/jneurosci.3894-11.2011\">https://doi.org/10.1523/jneurosci.3894-11.2011</a>","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.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2011. <a href=\"https://doi.org/10.1523/jneurosci.3894-11.2011\">https://doi.org/10.1523/jneurosci.3894-11.2011</a>.","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,” <i>Journal of Neuroscience</i>, vol. 31, no. 49. Society for Neuroscience, pp. 17872–17886, 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.","short":"A.R. Woodruff, L.M. McGarry, T.P. Vogels, M. Inan, S.A. Anderson, R. Yuste, Journal of Neuroscience 31 (2011) 17872–17886.","ama":"Woodruff AR, McGarry LM, Vogels TP, Inan M, Anderson SA, Yuste R. State-dependent function of neocortical chandelier cells. <i>Journal of Neuroscience</i>. 2011;31(49):17872-17886. doi:<a href=\"https://doi.org/10.1523/jneurosci.3894-11.2011\">10.1523/jneurosci.3894-11.2011</a>"},"extern":"1","publication_identifier":{"issn":["0270-6474","1529-2401"]},"quality_controlled":"1","_id":"8025","publication_status":"published","publisher":"Society for Neuroscience","author":[{"first_name":"A. R.","last_name":"Woodruff","full_name":"Woodruff, A. R."},{"full_name":"McGarry, L. M.","last_name":"McGarry","first_name":"L. M."},{"full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","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.","first_name":"R.","last_name":"Yuste"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","title":"State-dependent function of neocortical chandelier cells","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}]},{"external_id":{"pmid":["22075724"]},"page":"1569-1573","year":"2011","month":"12","intvolume":"       334","date_published":"2011-12-16T00:00:00Z","issue":"6062","date_updated":"2021-06-02T14:57:22Z","doi":"10.1126/science.1211095","publication":"Science","oa_version":"None","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1126/science.336.6083.802-c"}]},"pmid":1,"volume":334,"status":"public","day":"16","date_created":"2020-06-30T13:26:17Z","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"American Association for the Advancement of Science","title":"Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks","author":[{"orcid":"0000-0003-3295-6181","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P","full_name":"Vogels, Tim P"},{"last_name":"Sprekeler","first_name":"H.","full_name":"Sprekeler, H."},{"first_name":"F.","last_name":"Zenke","full_name":"Zenke, F."},{"first_name":"C.","last_name":"Clopath","full_name":"Clopath, C."},{"full_name":"Gerstner, W.","last_name":"Gerstner","first_name":"W."}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","publication_status":"published","type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","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."}],"extern":"1","publication_identifier":{"issn":["0036-8075","1095-9203"]},"citation":{"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.” <i>Science</i>. American Association for the Advancement of Science, 2011. <a href=\"https://doi.org/10.1126/science.1211095\">https://doi.org/10.1126/science.1211095</a>.","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.","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,” <i>Science</i>, vol. 334, no. 6062. American Association for the Advancement of Science, pp. 1569–1573, 2011.","ama":"Vogels TP, Sprekeler H, Zenke F, Clopath C, Gerstner W. Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks. <i>Science</i>. 2011;334(6062):1569-1573. doi:<a href=\"https://doi.org/10.1126/science.1211095\">10.1126/science.1211095</a>","mla":"Vogels, Tim P., et al. “Inhibitory Plasticity Balances Excitation and Inhibition in Sensory Pathways and Memory Networks.” <i>Science</i>, vol. 334, no. 6062, American Association for the Advancement of Science, 2011, pp. 1569–73, doi:<a href=\"https://doi.org/10.1126/science.1211095\">10.1126/science.1211095</a>.","apa":"Vogels, T. P., Sprekeler, H., Zenke, F., Clopath, C., &#38; Gerstner, W. (2011). Inhibitory plasticity balances excitation and inhibition in sensory pathways and memory networks. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1211095\">https://doi.org/10.1126/science.1211095</a>"},"quality_controlled":"1","_id":"8074"},{"date_updated":"2021-01-12T08:19:27Z","issue":"46","title":"Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion","author":[{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"},{"full_name":"Huber, Matthias","first_name":"Matthias","last_name":"Huber"},{"first_name":"Jérôme","last_name":"Boisbouvier","full_name":"Boisbouvier, Jérôme"},{"full_name":"Meier, Beat H.","first_name":"Beat H.","last_name":"Meier"},{"full_name":"Ernst, Matthias","last_name":"Ernst","first_name":"Matthias"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","intvolume":"        50","date_published":"2011-09-14T00:00:00Z","publisher":"Wiley","language":[{"iso":"eng"}],"year":"2011","article_type":"original","page":"11005-11009","article_processing_charge":"No","_id":"8464","date_created":"2020-09-18T10:09:40Z","quality_controlled":"1","day":"14","status":"public","citation":{"apa":"Schanda, P., Huber, M., Boisbouvier, J., Meier, B. H., &#38; Ernst, M. (2011). Solid-state NMR measurements of asymmetric dipolar couplings provide insight into protein side-chain motion. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201103944\">https://doi.org/10.1002/anie.201103944</a>","mla":"Schanda, Paul, et al. “Solid-State NMR Measurements of Asymmetric Dipolar Couplings Provide Insight into Protein Side-Chain Motion.” <i>Angewandte Chemie International Edition</i>, vol. 50, no. 46, Wiley, 2011, pp. 11005–09, doi:<a href=\"https://doi.org/10.1002/anie.201103944\">10.1002/anie.201103944</a>.","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,” <i>Angewandte Chemie International Edition</i>, vol. 50, no. 46. Wiley, pp. 11005–11009, 2011.","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.","short":"P. Schanda, M. Huber, J. Boisbouvier, B.H. Meier, M. Ernst, Angewandte Chemie International Edition 50 (2011) 11005–11009.","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. <i>Angewandte Chemie International Edition</i>. 2011;50(46):11005-11009. doi:<a href=\"https://doi.org/10.1002/anie.201103944\">10.1002/anie.201103944</a>","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.” <i>Angewandte Chemie International Edition</i>. Wiley, 2011. <a href=\"https://doi.org/10.1002/anie.201103944\">https://doi.org/10.1002/anie.201103944</a>."},"publication_identifier":{"issn":["1433-7851"]},"extern":"1","volume":50,"type":"journal_article","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."}],"related_material":{"link":[{"url":"https://doi.org/10.1002/anie.201206663","relation":"erratum"}]},"oa_version":"None","publication_status":"published","doi":"10.1002/anie.201103944","publication":"Angewandte Chemie International Edition"},{"page":"477-485","article_processing_charge":"No","article_type":"original","year":"2011","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2011-10-25T00:00:00Z","intvolume":"        51","month":"10","title":"Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins","author":[{"full_name":"Lalli, Daniela","last_name":"Lalli","first_name":"Daniela"},{"orcid":"0000-0002-9350-7606","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","full_name":"Schanda, Paul"},{"full_name":"Chowdhury, Anup","first_name":"Anup","last_name":"Chowdhury"},{"full_name":"Retel, Joren","last_name":"Retel","first_name":"Joren"},{"full_name":"Hiller, Matthias","last_name":"Hiller","first_name":"Matthias"},{"full_name":"Higman, Victoria A.","last_name":"Higman","first_name":"Victoria A."},{"first_name":"Lieselotte","last_name":"Handel","full_name":"Handel, Lieselotte"},{"full_name":"Agarwal, Vipin","first_name":"Vipin","last_name":"Agarwal"},{"first_name":"Bernd","last_name":"Reif","full_name":"Reif, Bernd"},{"full_name":"van Rossum, Barth","last_name":"van Rossum","first_name":"Barth"},{"full_name":"Akbey, Ümit","first_name":"Ümit","last_name":"Akbey"},{"full_name":"Oschkinat, Hartmut","last_name":"Oschkinat","first_name":"Hartmut"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"4","date_updated":"2021-01-12T08:19:29Z","publication":"Journal of Biomolecular NMR","publication_status":"published","doi":"10.1007/s10858-011-9578-1","oa_version":"None","type":"journal_article","volume":51,"publication_identifier":{"issn":["0925-2738","1573-5001"]},"extern":"1","citation":{"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. <i>Journal of Biomolecular NMR</i>. 2011;51(4):477-485. doi:<a href=\"https://doi.org/10.1007/s10858-011-9578-1\">10.1007/s10858-011-9578-1</a>","ieee":"D. Lalli <i>et al.</i>, “Three-dimensional deuterium-carbon correlation experiments for high-resolution solid-state MAS NMR spectroscopy of large proteins,” <i>Journal of Biomolecular NMR</i>, vol. 51, no. 4. Springer Nature, pp. 477–485, 2011.","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.","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.","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.” <i>Journal of Biomolecular NMR</i>. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/s10858-011-9578-1\">https://doi.org/10.1007/s10858-011-9578-1</a>.","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. <i>Journal of Biomolecular NMR</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10858-011-9578-1\">https://doi.org/10.1007/s10858-011-9578-1</a>","mla":"Lalli, Daniela, et al. “Three-Dimensional Deuterium-Carbon Correlation Experiments for High-Resolution Solid-State MAS NMR Spectroscopy of Large Proteins.” <i>Journal of Biomolecular NMR</i>, vol. 51, no. 4, Springer Nature, 2011, pp. 477–85, doi:<a href=\"https://doi.org/10.1007/s10858-011-9578-1\">10.1007/s10858-011-9578-1</a>."},"day":"25","quality_controlled":"1","status":"public","date_created":"2020-09-18T10:10:43Z","_id":"8468"},{"page":"246-259","article_processing_charge":"No","year":"2011","article_type":"original","language":[{"iso":"eng"}],"publisher":"Elsevier","intvolume":"       210","month":"06","date_published":"2011-06-01T00:00:00Z","issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"},{"full_name":"Meier, Beat H.","last_name":"Meier","first_name":"Beat H."},{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"}],"title":"Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR","date_updated":"2021-01-12T08:19:29Z","keyword":["Nuclear and High Energy Physics","Biophysics","Biochemistry","Condensed Matter Physics"],"doi":"10.1016/j.jmr.2011.03.015","publication_status":"published","publication":"Journal of Magnetic Resonance","oa_version":"None","type":"journal_article","abstract":[{"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.","lang":"eng"}],"citation":{"mla":"Schanda, Paul, et al. “Accurate Measurement of One-Bond H–X Heteronuclear Dipolar Couplings in MAS Solid-State NMR.” <i>Journal of Magnetic Resonance</i>, vol. 210, no. 2, Elsevier, 2011, pp. 246–59, doi:<a href=\"https://doi.org/10.1016/j.jmr.2011.03.015\">10.1016/j.jmr.2011.03.015</a>.","apa":"Schanda, P., Meier, B. H., &#38; Ernst, M. (2011). Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR. <i>Journal of Magnetic Resonance</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmr.2011.03.015\">https://doi.org/10.1016/j.jmr.2011.03.015</a>","chicago":"Schanda, Paul, Beat H. Meier, and Matthias Ernst. “Accurate Measurement of One-Bond H–X Heteronuclear Dipolar Couplings in MAS Solid-State NMR.” <i>Journal of Magnetic Resonance</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.jmr.2011.03.015\">https://doi.org/10.1016/j.jmr.2011.03.015</a>.","short":"P. Schanda, B.H. Meier, M. Ernst, Journal of Magnetic Resonance 210 (2011) 246–259.","ieee":"P. Schanda, B. H. Meier, and M. Ernst, “Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR,” <i>Journal of Magnetic Resonance</i>, 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.","ama":"Schanda P, Meier BH, Ernst M. Accurate measurement of one-bond H–X heteronuclear dipolar couplings in MAS solid-state NMR. <i>Journal of Magnetic Resonance</i>. 2011;210(2):246-259. doi:<a href=\"https://doi.org/10.1016/j.jmr.2011.03.015\">10.1016/j.jmr.2011.03.015</a>"},"publication_identifier":{"issn":["1090-7807"]},"extern":"1","volume":210,"status":"public","quality_controlled":"1","day":"01","date_created":"2020-09-18T10:10:50Z","_id":"8469"}]