[{"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>.","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. Vol. 7213, Springer, 2012, pp. 270–85, doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>.","ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>","ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285."},"month":"03","arxiv":1,"department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider two-player stochastic 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 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 \\omega-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 gameswith 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 function 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"}],"intvolume":"      7213","publication_status":"published","title":"Robustness of structurally equivalent concurrent parity games","oa_version":"Preprint","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"day":"22","scopus_import":1,"date_created":"2018-12-11T12:02:46Z","volume":7213,"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","conference":{"location":"Tallinn, Estonia","end_date":"2012-04-01","start_date":"2012-03-24","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"date_published":"2012-03-22T00:00:00Z","ec_funded":1,"external_id":{"arxiv":["1107.2009"]},"related_material":{"record":[{"id":"5382","status":"public","relation":"earlier_version"}]},"year":"2012","publist_id":"3284","page":"270 - 285","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1107.2009","open_access":"1"}],"publisher":"Springer","doi":"10.1007/978-3-642-28729-9_18","alternative_title":["LNCS"],"type":"conference","date_updated":"2023-02-23T12:23:46Z","_id":"3341"},{"publisher":"American Physical Society","alternative_title":["Bulletin of the American Physical Society"],"article_processing_charge":"No","type":"conference","_id":"10750","date_updated":"2022-02-08T10:48:01Z","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR12/Event/167014"}],"year":"2012","status":"public","publication":"APS March Meeting 2012","extern":"1","date_published":"2012-02-01T00:00:00Z","acknowledgement":"This work was supported by the Center for Emergent Superconductivity, an Energy Frontier Research Center funded by the U.S. DOE, Office of Science, under Award No. DE-AC0298CH1088.","conference":{"location":"Boston, MA, United States","start_date":"2012-02-27","end_date":"2012-03-02","name":"APS: American Physical Society"},"title":"Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc","oa_version":"Published Version","day":"01","author":[{"first_name":"Hryhoriy","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","last_name":"Polshyn"},{"full_name":"Budakian, Raffi","last_name":"Budakian","first_name":"Raffi"}],"date_created":"2022-02-08T10:39:08Z","volume":57,"intvolume":"        57","abstract":[{"lang":"eng","text":"The goal of this work is to study the superconducting coherence length in the fluctuation regime in cuprate superconductors. In this work we present cantilever torque magnetometry measurements of micron-size BSCCO flakes patterned with arrays of nanometer scale rings or holes. Using ultrasensitive dynamic torque magnetometry, oscillations in magnetization are observed near Tc as a function of the applied magnetic flux threading the array. Special effort was made to detect the oscillations in magnetization at temperatures above Tc, where the Nernst effect and magnetization measurements suggest the possibility of pairing. To constrain the magnitude of the coherence length in the fluctuation regime, we will present the dependence of the amplitude of the h/2e period oscillations as a function of temperature and hole size."}],"publication_status":"published","publication_identifier":{"issn":["0003-0503"]},"month":"02","article_number":"X21.00008","language":[{"iso":"eng"}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Polshyn H, Budakian R. 2012. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. APS March Meeting 2012. APS: American Physical Society, Bulletin of the American Physical Society, vol. 57, X21.00008.","chicago":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” In <i>APS March Meeting 2012</i>, Vol. 57. American Physical Society, 2012.","mla":"Polshyn, Hryhoriy, and Raffi Budakian. “Cantilever Torque Magnetometry Study of Multiply Connected BSCCO Arrays near Tc.” <i>APS March Meeting 2012</i>, vol. 57, no. 1, X21.00008, American Physical Society, 2012.","apa":"Polshyn, H., &#38; Budakian, R. (2012). Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In <i>APS March Meeting 2012</i> (Vol. 57). Boston, MA, United States: American Physical Society.","ama":"Polshyn H, Budakian R. Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc. In: <i>APS March Meeting 2012</i>. Vol 57. American Physical Society; 2012.","short":"H. Polshyn, R. Budakian, in:, APS March Meeting 2012, American Physical Society, 2012.","ieee":"H. Polshyn and R. Budakian, “Cantilever torque magnetometry study of multiply connected BSCCO arrays near Tc,” in <i>APS March Meeting 2012</i>, Boston, MA, United States, 2012, vol. 57, no. 1."},"issue":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2012-07-23T00:00:00Z","acknowledgement":"We are grateful to Research into Ageing/Ageing UK and The Dunhill Trust for funding SzN’s graduate studies, and to Prof Nicholas Dale for his valuable input.","place":"New York","citation":{"ama":"zur Nedden S, Doney AS, Frenguelli BG. The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In: Masino S, Boison D, eds. <i>Adenosine</i>. 1st ed. New York: Springer; 2012:109-129. doi:<a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">10.1007/978-1-4614-3903-5_6</a>","short":"S. zur Nedden, A.S. Doney, B.G. Frenguelli, in:, S. Masino, D. Boison (Eds.), Adenosine, 1st ed., Springer, New York, 2012, pp. 109–129.","ieee":"S. zur Nedden, A. S. Doney, and B. G. Frenguelli, “The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books,” in <i>Adenosine</i>, 1st ed., S. Masino and D. Boison, Eds. New York: Springer, 2012, pp. 109–129.","chicago":"Nedden, Stephanie zur, Alexander S. Doney, and Bruno G. Frenguelli. “The Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the Books.” In <i>Adenosine</i>, edited by Susan Masino and Detlev Boison, 1st ed., 109–29. New York: Springer, 2012. <a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">https://doi.org/10.1007/978-1-4614-3903-5_6</a>.","ista":"zur Nedden S, Doney AS, Frenguelli BG. 2012.The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In: Adenosine. , 109–129.","mla":"zur Nedden, Stephanie, et al. “The Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the Books.” <i>Adenosine</i>, edited by Susan Masino and Detlev Boison, 1st ed., Springer, 2012, pp. 109–29, doi:<a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">10.1007/978-1-4614-3903-5_6</a>.","apa":"zur Nedden, S., Doney, A. S., &#38; Frenguelli, B. G. (2012). The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books. In S. Masino &#38; D. Boison (Eds.), <i>Adenosine</i> (1st ed., pp. 109–129). New York: Springer. <a href=\"https://doi.org/10.1007/978-1-4614-3903-5_6\">https://doi.org/10.1007/978-1-4614-3903-5_6</a>"},"status":"public","publication":"Adenosine","language":[{"iso":"eng"}],"department":[{"_id":"HaJa"}],"month":"07","year":"2012","publication_identifier":{"isbn":["9781461439028"],"eisbn":["9781461439035"]},"publication_status":"published","quality_controlled":"1","abstract":[{"text":"Under physiological conditions the brain, via the purine salvage pathway, reuses the preformed purine bases hypoxanthine, derived from ATP degradation, and adenine (Ade), derived from polyamine synthesis, to restore its ATP pool. However, the massive degradation of ATP during ischemia, although providing valuable neuroprotective adenosine, results in the accumulation and loss of diffusible purine metabolites and thereby leads to a protracted reduction in the post-ischemic ATP pool size. In vivo, this may both limit the ability to deploy ATP-dependent reparative mechanisms and reduce the subsequent availability of adenosine, whilst in brain slices results in tissue with substantially lower levels of ATP than in vivo. In the present review, we describe the mechanisms by which brain tissue replenishes its ATP, how this can be improved with the clinically tolerated chemicals D-ribose and adenine, and the functional, and potential therapeutic, implications of doing so.","lang":"eng"}],"page":"109-129","date_created":"2022-03-21T07:16:12Z","type":"book_chapter","edition":"1","_id":"10896","date_updated":"2022-06-21T11:51:58Z","publisher":"Springer","oa_version":"None","title":"The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books","editor":[{"full_name":"Masino, Susan","last_name":"Masino","first_name":"Susan"},{"first_name":"Detlev","full_name":"Boison, Detlev","last_name":"Boison"}],"article_processing_charge":"No","day":"23","scopus_import":"1","doi":"10.1007/978-1-4614-3903-5_6","author":[{"first_name":"Stephanie","last_name":"zur Nedden","full_name":"zur Nedden, Stephanie","id":"3C77F464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander S.","last_name":"Doney","full_name":"Doney, Alexander S."},{"first_name":"Bruno G.","last_name":"Frenguelli","full_name":"Frenguelli, Bruno G."}]},{"year":"2012","conference":{"end_date":"2012-10-06","start_date":"2012-10-03","name":"ATVA: Automated Technology for Verification and Analysis","location":"Thiruvananthapuram, India"},"acknowledgement":"This work has been partially supported by the French ANR project Veridyc","date_published":"2012-10-15T00:00:00Z","publication":"Automated Technology for Verification and Analysis","status":"public","series_title":"LNCS","type":"conference","_id":"10903","date_updated":"2023-09-05T14:07:24Z","publisher":"Springer","article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-33386-6_14","quality_controlled":"1","page":"167-182","department":[{"_id":"ToHe"}],"month":"10","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in <i>Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In <i>Automated Technology for Verification and Analysis</i>, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>.","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.","mla":"Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>"},"place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"date_created":"2022-03-21T07:58:39Z","volume":7561,"oa_version":"None","title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data","scopus_import":"1","day":"15","author":[{"full_name":"Bouajjani, Ahmed","last_name":"Bouajjani","first_name":"Ahmed"},{"last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","first_name":"Cezara"},{"full_name":"Enea, Constantin","last_name":"Enea","first_name":"Constantin"},{"full_name":"Sighireanu, Mihaela","last_name":"Sighireanu","first_name":"Mihaela"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642333859"],"eissn":["1611-3349"],"eisbn":["9783642333866"]},"abstract":[{"lang":"eng","text":"We propose a logic-based framework for automated reasoning about sequential programs manipulating singly-linked lists and arrays with unbounded data. We introduce the logic SLAD, which allows combining shape constraints, written in a fragment of Separation Logic, with data and size constraints. We address the problem of checking the entailment between SLAD formulas, which is crucial in performing pre-post condition reasoning. Although this problem is undecidable in general for SLAD, we propose a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools. We prove that this procedure is complete, i.e., it is actually a decision procedure for this problem, for an important fragment of SLAD including known decidable logics. We implemented this procedure and shown its preciseness and its efficiency on a significant benchmark of formulas."}],"intvolume":"      7561"},{"date_created":"2022-03-21T08:00:21Z","volume":7454,"title":"Strategy synthesis for multi-dimensional quantitative objectives","oa_version":"Preprint","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Randour","full_name":"Randour, Mickael","first_name":"Mickael"},{"full_name":"Raskin, Jean-François","last_name":"Raskin","first_name":"Jean-François"}],"day":"15","scopus_import":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642329395"],"eisbn":["9783642329401"]},"publication_status":"published","intvolume":"      7454","abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"department":[{"_id":"KrCh"}],"arxiv":1,"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","place":"Berlin, Heidelberg","citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>.","ista":"Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.","short":"K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.","ieee":"K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in <i>CONCUR 2012 - Concurrency Theory</i>, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>"},"language":[{"iso":"eng"}],"type":"conference","date_updated":"2023-02-23T10:55:06Z","_id":"10904","editor":[{"first_name":"Maciej","last_name":"Koutny","full_name":"Koutny, Maciej"},{"last_name":"Ulidowski","full_name":"Ulidowski, Irek","first_name":"Irek"}],"publisher":"Springer","doi":"10.1007/978-3-642-32940-1_10","alternative_title":["LNCS"],"article_processing_charge":"No","quality_controlled":"1","page":"115-131","external_id":{"arxiv":["1201.5073"]},"related_material":{"record":[{"status":"public","relation":"later_version","id":"2716"}]},"year":"2012","date_published":"2012-09-15T00:00:00Z","acknowledgement":"Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft faculty fellowship.","conference":{"end_date":"2012-09-07","start_date":"2012-09-04","name":"CONCUR: Conference on Concurrency Theory","location":"Newcastle upon Tyne, United Kingdom"},"ec_funded":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication":"CONCUR 2012 - Concurrency Theory","status":"public"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"scopus_import":"1","day":"01","title":"Polynomial-time algorithms for energy games with special weight structures","oa_version":"Preprint","volume":7501,"date_created":"2022-03-21T08:01:45Z","intvolume":"      7501","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help."}],"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642330902"],"issn":["0302-9743"],"isbn":["9783642330896"]},"publication_status":"published","arxiv":1,"month":"10","department":[{"_id":"KrCh"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: <i>Algorithms – ESA 2012</i>. Vol 7501. Springer; 2012:301-312. doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in <i>Algorithms – ESA 2012</i>, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>Algorithms – ESA 2012</i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithms – ESA 2012</i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>Algorithms – ESA 2012</i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1007/978-3-642-33090-2_27","article_processing_charge":"No","alternative_title":["LNCS"],"publisher":"Springer","date_updated":"2023-09-05T14:09:30Z","_id":"10905","type":"conference","page":"301-312","main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"quality_controlled":"1","year":"2012","external_id":{"arxiv":["1604.08234"]},"related_material":{"record":[{"id":"535","relation":"later_version","status":"public"}]},"project":[{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication":"Algorithms – ESA 2012","status":"public","ec_funded":1,"date_published":"2012-10-01T00:00:00Z","acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","conference":{"start_date":"2012-09-10","end_date":"2012-09-12","name":"ESA: European Symposium on Algorithms","location":"Ljubljana, Slovenia"}},{"year":"2012","status":"public","publication":"Tools and Algorithms for the Construction and Analysis of Systems","date_published":"2012-04-01T00:00:00Z","conference":{"end_date":"2012-04-01","start_date":"2012-03-24","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Tallinn, Estonia"},"doi":"10.1007/978-3-642-28756-5_46","alternative_title":["LNCS"],"article_processing_charge":"No","editor":[{"full_name":"Flanagan, Cormac","last_name":"Flanagan","first_name":"Cormac"},{"first_name":"Barbara","last_name":"König","full_name":"König, Barbara"}],"publisher":"Springer","date_updated":"2023-09-05T14:09:54Z","_id":"10906","type":"conference","series_title":"LNCS","page":"549-551","main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"quality_controlled":"1","month":"04","department":[{"_id":"ToHe"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>"},"place":"Berlin, Heidelberg","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Sergey","last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"full_name":"Lopes, Nuno P.","last_name":"Lopes","first_name":"Nuno P."},{"last_name":"Popeea","full_name":"Popeea, Corneliu","first_name":"Corneliu"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"day":"01","scopus_import":"1","title":"HSF(C): A software verifier based on Horn clauses","oa_version":"Published Version","volume":7214,"date_created":"2022-03-21T08:03:30Z","abstract":[{"lang":"eng","text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool."}],"intvolume":"      7214","publication_identifier":{"isbn":["9783642287558"],"issn":["0302-9743"],"eisbn":["9783642287565"],"eissn":["1611-3349"]},"publication_status":"published"},{"publication_identifier":{"issn":["0955-0674"]},"publication_status":"published","intvolume":"        24","abstract":[{"lang":"eng","text":"The Nuclear Envelope (NE) contains over 100 different proteins that associate with nuclear components such as chromatin, the lamina and the transcription machinery. Mutations in genes encoding NE proteins have been shown to result in tissue-specific defects and disease, suggesting cell-type specific differences in NE composition and function. Consistent with these observations, recent studies have revealed unexpected functions for numerous NE associated proteins during cell differentiation and development. Here we review the latest insights into the roles played by the NE in cell differentiation, development, disease and aging, focusing primarily on inner nuclear membrane (INM) proteins and nuclear pore components."}],"date_created":"2022-04-07T07:51:37Z","article_type":"original","volume":24,"title":"Outfits for different occasions: tissue-specific roles of Nuclear Envelope proteins","oa_version":"None","scopus_import":"1","day":"01","author":[{"last_name":"Gomez-Cavazos","full_name":"Gomez-Cavazos, J Sebastian","first_name":"J Sebastian"},{"first_name":"Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","citation":{"short":"J.S. Gomez-Cavazos, M. Hetzer, Current Opinion in Cell Biology 24 (2012) 775–783.","ieee":"J. S. Gomez-Cavazos and M. Hetzer, “Outfits for different occasions: tissue-specific roles of Nuclear Envelope proteins,” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 6. Elsevier, pp. 775–783, 2012.","ama":"Gomez-Cavazos JS, Hetzer M. Outfits for different occasions: tissue-specific roles of Nuclear Envelope proteins. <i>Current Opinion in Cell Biology</i>. 2012;24(6):775-783. doi:<a href=\"https://doi.org/10.1016/j.ceb.2012.08.008\">10.1016/j.ceb.2012.08.008</a>","mla":"Gomez-Cavazos, J. Sebastian, and Martin Hetzer. “Outfits for Different Occasions: Tissue-Specific Roles of Nuclear Envelope Proteins.” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 6, Elsevier, 2012, pp. 775–83, doi:<a href=\"https://doi.org/10.1016/j.ceb.2012.08.008\">10.1016/j.ceb.2012.08.008</a>.","apa":"Gomez-Cavazos, J. S., &#38; Hetzer, M. (2012). Outfits for different occasions: tissue-specific roles of Nuclear Envelope proteins. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2012.08.008\">https://doi.org/10.1016/j.ceb.2012.08.008</a>","ista":"Gomez-Cavazos JS, Hetzer M. 2012. Outfits for different occasions: tissue-specific roles of Nuclear Envelope proteins. Current Opinion in Cell Biology. 24(6), 775–783.","chicago":"Gomez-Cavazos, J Sebastian, and Martin Hetzer. “Outfits for Different Occasions: Tissue-Specific Roles of Nuclear Envelope Proteins.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ceb.2012.08.008\">https://doi.org/10.1016/j.ceb.2012.08.008</a>."},"issue":"6","language":[{"iso":"eng"}],"month":"12","quality_controlled":"1","page":"775-783","type":"journal_article","_id":"11089","date_updated":"2022-07-18T08:38:47Z","publisher":"Elsevier","article_processing_charge":"No","doi":"10.1016/j.ceb.2012.08.008","date_published":"2012-12-01T00:00:00Z","pmid":1,"publication":"Current Opinion in Cell Biology","extern":"1","status":"public","keyword":["Cell Biology"],"external_id":{"pmid":["22995343"]},"year":"2012"},{"date_created":"2022-04-07T07:51:45Z","article_type":"letter_note","volume":149,"title":"RNP export by nuclear envelope budding","oa_version":"Published Version","day":"11","scopus_import":"1","author":[{"first_name":"Emily M.","full_name":"Hatch, Emily M.","last_name":"Hatch"},{"first_name":"Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"publication_status":"published","publication_identifier":{"issn":["0092-8674"]},"intvolume":"       149","abstract":[{"text":"Nuclear export of mRNAs is thought to occur exclusively through nuclear pore complexes. In this issue of Cell, Speese et al. identify an alternate pathway for mRNA export in muscle cells where ribonucleoprotein complexes involved in forming neuromuscular junctions transit the nuclear envelope by fusing with and budding through the nuclear membrane.","lang":"eng"}],"month":"05","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","citation":{"ama":"Hatch EM, Hetzer M. RNP export by nuclear envelope budding. <i>Cell</i>. 2012;149(4):733-735. doi:<a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">10.1016/j.cell.2012.04.018</a>","ieee":"E. M. Hatch and M. Hetzer, “RNP export by nuclear envelope budding,” <i>Cell</i>, vol. 149, no. 4. Elsevier, pp. 733–735, 2012.","short":"E.M. Hatch, M. Hetzer, Cell 149 (2012) 733–735.","ista":"Hatch EM, Hetzer M. 2012. RNP export by nuclear envelope budding. Cell. 149(4), 733–735.","chicago":"Hatch, Emily M., and Martin Hetzer. “RNP Export by Nuclear Envelope Budding.” <i>Cell</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">https://doi.org/10.1016/j.cell.2012.04.018</a>.","apa":"Hatch, E. M., &#38; Hetzer, M. (2012). RNP export by nuclear envelope budding. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">https://doi.org/10.1016/j.cell.2012.04.018</a>","mla":"Hatch, Emily M., and Martin Hetzer. “RNP Export by Nuclear Envelope Budding.” <i>Cell</i>, vol. 149, no. 4, Elsevier, 2012, pp. 733–35, doi:<a href=\"https://doi.org/10.1016/j.cell.2012.04.018\">10.1016/j.cell.2012.04.018</a>."},"issue":"4","language":[{"iso":"eng"}],"oa":1,"type":"journal_article","_id":"11090","date_updated":"2022-07-18T08:58:48Z","publisher":"Elsevier","article_processing_charge":"No","doi":"10.1016/j.cell.2012.04.018","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.cell.2012.04.018","open_access":"1"}],"page":"733-735","keyword":["General Biochemistry","Genetics and Molecular Biology"],"external_id":{"pmid":["22579277"]},"year":"2012","date_published":"2012-05-11T00:00:00Z","pmid":1,"status":"public","publication":"Cell","extern":"1"},{"quality_controlled":"1","page":"88-100","_id":"11091","date_updated":"2022-07-18T08:52:53Z","type":"journal_article","article_processing_charge":"No","doi":"10.4161/nucl.18954","publisher":"Taylor & Francis","pmid":1,"date_published":"2012-01-01T00:00:00Z","status":"public","extern":"1","publication":"Nucleus","keyword":["Cell Biology"],"year":"2012","external_id":{"pmid":["22567193"]},"publication_status":"published","publication_identifier":{"eissn":["1949-1042"],"issn":["1949-1034"]},"intvolume":"         3","abstract":[{"lang":"eng","text":"Neoplastic cells are often characterized by specific morphological abnormalities of the nuclear envelope (NE), which have been used for cancer diagnosis for more than a century. The NE is a double phospholipid bilayer that encapsulates the nuclear genome, regulates all nuclear trafficking of RNAs and proteins and prevents the passive diffusion of macromolecules between the nucleoplasm and the cytoplasm. Whether there is a consequence to the proper functioning of the cell and loss of structural integrity of the nucleus remains unclear. Using live cell imaging, we characterize a phenomenon wherein nuclei of several proliferating human cancer cell lines become temporarily ruptured during interphase. Strikingly, NE rupturing was associated with the mislocalization of nucleoplasmic and cytoplasmic proteins and, in the most extreme cases, the entrapment of cytoplasmic organelles in the nuclear interior. In addition, we observed the formation of micronuclei-like structures during interphase and the movement of chromatin out of the nuclear space. The frequency of these NE rupturing events was higher in cells in which the nuclear lamina, a network of intermediate filaments providing mechanical support to the NE, was not properly formed. Our data uncover the existence of a NE instability that has the potential to change the genomic landscape of cancer cells."}],"volume":3,"date_created":"2022-04-07T07:51:53Z","article_type":"original","day":"01","scopus_import":"1","author":[{"last_name":"Vargas","full_name":"Vargas, Jesse D.","first_name":"Jesse D."},{"last_name":"Hatch","full_name":"Hatch, Emily M.","first_name":"Emily M."},{"full_name":"Anderson, Daniel J.","last_name":"Anderson","first_name":"Daniel J."},{"last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W","orcid":"0000-0002-2111-992X"}],"title":"Transient nuclear envelope rupturing during interphase in human cancer cells","oa_version":"None","citation":{"ieee":"J. D. Vargas, E. M. Hatch, D. J. Anderson, and M. Hetzer, “Transient nuclear envelope rupturing during interphase in human cancer cells,” <i>Nucleus</i>, vol. 3, no. 1. Taylor &#38; Francis, pp. 88–100, 2012.","short":"J.D. Vargas, E.M. Hatch, D.J. Anderson, M. Hetzer, Nucleus 3 (2012) 88–100.","ama":"Vargas JD, Hatch EM, Anderson DJ, Hetzer M. Transient nuclear envelope rupturing during interphase in human cancer cells. <i>Nucleus</i>. 2012;3(1):88-100. doi:<a href=\"https://doi.org/10.4161/nucl.18954\">10.4161/nucl.18954</a>","apa":"Vargas, J. D., Hatch, E. M., Anderson, D. J., &#38; Hetzer, M. (2012). Transient nuclear envelope rupturing during interphase in human cancer cells. <i>Nucleus</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/nucl.18954\">https://doi.org/10.4161/nucl.18954</a>","mla":"Vargas, Jesse D., et al. “Transient Nuclear Envelope Rupturing during Interphase in Human Cancer Cells.” <i>Nucleus</i>, vol. 3, no. 1, Taylor &#38; Francis, 2012, pp. 88–100, doi:<a href=\"https://doi.org/10.4161/nucl.18954\">10.4161/nucl.18954</a>.","chicago":"Vargas, Jesse D., Emily M. Hatch, Daniel J. Anderson, and Martin Hetzer. “Transient Nuclear Envelope Rupturing during Interphase in Human Cancer Cells.” <i>Nucleus</i>. Taylor &#38; Francis, 2012. <a href=\"https://doi.org/10.4161/nucl.18954\">https://doi.org/10.4161/nucl.18954</a>.","ista":"Vargas JD, Hatch EM, Anderson DJ, Hetzer M. 2012. Transient nuclear envelope rupturing during interphase in human cancer cells. Nucleus. 3(1), 88–100."},"issue":"1","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","language":[{"iso":"eng"}],"month":"01"},{"oa_version":"None","title":"Extremely long-lived nuclear pore proteins in the rat brain","author":[{"full_name":"Savas, Jeffrey N.","last_name":"Savas","first_name":"Jeffrey N."},{"first_name":"Brandon H.","last_name":"Toyama","full_name":"Toyama, Brandon H."},{"first_name":"Tao","last_name":"Xu","full_name":"Xu, Tao"},{"last_name":"Yates","full_name":"Yates, John R.","first_name":"John R."},{"first_name":"Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","last_name":"HETZER"}],"day":"02","scopus_import":"1","article_type":"letter_note","date_created":"2022-04-07T07:52:01Z","volume":335,"abstract":[{"lang":"eng","text":"To combat the functional decline of the proteome, cells use the process of protein turnover to replace potentially impaired polypeptides with new functional copies. We found that extremely long-lived proteins (ELLPs) did not turn over in postmitotic cells of the rat central nervous system. These ELLPs were associated with chromatin and the nuclear pore complex, the central transport channels that mediate all molecular trafficking in and out of the nucleus. The longevity of these proteins would be expected to expose them to potentially harmful metabolites, putting them at risk of accumulating damage over extended periods of time. Thus, it is possible that failure to maintain proper levels and functional integrity of ELLPs in nonproliferative cells might contribute to age-related deterioration in cell and tissue function."}],"intvolume":"       335","publication_status":"published","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"month":"02","language":[{"iso":"eng"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","issue":"6071","citation":{"ama":"Savas JN, Toyama BH, Xu T, Yates JR, Hetzer M. Extremely long-lived nuclear pore proteins in the rat brain. <i>Science</i>. 2012;335(6071):942-942. doi:<a href=\"https://doi.org/10.1126/science.1217421\">10.1126/science.1217421</a>","short":"J.N. Savas, B.H. Toyama, T. Xu, J.R. Yates, M. Hetzer, Science 335 (2012) 942–942.","ieee":"J. N. Savas, B. H. Toyama, T. Xu, J. R. Yates, and M. Hetzer, “Extremely long-lived nuclear pore proteins in the rat brain,” <i>Science</i>, vol. 335, no. 6071. American Association for the Advancement of Science, pp. 942–942, 2012.","ista":"Savas JN, Toyama BH, Xu T, Yates JR, Hetzer M. 2012. Extremely long-lived nuclear pore proteins in the rat brain. Science. 335(6071), 942–942.","chicago":"Savas, Jeffrey N., Brandon H. Toyama, Tao Xu, John R. Yates, and Martin Hetzer. “Extremely Long-Lived Nuclear Pore Proteins in the Rat Brain.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1217421\">https://doi.org/10.1126/science.1217421</a>.","mla":"Savas, Jeffrey N., et al. “Extremely Long-Lived Nuclear Pore Proteins in the Rat Brain.” <i>Science</i>, vol. 335, no. 6071, American Association for the Advancement of Science, 2012, pp. 942–942, doi:<a href=\"https://doi.org/10.1126/science.1217421\">10.1126/science.1217421</a>.","apa":"Savas, J. N., Toyama, B. H., Xu, T., Yates, J. R., &#38; Hetzer, M. (2012). Extremely long-lived nuclear pore proteins in the rat brain. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1217421\">https://doi.org/10.1126/science.1217421</a>"},"publisher":"American Association for the Advancement of Science","doi":"10.1126/science.1217421","article_processing_charge":"No","type":"journal_article","date_updated":"2022-07-18T08:53:06Z","_id":"11092","page":"942-942","quality_controlled":"1","external_id":{"pmid":["22300851"]},"year":"2012","keyword":["Multidisciplinary"],"publication":"Science","extern":"1","status":"public","date_published":"2012-02-02T00:00:00Z","pmid":1},{"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","citation":{"chicago":"D’Angelo, Maximiliano A., J. Sebastian Gomez-Cavazos, Arianna Mei, Daniel H. Lackner, and Martin Hetzer. “A Change in Nuclear Pore Complex Composition Regulates Cell Differentiation.” <i>Developmental Cell</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">https://doi.org/10.1016/j.devcel.2011.11.021</a>.","ista":"D’Angelo MA, Gomez-Cavazos JS, Mei A, Lackner DH, Hetzer M. 2012. A change in nuclear pore complex composition regulates cell differentiation. Developmental Cell. 22(2), 446–458.","apa":"D’Angelo, M. A., Gomez-Cavazos, J. S., Mei, A., Lackner, D. H., &#38; Hetzer, M. (2012). A change in nuclear pore complex composition regulates cell differentiation. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">https://doi.org/10.1016/j.devcel.2011.11.021</a>","mla":"D’Angelo, Maximiliano A., et al. “A Change in Nuclear Pore Complex Composition Regulates Cell Differentiation.” <i>Developmental Cell</i>, vol. 22, no. 2, Elsevier, 2012, pp. 446–58, doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">10.1016/j.devcel.2011.11.021</a>.","ama":"D’Angelo MA, Gomez-Cavazos JS, Mei A, Lackner DH, Hetzer M. A change in nuclear pore complex composition regulates cell differentiation. <i>Developmental Cell</i>. 2012;22(2):446-458. doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.11.021\">10.1016/j.devcel.2011.11.021</a>","ieee":"M. A. D’Angelo, J. S. Gomez-Cavazos, A. Mei, D. H. Lackner, and M. Hetzer, “A change in nuclear pore complex composition regulates cell differentiation,” <i>Developmental Cell</i>, vol. 22, no. 2. Elsevier, pp. 446–458, 2012.","short":"M.A. D’Angelo, J.S. Gomez-Cavazos, A. Mei, D.H. Lackner, M. Hetzer, Developmental Cell 22 (2012) 446–458."},"issue":"2","language":[{"iso":"eng"}],"oa":1,"month":"01","publication_identifier":{"issn":["1534-5807"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Nuclear pore complexes (NPCs) are built from ∼30 different proteins called nucleoporins or Nups. Previous studies have shown that several Nups exhibit cell-type-specific expression and that mutations in NPC components result in tissue-specific diseases. Here we show that a specific change in NPC composition is required for both myogenic and neuronal differentiation. The transmembrane nucleoporin Nup210 is absent in proliferating myoblasts and embryonic stem cells (ESCs) but becomes expressed and incorporated into NPCs during cell differentiation. Preventing Nup210 production by RNAi blocks myogenesis and the differentiation of ESCs into neuroprogenitors. We found that the addition of Nup210 to NPCs does not affect nuclear transport but is required for the induction of genes that are essential for cell differentiation. Our results identify a single change in NPC composition as an essential step in cell differentiation and establish a role for Nup210 in gene expression regulation and cell fate determination."}],"intvolume":"        22","date_created":"2022-04-07T07:52:10Z","article_type":"original","volume":22,"oa_version":"Published Version","title":"A change in nuclear pore complex composition regulates cell differentiation","scopus_import":"1","day":"19","author":[{"full_name":"D'Angelo, Maximiliano A.","last_name":"D'Angelo","first_name":"Maximiliano A."},{"first_name":"J. Sebastian","full_name":"Gomez-Cavazos, J. Sebastian","last_name":"Gomez-Cavazos"},{"first_name":"Arianna","full_name":"Mei, Arianna","last_name":"Mei"},{"first_name":"Daniel H.","last_name":"Lackner","full_name":"Lackner, Daniel H."},{"orcid":"0000-0002-2111-992X","first_name":"Martin W","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"date_published":"2012-01-19T00:00:00Z","pmid":1,"status":"public","extern":"1","publication":"Developmental Cell","keyword":["Developmental Biology","Cell Biology","General Biochemistry","Genetics and Molecular Biology","Molecular Biology"],"external_id":{"pmid":["22264802"]},"year":"2012","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2011.11.021","open_access":"1"}],"page":"446-458","type":"journal_article","_id":"11093","date_updated":"2022-07-18T08:53:16Z","publisher":"Elsevier","article_processing_charge":"No","doi":"10.1016/j.devcel.2011.11.021"},{"volume":487,"_id":"113","date_updated":"2021-01-12T06:48:30Z","date_created":"2018-12-11T11:44:42Z","type":"journal_article","day":"12","doi":"10.1038/nature11187","author":[{"orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R"},{"last_name":"Jaeger","full_name":"Jaeger, Heinrich","first_name":"Heinrich"}],"oa_version":"None","title":"Impact-activated solidification of dense suspensions via dynamic jamming fronts","publisher":"Nature Publishing Group","publication_status":"published","page":"205 - 209","intvolume":"       487","abstract":[{"lang":"eng","text":"Although liquids typically flow around intruding objects, a counterintuitive phenomenon occurs in dense suspensions of micrometre-sized particles: they become liquid-like when perturbed lightly, but harden when driven strongly. Rheological experiments have investigated how such thickening arises under shear, and linked it to hydrodynamic interactions or granular dilation. However, neither of these mechanisms alone can explain the ability of suspensions to generate very large, positive normal stresses under impact. To illustrate the phenomenon, such stresses can be large enough to allow a person to run across a suspension without sinking, and far exceed the upper limit observed under shear or extension. Here we show that these stresses originate from an impact-generated solidification front that transforms an initially compressible particle matrix into a rapidly growing jammed region, ultimately leading to extraordinary amounts of momentum absorption. Using high-speed videography, embedded force sensing and X-ray imaging, we capture the detailed dynamics of this process as it decelerates a metal rod hitting a suspension of cornflour (cornstarch) in water. We develop a model for the dynamic solidification and its effect on the surrounding suspension that reproduces the observed behaviour quantitatively. Our findings suggest that prior interpretations of the impact resistance as dominated by shear thickening need to be revisited."}],"publist_id":"7941","year":"2012","month":"07","citation":{"ama":"Waitukaitis SR, Jaeger H. Impact-activated solidification of dense suspensions via dynamic jamming fronts. <i>Nature</i>. 2012;487(7406):205-209. doi:<a href=\"https://doi.org/10.1038/nature11187\">10.1038/nature11187</a>","short":"S.R. Waitukaitis, H. Jaeger, Nature 487 (2012) 205–209.","ieee":"S. R. Waitukaitis and H. Jaeger, “Impact-activated solidification of dense suspensions via dynamic jamming fronts,” <i>Nature</i>, vol. 487, no. 7406. Nature Publishing Group, pp. 205–209, 2012.","chicago":"Waitukaitis, Scott R, and Heinrich Jaeger. “Impact-Activated Solidification of Dense Suspensions via Dynamic Jamming Fronts.” <i>Nature</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nature11187\">https://doi.org/10.1038/nature11187</a>.","ista":"Waitukaitis SR, Jaeger H. 2012. Impact-activated solidification of dense suspensions via dynamic jamming fronts. Nature. 487(7406), 205–209.","mla":"Waitukaitis, Scott R., and Heinrich Jaeger. “Impact-Activated Solidification of Dense Suspensions via Dynamic Jamming Fronts.” <i>Nature</i>, vol. 487, no. 7406, Nature Publishing Group, 2012, pp. 205–09, doi:<a href=\"https://doi.org/10.1038/nature11187\">10.1038/nature11187</a>.","apa":"Waitukaitis, S. R., &#38; Jaeger, H. (2012). Impact-activated solidification of dense suspensions via dynamic jamming fronts. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature11187\">https://doi.org/10.1038/nature11187</a>"},"issue":"7406","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2012-07-12T00:00:00Z","acknowledgement":"This work was supported by NSF through its MRSEC programme (DMR-0820054) and by the US Army Research Office through grant number W911NF-12-1-0182. S.R.W. acknowledges support from a Millikan fellowship.","extern":"1","status":"public","publication":"Nature","language":[{"iso":"eng"}]},{"publist_id":"7940","year":"2012","date_published":"2012-08-14T00:00:00Z","acknowledgement":"This work was supported by the NSF through its MRSEC program (DMR-0820054). S. R. W. acknowledges support from a Millikan fellowship.","extern":"1","status":"public","publication":"Revista Cubana de Fisica","type":"journal_article","_id":"114","date_updated":"2021-01-12T06:48:34Z","publisher":"Universidad de La Habana","quality_controlled":"1","ddc":["530"],"page":"1E31 - 1E33","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2012_RCF_Waitukaitis.pdf","success":1,"file_id":"6461","date_updated":"2019-05-16T11:08:52Z","creator":"kschuh","file_size":589776,"date_created":"2019-05-16T11:08:52Z"}],"month":"08","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Waitukaitis SR, Jaeger H. Solidification of a cornstarch and water suspension. <i>Revista Cubana de Fisica</i>. 2012;29(1E):1E31-1E33.","ieee":"S. R. Waitukaitis and H. Jaeger, “Solidification of a cornstarch and water suspension,” <i>Revista Cubana de Fisica</i>, vol. 29, no. 1E. Universidad de La Habana, p. 1E31-1E33, 2012.","short":"S.R. Waitukaitis, H. Jaeger, Revista Cubana de Fisica 29 (2012) 1E31-1E33.","ista":"Waitukaitis SR, Jaeger H. 2012. Solidification of a cornstarch and water suspension. Revista Cubana de Fisica. 29(1E), 1E31-1E33.","chicago":"Waitukaitis, Scott R, and Heinrich Jaeger. “Solidification of a Cornstarch and Water Suspension.” <i>Revista Cubana de Fisica</i>. Universidad de La Habana, 2012.","apa":"Waitukaitis, S. R., &#38; Jaeger, H. (2012). Solidification of a cornstarch and water suspension. <i>Revista Cubana de Fisica</i>. Universidad de La Habana.","mla":"Waitukaitis, Scott R., and Heinrich Jaeger. “Solidification of a Cornstarch and Water Suspension.” <i>Revista Cubana de Fisica</i>, vol. 29, no. 1E, Universidad de La Habana, 2012, p. 1E31-1E33."},"issue":"1E","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:44:42Z","volume":29,"oa_version":"Published Version","title":"Solidification of a cornstarch and water suspension","day":"14","author":[{"last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","first_name":"Scott R"},{"last_name":"Jaeger","full_name":"Jaeger, Heinrich","first_name":"Heinrich"}],"file_date_updated":"2019-05-16T11:08:52Z","publication_status":"published","license":"https://creativecommons.org/licenses/by-nc/4.0/","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"intvolume":"        29","abstract":[{"text":"We report on an investigation of the solidification of a cornstarch and water suspension during normal impact on its surface. We find that a finite time after impact, the suspension displays characteristics reminiscent of a solid, including localized stress transmission, the development of a yield stress, and some elastic energy storage. The time dependence of these characteristics depends on the thickness of the cornstarch layer, showing that the solidification is a dynamic process driven by the impacting object. These findings confirm previous speculations that rapidly applied normal stress transforms the normally fluid-like suspension into a temporarily jammed solid and draw a clear distinction between the effects of normal stress and shear stress in dense suspensions.","lang":"eng"}],"has_accepted_license":"1"},{"publication_status":"published","quality_controlled":"1","publication_identifier":{"isbn":["9781450311564"]},"page":"2268-2286","abstract":[{"lang":"eng","text":"Suppose your sole interest in recommending a product to me is to maximize the amount paid to you by the seller for a sequence of recommendations. How should you recommend optimally if I become more inclined to ignore you with each irrelevant recommendation you make? Finding an answer to this question is a key challenge in all forms of marketing that rely on and explore social ties; ranging from personal recommendations to viral marketing.\r\n\r\nWe prove that even if the recommendee regains her initial trust on each successful recommendation, the expected revenue the recommender can make over an infinite period due to payments by the seller is bounded. This can only be overcome when the recommendee also incrementally regains trust during periods without any recommendation. Here, we see a connection to \"banner blindness,\" suggesting that showing fewer ads can lead to a higher long-term revenue."}],"_id":"11656","date_updated":"2023-02-09T09:19:49Z","date_created":"2022-07-27T06:47:53Z","type":"conference","day":"29","scopus_import":"1","article_processing_charge":"No","author":[{"first_name":"Paul","full_name":"Dütting, Paul","last_name":"Dütting"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Ingmar","full_name":"Weber, Ingmar","last_name":"Weber"}],"doi":"10.1145/2396761.2398621","oa_version":"None","title":"Maximizing revenue from strategic recommendations under decaying trust","publisher":"Association for Computing Machinery","citation":{"ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Maximizing revenue from strategic recommendations under decaying trust,” in <i>Proceedings of the 21st ACM international conference on Information and knowledge management</i>, Maui, HI, United States, 2012, pp. 2268–2286.","short":"P. Dütting, M.H. Henzinger, I. Weber, in:, Proceedings of the 21st ACM International Conference on Information and Knowledge Management, Association for Computing Machinery, 2012, pp. 2268–2286.","ama":"Dütting P, Henzinger MH, Weber I. Maximizing revenue from strategic recommendations under decaying trust. In: <i>Proceedings of the 21st ACM International Conference on Information and Knowledge Management</i>. Association for Computing Machinery; 2012:2268-2286. doi:<a href=\"https://doi.org/10.1145/2396761.2398621\">10.1145/2396761.2398621</a>","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2012). Maximizing revenue from strategic recommendations under decaying trust. In <i>Proceedings of the 21st ACM international conference on Information and knowledge management</i> (pp. 2268–2286). Maui, HI, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2396761.2398621\">https://doi.org/10.1145/2396761.2398621</a>","mla":"Dütting, Paul, et al. “Maximizing Revenue from Strategic Recommendations under Decaying Trust.” <i>Proceedings of the 21st ACM International Conference on Information and Knowledge Management</i>, Association for Computing Machinery, 2012, pp. 2268–86, doi:<a href=\"https://doi.org/10.1145/2396761.2398621\">10.1145/2396761.2398621</a>.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Maximizing Revenue from Strategic Recommendations under Decaying Trust.” In <i>Proceedings of the 21st ACM International Conference on Information and Knowledge Management</i>, 2268–86. Association for Computing Machinery, 2012. <a href=\"https://doi.org/10.1145/2396761.2398621\">https://doi.org/10.1145/2396761.2398621</a>.","ista":"Dütting P, Henzinger MH, Weber I. 2012. Maximizing revenue from strategic recommendations under decaying trust. Proceedings of the 21st ACM international conference on Information and knowledge management. CIKM: Conference on Information and Knowledge Management, 2268–2286."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Maui, HI, United States","name":"CIKM: Conference on Information and Knowledge Management","start_date":"2012-10-29","end_date":"2012-11-02"},"date_published":"2012-10-29T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 21st ACM international conference on Information and knowledge management","status":"public","extern":"1","year":"2012","month":"10"},{"issue":"15","citation":{"short":"K.C. Lukas, G. Joshi, K.A. Modic, Z.F. Ren, C.P. Opeil, Journal of Materials Science 47 (2012) 5729–5734.","ieee":"K. C. Lukas, G. Joshi, K. A. Modic, Z. F. Ren, and C. P. Opeil, “Thermoelectric properties of Ho-doped Bi0.88Sb0.12,” <i>Journal of Materials Science</i>, vol. 47, no. 15. Springer Nature, pp. 5729–5734, 2012.","ama":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. <i>Journal of Materials Science</i>. 2012;47(15):5729-5734. doi:<a href=\"https://doi.org/10.1007/s10853-012-6463-6\">10.1007/s10853-012-6463-6</a>","mla":"Lukas, K. C., et al. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” <i>Journal of Materials Science</i>, vol. 47, no. 15, Springer Nature, 2012, pp. 5729–34, doi:<a href=\"https://doi.org/10.1007/s10853-012-6463-6\">10.1007/s10853-012-6463-6</a>.","apa":"Lukas, K. C., Joshi, G., Modic, K. A., Ren, Z. F., &#38; Opeil, C. P. (2012). Thermoelectric properties of Ho-doped Bi0.88Sb0.12. <i>Journal of Materials Science</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10853-012-6463-6\">https://doi.org/10.1007/s10853-012-6463-6</a>","ista":"Lukas KC, Joshi G, Modic KA, Ren ZF, Opeil CP. 2012. Thermoelectric properties of Ho-doped Bi0.88Sb0.12. Journal of Materials Science. 47(15), 5729–5734.","chicago":"Lukas, K. C., G. Joshi, Kimberly A Modic, Z. F. Ren, and C. P. Opeil. “Thermoelectric Properties of Ho-Doped Bi0.88Sb0.12.” <i>Journal of Materials Science</i>. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/s10853-012-6463-6\">https://doi.org/10.1007/s10853-012-6463-6</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"arxiv":1,"month":"08","publication_identifier":{"eissn":["1573-4803"],"issn":["0022-2461"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The Seebeck coefficients, electrical resistivities, total thermal conductivities, and magnetization are reported for temperatures between 5 and 350 K for n-type Bi0.88Sb0.12 nano-composite alloys made by Ho-doping at the 0, 1, and 3 % atomic levels. The alloys were prepared using a dc hot-pressing method, and are shown to be single phase for both Ho contents with grain sizes on the average of 900 nm. We find the parent compound has a maximum of ZT = 0.28 at 231 K, while doping 1 % Ho increases the maximum ZT to 0.31 at 221 K and the 3 % doped sample suppresses the maximum ZT = 0.24 at a temperature of 260 K."}],"intvolume":"        47","volume":47,"article_type":"original","date_created":"2022-08-08T08:28:20Z","author":[{"full_name":"Lukas, K. C.","last_name":"Lukas","first_name":"K. C."},{"full_name":"Joshi, G.","last_name":"Joshi","first_name":"G."},{"orcid":"0000-0001-9760-3147","first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"full_name":"Ren, Z. F.","last_name":"Ren","first_name":"Z. F."},{"last_name":"Opeil","full_name":"Opeil, C. P.","first_name":"C. P."}],"day":"01","scopus_import":"1","title":"Thermoelectric properties of Ho-doped Bi0.88Sb0.12","oa_version":"Preprint","date_published":"2012-08-01T00:00:00Z","status":"public","publication":"Journal of Materials Science","extern":"1","year":"2012","external_id":{"arxiv":["1201.6304"]},"quality_controlled":"1","page":"5729-5734","date_updated":"2022-08-11T09:34:39Z","_id":"11751","type":"journal_article","doi":"10.1007/s10853-012-6463-6","article_processing_charge":"No","publisher":"Springer Nature"},{"oa_version":"Preprint","title":"Auctions with heterogeneous items and budget limits","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Starnberger","full_name":"Starnberger, Martin","first_name":"Martin"}],"day":"01","scopus_import":"1","date_created":"2022-08-11T11:32:25Z","volume":7695,"abstract":[{"lang":"eng","text":"We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these properties for divisible items. We use this to show that there can also be no randomized mechanism that achieves this for either divisible or indivisible items. For single-dimensional valuations we show that there can be no deterministic mechanism with these properties for indivisible items, but that there is a randomized mechanism that achieves this for either divisible or indivisible items. The impossibility results hold for public budgets, while the mechanism allows private budgets, which is in both cases the harder variant to show. While all positive results are polynomial-time algorithms, all negative results hold independent of complexity considerations."}],"intvolume":"      7695","publication_status":"published","publication_identifier":{"issn":["1611-3349"],"isbn":["9783642353109"]},"month":"12","arxiv":1,"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dütting, Paul, et al. “Auctions with Heterogeneous Items and Budget Limits.” <i>8th International Workshop on Internet and Network Economics</i>, vol. 7695, Springer Nature, 2012, pp. 44–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">10.1007/978-3-642-35311-6_4</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Starnberger, M. (2012). Auctions with heterogeneous items and budget limits. In <i>8th International Workshop on Internet and Network Economics</i> (Vol. 7695, pp. 44–57). Liverpool, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">https://doi.org/10.1007/978-3-642-35311-6_4</a>","ista":"Dütting P, Henzinger MH, Starnberger M. 2012. Auctions with heterogeneous items and budget limits. 8th International Workshop on Internet and Network Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 7695, 44–57.","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Auctions with Heterogeneous Items and Budget Limits.” In <i>8th International Workshop on Internet and Network Economics</i>, 7695:44–57. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">https://doi.org/10.1007/978-3-642-35311-6_4</a>.","short":"P. Dütting, M.H. Henzinger, M. Starnberger, in:, 8th International Workshop on Internet and Network Economics, Springer Nature, 2012, pp. 44–57.","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions with heterogeneous items and budget limits,” in <i>8th International Workshop on Internet and Network Economics</i>, Liverpool, United Kingdom, 2012, vol. 7695, pp. 44–57.","ama":"Dütting P, Henzinger MH, Starnberger M. Auctions with heterogeneous items and budget limits. In: <i>8th International Workshop on Internet and Network Economics</i>. Vol 7695. Springer Nature; 2012:44–57. doi:<a href=\"https://doi.org/10.1007/978-3-642-35311-6_4\">10.1007/978-3-642-35311-6_4</a>"},"publisher":"Springer Nature","doi":"10.1007/978-3-642-35311-6_4","article_processing_charge":"No","alternative_title":["LNCS"],"type":"conference","date_updated":"2023-02-21T16:28:29Z","_id":"11794","page":"44–57","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1209.6448"}],"external_id":{"arxiv":["1209.6448"]},"related_material":{"record":[{"status":"public","relation":"later_version","id":"11794"}]},"year":"2012","extern":"1","status":"public","publication":"8th International Workshop on Internet and Network Economics","conference":{"name":"WINE: International Conference on Web and Internet Economics","end_date":"2012-12-14","start_date":"2012-12-11","location":"Liverpool, United Kingdom"},"date_published":"2012-12-01T00:00:00Z"},{"month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"R. Colini-Baldeschi, M.H. Henzinger, S. Leonardi, M. Starnberger, in:, 39th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2012, pp. 1–12.","ieee":"R. Colini-Baldeschi, M. H. Henzinger, S. Leonardi, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” in <i>39th International Colloquium on Automata, Languages, and Programming</i>, Warwick, United Kingdom, 2012, vol. 7392, pp. 1–12.","ama":"Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. On multiple keyword sponsored search auctions with budgets. In: <i>39th International Colloquium on Automata, Languages, and Programming</i>. Vol 7392. Springer Nature; 2012:1–12. doi:<a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">10.1007/978-3-642-31585-5_1</a>","mla":"Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.” <i>39th International Colloquium on Automata, Languages, and Programming</i>, vol. 7392, Springer Nature, 2012, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">10.1007/978-3-642-31585-5_1</a>.","apa":"Colini-Baldeschi, R., Henzinger, M. H., Leonardi, S., &#38; Starnberger, M. (2012). On multiple keyword sponsored search auctions with budgets. In <i>39th International Colloquium on Automata, Languages, and Programming</i> (Vol. 7392, pp. 1–12). Warwick, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">https://doi.org/10.1007/978-3-642-31585-5_1</a>","chicago":"Colini-Baldeschi, Riccardo, Monika H Henzinger, Stefano Leonardi, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” In <i>39th International Colloquium on Automata, Languages, and Programming</i>, 7392:1–12. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31585-5_1\">https://doi.org/10.1007/978-3-642-31585-5_1</a>.","ista":"Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. 2012. On multiple keyword sponsored search auctions with budgets. 39th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7392, 1–12."},"language":[{"iso":"eng"}],"date_created":"2022-08-11T11:46:51Z","volume":7392,"oa_version":"None","title":"On multiple keyword sponsored search auctions with budgets","day":"01","scopus_import":"1","author":[{"first_name":"Riccardo","last_name":"Colini-Baldeschi","full_name":"Colini-Baldeschi, Riccardo"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Stefano","full_name":"Leonardi, Stefano","last_name":"Leonardi"},{"first_name":"Martin","full_name":"Starnberger, Martin","last_name":"Starnberger"}],"publication_identifier":{"isbn":["9783642315848"],"issn":["0302-9743"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We study multiple keyword sponsored search auctions with budgets. Each keyword has multiple ad slots with a click-through rate. The bidders have additive valuations, which are linear in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the first mechanism for multiple keywords, where click-through rates differ among slots. Our mechanism is incentive compatible in expectation, individually rational in expectation, and Pareto optimal. (2) We study the combinatorial setting, where each bidder is only interested in a subset of the keywords. We give an incentive compatible, individually rational, Pareto optimal, and deterministic mechanism for identical click-through rates. (3) We give an impossibility result for incentive compatible, individually rational, Pareto optimal, and deterministic mechanisms for bidders with diminishing marginal valuations."}],"intvolume":"      7392","related_material":{"record":[{"id":"11795","status":"public","relation":"later_version"}]},"year":"2012","conference":{"start_date":"2012-07-09","end_date":"2012-07-13","name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Warwick, United Kingdom"},"date_published":"2012-07-01T00:00:00Z","extern":"1","status":"public","publication":"39th International Colloquium on Automata, Languages, and Programming","type":"conference","_id":"11795","date_updated":"2023-02-21T16:28:31Z","publisher":"Springer Nature","alternative_title":["LNCS"],"article_processing_charge":"No","doi":"10.1007/978-3-642-31585-5_1","quality_controlled":"1","page":"1–12"},{"article_processing_charge":"No","day":"27","doi":"10.1103/physrevlett.109.095704","author":[{"last_name":"Goodrich","full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","orcid":"0000-0002-1307-5074"},{"first_name":"Andrea J.","last_name":"Liu","full_name":"Liu, Andrea J."},{"first_name":"Sidney R.","full_name":"Nagel, Sidney R.","last_name":"Nagel"}],"oa_version":"None","publisher":"American Physical Society","title":"Finite-size scaling at the jamming transition","_id":"7776","volume":109,"date_updated":"2021-01-12T08:15:27Z","date_created":"2020-04-30T11:44:12Z","article_type":"original","type":"journal_article","intvolume":"       109","abstract":[{"text":"We present an analysis of finite-size effects in jammed packings of N soft, frictionless spheres at zero temperature. There is a 1/N correction to the discrete jump in the contact number at the transition so that jammed packings exist only above isostaticity. As a result, the canonical power-law scalings of the contact number and elastic moduli break down at low pressure. These quantities exhibit scaling collapse with a nontrivial scaling function, demonstrating that the jamming transition can be considered a phase transition. Scaling is achieved as a function of N in both two and three dimensions, indicating an upper critical dimension of 2.","lang":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0031-9007","1079-7114"]},"quality_controlled":"1","year":"2012","month":"08","article_number":"095704","language":[{"iso":"eng"}],"status":"public","publication":"Physical Review Letters","extern":"1","citation":{"chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Finite-Size Scaling at the Jamming Transition.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/physrevlett.109.095704\">https://doi.org/10.1103/physrevlett.109.095704</a>.","ista":"Goodrich CP, Liu AJ, Nagel SR. 2012. Finite-size scaling at the jamming transition. Physical Review Letters. 109(9), 095704.","apa":"Goodrich, C. P., Liu, A. J., &#38; Nagel, S. R. (2012). Finite-size scaling at the jamming transition. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.109.095704\">https://doi.org/10.1103/physrevlett.109.095704</a>","mla":"Goodrich, Carl Peter, et al. “Finite-Size Scaling at the Jamming Transition.” <i>Physical Review Letters</i>, vol. 109, no. 9, 095704, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/physrevlett.109.095704\">10.1103/physrevlett.109.095704</a>.","ama":"Goodrich CP, Liu AJ, Nagel SR. Finite-size scaling at the jamming transition. <i>Physical Review Letters</i>. 2012;109(9). doi:<a href=\"https://doi.org/10.1103/physrevlett.109.095704\">10.1103/physrevlett.109.095704</a>","ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Finite-size scaling at the jamming transition,” <i>Physical Review Letters</i>, vol. 109, no. 9. American Physical Society, 2012.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 109 (2012)."},"issue":"9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2012-08-27T00:00:00Z"},{"publist_id":"6852","external_id":{"pmid":["23139423"]},"year":"2012","date_published":"2012-12-28T00:00:00Z","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft.","pmid":1,"publication":"Journal of Biological Chemistry","status":"public","extern":"1","type":"journal_article","_id":"801","date_updated":"2022-03-21T07:57:14Z","publisher":"American Society for Biochemistry and Molecular Biology","article_processing_charge":"No","doi":"10.1074/jbc.M112.398321","quality_controlled":"1","page":"44418 - 44424","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Engel, Jakob, et al. “Biosynthesis of the Fungal Cell Wall Polysaccharide Galactomannan Requires Intraluminal GDP-Mannose.” <i>Journal of Biological Chemistry</i>, vol. 287, no. 53, American Society for Biochemistry and Molecular Biology, 2012, pp. 44418–24, doi:<a href=\"https://doi.org/10.1074/jbc.M112.398321\">10.1074/jbc.M112.398321</a>.","apa":"Engel, J., Schmalhorst, P. S., &#38; Routier, F. (2012). Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M112.398321\">https://doi.org/10.1074/jbc.M112.398321</a>","chicago":"Engel, Jakob, Philipp S Schmalhorst, and Françoise Routier. “Biosynthesis of the Fungal Cell Wall Polysaccharide Galactomannan Requires Intraluminal GDP-Mannose.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2012. <a href=\"https://doi.org/10.1074/jbc.M112.398321\">https://doi.org/10.1074/jbc.M112.398321</a>.","ista":"Engel J, Schmalhorst PS, Routier F. 2012. Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose. Journal of Biological Chemistry. 287(53), 44418–44424.","short":"J. Engel, P.S. Schmalhorst, F. Routier, Journal of Biological Chemistry 287 (2012) 44418–44424.","ieee":"J. Engel, P. S. Schmalhorst, and F. Routier, “Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose,” <i>Journal of Biological Chemistry</i>, vol. 287, no. 53. American Society for Biochemistry and Molecular Biology, pp. 44418–44424, 2012.","ama":"Engel J, Schmalhorst PS, Routier F. Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose. <i>Journal of Biological Chemistry</i>. 2012;287(53):44418-44424. doi:<a href=\"https://doi.org/10.1074/jbc.M112.398321\">10.1074/jbc.M112.398321</a>"},"issue":"53","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:48:34Z","article_type":"original","volume":287,"title":"Biosynthesis of the fungal cell wall polysaccharide galactomannan requires intraluminal GDP-mannose","oa_version":"None","day":"28","scopus_import":"1","author":[{"first_name":"Jakob","full_name":"Engel, Jakob","last_name":"Engel"},{"last_name":"Schmalhorst","id":"309D50DA-F248-11E8-B48F-1D18A9856A87","full_name":"Schmalhorst, Philipp S","orcid":"0000-0002-5795-0133","first_name":"Philipp S"},{"full_name":"Routier, Françoise","last_name":"Routier","first_name":"Françoise"}],"publication_status":"published","intvolume":"       287","abstract":[{"text":"Fungal cell walls frequently contain a polymer of mannose and galactose called galactomannan. In the pathogenic filamentous fungus Aspergillus fumigatus, this polysaccharide is made of a linear mannan backbone with side chains of galactofuran and is anchored to the plasma membrane via a glycosylphosphatidylinositol or is covalently linked to the cell wall. To date, the biosynthesis and significance of this polysaccharide are unknown. The present data demonstrate that deletion of the Golgi UDP-galactofuranose transporter GlfB or the GDP-mannose transporter GmtA leads to the absence of galactofuran or galactomannan, respectively. This indicates that the biosynthesis of galactomannan probably occurs in the lumen of the Golgi apparatus and thus contrasts with the biosynthesis of other fungal cell wall polysaccharides studied to date that takes place at the plasma membrane. Transglycosylation of galactomannan from the membrane to the cell wall is hypothesized because both the cell wall-bound and membrane-bound polysaccharide forms are affected in the generated mutants. Considering the severe growth defect of the A. fumigatus GmtA-deficient mutant, proving this paradigm might provide new targets for antifungal therapy.","lang":"eng"}]}]