[{"quality_controlled":"1","page":"329 - 344","day":"01","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7"}],"type":"conference","date_published":"2014-01-01T00:00:00Z","publisher":"Springer","month":"01","publist_id":"5006","status":"public","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"title":"Enhanced chosen-ciphertext security and applications","publication_status":"published","oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"url":"https://eprint.iacr.org/2012/543","open_access":"1"}],"doi":"10.1007/978-3-642-54631-0_19","acknowledgement":"The second author was supported by EPSRC grant EP/H043454/1.","conference":{"start_date":"2014-03-26","end_date":"2014-03-28","location":"Buenos Aires, Argentina","name":"PKC: Public Key Crypography"},"editor":[{"first_name":"Hugo","last_name":"Krawczyk","full_name":"Krawczyk, Hugo"}],"date_created":"2018-12-11T11:55:24Z","_id":"2045","citation":{"ama":"Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. Enhanced chosen-ciphertext security and applications. In: Krawczyk H, ed. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8383. Springer; 2014:329-344. doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">10.1007/978-3-642-54631-0_19</a>","ieee":"D. Dachman Soled, G. Fuchsbauer, P. Mohassel, and A. O’Neill, “Enhanced chosen-ciphertext security and applications,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Buenos Aires, Argentina, 2014, vol. 8383, pp. 329–344.","ista":"Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. 2014. Enhanced chosen-ciphertext security and applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol. 8383, 329–344.","chicago":"Dachman Soled, Dana, Georg Fuchsbauer, Payman Mohassel, and Adam O’Neill. “Enhanced Chosen-Ciphertext Security and Applications.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, 8383:329–44. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">https://doi.org/10.1007/978-3-642-54631-0_19</a>.","apa":"Dachman Soled, D., Fuchsbauer, G., Mohassel, P., &#38; O’Neill, A. (2014). Enhanced chosen-ciphertext security and applications. In H. Krawczyk (Ed.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8383, pp. 329–344). Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">https://doi.org/10.1007/978-3-642-54631-0_19</a>","short":"D. Dachman Soled, G. Fuchsbauer, P. Mohassel, A. O’Neill, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 329–344.","mla":"Dachman Soled, Dana, et al. “Enhanced Chosen-Ciphertext Security and Applications.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 329–44, doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_19\">10.1007/978-3-642-54631-0_19</a>."},"year":"2014","abstract":[{"text":"We introduce and study a new notion of enhanced chosen-ciphertext security (ECCA) for public-key encryption. Loosely speaking, in the ECCA security experiment, the decryption oracle provided to the adversary is augmented to return not only the output of the decryption algorithm on a queried ciphertext but also of a randomness-recovery algorithm associated to the scheme. Our results mainly concern the case where the randomness-recovery algorithm is efficient. We provide constructions of ECCA-secure encryption from adaptive trapdoor functions as defined by Kiltz et al. (EUROCRYPT 2010), resulting in ECCA encryption from standard number-theoretic assumptions. We then give two applications of ECCA-secure encryption: (1) We use it as a unifying concept in showing equivalence of adaptive trapdoor functions and tag-based adaptive trapdoor functions, resolving an open question of Kiltz et al. (2) We show that ECCA-secure encryption can be used to securely realize an approach to public-key encryption with non-interactive opening (PKENO) originally suggested by Damgård and Thorbek (EUROCRYPT 2007), resulting in new and practical PKENO schemes quite different from those in prior work. Our results demonstrate that ECCA security is of both practical and theoretical interest.","lang":"eng"}],"volume":8383,"oa":1,"author":[{"full_name":"Dachman Soled, Dana","last_name":"Dachman Soled","first_name":"Dana"},{"first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"last_name":"Mohassel","first_name":"Payman","full_name":"Mohassel, Payman"},{"full_name":"O’Neill, Adam","last_name":"O’Neill","first_name":"Adam"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T06:54:57Z","ec_funded":1,"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","intvolume":"      8383"},{"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publist_id":"5005","status":"public","month":"01","publisher":"Springer","type":"conference","date_published":"2014-01-01T00:00:00Z","project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668"}],"day":"01","page":"520 - 537","quality_controlled":"1","intvolume":"      8383","ec_funded":1,"date_updated":"2021-01-12T06:54:57Z","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","department":[{"_id":"KrPi"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Mihir","last_name":"Bellare","full_name":"Bellare, Mihir"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"}],"volume":8383,"oa":1,"abstract":[{"text":"We introduce policy-based signatures (PBS), where a signer can only sign messages conforming to some authority-specified policy. The main requirements are unforgeability and privacy, the latter meaning that signatures not reveal the policy. PBS offers value along two fronts: (1) On the practical side, they allow a corporation to control what messages its employees can sign under the corporate key. (2) On the theoretical side, they unify existing work, capturing other forms of signatures as special cases or allowing them to be easily built. Our work focuses on definitions of PBS, proofs that this challenging primitive is realizable for arbitrary policies, efficient constructions for specific policies, and a few representative applications.","lang":"eng"}],"citation":{"ama":"Bellare M, Fuchsbauer G. Policy-based signatures. In: Krawczyk H, ed. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8383. Springer; 2014:520-537. doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">10.1007/978-3-642-54631-0_30</a>","ista":"Bellare M, Fuchsbauer G. 2014. Policy-based signatures. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol. 8383, 520–537.","ieee":"M. Bellare and G. Fuchsbauer, “Policy-based signatures,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Buenos Aires, Argentina, 2014, vol. 8383, pp. 520–537.","short":"M. Bellare, G. Fuchsbauer, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 520–537.","apa":"Bellare, M., &#38; Fuchsbauer, G. (2014). Policy-based signatures. In H. Krawczyk (Ed.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8383, pp. 520–537). Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">https://doi.org/10.1007/978-3-642-54631-0_30</a>","chicago":"Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, 8383:520–37. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">https://doi.org/10.1007/978-3-642-54631-0_30</a>.","mla":"Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 520–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-54631-0_30\">10.1007/978-3-642-54631-0_30</a>."},"year":"2014","date_created":"2018-12-11T11:55:24Z","_id":"2046","conference":{"location":"Buenos Aires, Argentina","name":"PKC: Public Key Crypography","end_date":"2014-05-28","start_date":"2014-05-26"},"editor":[{"last_name":"Krawczyk","first_name":"Hugo","full_name":"Krawczyk, Hugo"}],"acknowledgement":"Part of his work was done while at Bristol University, supported by EPSRC grant EP/H043454/1.","scopus_import":1,"main_file_link":[{"url":"https://eprint.iacr.org/2013/413","open_access":"1"}],"doi":"10.1007/978-3-642-54631-0_30","oa_version":"Submitted Version","title":"Policy-based signatures","publication_status":"published"},{"project":[{"grant_number":"11-NSF-1070","name":"ROOTS Genome-wide Analysis of Root Traits","_id":"25636330-B435-11E9-9278-68D0E5697425"}],"day":"01","page":"170 - 184","quality_controlled":"1","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publist_id":"5004","status":"public","month":"01","publisher":"Springer","type":"conference","date_published":"2014-01-01T00:00:00Z","external_id":{"arxiv":["1407.8067"]},"abstract":[{"lang":"eng","text":"Following the publication of an attack on genome-wide association studies (GWAS) data proposed by Homer et al., considerable attention has been given to developing methods for releasing GWAS data in a privacy-preserving way. Here, we develop an end-to-end differentially private method for solving regression problems with convex penalty functions and selecting the penalty parameters by cross-validation. In particular, we focus on penalized logistic regression with elastic-net regularization, a method widely used to in GWAS analyses to identify disease-causing genes. We show how a differentially private procedure for penalized logistic regression with elastic-net regularization can be applied to the analysis of GWAS data and evaluate our method’s performance."}],"citation":{"mla":"Yu, Fei, et al. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">10.1007/978-3-319-11257-2_14</a>.","apa":"Yu, F., Rybar, M., Uhler, C., &#38; Fienberg, S. (2014). Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In J. Domingo Ferrer (Ed.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8744, pp. 170–184). Ibiza, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">https://doi.org/10.1007/978-3-319-11257-2_14</a>","chicago":"Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Josep Domingo Ferrer, 8744:170–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">https://doi.org/10.1007/978-3-319-11257-2_14</a>.","short":"F. Yu, M. Rybar, C. Uhler, S. Fienberg, in:, J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 170–184.","ama":"Yu F, Rybar M, Uhler C, Fienberg S. Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In: Domingo Ferrer J, ed. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8744. Springer; 2014:170-184. doi:<a href=\"https://doi.org/10.1007/978-3-319-11257-2_14\">10.1007/978-3-319-11257-2_14</a>","ista":"Yu F, Rybar M, Uhler C, Fienberg S. 2014. Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PSD: Privacy in Statistical Databases, LNCS, vol. 8744, 170–184.","ieee":"F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Ibiza, Spain, 2014, vol. 8744, pp. 170–184."},"year":"2014","date_created":"2018-12-11T11:55:24Z","_id":"2047","conference":{"end_date":"2014-09-19","location":"Ibiza, Spain","name":"PSD: Privacy in Statistical Databases","start_date":"2014-09-17"},"editor":[{"first_name":"Josep","last_name":"Domingo Ferrer","full_name":"Domingo Ferrer, Josep"}],"acknowledgement":"This research was partially supported by BCS- 0941518 to the Department of Statistics at Carnegie Mellon University.","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.8067"}],"doi":"10.1007/978-3-319-11257-2_14","oa_version":"Submitted Version","publication_status":"published","title":"Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases","intvolume":"      8744","arxiv":1,"date_updated":"2021-01-12T06:54:57Z","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","department":[{"_id":"KrPi"},{"_id":"CaUh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Yu, Fei","last_name":"Yu","first_name":"Fei"},{"last_name":"Rybar","first_name":"Michal","full_name":"Rybar, Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline"},{"full_name":"Fienberg, Stephen","first_name":"Stephen","last_name":"Fienberg"}],"volume":8744,"oa":1},{"title":"Experimental investigation of transitional flow in a toroidal pipe","publication_status":"published","article_processing_charge":"No","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.06546"}],"doi":"10.1017/jfm.2013.603","scopus_import":1,"_id":"2050","date_created":"2018-12-11T11:55:25Z","year":"2014","citation":{"ama":"Kühnen J, Holzner M, Hof B, Kuhlmann H. Experimental investigation of transitional flow in a toroidal pipe. <i>Journal of Fluid Mechanics</i>. 2014;738:463-491. doi:<a href=\"https://doi.org/10.1017/jfm.2013.603\">10.1017/jfm.2013.603</a>","ista":"Kühnen J, Holzner M, Hof B, Kuhlmann H. 2014. Experimental investigation of transitional flow in a toroidal pipe. Journal of Fluid Mechanics. 738, 463–491.","ieee":"J. Kühnen, M. Holzner, B. Hof, and H. Kuhlmann, “Experimental investigation of transitional flow in a toroidal pipe,” <i>Journal of Fluid Mechanics</i>, vol. 738. Cambridge University Press, pp. 463–491, 2014.","apa":"Kühnen, J., Holzner, M., Hof, B., &#38; Kuhlmann, H. (2014). Experimental investigation of transitional flow in a toroidal pipe. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2013.603\">https://doi.org/10.1017/jfm.2013.603</a>","short":"J. Kühnen, M. Holzner, B. Hof, H. Kuhlmann, Journal of Fluid Mechanics 738 (2014) 463–491.","chicago":"Kühnen, Jakob, Markus Holzner, Björn Hof, and Hendrik Kuhlmann. “Experimental Investigation of Transitional Flow in a Toroidal Pipe.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2014. <a href=\"https://doi.org/10.1017/jfm.2013.603\">https://doi.org/10.1017/jfm.2013.603</a>.","mla":"Kühnen, Jakob, et al. “Experimental Investigation of Transitional Flow in a Toroidal Pipe.” <i>Journal of Fluid Mechanics</i>, vol. 738, Cambridge University Press, 2014, pp. 463–91, doi:<a href=\"https://doi.org/10.1017/jfm.2013.603\">10.1017/jfm.2013.603</a>."},"abstract":[{"lang":"eng","text":"The flow instability and further transition to turbulence in a toroidal pipe (torus) with curvature ratio (tube-to-coiling diameter) 0.049 is investigated experimentally. The flow inside the toroidal pipe is driven by a steel sphere fitted to the inner pipe diameter. The sphere is moved with constant azimuthal velocity from outside the torus by a moving magnet. The experiment is designed to investigate curved pipe flow by optical measurement techniques. Using stereoscopic particle image velocimetry, laser Doppler velocimetry and pressure drop measurements, the flow is measured for Reynolds numbers ranging from 1000 to 15 000. Time- and space-resolved velocity fields are obtained and analysed. The steady axisymmetric basic flow is strongly influenced by centrifugal effects. On an increase of the Reynolds number we find a sequence of bifurcations. For Re=4075±2% a supercritical bifurcation to an oscillatory flow is found in which waves travel in the streamwise direction with a phase velocity slightly faster than the mean flow. The oscillatory flow is superseded by a presumably quasi-periodic flow at a further increase of the Reynolds number before turbulence sets in. The results are found to be compatible, in general, with earlier experimental and numerical investigations on transition to turbulence in helical and curved pipes. However, important aspects of the bifurcation scenario differ considerably."}],"oa":1,"volume":738,"author":[{"full_name":"Kühnen, Jakob","orcid":"0000-0003-4312-0179","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","last_name":"Kühnen","first_name":"Jakob"},{"last_name":"Holzner","first_name":"Markus","full_name":"Holzner, Markus"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"},{"last_name":"Kuhlmann","first_name":"Hendrik","full_name":"Kuhlmann, Hendrik"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BjHo"}],"publication":"Journal of Fluid Mechanics","date_updated":"2021-01-12T06:54:59Z","arxiv":1,"intvolume":"       738","quality_controlled":"1","page":"463 - 491","day":"10","external_id":{"arxiv":["1508.06546"]},"date_published":"2014-01-10T00:00:00Z","type":"journal_article","publisher":"Cambridge University Press","month":"01","status":"public","publist_id":"5001","language":[{"iso":"eng"}]},{"conference":{"name":"NIPS: Neural Information Processing Systems"},"_id":"2051","date_created":"2018-12-11T11:55:26Z","year":"2014","citation":{"ama":"Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. Multilabel structured output learning with random spanning trees of max-margin Markov networks. In: Neural Information Processing Systems; 2014.","ista":"Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. 2014. Multilabel structured output learning with random spanning trees of max-margin Markov networks. NIPS: Neural Information Processing Systems.","ieee":"M. Marchand, S. Hongyu, E. Morvant, J. Rousu, and J. Shawe Taylor, “Multilabel structured output learning with random spanning trees of max-margin Markov networks,” presented at the NIPS: Neural Information Processing Systems, 2014.","apa":"Marchand, M., Hongyu, S., Morvant, E., Rousu, J., &#38; Shawe Taylor, J. (2014). Multilabel structured output learning with random spanning trees of max-margin Markov networks. Presented at the NIPS: Neural Information Processing Systems, Neural Information Processing Systems.","chicago":"Marchand, Mario, Su Hongyu, Emilie Morvant, Juho Rousu, and John Shawe Taylor. “Multilabel Structured Output Learning with Random Spanning Trees of Max-Margin Markov Networks.” Neural Information Processing Systems, 2014.","short":"M. Marchand, S. Hongyu, E. Morvant, J. Rousu, J. Shawe Taylor, in:, Neural Information Processing Systems, 2014.","mla":"Marchand, Mario, et al. <i>Multilabel Structured Output Learning with Random Spanning Trees of Max-Margin Markov Networks</i>. Neural Information Processing Systems, 2014."},"abstract":[{"text":"We show that the usual score function for conditional Markov networks can be written as the expectation over the scores of their spanning trees. We also show that a small random sample of these output trees can attain a significant fraction of the margin obtained by the complete graph and we provide conditions under which we can perform tractable inference. The experimental results confirm that practical learning is scalable to realistic datasets using this approach.","lang":"eng"}],"quality_controlled":0,"title":"Multilabel structured output learning with random spanning trees of max-margin Markov networks","publication_status":"published","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01065586","open_access":"1"}],"day":"01","month":"01","status":"public","publist_id":"4996","date_updated":"2021-01-12T06:54:59Z","extern":1,"date_published":"2014-01-01T00:00:00Z","type":"conference","oa":1,"publisher":"Neural Information Processing Systems","author":[{"full_name":"Marchand, Mario","first_name":"Mario","last_name":"Marchand"},{"full_name":"Hongyu, Su","first_name":"Su","last_name":"Hongyu"},{"last_name":"Morvant","first_name":"Emilie","full_name":"Emilie Morvant","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8301-7240"},{"last_name":"Rousu","first_name":"Juho","full_name":"Rousu, Juho"},{"full_name":"Shawe-Taylor, John","last_name":"Shawe Taylor","first_name":"John"}]},{"status":"public","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","date_updated":"2021-01-12T06:54:59Z","publist_id":"4994","month":"09","department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"intvolume":"      8704","language":[{"iso":"eng"}],"volume":8704,"date_published":"2014-09-01T00:00:00Z","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","full_name":"Aminof, Benjamin","first_name":"Benjamin","last_name":"Aminof"},{"first_name":"Tomer","last_name":"Kotek","full_name":"Kotek, Tomer"},{"full_name":"Rubin, Sacha","first_name":"Sacha","last_name":"Rubin"},{"first_name":"Francesco","last_name":"Spegni","full_name":"Spegni, Francesco"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"}],"_id":"2052","date_created":"2018-12-11T11:55:26Z","editor":[{"last_name":"Baldan","first_name":"Paolo","full_name":"Baldan, Paolo"},{"last_name":"Gorla","first_name":"Daniele","full_name":"Gorla, Daniele"}],"conference":{"end_date":"2014-09-05","location":"Rome, Italy","name":"CONCUR: Concurrency Theory","start_date":"2014-09-02"},"abstract":[{"text":"A standard technique for solving the parameterized model checking problem is to reduce it to the classic model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the parameterized model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that model checking the parameterized system can be reduced to model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata.","lang":"eng"}],"year":"2014","citation":{"ama":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking of rendezvous systems. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:109-124. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">10.1007/978-3-662-44584-6_9</a>","ista":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model checking of rendezvous systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.","ieee":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 109–124.","apa":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., &#38; Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">https://doi.org/10.1007/978-3-662-44584-6_9</a>","chicago":"Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut Veith. “Parameterized Model Checking of Rendezvous Systems.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">https://doi.org/10.1007/978-3-662-44584-6_9</a>.","short":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–124.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">10.1007/978-3-662-44584-6_9</a>."},"oa_version":"None","publication_status":"published","quality_controlled":"1","title":"Parameterized model checking of rendezvous systems","day":"01","acknowledgement":"The second, third, fourth and fifth authors were supported by the Austrian National Research Network S11403-N23 (RiSE) of the Austrian Science Fund (FWF) and by the Vienna Science and Technology Fund (WWTF) through grants PROSEED, ICT12-059, and VRG11-005.","page":"109 - 124","doi":"10.1007/978-3-662-44584-6_9"},{"project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"page":"249 - 265","day":"01","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"month":"09","publist_id":"4993","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","date_published":"2014-09-01T00:00:00Z","citation":{"ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>","ista":"Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.","ieee":"H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 249–265.","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>.","apa":"Hermanns, H., Krčál, J., &#38; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>","short":"H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.","chicago":"Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>."},"year":"2014","abstract":[{"lang":"eng","text":"In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition refines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems."}],"conference":{"end_date":"2014-09-05","name":"CONCUR: Concurrency Theory","location":"Rome, Italy","start_date":"2014-09-02"},"editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"last_name":"Gorla","first_name":"Daniele","full_name":"Gorla, Daniele"}],"date_created":"2018-12-11T11:55:27Z","_id":"2053","main_file_link":[{"url":"http://arxiv.org/abs/1404.5084","open_access":"1"}],"doi":"10.1007/978-3-662-44584-6_18","acknowledgement":"This work is supported by the EU 7th Framework Programme under grant agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","title":"Probabilistic bisimulation: Naturally on distributions","publication_status":"published","oa_version":"Submitted Version","intvolume":"      8704","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ec_funded":1,"date_updated":"2021-01-12T06:55:00Z","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"full_name":"Hermanns, Holger","first_name":"Holger","last_name":"Hermanns"},{"full_name":"Krčál, Jan","last_name":"Krčál","first_name":"Jan"},{"last_name":"Kretinsky","first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":8704,"oa":1},{"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"544 - 559","day":"01","quality_controlled":"1","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"month":"09","publist_id":"4992","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","date_published":"2014-09-01T00:00:00Z","citation":{"ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 544–559.","ista":"Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.","mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>","short":"K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>."},"year":"2014","abstract":[{"lang":"eng","text":"We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games."}],"conference":{"name":"CONCUR: Concurrency Theory","location":"Rome, Italy","end_date":"2014-09-05","start_date":"2014-09-02"},"editor":[{"full_name":"Baldan, Paolo","first_name":"Paolo","last_name":"Baldan"},{"full_name":"Gorla, Daniele","last_name":"Gorla","first_name":"Daniele"}],"date_created":"2018-12-11T11:55:27Z","_id":"2054","doi":"10.1007/978-3-662-44584-6_37","publication_status":"published","title":"Qualitative concurrent parity games: Bounded rationality","oa_version":"None","intvolume":"      8704","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T11:23:36Z","ec_funded":1,"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":8704,"related_material":{"record":[{"id":"3354","relation":"earlier_version","status":"public"}]}},{"intvolume":"        69","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"date_updated":"2021-01-12T06:55:01Z","publication":"Journal of Mathematical Biology","author":[{"first_name":"Arnab","last_name":"Ganguly","full_name":"Ganguly, Arnab"},{"full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":69,"oa":1,"citation":{"apa":"Ganguly, A., Petrov, T., &#38; Koeppl, H. (2014). Markov chain aggregation and its applications to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s00285-013-0738-7\">https://doi.org/10.1007/s00285-013-0738-7</a>","short":"A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014) 767–797.","chicago":"Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical Biology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00285-013-0738-7\">https://doi.org/10.1007/s00285-013-0738-7</a>.","mla":"Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3, Springer, 2014, pp. 767–97, doi:<a href=\"https://doi.org/10.1007/s00285-013-0738-7\">10.1007/s00285-013-0738-7</a>.","ista":"Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797.","ieee":"A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications to combinatorial reaction networks,” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3. Springer, pp. 767–797, 2014.","ama":"Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. 2014;69(3):767-797. doi:<a href=\"https://doi.org/10.1007/s00285-013-0738-7\">10.1007/s00285-013-0738-7</a>"},"year":"2014","abstract":[{"text":"We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is devoted to illustrate how the developed theory aids in reducing CTMC models of biochemical systems particularly in connection to protein-protein interactions. We assume that the model is written by a biologist in form of site-graph-rewrite rules. Site-graph-rewrite rules compactly express that, often, only a local context of a protein (instead of a full molecular species) needs to be in a certain configuration in order to trigger a reaction event. This observation leads to suitable aggregate Markov chains with smaller state spaces, thereby providing sufficient reduction in computational complexity. This is further exemplified in two case studies: simple unbounded polymerization and early EGFR/insulin crosstalk.","lang":"eng"}],"date_created":"2018-12-11T11:55:28Z","_id":"2056","scopus_import":1,"doi":"10.1007/s00285-013-0738-7","main_file_link":[{"url":"http://arxiv.org/abs/1303.4532","open_access":"1"}],"acknowledgement":"T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems Biology.","publication_status":"published","title":"Markov chain aggregation and its applications to combinatorial reaction networks","oa_version":"Submitted Version","language":[{"iso":"eng"}],"month":"11","publist_id":"4990","status":"public","publisher":"Springer","type":"journal_article","date_published":"2014-11-20T00:00:00Z","issue":"3","page":"767 - 797","day":"20","quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle this problem, we investigate a recent and elegant well-founded quadratic program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq looks for the weighted combination, over a set of real-valued functions seen as voters, leading to the lowest misclassification rate, while maximizing the voters’ diversity. We propose an extension of MinCq tailored to multimedia indexing. Our method is based on an order-preserving pairwise loss adapted to ranking that allows us to improve Mean Averaged Precision measure while taking into account the diversity of the voters that we want to fuse. We provide evidence that this method is naturally adapted to late fusion procedures and confirm the good behavior of our approach on the challenging PASCAL VOC’07 benchmark."}],"citation":{"ieee":"E. Morvant, A. Habrard, and S. Ayache, “Majority vote of diverse classifiers for late fusion,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Joensuu, Finland, 2014, vol. 8621, pp. 153–162.","ista":"Morvant E, Habrard A, Ayache S. 2014. Majority vote of diverse classifiers for late fusion. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). IAPR: International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, LNCS, vol. 8621, 153–162.","ama":"Morvant E, Habrard A, Ayache S. Majority vote of diverse classifiers for late fusion. In: <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8621. Springer; 2014:153-162. doi:<a href=\"https://doi.org/10.1007/978-3-662-44415-3_16\">10.1007/978-3-662-44415-3_16</a>","short":"E. Morvant, A. Habrard, S. Ayache, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 153–162.","apa":"Morvant, E., Habrard, A., &#38; Ayache, S. (2014). Majority vote of diverse classifiers for late fusion. In <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8621, pp. 153–162). Joensuu, Finland: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44415-3_16\">https://doi.org/10.1007/978-3-662-44415-3_16</a>","chicago":"Morvant, Emilie, Amaury Habrard, and Stéphane Ayache. “Majority Vote of Diverse Classifiers for Late Fusion.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, 8621:153–62. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44415-3_16\">https://doi.org/10.1007/978-3-662-44415-3_16</a>.","mla":"Morvant, Emilie, et al. “Majority Vote of Diverse Classifiers for Late Fusion.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, vol. 8621, Springer, 2014, pp. 153–62, doi:<a href=\"https://doi.org/10.1007/978-3-662-44415-3_16\">10.1007/978-3-662-44415-3_16</a>."},"year":"2014","date_created":"2018-12-11T11:55:28Z","_id":"2057","conference":{"end_date":"2014-08-22","location":"Joensuu, Finland","name":"IAPR: International Workshop on Structural, Syntactic, and Statistical Pattern Recognition","start_date":"2014-08-20"},"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1404.7796","open_access":"1"}],"doi":"10.1007/978-3-662-44415-3_16","oa_version":"Preprint","title":"Majority vote of diverse classifiers for late fusion","publication_status":"published","intvolume":"      8621","arxiv":1,"date_updated":"2021-01-12T06:55:01Z","ec_funded":1,"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Morvant, Emilie","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8301-7240","last_name":"Morvant","first_name":"Emilie"},{"full_name":"Habrard, Amaury","last_name":"Habrard","first_name":"Amaury"},{"last_name":"Ayache","first_name":"Stéphane","full_name":"Ayache, Stéphane"}],"volume":8621,"oa":1,"project":[{"call_identifier":"FP7","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"day":"01","page":"153 - 162","quality_controlled":"1","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publist_id":"4989","status":"public","month":"01","publisher":"Springer","type":"conference","external_id":{"arxiv":["1404.7796"]},"date_published":"2014-01-01T00:00:00Z"},{"day":"01","quality_controlled":"1","pubrep_id":"606","issue":"4","has_accepted_license":"1","project":[{"grant_number":"11-NSF-1070","name":"ROOTS Genome-wide Analysis of Root Traits","_id":"25636330-B435-11E9-9278-68D0E5697425"}],"publisher":"ACM","date_published":"2014-07-01T00:00:00Z","type":"conference","language":[{"iso":"eng"}],"ddc":["000"],"month":"07","status":"public","publist_id":"4988","doi":"10.1145/2601097.2601126","scopus_import":"1","publication_status":"published","title":"Blending liquids","file_date_updated":"2020-07-14T12:45:27Z","oa_version":"Submitted Version","article_processing_charge":"No","year":"2014","article_number":"137","citation":{"mla":"Raveendran, Karthik, et al. “Blending Liquids.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 4, 137, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2601097.2601126\">10.1145/2601097.2601126</a>.","short":"K. Raveendran, C. Wojtan, N. Thuerey, G. Türk, in:, ACM Transactions on Graphics, ACM, 2014.","apa":"Raveendran, K., Wojtan, C., Thuerey, N., &#38; Türk, G. (2014). Blending liquids. In <i>ACM Transactions on Graphics</i> (Vol. 33). Vancouver, Canada: ACM. <a href=\"https://doi.org/10.1145/2601097.2601126\">https://doi.org/10.1145/2601097.2601126</a>","chicago":"Raveendran, Karthik, Chris Wojtan, Nils Thuerey, and Greg Türk. “Blending Liquids.” In <i>ACM Transactions on Graphics</i>, Vol. 33. ACM, 2014. <a href=\"https://doi.org/10.1145/2601097.2601126\">https://doi.org/10.1145/2601097.2601126</a>.","ieee":"K. Raveendran, C. Wojtan, N. Thuerey, and G. Türk, “Blending liquids,” in <i>ACM Transactions on Graphics</i>, Vancouver, Canada, 2014, vol. 33, no. 4.","ista":"Raveendran K, Wojtan C, Thuerey N, Türk G. 2014. Blending liquids. ACM Transactions on Graphics. SIGGRAPH: International Conference and Exhibition on Computer Graphics and Interactive Techniques vol. 33, 137.","ama":"Raveendran K, Wojtan C, Thuerey N, Türk G. Blending liquids. In: <i>ACM Transactions on Graphics</i>. Vol 33. ACM; 2014. doi:<a href=\"https://doi.org/10.1145/2601097.2601126\">10.1145/2601097.2601126</a>"},"abstract":[{"text":"We present a method for smoothly blending between existing liquid animations. We introduce a semi-automatic method for matching two existing liquid animations, which we use to create new fluid motion that plausibly interpolates the input. Our contributions include a new space-time non-rigid iterative closest point algorithm that incorporates user guidance, a subsampling technique for efficient registration of meshes with millions of vertices, and a fast surface extraction algorithm that produces 3D triangle meshes from a 4D space-time surface. Our technique can be used to instantly create hundreds of new simulations, or to interactively explore complex parameter spaces. Our method is guaranteed to produce output that does not deviate from the input animations, and it generalizes to multiple dimensions. Because our method runs at interactive rates after the initial precomputation step, it has potential applications in games and training simulations.","lang":"eng"}],"conference":{"start_date":"2014-08-10","end_date":"2014-08-14","name":"SIGGRAPH: International Conference and Exhibition on Computer Graphics and Interactive Techniques","location":"Vancouver, Canada"},"_id":"2058","date_created":"2018-12-11T11:55:28Z","file":[{"content_type":"application/pdf","file_id":"4688","creator":"system","checksum":"1752760a2e71e254537f31c0d10d9c6c","access_level":"open_access","file_name":"IST-2016-606-v1+1_BlendingLiquids-Preprint.pdf","date_updated":"2020-07-14T12:45:27Z","date_created":"2018-12-12T10:08:27Z","file_size":8387384,"relation":"main_file"}],"author":[{"first_name":"Karthik","last_name":"Raveendran","full_name":"Raveendran, Karthik"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan","first_name":"Christopher J"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"last_name":"Türk","first_name":"Greg","full_name":"Türk, Greg"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":33,"intvolume":"        33","department":[{"_id":"ChWo"}],"publication":"ACM Transactions on Graphics","date_updated":"2022-08-25T14:02:46Z"},{"pubrep_id":"394","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","issue":"5","day":"20","page":"1077 - 1087","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["580"],"status":"public","publist_id":"4987","month":"02","publisher":"Springer","date_published":"2014-02-20T00:00:00Z","type":"journal_article","abstract":[{"text":"Plant embryogenesis is regulated by differential distribution of the plant hormone auxin. However, the cells establishing these gradients during microspore embryogenesis remain to be identified. For the first time, we describe, using the DR5 or DR5rev reporter gene systems, the GFP- and GUS-based auxin biosensors to monitor auxin during Brassica napus androgenesis at cellular resolution in the initial stages. Our study provides evidence that the distribution of auxin changes during embryo development and depends on the temperature-inducible in vitro culture conditions. For this, microspores (mcs) were induced to embryogenesis by heat treatment and then subjected to genetic modification via Agrobacterium tumefaciens. The duration of high temperature treatment had a significant influence on auxin distribution in isolated and in vitro-cultured microspores and on microspore-derived embryo development. In the “mild” heat-treated (1 day at 32 °C) mcs, auxin localized in a polar way already at the uni-nucleate microspore, which was critical for the initiation of embryos with suspensor-like structure. Assuming a mean mcs radius of 20 μm, endogenous auxin content in a single cell corresponded to concentration of 1.01 μM. In mcs subjected to a prolonged heat (5 days at 32 °C), although auxin concentration increased dozen times, auxin polarization was set up at a few-celled pro-embryos without suspensor. Those embryos were enclosed in the outer wall called the exine. The exine rupture was accompanied by the auxin gradient polarization. Relative quantitative estimation of auxin, using time-lapse imaging, revealed that primordia possess up to 1.3-fold higher amounts than those found in the root apices of transgenic MDEs in the presence of exogenous auxin. Our results show, for the first time, which concentration of endogenous auxin coincides with the first cell division and how the high temperature interplays with auxin, by what affects delay early establishing microspore polarity. Moreover, we present how the local auxin accumulation demonstrates the apical–basal axis formation of the androgenic embryo and directs the axiality of the adult haploid plant.","lang":"eng"}],"year":"2014","citation":{"mla":"Dubas, Ewa, et al. “The Influence of Heat Stress on Auxin Distribution in Transgenic B Napus Microspores and Microspore Derived Embryos.” <i>Protoplasma</i>, vol. 251, no. 5, Springer, 2014, pp. 1077–87, doi:<a href=\"https://doi.org/10.1007/s00709-014-0616-1\">10.1007/s00709-014-0616-1</a>.","short":"E. Dubas, J. Moravčíková, J. Libantová, I. Matušíková, E. Benková, I. Zur, M. Krzewska, Protoplasma 251 (2014) 1077–1087.","apa":"Dubas, E., Moravčíková, J., Libantová, J., Matušíková, I., Benková, E., Zur, I., &#38; Krzewska, M. (2014). The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos. <i>Protoplasma</i>. Springer. <a href=\"https://doi.org/10.1007/s00709-014-0616-1\">https://doi.org/10.1007/s00709-014-0616-1</a>","chicago":"Dubas, Ewa, Jana Moravčíková, Jana Libantová, Ildikó Matušíková, Eva Benková, Iwona Zur, and Monika Krzewska. “The Influence of Heat Stress on Auxin Distribution in Transgenic B Napus Microspores and Microspore Derived Embryos.” <i>Protoplasma</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00709-014-0616-1\">https://doi.org/10.1007/s00709-014-0616-1</a>.","ieee":"E. Dubas <i>et al.</i>, “The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos,” <i>Protoplasma</i>, vol. 251, no. 5. Springer, pp. 1077–1087, 2014.","ista":"Dubas E, Moravčíková J, Libantová J, Matušíková I, Benková E, Zur I, Krzewska M. 2014. The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos. Protoplasma. 251(5), 1077–1087.","ama":"Dubas E, Moravčíková J, Libantová J, et al. The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos. <i>Protoplasma</i>. 2014;251(5):1077-1087. doi:<a href=\"https://doi.org/10.1007/s00709-014-0616-1\">10.1007/s00709-014-0616-1</a>"},"_id":"2059","date_created":"2018-12-11T11:55:29Z","file":[{"content_type":"application/pdf","creator":"system","file_id":"5353","checksum":"d570a6073765118fc0bb83c31d96fa53","file_name":"IST-2015-394-v1+1_s00709-014-0616-1.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:31Z","file_size":6377990,"date_updated":"2020-07-14T12:45:27Z"}],"acknowledgement":"The research was supported by the IPP PAS-IPGB SAS bilateral project (“Molecular analysis of auxin distribution in oilseed androgenic embryos”), IPP PAS-FWO VIB bilateral project (“Auxin as signaling molecule in doubled haploid production of rape (B. napus var. oleifera)”), individual national research project 2011/01/D/NZ9/02547, and VEGA 2-0090-14.","doi":"10.1007/s00709-014-0616-1","scopus_import":1,"file_date_updated":"2020-07-14T12:45:27Z","oa_version":"Published Version","publication_status":"published","title":"The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos","intvolume":"       251","publication":"Protoplasma","date_updated":"2021-01-12T06:55:02Z","department":[{"_id":"EvBe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ewa","last_name":"Dubas","full_name":"Dubas, Ewa"},{"full_name":"Moravčíková, Jana","last_name":"Moravčíková","first_name":"Jana"},{"first_name":"Jana","last_name":"Libantová","full_name":"Libantová, Jana"},{"last_name":"Matušíková","first_name":"Ildikó","full_name":"Matušíková, Ildikó"},{"last_name":"Benková","first_name":"Eva","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Iwona","last_name":"Zur","full_name":"Zur, Iwona"},{"full_name":"Krzewska, Monika","first_name":"Monika","last_name":"Krzewska"}],"oa":1,"volume":251},{"oa_version":"None","publication_status":"published","quality_controlled":"1","title":"Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis","day":"14","scopus_import":1,"doi":"10.1007/s00709-014-0620-5","page":"1125 - 1139","date_created":"2018-12-11T11:55:29Z","_id":"2061","issue":"5","abstract":[{"text":"Development of cambium and its activity is important for our knowledge of the mechanism of secondary growth. Arabidopsis thaliana emerges as a good model plant for such a kind of study. Thus, this paper reports on cellular events taking place in the interfascicular regions of inflorescence stems of A. thaliana, leading to the development of interfascicular cambium from differentiated interfascicular parenchyma cells (IPC). These events are as follows: appearance of auxin accumulation, PIN1 gene expression, polar PIN1 protein localization in the basal plasma membrane and periclinal divisions. Distribution of auxin was observed to be higher in differentiating into cambium parenchyma cells compared to cells within the pith and cortex. Expression of PIN1 in IPC was always preceded by auxin accumulation. Basal localization of PIN1 was already established in the cells prior to their periclinal division. These cellular events initiated within parenchyma cells adjacent to the vascular bundles and successively extended from that point towards the middle region of the interfascicular area, located between neighboring vascular bundles. The final consequence of which was the closure of the cambial ring within the stem. Changes in the chemical composition of IPC walls were also detected and included changes of pectic epitopes, xyloglucans (XG) and extensins rich in hydroxyproline (HRGPs). In summary, results presented in this paper describe interfascicular cambium ontogenesis in terms of successive cellular events in the interfascicular regions of inflorescence stems of Arabidopsis.","lang":"eng"}],"citation":{"mla":"Mazur, Ewa, et al. “Cellular Events during Interfascicular Cambium Ontogenesis in Inflorescence Stems of Arabidopsis.” <i>Protoplasma</i>, vol. 251, no. 5, Springer, 2014, pp. 1125–39, doi:<a href=\"https://doi.org/10.1007/s00709-014-0620-5\">10.1007/s00709-014-0620-5</a>.","apa":"Mazur, E., Kurczyñska, E., &#38; Friml, J. (2014). Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis. <i>Protoplasma</i>. Springer. <a href=\"https://doi.org/10.1007/s00709-014-0620-5\">https://doi.org/10.1007/s00709-014-0620-5</a>","short":"E. Mazur, E. Kurczyñska, J. Friml, Protoplasma 251 (2014) 1125–1139.","chicago":"Mazur, Ewa, Ewa Kurczyñska, and Jiří Friml. “Cellular Events during Interfascicular Cambium Ontogenesis in Inflorescence Stems of Arabidopsis.” <i>Protoplasma</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00709-014-0620-5\">https://doi.org/10.1007/s00709-014-0620-5</a>.","ieee":"E. Mazur, E. Kurczyñska, and J. Friml, “Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis,” <i>Protoplasma</i>, vol. 251, no. 5. Springer, pp. 1125–1139, 2014.","ista":"Mazur E, Kurczyñska E, Friml J. 2014. Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis. Protoplasma. 251(5), 1125–1139.","ama":"Mazur E, Kurczyñska E, Friml J. Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis. <i>Protoplasma</i>. 2014;251(5):1125-1139. doi:<a href=\"https://doi.org/10.1007/s00709-014-0620-5\">10.1007/s00709-014-0620-5</a>"},"year":"2014","volume":251,"type":"journal_article","date_published":"2014-02-14T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Mazur","first_name":"Ewa","full_name":"Mazur, Ewa"},{"full_name":"Kurczyñska, Ewa","first_name":"Ewa","last_name":"Kurczyñska"},{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"publisher":"Springer","publist_id":"4985","date_updated":"2021-01-12T06:55:03Z","publication":"Protoplasma","status":"public","department":[{"_id":"JiFr"}],"month":"02","intvolume":"       251","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"The success story of fast-spiking, parvalbumin-positive (PV+) GABAergic interneurons (GABA, γ-aminobutyric acid) in the mammalian central nervous system is noteworthy. In 1995, the properties of these interneurons were completely unknown. Twenty years later, thanks to the massive use of subcellular patch-clamp techniques, simultaneous multiple-cell recording, optogenetics, in vivo measurements, and computational approaches, our knowledge about PV+ interneurons became more extensive than for several types of pyramidal neurons. These findings have implications beyond the “small world” of basic research on GABAergic cells. For example, the results provide a first proof of principle that neuroscientists might be able to close the gaps between the molecular, cellular, network, and behavioral levels, representing one of the main challenges at the present time. Furthermore, the results may form the basis for PV+ interneurons as therapeutic targets for brain disease in the future. However, much needs to be learned about the basic function of these interneurons before clinical neuroscientists will be able to use PV+ interneurons for therapeutic purposes."}],"citation":{"ista":"Hu H, Gan J, Jonas PM. 2014. Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function. Science. 345(6196), 1255263.","ieee":"H. Hu, J. Gan, and P. M. Jonas, “Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function,” <i>Science</i>, vol. 345, no. 6196. American Association for the Advancement of Science, 2014.","ama":"Hu H, Gan J, Jonas PM. Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function. <i>Science</i>. 2014;345(6196). doi:<a href=\"https://doi.org/10.1126/science.1255263\">10.1126/science.1255263</a>","mla":"Hu, Hua, et al. “Fast-Spiking Parvalbumin^+ GABAergic Interneurons: From Cellular Design to Microcircuit Function.” <i>Science</i>, vol. 345, no. 6196, 1255263, American Association for the Advancement of Science, 2014, doi:<a href=\"https://doi.org/10.1126/science.1255263\">10.1126/science.1255263</a>.","apa":"Hu, H., Gan, J., &#38; Jonas, P. M. (2014). Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1255263\">https://doi.org/10.1126/science.1255263</a>","chicago":"Hu, Hua, Jian Gan, and Peter M Jonas. “Fast-Spiking Parvalbumin^+ GABAergic Interneurons: From Cellular Design to Microcircuit Function.” <i>Science</i>. American Association for the Advancement of Science, 2014. <a href=\"https://doi.org/10.1126/science.1255263\">https://doi.org/10.1126/science.1255263</a>.","short":"H. Hu, J. Gan, P.M. Jonas, Science 345 (2014)."},"article_number":"1255263","year":"2014","date_created":"2018-12-11T11:55:29Z","file":[{"checksum":"a0036a589037d37e86364fa25cc0a82f","content_type":"application/pdf","file_id":"5185","creator":"system","date_created":"2018-12-12T10:16:00Z","relation":"main_file","date_updated":"2020-07-14T12:45:27Z","file_size":215514,"file_name":"IST-2017-821-v1+1_1255263JonasPVReviewTextR_Final.pdf","access_level":"open_access"},{"date_updated":"2020-07-14T12:45:27Z","relation":"main_file","file_size":1732723,"date_created":"2018-12-12T10:16:01Z","file_name":"IST-2017-821-v1+2_1255263JonasPVReviewFigures_Final.pdf","access_level":"open_access","checksum":"e1f57d2713725449cb898fdcb8ef47b8","creator":"system","file_id":"5186","content_type":"application/pdf"}],"_id":"2062","scopus_import":1,"doi":"10.1126/science.1255263","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:27Z","publication_status":"published","title":"Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function","intvolume":"       345","ec_funded":1,"date_updated":"2021-01-12T06:55:03Z","publication":"Science","department":[{"_id":"PeJo"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Hu","first_name":"Hua","full_name":"Hu, Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gan, Jian","id":"3614E438-F248-11E8-B48F-1D18A9856A87","last_name":"Gan","first_name":"Jian"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"}],"volume":345,"oa":1,"pubrep_id":"821","has_accepted_license":"1","project":[{"call_identifier":"FWF","grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"},{"_id":"25C0F108-B435-11E9-9278-68D0E5697425","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","call_identifier":"FP7","grant_number":"268548"}],"issue":"6196","day":"01","quality_controlled":"1","ddc":["570"],"language":[{"iso":"eng"}],"publist_id":"4984","status":"public","month":"08","publisher":"American Association for the Advancement of Science","type":"journal_article","date_published":"2014-08-01T00:00:00Z"},{"volume":8559,"related_material":{"record":[{"id":"5412","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5413"},{"id":"5414","relation":"earlier_version","status":"public"},{"id":"1155","status":"public","relation":"dissertation_contains"}]},"type":"conference","date_published":"2014-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca"}],"publisher":"Springer","publist_id":"4978","date_updated":"2023-09-07T11:58:33Z","ec_funded":1,"status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"07","intvolume":"      8559","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"oa_version":"None","title":"CEGAR for qualitative analysis of probabilistic systems","publication_status":"published","quality_controlled":"1","day":"01","doi":"10.1007/978-3-319-08867-9_31","page":"473 - 490","date_created":"2018-12-11T11:55:30Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"}],"_id":"2063","conference":{"name":"CAV: Computer Aided Verification","location":"Vienna, Austria","end_date":"2014-07-22","start_date":"2014-07-18"},"abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements.","lang":"eng"}],"citation":{"ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. Vol. 8559, Springer, 2014, pp. 473–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>.","short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490."},"year":"2014"},{"date_created":"2018-12-11T11:55:30Z","_id":"2064","abstract":[{"text":"We examined the synaptic structure, quantity, and distribution of α-amino-3-hydroxy-5-methylisoxazole-4-propionic acid (AMPA)- and N-methyl-D-aspartate (NMDA)-type glutamate receptors (AMPARs and NMDARs, respectively) in rat cochlear nuclei by a highly sensitive freeze-fracture replica labeling technique. Four excitatory synapses formed by two distinct inputs, auditory nerve (AN) and parallel fibers (PF), on different cell types were analyzed. These excitatory synapse types included AN synapses on bushy cells (AN-BC synapses) and fusiform cells (AN-FC synapses) and PF synapses on FC (PF-FC synapses) and cartwheel cell spines (PF-CwC synapses). Immunogold labeling revealed differences in synaptic structure as well as AMPAR and NMDAR number and/or density in both AN and PF synapses, indicating a target-dependent organization. The immunogold receptor labeling also identified differences in the synaptic organization of FCs based on AN or PF connections, indicating an input-dependent organization in FCs. Among the four excitatory synapse types, the AN-BC synapses were the smallest and had the most densely packed intramembrane particles (IMPs), whereas the PF-CwC synapses were the largest and had sparsely packed IMPs. All four synapse types showed positive correlations between the IMP-cluster area and the AMPAR number, indicating a common intrasynapse-type relationship for glutamatergic synapses. Immunogold particles for AMPARs were distributed over the entire area of individual AN synapses; PF synapses often showed synaptic areas devoid of labeling. The gold-labeling for NMDARs occurred in a mosaic fashion, with less positive correlations between the IMP-cluster area and the NMDAR number. Our observations reveal target- and input-dependent features in the structure, number, and organization of AMPARs and NMDARs in AN and PF synapses.","lang":"eng"}],"citation":{"chicago":"Rubio, Maía, Yugo Fukazawa, Naomi Kamasawa, Cheryl Clarkson, Elek Molnár, and Ryuichi Shigemoto. “Target- and Input-Dependent Organization of AMPA and NMDA Receptors in Synaptic Connections of the Cochlear Nucleus.” <i>Journal of Comparative Neurology</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/cne.23654\">https://doi.org/10.1002/cne.23654</a>.","short":"M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, R. Shigemoto, Journal of Comparative Neurology 522 (2014) 4023–4042.","apa":"Rubio, M., Fukazawa, Y., Kamasawa, N., Clarkson, C., Molnár, E., &#38; Shigemoto, R. (2014). Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus. <i>Journal of Comparative Neurology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/cne.23654\">https://doi.org/10.1002/cne.23654</a>","mla":"Rubio, Maía, et al. “Target- and Input-Dependent Organization of AMPA and NMDA Receptors in Synaptic Connections of the Cochlear Nucleus.” <i>Journal of Comparative Neurology</i>, vol. 522, no. 18, Wiley-Blackwell, 2014, pp. 4023–42, doi:<a href=\"https://doi.org/10.1002/cne.23654\">10.1002/cne.23654</a>.","ieee":"M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, and R. Shigemoto, “Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus,” <i>Journal of Comparative Neurology</i>, vol. 522, no. 18. Wiley-Blackwell, pp. 4023–4042, 2014.","ista":"Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. 2014. Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus. Journal of Comparative Neurology. 522(18), 4023–4042.","ama":"Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus. <i>Journal of Comparative Neurology</i>. 2014;522(18):4023-4042. doi:<a href=\"https://doi.org/10.1002/cne.23654\">10.1002/cne.23654</a>"},"year":"2014","oa_version":"Submitted Version","publication_status":"published","title":"Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus","acknowledgement":"National Institutes of Health (NIH) Grant Number: 1R01DC013048‐0; Biotechnology and Biological Sciences Research Council, UK Grant Number: BB/J015938/1\r\n","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4198489/","open_access":"1"}],"doi":"10.1002/cne.23654","date_updated":"2021-01-12T06:55:05Z","publication":"Journal of Comparative Neurology","department":[{"_id":"RySh"}],"intvolume":"       522","volume":522,"oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Rubio","first_name":"Maía","full_name":"Rubio, Maía"},{"last_name":"Fukazawa","first_name":"Yugo","full_name":"Fukazawa, Yugo"},{"full_name":"Kamasawa, Naomi","first_name":"Naomi","last_name":"Kamasawa"},{"last_name":"Clarkson","first_name":"Cheryl","full_name":"Clarkson, Cheryl"},{"first_name":"Elek","last_name":"Molnár","full_name":"Molnár, Elek"},{"first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"}],"issue":"18","quality_controlled":"1","day":"29","page":"4023 - 4042","publist_id":"4974","status":"public","month":"07","language":[{"iso":"eng"}],"type":"journal_article","date_published":"2014-07-29T00:00:00Z","publisher":"Wiley-Blackwell"},{"_id":"13399","date_created":"2023-08-01T09:45:42Z","abstract":[{"text":"Nature has long inspired scientists with its seemingly unlimited ability to harness solar energy and to utilize it to drive various physiological processes. With the help of man-made molecular photoswitches, we now have the potential to outperform natural systems in many ways, with the ultimate goal of fabricating multifunctional materials that operate at different light wavelengths. An important challenge in developing light-controlled artificial molecular machines lies in attaining a detailed understanding of the photoisomerization-coupled conformational changes that occur in macromolecules and molecular assemblies. In this issue of ACS Nano, Bléger, Rabe, and co-workers use force microscopy to provide interesting insights into the behavior of individual photoresponsive molecules and to identify contraction, extension, and crawling events accompanying light-induced isomerization.","lang":"eng"}],"year":"2014","citation":{"mla":"Kundu, Pintu K., and Rafal Klajn. “Watching Single Molecules Move in Response to Light.” <i>ACS Nano</i>, vol. 8, no. 12, American Chemical Society, 2014, pp. 11913–16, doi:<a href=\"https://doi.org/10.1021/nn506656r\">10.1021/nn506656r</a>.","short":"P.K. Kundu, R. Klajn, ACS Nano 8 (2014) 11913–11916.","apa":"Kundu, P. K., &#38; Klajn, R. (2014). Watching single molecules move in response to light. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/nn506656r\">https://doi.org/10.1021/nn506656r</a>","chicago":"Kundu, Pintu K., and Rafal Klajn. “Watching Single Molecules Move in Response to Light.” <i>ACS Nano</i>. American Chemical Society, 2014. <a href=\"https://doi.org/10.1021/nn506656r\">https://doi.org/10.1021/nn506656r</a>.","ieee":"P. K. Kundu and R. Klajn, “Watching single molecules move in response to light,” <i>ACS Nano</i>, vol. 8, no. 12. American Chemical Society, pp. 11913–11916, 2014.","ista":"Kundu PK, Klajn R. 2014. Watching single molecules move in response to light. ACS Nano. 8(12), 11913–11916.","ama":"Kundu PK, Klajn R. Watching single molecules move in response to light. <i>ACS Nano</i>. 2014;8(12):11913-11916. doi:<a href=\"https://doi.org/10.1021/nn506656r\">10.1021/nn506656r</a>"},"oa_version":"None","article_processing_charge":"No","publication_status":"published","title":"Watching single molecules move in response to light","article_type":"original","publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"doi":"10.1021/nn506656r","scopus_import":"1","publication":"ACS Nano","date_updated":"2023-08-08T07:18:58Z","intvolume":"         8","volume":8,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Kundu, Pintu K.","first_name":"Pintu K.","last_name":"Kundu"},{"first_name":"Rafal","last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal"}],"issue":"12","quality_controlled":"1","day":"23","page":"11913-11916","status":"public","month":"12","keyword":["General Physics and Astronomy","General Engineering","General Materials Science"],"extern":"1","language":[{"iso":"eng"}],"external_id":{"pmid":["25474733"]},"date_published":"2014-12-23T00:00:00Z","type":"journal_article","publisher":"American Chemical Society","pmid":1},{"pmid":1,"publisher":"American Association for the Advancement of Science","type":"journal_article","date_published":"2014-07-24T00:00:00Z","external_id":{"pmid":["25061133"]},"extern":"1","keyword":["Multidisciplinary"],"language":[{"iso":"eng"}],"status":"public","month":"07","day":"24","page":"1149-1153","quality_controlled":"1","issue":"6201","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Gurvinder","last_name":"Singh","full_name":"Singh, Gurvinder"},{"last_name":"Chan","first_name":"Henry","full_name":"Chan, Henry"},{"first_name":"Artem","last_name":"Baskin","full_name":"Baskin, Artem"},{"full_name":"Gelman, Elijah","last_name":"Gelman","first_name":"Elijah"},{"full_name":"Repnin, Nikita","first_name":"Nikita","last_name":"Repnin"},{"last_name":"Král","first_name":"Petr","full_name":"Král, Petr"},{"first_name":"Rafal","last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal"}],"volume":345,"intvolume":"       345","date_updated":"2023-08-08T07:23:05Z","publication":"Science","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"article_type":"original","scopus_import":"1","doi":"10.1126/science.1254132","article_processing_charge":"No","oa_version":"None","title":"Self-assembly of magnetite nanocubes into helical superstructures","publication_status":"published","abstract":[{"text":"Organizing inorganic nanocrystals into complex architectures is challenging and typically relies on preexisting templates, such as properly folded DNA or polypeptide chains. We found that under carefully controlled conditions, cubic nanocrystals of magnetite self-assemble into arrays of helical superstructures in a template-free manner with >99% yield. Computer simulations revealed that the formation of helices is determined by the interplay of van der Waals and magnetic dipole-dipole interactions, Zeeman coupling, and entropic forces and can be attributed to spontaneous formation of chiral nanocube clusters. Neighboring helices within their densely packed ensembles tended to adopt the same handedness in order to maximize packing, thus revealing a novel mechanism of symmetry breaking and chirality amplification.","lang":"eng"}],"citation":{"ama":"Singh G, Chan H, Baskin A, et al. Self-assembly of magnetite nanocubes into helical superstructures. <i>Science</i>. 2014;345(6201):1149-1153. doi:<a href=\"https://doi.org/10.1126/science.1254132\">10.1126/science.1254132</a>","ista":"Singh G, Chan H, Baskin A, Gelman E, Repnin N, Král P, Klajn R. 2014. Self-assembly of magnetite nanocubes into helical superstructures. Science. 345(6201), 1149–1153.","ieee":"G. Singh <i>et al.</i>, “Self-assembly of magnetite nanocubes into helical superstructures,” <i>Science</i>, vol. 345, no. 6201. American Association for the Advancement of Science, pp. 1149–1153, 2014.","short":"G. Singh, H. Chan, A. Baskin, E. Gelman, N. Repnin, P. Král, R. Klajn, Science 345 (2014) 1149–1153.","chicago":"Singh, Gurvinder, Henry Chan, Artem Baskin, Elijah Gelman, Nikita Repnin, Petr Král, and Rafal Klajn. “Self-Assembly of Magnetite Nanocubes into Helical Superstructures.” <i>Science</i>. American Association for the Advancement of Science, 2014. <a href=\"https://doi.org/10.1126/science.1254132\">https://doi.org/10.1126/science.1254132</a>.","apa":"Singh, G., Chan, H., Baskin, A., Gelman, E., Repnin, N., Král, P., &#38; Klajn, R. (2014). Self-assembly of magnetite nanocubes into helical superstructures. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1254132\">https://doi.org/10.1126/science.1254132</a>","mla":"Singh, Gurvinder, et al. “Self-Assembly of Magnetite Nanocubes into Helical Superstructures.” <i>Science</i>, vol. 345, no. 6201, American Association for the Advancement of Science, 2014, pp. 1149–53, doi:<a href=\"https://doi.org/10.1126/science.1254132\">10.1126/science.1254132</a>."},"year":"2014","date_created":"2023-08-01T09:45:56Z","_id":"13400"},{"author":[{"full_name":"Kundu, Pintu K.","last_name":"Kundu","first_name":"Pintu K."},{"first_name":"Avishai","last_name":"Lerner","full_name":"Lerner, Avishai"},{"first_name":"Kristina","last_name":"Kučanda","full_name":"Kučanda, Kristina"},{"last_name":"Leitus","first_name":"Gregory","full_name":"Leitus, Gregory"},{"first_name":"Rafal","last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":136,"intvolume":"       136","date_updated":"2023-08-08T07:25:37Z","publication":"Journal of the American Chemical Society","scopus_import":"1","doi":"10.1021/ja505948q","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"article_type":"original","title":"Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran","publication_status":"published","article_processing_charge":"No","oa_version":"None","citation":{"chicago":"Kundu, Pintu K., Avishai Lerner, Kristina Kučanda, Gregory Leitus, and Rafal Klajn. “Cyclic Kinetics during Thermal Equilibration of an Axially Chiral Bis-Spiropyran.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2014. <a href=\"https://doi.org/10.1021/ja505948q\">https://doi.org/10.1021/ja505948q</a>.","short":"P.K. Kundu, A. Lerner, K. Kučanda, G. Leitus, R. Klajn, Journal of the American Chemical Society 136 (2014) 11276–11279.","apa":"Kundu, P. K., Lerner, A., Kučanda, K., Leitus, G., &#38; Klajn, R. (2014). Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/ja505948q\">https://doi.org/10.1021/ja505948q</a>","mla":"Kundu, Pintu K., et al. “Cyclic Kinetics during Thermal Equilibration of an Axially Chiral Bis-Spiropyran.” <i>Journal of the American Chemical Society</i>, vol. 136, no. 32, American Chemical Society, 2014, pp. 11276–79, doi:<a href=\"https://doi.org/10.1021/ja505948q\">10.1021/ja505948q</a>.","ista":"Kundu PK, Lerner A, Kučanda K, Leitus G, Klajn R. 2014. Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran. Journal of the American Chemical Society. 136(32), 11276–11279.","ieee":"P. K. Kundu, A. Lerner, K. Kučanda, G. Leitus, and R. Klajn, “Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran,” <i>Journal of the American Chemical Society</i>, vol. 136, no. 32. American Chemical Society, pp. 11276–11279, 2014.","ama":"Kundu PK, Lerner A, Kučanda K, Leitus G, Klajn R. Cyclic kinetics during thermal equilibration of an axially chiral bis-spiropyran. <i>Journal of the American Chemical Society</i>. 2014;136(32):11276-11279. doi:<a href=\"https://doi.org/10.1021/ja505948q\">10.1021/ja505948q</a>"},"year":"2014","abstract":[{"lang":"eng","text":"A compound combining the features of a molecular rotor and a photoswitch was synthesized and was shown to exist as three diastereomers, which interconvert via a reversible cyclic reaction scheme. Each of the three diastereomers was isolated, and by following the equilibration kinetics, activation barriers for all reactions were calculated. The results indicate that the properties of molecular switches depend heavily on their immediate chemical environment. The conclusions are important in the context of designing new switchable molecules and materials."}],"date_created":"2023-08-01T09:46:12Z","_id":"13401","pmid":1,"publisher":"American Chemical Society","type":"journal_article","date_published":"2014-08-13T00:00:00Z","external_id":{"pmid":["25072292"]},"language":[{"iso":"eng"}],"extern":"1","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"month":"08","status":"public","page":"11276-11279","day":"13","quality_controlled":"1","issue":"32"},{"oa_version":"Published Version","article_processing_charge":"No","title":"Nanoporous frameworks exhibiting multiple stimuli responsiveness","publication_status":"published","article_type":"original","publication_identifier":{"eissn":["2041-1723"]},"doi":"10.1038/ncomms4588","main_file_link":[{"url":"https://doi.org/10.1038/ncomms4588","open_access":"1"}],"scopus_import":"1","_id":"13402","date_created":"2023-08-01T09:46:27Z","abstract":[{"lang":"eng","text":"Nanoporous frameworks are polymeric materials built from rigid molecules, which give rise to their nanoporous structures with applications in gas sorption and storage, catalysis and others. Conceptually new applications could emerge, should these beneficial properties be manipulated by external stimuli in a reversible manner. One approach to render nanoporous frameworks responsive to external signals would be to immobilize molecular switches within their nanopores. Although the majority of molecular switches require conformational freedom to isomerize, and switching in the solid state is prohibited, the nanopores may provide enough room for the switches to efficiently isomerize. Here we describe two families of nanoporous materials incorporating the spiropyran molecular switch. These materials exhibit a variety of interesting properties, including reversible photochromism and acidochromism under solvent-free conditions, light-controlled capture and release of metal ions, as well reversible chromism induced by solvation/desolvation."}],"article_number":"3588","year":"2014","citation":{"chicago":"Kundu, Pintu K., Gregory L. Olsen, Vladimir Kiss, and Rafal Klajn. “Nanoporous Frameworks Exhibiting Multiple Stimuli Responsiveness.” <i>Nature Communications</i>. Springer Nature, 2014. <a href=\"https://doi.org/10.1038/ncomms4588\">https://doi.org/10.1038/ncomms4588</a>.","apa":"Kundu, P. K., Olsen, G. L., Kiss, V., &#38; Klajn, R. (2014). Nanoporous frameworks exhibiting multiple stimuli responsiveness. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/ncomms4588\">https://doi.org/10.1038/ncomms4588</a>","short":"P.K. Kundu, G.L. Olsen, V. Kiss, R. Klajn, Nature Communications 5 (2014).","mla":"Kundu, Pintu K., et al. “Nanoporous Frameworks Exhibiting Multiple Stimuli Responsiveness.” <i>Nature Communications</i>, vol. 5, 3588, Springer Nature, 2014, doi:<a href=\"https://doi.org/10.1038/ncomms4588\">10.1038/ncomms4588</a>.","ista":"Kundu PK, Olsen GL, Kiss V, Klajn R. 2014. Nanoporous frameworks exhibiting multiple stimuli responsiveness. Nature Communications. 5, 3588.","ieee":"P. K. Kundu, G. L. Olsen, V. Kiss, and R. Klajn, “Nanoporous frameworks exhibiting multiple stimuli responsiveness,” <i>Nature Communications</i>, vol. 5. Springer Nature, 2014.","ama":"Kundu PK, Olsen GL, Kiss V, Klajn R. Nanoporous frameworks exhibiting multiple stimuli responsiveness. <i>Nature Communications</i>. 2014;5. doi:<a href=\"https://doi.org/10.1038/ncomms4588\">10.1038/ncomms4588</a>"},"oa":1,"volume":5,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Kundu, Pintu K.","first_name":"Pintu K.","last_name":"Kundu"},{"full_name":"Olsen, Gregory L.","last_name":"Olsen","first_name":"Gregory L."},{"first_name":"Vladimir","last_name":"Kiss","full_name":"Kiss, Vladimir"},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal","first_name":"Rafal","last_name":"Klajn"}],"publication":"Nature Communications","date_updated":"2023-08-08T07:28:10Z","intvolume":"         5","quality_controlled":"1","day":"07","external_id":{"pmid":["24709950"]},"date_published":"2014-04-07T00:00:00Z","type":"journal_article","publisher":"Springer Nature","pmid":1,"status":"public","month":"04","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"extern":"1","language":[{"iso":"eng"}]}]