[{"scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No","article_type":"original","publication":"Logical Methods in Computer Science","citation":{"chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science. International Federation of Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015.","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.","short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015).","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015.","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015"},"date_published":"2015-04-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. "}],"issue":"1","title":"Aspect-oriented linearizability proofs","status":"public","ddc":["000"],"intvolume":" 11","_id":"1832","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","content_type":"application/pdf","file_size":380203,"access_level":"open_access","file_name":"IST-2015-390-v1+1_1502.07639.pdf","checksum":"7370e164d0a731f442424a92669efc34","date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:11:27Z","file_id":"4881","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"390","month":"04","quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"language":[{"iso":"eng"}],"doi":"10.2168/LMCS-11(1:20)2015","article_number":"20","license":"https://creativecommons.org/licenses/by-nd/4.0/","file_date_updated":"2020-07-14T12:45:17Z","ec_funded":1,"publist_id":"5271","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"International Federation of Computational Logic","year":"2015","date_updated":"2023-02-23T10:38:13Z","date_created":"2018-12-11T11:54:15Z","volume":11,"author":[{"full_name":"Chakraborty, Soham","first_name":"Soham","last_name":"Chakraborty"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Sezgin, Ali","first_name":"Ali","last_name":"Sezgin"},{"full_name":"Vafeiadis, Viktor","first_name":"Viktor","last_name":"Vafeiadis"}],"related_material":{"record":[{"id":"2328","relation":"earlier_version","status":"public"}]}},{"language":[{"iso":"eng"}],"doi":"10.1137/130945648","quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1311.4219","open_access":"1"}],"external_id":{"arxiv":["1311.4219"]},"month":"02","volume":44,"date_created":"2018-12-11T11:56:41Z","date_updated":"2023-02-23T10:46:30Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2518"}]},"author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Thapper, Johan","first_name":"Johan","last_name":"Thapper"},{"full_name":"Živný, Stanislav","last_name":"Živný","first_name":"Stanislav"}],"department":[{"_id":"VlKo"}],"publisher":"SIAM","publication_status":"published","year":"2015","publist_id":"4673","date_published":"2015-02-01T00:00:00Z","page":"1 - 36","citation":{"ama":"Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648","ista":"Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.","ieee":"V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.","apa":"Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648","mla":"Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.","short":"V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.","chicago":"Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2015. https://doi.org/10.1137/130945648."},"publication":"SIAM Journal on Computing","day":"01","scopus_import":1,"oa_version":"Preprint","intvolume":" 44","title":"The power of linear programming for general-valued CSPs","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2271","issue":"1","abstract":[{"lang":"eng","text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. "}],"type":"journal_article"},{"year":"2015","_id":"257","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457 and the second author was supported by SwarnaJayanti Fellowship 2011–12, DST, Government of India.","publication_status":"published","title":"Pairs of diagonal quadratic forms and linear correlations among sums of two squares","status":"public","publisher":"Walter de Gruyter GmbH","intvolume":" 27","author":[{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning"},{"first_name":"Ritabrata","last_name":"Munshi","full_name":"Munshi, Ritabrata"}],"date_updated":"2021-01-12T06:58:18Z","date_created":"2018-12-11T11:45:28Z","volume":27,"type":"journal_article","abstract":[{"lang":"eng","text":"For suitable pairs of diagonal quadratic forms in eight variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares."}],"issue":"4","publist_id":"7645","extern":1,"publication":"Forum Mathematicum","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1302.2434"}],"oa":1,"citation":{"short":"T.D. Browning, R. Munshi, Forum Mathematicum 27 (2015) 2025–2050.","mla":"Browning, Timothy D., and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum, vol. 27, no. 4, Walter de Gruyter GmbH, 2015, pp. 2025–50, doi:10.1515/forum-2013-6024.","chicago":"Browning, Timothy D, and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum. Walter de Gruyter GmbH, 2015. https://doi.org/10.1515/forum-2013-6024.","ama":"Browning TD, Munshi R. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 2015;27(4):2025-2050. doi:10.1515/forum-2013-6024","apa":"Browning, T. D., & Munshi, R. (2015). Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. Walter de Gruyter GmbH. https://doi.org/10.1515/forum-2013-6024","ieee":"T. D. Browning and R. Munshi, “Pairs of diagonal quadratic forms and linear correlations among sums of two squares,” Forum Mathematicum, vol. 27, no. 4. Walter de Gruyter GmbH, pp. 2025–2050, 2015.","ista":"Browning TD, Munshi R. 2015. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 27(4), 2025–2050."},"quality_controlled":0,"page":"2025 - 2050","date_published":"2015-07-10T00:00:00Z","doi":"10.1515/forum-2013-6024","day":"10","month":"07"},{"day":"01","month":"08","quality_controlled":"1","page":"89 - 113","publication":"Arithmetic and Geometry","citation":{"apa":"Browning, T. D. (2015). A survey of applications of the circle method to rational points. In Arithmetic and Geometry (pp. 89–113). Cambridge University Press. https://doi.org/10.1017/CBO9781316106877.009","ieee":"T. D. Browning, “A survey of applications of the circle method to rational points,” in Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","ista":"Browning TD. 2015.A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. , 89–113.","ama":"Browning TD. A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. Cambridge University Press; 2015:89-113. doi:10.1017/CBO9781316106877.009","chicago":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” In Arithmetic and Geometry, 89–113. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9781316106877.009.","short":"T.D. Browning, in:, Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","mla":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113, doi:10.1017/CBO9781316106877.009."},"language":[{"iso":"eng"}],"date_published":"2015-08-01T00:00:00Z","doi":"10.1017/CBO9781316106877.009","type":"book_chapter","extern":"1","abstract":[{"lang":"eng","text":"Given a number field k and a projective algebraic variety X defined over k, the question of whether X contains a k-rational point is both very natural and very difficult. In the event that the set X(k) of k-rational points is not empty, one can also ask how the points of X(k) are distributed. Are they dense in X under the Zariski topology? Are they dense in the set."}],"publist_id":"7644","status":"public","publication_status":"published","title":"A survey of applications of the circle method to rational points","publisher":"Cambridge University Press","_id":"258","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:58:22Z","date_created":"2018-12-11T11:45:28Z","oa_version":"None","author":[{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D"}]},{"month":"06","day":"11","date_published":"2015-06-11T00:00:00Z","doi":"10.1007/s00039-015-0328-5","citation":{"mla":"Browning, Timothy D., and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis, vol. 25, no. 3, Birkhäuser, 2015, pp. 671–732, doi:10.1007/s00039-015-0328-5.","short":"T.D. Browning, P. Vishe, Geometric and Functional Analysis 25 (2015) 671–732.","chicago":"Browning, Timothy D, and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis. Birkhäuser, 2015. https://doi.org/10.1007/s00039-015-0328-5.","ama":"Browning TD, Vishe P. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 2015;25(3):671-732. doi:10.1007/s00039-015-0328-5","ista":"Browning TD, Vishe P. 2015. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 25(3), 671–732.","ieee":"T. D. Browning and P. Vishe, “Rational points on cubic hypersurfaces over F_q(t) ,” Geometric and Functional Analysis, vol. 25, no. 3. Birkhäuser, pp. 671–732, 2015.","apa":"Browning, T. D., & Vishe, P. (2015). Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. Birkhäuser. https://doi.org/10.1007/s00039-015-0328-5"},"publication":"Geometric and Functional Analysis","page":"671 - 732","quality_controlled":0,"issue":"3","publist_id":"7643","abstract":[{"lang":"eng","text":"The Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field "}],"extern":1,"type":"journal_article","author":[{"full_name":"Timothy Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","last_name":"Browning"},{"full_name":"Vishe, Pankaj","last_name":"Vishe","first_name":"Pankaj"}],"volume":25,"date_created":"2018-12-11T11:45:29Z","date_updated":"2021-01-12T06:58:25Z","acknowledgement":"EP/J018260/1\tEngineering and Physical Sciences Research Council EPSRC","_id":"259","year":"2015","publisher":"Birkhäuser","intvolume":" 25","publication_status":"published","title":"Rational points on cubic hypersurfaces over F_q(t) ","status":"public"},{"ec_funded":1,"publist_id":"5571","publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2015","acknowledgement":"The research was supported by FWF Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n","volume":573,"date_updated":"2023-02-23T10:55:03Z","date_created":"2018-12-11T11:52:56Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2715"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Joglekar, Manas","first_name":"Manas","last_name":"Joglekar"},{"last_name":"Shah","first_name":"Nisarg","full_name":"Shah, Nisarg"}],"month":"03","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1202.4175","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1202.4175"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2015.01.050","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure winning vertices such that the objective can be ensured with probability 1 from these vertices. We study for the first time the average-case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average-case running time is linear (as compared to the worst-case linear number of iterations and quadratic time complexity). Second, for the average-case analysis over all MDPs we show that the expected number of iterations is constant and the average-case running time is linear (again as compared to the worst-case linear number of iterations and quadratic time complexity). Finally we also show that when all MDPs are equally likely, the probability that the classical algorithm requires more than a constant number of iterations is exponentially small."}],"intvolume":" 573","title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1598","oa_version":"Preprint","scopus_import":1,"article_processing_charge":"No","day":"30","page":"71 - 89","citation":{"ama":"Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050","ista":"Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89.","ieee":"K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.","apa":"Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050","mla":"Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050.","short":"K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.","chicago":"Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050."},"publication":"Theoretical Computer Science","date_published":"2015-03-30T00:00:00Z"},{"month":"06","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1016/j.comgeo.2014.08.010","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"5305","year":"2015","department":[{"_id":"HeEd"}],"publisher":"Elsevier","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2812"}]},"author":[{"full_name":"Attali, Dominique","last_name":"Attali","first_name":"Dominique"},{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich"},{"first_name":"Olivier","last_name":"Devillers","full_name":"Devillers, Olivier"},{"last_name":"Glisse","first_name":"Marc","full_name":"Glisse, Marc"},{"full_name":"Lieutier, André","first_name":"André","last_name":"Lieutier"}],"volume":48,"date_updated":"2023-02-23T10:59:19Z","date_created":"2018-12-11T11:54:06Z","scopus_import":1,"day":"03","citation":{"apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2015). Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.010","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” Computational Geometry: Theory and Applications, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.","ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 48(8), 606–621.","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 2015;48(8):606-621. doi:10.1016/j.comgeo.2014.08.010","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.010.","short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621.","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications, vol. 48, no. 8, Elsevier, 2015, pp. 606–21, doi:10.1016/j.comgeo.2014.08.010."},"publication":"Computational Geometry: Theory and Applications","page":"606 - 621","date_published":"2015-06-03T00:00:00Z","type":"journal_article","issue":"8","abstract":[{"text":"We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1805","intvolume":" 48","title":"Homological reconstruction and simplification in R3","status":"public","oa_version":"None"},{"type":"journal_article","extern":"1","issue":"21","publist_id":"7507","abstract":[{"lang":"eng","text":"We present a hybrid intercalation battery based on a sodium/magnesium (Na/Mg) dual salt electrolyte, metallic magnesium anode, and a cathode based on FeS2 nanocrystals (NCs). Compared to lithium or sodium, metallic magnesium anode is safer due to dendrite-free electroplating and offers extremely high volumetric (3833 mAh cm-3) and gravimetric capacities (2205 mAh g-1). Na-ion cathodes, FeS2 NCs in the present study, may serve as attractive alternatives to Mg-ion cathodes due to the higher voltage of operation and fast, highly reversible insertion of Na-ions. In this proof-of-concept study, electrochemical cycling of the Na/Mg hybrid battery was characterized by high rate capability, high Coulombic efficiency of 99.8%, and high energy density. In particular, with an average discharge voltage of ∼1.1 V and a cathodic capacity of 189 mAh g-1 at a current of 200 mA g-1, the presented Mg/FeS2 hybrid battery delivers energy densities of up to 210 Wh kg-1, comparable to commercial Li-ion batteries and approximately twice as high as state-of-the-art Mg-ion batteries based on Mo6S8 cathodes. Further significant gains in the energy density are expected from the development of Na/Mg electrolytes with a broader electrochemical stability window. Fully based on Earth-abundant elements, hybrid Na-Mg batteries are highly promising for large-scale stationary energy storage. "}],"intvolume":" 27","publisher":"ACS","status":"public","title":"Efficient and inexpensive sodium magnesium hybrid battery","publication_status":"published","_id":"333","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","volume":27,"oa_version":"None","date_updated":"2021-01-12T07:42:42Z","date_created":"2018-12-11T11:45:52Z","author":[{"first_name":"Marc","last_name":"Walter","full_name":"Walter, Marc"},{"first_name":"Kostiantyn","last_name":"Kravchyk","full_name":"Kravchyk, Kostiantyn"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria"},{"full_name":"Kovalenko, Maksym","last_name":"Kovalenko","first_name":"Maksym"}],"article_processing_charge":"No","month":"10","day":"16","page":"7452 - 7458","quality_controlled":"1","article_type":"original","citation":{"ama":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 2015;27(21):7452-7458. doi:10.1021/acs.chemmater.5b03531","ieee":"M. Walter, K. Kravchyk, M. Ibáñez, and M. Kovalenko, “Efficient and inexpensive sodium magnesium hybrid battery,” Chemistry of Materials, vol. 27, no. 21. ACS, pp. 7452–7458, 2015.","apa":"Walter, M., Kravchyk, K., Ibáñez, M., & Kovalenko, M. (2015). Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. ACS. https://doi.org/10.1021/acs.chemmater.5b03531","ista":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. 2015. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 27(21), 7452–7458.","short":"M. Walter, K. Kravchyk, M. Ibáñez, M. Kovalenko, Chemistry of Materials 27 (2015) 7452–7458.","mla":"Walter, Marc, et al. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials, vol. 27, no. 21, ACS, 2015, pp. 7452–58, doi:10.1021/acs.chemmater.5b03531.","chicago":"Walter, Marc, Kostiantyn Kravchyk, Maria Ibáñez, and Maksym Kovalenko. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials. ACS, 2015. https://doi.org/10.1021/acs.chemmater.5b03531."},"publication":"Chemistry of Materials","language":[{"iso":"eng"}],"doi":"10.1021/acs.chemmater.5b03531","date_published":"2015-10-16T00:00:00Z"},{"status":"public","publication_status":"published","title":"Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement","intvolume":" 137","publisher":"American Chemical Society","year":"2015","_id":"354","acknowledgement":"At IREC, work was supported by European Regional Development Funds and the Framework 7 program under project UNION (FP7-NMP 310250). M.I. and S.O. thank AGAUR for their Beatriu i Pinós postdoctoral grant and the PhD grant, respectively. At Northwestern, work was supported by the Revolutionary Materials for Solid State Energy Conversion, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, and Office of Basic Energy Sciences under Award Number DE-SC0001054.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:44:10Z","date_created":"2018-12-11T11:45:59Z","oa_version":"None","volume":137,"author":[{"full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843"},{"last_name":"Korkosz","first_name":"Rachel","full_name":"Korkosz, Rachel"},{"first_name":"Zhishan","last_name":"Luo","full_name":"Luo, Zhishan"},{"full_name":"Riba, Pau","last_name":"Riba","first_name":"Pau"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"full_name":"Ortega, Silvia","last_name":"Ortega","first_name":"Silvia"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"},{"last_name":"Kanatzidis","first_name":"Mercouri","full_name":"Kanatzidis, Mercouri"}],"type":"journal_article","extern":"1","abstract":[{"text":"A simple and effective method to introduce precise amounts of doping in nanomaterials produced from the bottom-up assembly of colloidal nanoparticles (NPs) is described. The procedure takes advantage of a ligand displacement step to incorporate controlled concentrations of halide ions while removing carboxylic acids from the NP surface. Upon consolidation of the NPs into dense pellets, halide ions diffuse within the crystal structure, doping the anion sublattice and achieving n-type electrical doping. Through the characterization of the thermoelectric properties of nanocrystalline PbS, we demonstrate this strategy to be effective to control charge transport properties on thermoelectric nanomaterials assembled from NP building blocks. This approach is subsequently extended to PbTexSe1-x@PbS core-shell NPs, where a significant enhancement of the thermoelectric figure of merit is achieved. ","lang":"eng"}],"issue":"12","publist_id":"7470","quality_controlled":"1","article_type":"original","page":"4046 - 4049","publication":"Journal of the American Chemical Society","citation":{"ista":"Ibáñez M, Korkosz R, Luo Z, Riba P, Cadavid D, Ortega S, Cabot A, Kanatzidis M. 2015. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 137(12), 4046–4049.","ieee":"M. Ibáñez et al., “Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement,” Journal of the American Chemical Society, vol. 137, no. 12. American Chemical Society, pp. 4046–4049, 2015.","apa":"Ibáñez, M., Korkosz, R., Luo, Z., Riba, P., Cadavid, D., Ortega, S., … Kanatzidis, M. (2015). Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.5b00091","ama":"Ibáñez M, Korkosz R, Luo Z, et al. Electron doping in bottom up engineered thermoelectric nanomaterials through HCl mediated ligand displacement. Journal of the American Chemical Society. 2015;137(12):4046-4049. doi:10.1021/jacs.5b00091","chicago":"Ibáñez, Maria, Rachel Korkosz, Zhishan Luo, Pau Riba, Doris Cadavid, Silvia Ortega, Andreu Cabot, and Mercouri Kanatzidis. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” Journal of the American Chemical Society. American Chemical Society, 2015. https://doi.org/10.1021/jacs.5b00091.","mla":"Ibáñez, Maria, et al. “Electron Doping in Bottom up Engineered Thermoelectric Nanomaterials through HCl Mediated Ligand Displacement.” Journal of the American Chemical Society, vol. 137, no. 12, American Chemical Society, 2015, pp. 4046–49, doi:10.1021/jacs.5b00091.","short":"M. Ibáñez, R. Korkosz, Z. Luo, P. Riba, D. Cadavid, S. Ortega, A. Cabot, M. Kanatzidis, Journal of the American Chemical Society 137 (2015) 4046–4049."},"language":[{"iso":"eng"}],"doi":"10.1021/jacs.5b00091","date_published":"2015-03-11T00:00:00Z","day":"11","month":"03","article_processing_charge":"No"},{"abstract":[{"lang":"eng","text":"A cation exchange-based route was used to produce Cu2ZnSnS4 (CZTS)-Ag2S nanoparticles with controlled composition. We report a detailed study of the formation of such CZTS-Ag2S nanoheterostructures and of their photocatalytic properties. When compared to pure CZTS, the use of nanoscale p-n heterostructures as light absorbers for photocatalytic water splitting provides superior photocurrents. We associate this experimental fact to a higher separation efficiency of the photogenerated electron-hole pairs. We believe this and other type-II nanoheterostructures will open the door to the use of CZTS, with excellent light absorption properties and made of abundant and environmental friendly elements, to the field of photocatalysis. "}],"issue":"38","publist_id":"7467","extern":"1","type":"journal_article","author":[{"last_name":"Yu","first_name":"Xuelian","full_name":"Yu, Xuelian"},{"first_name":"Jingjing","last_name":"Liu","full_name":"Liu, Jingjing"},{"last_name":"Genç","first_name":"Aziz","full_name":"Genç, Aziz"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"full_name":"Luo, Zhishan","first_name":"Zhishan","last_name":"Luo"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Zhang","first_name":"Guangjin","full_name":"Zhang, Guangjin"},{"first_name":"Yihe","last_name":"Zhang","full_name":"Zhang, Yihe"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"date_created":"2018-12-11T11:46:01Z","date_updated":"2021-01-12T07:44:34Z","volume":31,"oa_version":"None","_id":"360","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","title":"Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting","status":"public","publication_status":"published","publisher":"American Chemical Society","intvolume":" 31","month":"09","day":"29","article_processing_charge":"No","date_published":"2015-09-29T00:00:00Z","doi":"10.1021/acs.langmuir.5b02490","language":[{"iso":"eng"}],"publication":"Langmuir","citation":{"apa":"Yu, X., Liu, J., Genç, A., Ibáñez, M., Luo, Z., Shavel, A., … Cabot, A. (2015). Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. American Chemical Society. https://doi.org/10.1021/acs.langmuir.5b02490","ieee":"X. Yu et al., “Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting,” Langmuir, vol. 31, no. 38. American Chemical Society, pp. 10555–10561, 2015.","ista":"Yu X, Liu J, Genç A, Ibáñez M, Luo Z, Shavel A, Arbiol J, Zhang G, Zhang Y, Cabot A. 2015. Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 31(38), 10555–10561.","ama":"Yu X, Liu J, Genç A, et al. Cu2ZnSnS4-Ag2S nanoscale p-n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 2015;31(38):10555-10561. doi:10.1021/acs.langmuir.5b02490","chicago":"Yu, Xuelian, Jingjing Liu, Aziz Genç, Maria Ibáñez, Zhishan Luo, Alexey Shavel, Jordi Arbiol, Guangjin Zhang, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4-Ag2S Nanoscale p-n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/acs.langmuir.5b02490.","short":"X. Yu, J. Liu, A. Genç, M. Ibáñez, Z. Luo, A. Shavel, J. Arbiol, G. Zhang, Y. Zhang, A. Cabot, Langmuir 31 (2015) 10555–10561.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4-Ag2S Nanoscale p-n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir, vol. 31, no. 38, American Chemical Society, 2015, pp. 10555–61, doi:10.1021/acs.langmuir.5b02490."},"page":"10555 - 10561"},{"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"Monodisperse Pd2Sn nanorods with tuned size and aspect ratio were prepared by co-reduction of metal salts in the presence of trioctylphosphine, amine, and chloride ions. Asymmetric Pd2Sn nanostructures were achieved by the selective desorption of a surfactant mediated by chlorine ions. A preliminary evaluation of the geometry influence on catalytic properties evidenced Pd2Sn nanorods to have improved catalytic performance. In view of these results, Pd2Sn nanorods were also evaluated for water denitration. "}],"issue":"13","publist_id":"7469","status":"public","publication_status":"published","title":"Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties","intvolume":" 31","publisher":"American Chemical Society","_id":"362","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","date_created":"2018-12-11T11:46:02Z","date_updated":"2021-01-12T07:44:42Z","oa_version":"None","volume":31,"author":[{"full_name":"Lu, Zhishan","first_name":"Zhishan","last_name":"Lu"},{"full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843"},{"last_name":"Antolín","first_name":"Ana","full_name":"Antolín, Ana"},{"full_name":"Genç, Aziz","last_name":"Genç","first_name":"Aziz"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"last_name":"Contreras","first_name":"Sandra","full_name":"Contreras, Sandra"},{"full_name":"Medina, Francesc","last_name":"Medina","first_name":"Francesc"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"day":"07","month":"04","article_processing_charge":"No","page":"3952 - 3957","publication":"Langmuir","citation":{"ama":"Lu Z, Ibáñez M, Antolín A, et al. Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. 2015;31(13):3952-3957. doi:10.1021/la504906q","ieee":"Z. Lu et al., “Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties,” Langmuir, vol. 31, no. 13. American Chemical Society, pp. 3952–3957, 2015.","apa":"Lu, Z., Ibáñez, M., Antolín, A., Genç, A., Shavel, A., Contreras, S., … Cabot, A. (2015). Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. American Chemical Society. https://doi.org/10.1021/la504906q","ista":"Lu Z, Ibáñez M, Antolín A, Genç A, Shavel A, Contreras S, Medina F, Arbiol J, Cabot A. 2015. Size and aspect ratio control of Pd inf 2 inf Sn nanorods and their water denitration properties. Langmuir. 31(13), 3952–3957.","short":"Z. Lu, M. Ibáñez, A. Antolín, A. Genç, A. Shavel, S. Contreras, F. Medina, J. Arbiol, A. Cabot, Langmuir 31 (2015) 3952–3957.","mla":"Lu, Zhishan, et al. “Size and Aspect Ratio Control of Pd Inf 2 Inf Sn Nanorods and Their Water Denitration Properties.” Langmuir, vol. 31, no. 13, American Chemical Society, 2015, pp. 3952–57, doi:10.1021/la504906q.","chicago":"Lu, Zhishan, Maria Ibáñez, Ana Antolín, Aziz Genç, Alexey Shavel, Sandra Contreras, Francesc Medina, Jordi Arbiol, and Andreu Cabot. “Size and Aspect Ratio Control of Pd Inf 2 Inf Sn Nanorods and Their Water Denitration Properties.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/la504906q."},"language":[{"iso":"eng"}],"doi":"10.1021/la504906q","date_published":"2015-04-07T00:00:00Z"},{"intvolume":" 245","title":"Randomness for free","status":"public","_id":"1731","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. "}],"page":"3 - 16","citation":{"ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. Information and Computation. 2015;245(12):3-16. doi:10.1016/j.ic.2015.06.003","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.06.003","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” Information and Computation, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003."},"publication":"Information and Computation","date_published":"2015-12-01T00:00:00Z","scopus_import":1,"day":"01","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","year":"2015","volume":245,"date_created":"2018-12-11T11:53:42Z","date_updated":"2023-02-23T11:45:42Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3856"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","first_name":"Hugo","last_name":"Gimbert"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"publist_id":"5395","ec_funded":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.0673"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2015.06.003","month":"12"},{"publication":"Langmuir","citation":{"chicago":"Yu, Xuelian, Jingjing Liu, Aziz Genç, Maria Ibáñez, Zhishan Luo, Alexey Shavel, Jordi Arbiol, Guangjin Zhang, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4–Ag2S Nanoscale p–n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir. American Chemical Society, 2015. https://doi.org/10.1021/acs.langmuir.5b02490.","short":"X. Yu, J. Liu, A. Genç, M. Ibáñez, Z. Luo, A. Shavel, J. Arbiol, G. Zhang, Y. Zhang, A. Cabot, Langmuir 31 (2015) 10555–10561.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4–Ag2S Nanoscale p–n Heterostructures as Sensitizers for Photoelectrochemical Water Splitting.” Langmuir, vol. 31, no. 38, American Chemical Society, 2015, pp. 10555–61, doi:10.1021/acs.langmuir.5b02490.","ieee":"X. Yu et al., “Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting,” Langmuir, vol. 31, no. 38. American Chemical Society, pp. 10555–10561, 2015.","apa":"Yu, X., Liu, J., Genç, A., Ibáñez, M., Luo, Z., Shavel, A., … Cabot, A. (2015). Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. American Chemical Society. https://doi.org/10.1021/acs.langmuir.5b02490","ista":"Yu X, Liu J, Genç A, Ibáñez M, Luo Z, Shavel A, Arbiol J, Zhang G, Zhang Y, Cabot A. 2015. Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 31(38), 10555–10561.","ama":"Yu X, Liu J, Genç A, et al. Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting. Langmuir. 2015;31(38):10555-10561. doi:10.1021/acs.langmuir.5b02490"},"quality_controlled":"1","article_type":"original","page":"10555 - 10561","date_published":"2015-09-07T00:00:00Z","doi":"10.1021/acs.langmuir.5b02490","language":[{"iso":"eng"}],"day":"07","month":"09","article_processing_charge":"No","_id":"334","year":"2015","acknowledgement":"This work was supported by the European Regional Development Funds, the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486), the Spanish MINECO under Contract ENE2013-46624-C4-3-R and Fundamental Research Funds for the Central Universities (2652015086). Authors acknowledge the funding from Generalitat de Catalunya 2014 SGR 1638.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Cu2ZnSnS4–Ag2S Nanoscale p–n heterostructures as sensitizers for photoelectrochemical water splitting","intvolume":" 31","publisher":"American Chemical Society","author":[{"first_name":"Xuelian","last_name":"Yu","full_name":"Yu, Xuelian"},{"full_name":"Liu, Jingjing","first_name":"Jingjing","last_name":"Liu"},{"first_name":"Aziz","last_name":"Genç","full_name":"Genç, Aziz"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria"},{"last_name":"Luo","first_name":"Zhishan","full_name":"Luo, Zhishan"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"last_name":"Zhang","first_name":"Guangjin","full_name":"Zhang, Guangjin"},{"first_name":"Yihe","last_name":"Zhang","full_name":"Zhang, Yihe"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"date_updated":"2021-01-12T07:42:46Z","date_created":"2018-12-11T11:45:52Z","oa_version":"None","volume":31,"type":"journal_article","abstract":[{"text":"A cation exchange-based route was used to produce Cu2ZnSnS4 (CZTS)-Ag2S nanoparticles with controlled composition. We report a detailed study of the formation of such CZTS-Ag2S nanoheterostructures and of their photocatalytic properties. When compared to pure CZTS, the use of nanoscale p-n heterostructures as light absorbers for photocatalytic water splitting provides superior photocurrents. We associate this experimental fact to a higher separation efficiency of the photogenerated electron-hole pairs. We believe this and other type-II nanoheterostructures will open the door to the use of CZTS, with excellent light absorption properties and made of abundant and environmental friendly elements, to the field of photocatalysis.","lang":"eng"}],"issue":"38","publist_id":"7508","extern":"1"},{"article_processing_charge":"No","day":"26","month":"08","page":"21882 - 21888","citation":{"short":"X. Yu, X. An, A. Genç, M. Ibáñez, J. Arbiol, Y. Zhang, A. Cabot, Journal of Physical Chemistry C 119 (2015) 21882–21888.","mla":"Yu, Xuelian, et al. “Cu2ZnSnS4–PtM (M = Co, Ni) Nanoheterostructures for Photocatalytic Hydrogen Evolution.” Journal of Physical Chemistry C, vol. 119, no. 38, American Chemical Society, 2015, pp. 21882–88, doi:10.1021/acs.jpcc.5b06199.","chicago":"Yu, Xuelian, Xiaoqiang An, Aziz Genç, Maria Ibáñez, Jordi Arbiol, Yihe Zhang, and Andreu Cabot. “Cu2ZnSnS4–PtM (M = Co, Ni) Nanoheterostructures for Photocatalytic Hydrogen Evolution.” Journal of Physical Chemistry C. American Chemical Society, 2015. https://doi.org/10.1021/acs.jpcc.5b06199.","ama":"Yu X, An X, Genç A, et al. Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. 2015;119(38):21882-21888. doi:10.1021/acs.jpcc.5b06199","ieee":"X. Yu et al., “Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution,” Journal of Physical Chemistry C, vol. 119, no. 38. American Chemical Society, pp. 21882–21888, 2015.","apa":"Yu, X., An, X., Genç, A., Ibáñez, M., Arbiol, J., Zhang, Y., & Cabot, A. (2015). Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. American Chemical Society. https://doi.org/10.1021/acs.jpcc.5b06199","ista":"Yu X, An X, Genç A, Ibáñez M, Arbiol J, Zhang Y, Cabot A. 2015. Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution. Journal of Physical Chemistry C. 119(38), 21882–21888."},"publication":"Journal of Physical Chemistry C","language":[{"iso":"eng"}],"doi":"10.1021/acs.jpcc.5b06199","date_published":"2015-08-26T00:00:00Z","type":"journal_article","extern":"1","publist_id":"7468","issue":"38","abstract":[{"text":"We report the synthesis and photocatalytic and magnetic characterization of colloidal nanoheterostructures formed by combining a Pt-based magnetic metal alloy (PtCo, PtNi) with Cu2ZnSnS4 (CZTS). While CZTS is one of the main candidate materials for solar energy conversion, the introduction of a Pt-based alloy on its surface strongly influences its chemical and electronic properties, ultimately determining its functionality. In this regard, up to a 15-fold increase of the photocatalytic hydrogen evolution activity was obtained with CZTS–PtCo when compared with CZTS. Furthermore, two times higher hydrogen evolution rates were obtained for CZTS–PtCo when compared with CZTS–Pt, in spite of the lower precious metal loading of the former. Besides, the magnetic properties of the PtCo nanoparticles attached to the CZTS nanocrystals were retained in the heterostructures, which could facilitate catalyst purification and recovery for its posterior recycling and/or reutilization.","lang":"eng"}],"publisher":"American Chemical Society","intvolume":" 119","status":"public","publication_status":"published","title":"Cu2ZnSnS4–PtM (M = Co, Ni) nanoheterostructures for photocatalytic hydrogen evolution","year":"2015","_id":"361","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the National Natural Science Foundation of China (Grant 21401212), Fundamental Research Funds for the Central Universities (2652015086), the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486), and the MICINN project ENE2013-46624-C4-3-R. Authors acknowledge the funding from Generalitat de Catalunya 2014 SGR 1638.","volume":119,"oa_version":"None","date_updated":"2021-01-12T07:44:38Z","date_created":"2018-12-11T11:46:01Z","author":[{"full_name":"Yu, Xuelian","first_name":"Xuelian","last_name":"Yu"},{"first_name":"Xiaoqiang","last_name":"An","full_name":"An, Xiaoqiang"},{"full_name":"Genç, Aziz","first_name":"Aziz","last_name":"Genç"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"last_name":"Zhang","first_name":"Yihe","full_name":"Zhang, Yihe"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}]},{"month":"02","language":[{"iso":"eng"}],"doi":"10.1145/2699430","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1004.0739"}],"publist_id":"5244","ec_funded":1,"article_number":"9","volume":62,"date_created":"2018-12-11T11:54:23Z","date_updated":"2023-02-23T11:46:04Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3864"}]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","year":"2015","day":"01","scopus_import":1,"date_published":"2015-02-01T00:00:00Z","citation":{"apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM. https://doi.org/10.1145/2699430","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 2015;62(1). doi:10.1145/2699430","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2699430.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).","mla":"Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430."},"publication":"Journal of the ACM","issue":"1","abstract":[{"text":"The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ε-optimal strategy with a bounded counter, for all ε > 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 62","status":"public","title":"Measuring and synthesizing systems in probabilistic environments","_id":"1856","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"date_published":"2015-07-07T00:00:00Z","doi":"10.1103/PhysRevLett.114.017203","quality_controlled":"1","article_type":"original","oa":1,"citation":{"ama":"Alpichshev Z, Mahmood F, Cao G, Gedik N. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 2015;114(1). doi:10.1103/PhysRevLett.114.017203","ista":"Alpichshev Z, Mahmood F, Cao G, Gedik N. 2015. Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. 114(1).","apa":"Alpichshev, Z., Mahmood, F., Cao, G., & Gedik, N. (2015). Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.017203","ieee":"Z. Alpichshev, F. Mahmood, G. Cao, and N. Gedik, “Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3,” Physical Review Letters, vol. 114, no. 1. American Physical Society, 2015.","mla":"Alpichshev, Zhanybek, et al. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” Physical Review Letters, vol. 114, no. 1, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.017203.","short":"Z. Alpichshev, F. Mahmood, G. Cao, N. Gedik, Physical Review Letters 114 (2015).","chicago":"Alpichshev, Zhanybek, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Confinement Deconfinement Transition as an Indication of Spin Liquid Type Behavior in Na2IrO3.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.017203."},"main_file_link":[{"url":"https://dspace.mit.edu/handle/1721.1/92979","open_access":"1"}],"publication":"Physical Review Letters","article_processing_charge":"No","month":"07","day":"07","oa_version":"Published Version","volume":114,"date_updated":"2021-01-12T07:52:54Z","date_created":"2018-12-11T11:46:11Z","author":[{"full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek"},{"first_name":"Fahad","last_name":"Mahmood","full_name":"Mahmood, Fahad"},{"full_name":"Cao, Gang","first_name":"Gang","last_name":"Cao"},{"first_name":"Nuh","last_name":"Gedik","full_name":"Gedik, Nuh"}],"publisher":"American Physical Society","intvolume":" 114","title":"Confinement deconfinement transition as an indication of spin liquid type behavior in Na2IrO3","publication_status":"published","status":"public","_id":"388","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","extern":"1","issue":"1","publist_id":"7441","abstract":[{"text":"We use ultrafast optical spectroscopy to observe binding of charged single-particle excitations (SE) in the magnetically frustrated Mott insulator Na2IrO3. Above the antiferromagnetic ordering temperature (TN) the system response is due to both Hubbard excitons (HE) and their constituent unpaired SE. The SE response becomes strongly suppressed immediately below TN. We argue that this increase in binding energy is due to a unique interplay between the frustrated Kitaev and the weak Heisenberg-type ordering term in the Hamiltonian, mediating an effective interaction between the spin-singlet SE. This interaction grows with distance causing the SE to become trapped in the HE, similar to quark confinement inside hadrons. This binding of charged particles, induced by magnetic ordering, is a result of a confinement-deconfinement transition of spin excitations. This observation provides evidence for spin liquid type behavior which is expected in Na2IrO3.","lang":"eng"}],"type":"journal_article"},{"publication":"Proceedings - Symposium on Logic in Computer Science","citation":{"short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888."},"date_published":"2015-07-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","status":"public","title":"Improved algorithms for one-pair and k-pair Streett objectives","_id":"1661","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Submitted Version","type":"conference","abstract":[{"text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/4368/"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2015-07-10","location":"Kyoto, Japan","start_date":"2015-07-06","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2015.34","month":"07","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrCh"}],"year":"2015","acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","date_created":"2018-12-11T11:53:19Z","date_updated":"2023-02-23T12:20:05Z","volume":"2015-July","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"464"}]},"article_number":"7174888","ec_funded":1,"publist_id":"5489"},{"scopus_import":1,"has_accepted_license":"1","day":"01","page":"65 - 115","citation":{"ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","apa":"Lewin, M., Nam, P., & Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique. https://doi.org/10.5802/jep.18","ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.","ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2015;2:65-115. doi:10.5802/jep.18","chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique, 2015. https://doi.org/10.5802/jep.18.","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:10.5802/jep.18.","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115."},"publication":"Journal de l'Ecole Polytechnique - Mathematiques","date_published":"2015-01-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2.","lang":"eng"}],"intvolume":" 2","title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","ddc":["539"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"473","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"4974","checksum":"a40eb4016717ddc9927154798a4c164a","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:12:53Z","access_level":"open_access","file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","file_size":1084254,"content_type":"application/pdf","creator":"system"}],"pubrep_id":"951","month":"01","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"language":[{"iso":"eng"}],"doi":"10.5802/jep.18","publist_id":"7344","ec_funded":1,"file_date_updated":"2020-07-14T12:46:35Z","publisher":"Ecole Polytechnique","department":[{"_id":"RoSe"}],"publication_status":"published","year":"2015","volume":2,"date_updated":"2021-01-12T08:00:52Z","date_created":"2018-12-11T11:46:40Z","author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"full_name":"Phan Thanh, Nam","last_name":"Phan Thanh","first_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rougerie, Nicolas","first_name":"Nicolas","last_name":"Rougerie"}]},{"scopus_import":1,"month":"06","day":"15","quality_controlled":"1","page":"2866 - 2880","publication":"Journal of Cell Science","citation":{"apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.167999","ieee":"K. Holst et al., “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” Journal of Cell Science, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 2015;128(15):2866-2880. doi:10.1242/jcs.167999","chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” Journal of Cell Science. Company of Biologists, 2015. https://doi.org/10.1242/jcs.167999.","short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” Journal of Cell Science, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:10.1242/jcs.167999."},"language":[{"iso":"eng"}],"doi":"10.1242/jcs.167999","date_published":"2015-06-15T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders."}],"issue":"15","publist_id":"7343","publication_status":"published","title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","status":"public","publisher":"Company of Biologists","department":[{"_id":"MiSi"}],"intvolume":" 128","_id":"477","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:41Z","date_updated":"2021-01-12T08:00:54Z","volume":128,"oa_version":"None","author":[{"last_name":"Holst","first_name":"Katrin","full_name":"Holst, Katrin"},{"last_name":"Guseva","first_name":"Daria","full_name":"Guseva, Daria"},{"last_name":"Schindler","first_name":"Susann","full_name":"Schindler, Susann"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Armin","last_name":"Braun","full_name":"Braun, Armin"},{"last_name":"Chopra","first_name":"Himpriya","full_name":"Chopra, Himpriya"},{"full_name":"Pabst, Oliver","last_name":"Pabst","first_name":"Oliver"},{"first_name":"Evgeni","last_name":"Ponimaskin","full_name":"Ponimaskin, Evgeni"}]},{"issue":"6","abstract":[{"text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"523","intvolume":" 242","status":"public","title":"Looking at mean-payoff and total-payoff through windows","day":"24","scopus_import":1,"date_published":"2015-03-24T00:00:00Z","citation":{"ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","apa":"Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.010","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. Information and Computation. 2015;242(6):25-52. doi:10.1016/j.ic.2015.03.010","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.","mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:10.1016/j.ic.2015.03.010.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52."},"publication":"Information and Computation","page":"25 - 52","ec_funded":1,"publist_id":"7296","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2279"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"volume":242,"date_created":"2018-12-11T11:46:57Z","date_updated":"2023-02-23T10:36:02Z","year":"2015","publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","month":"03","doi":"10.1016/j.ic.2015.03.010","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1302.4248","open_access":"1"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1"}]