[{"citation":{"ama":"Kicheva A, Bollenbach MT, Ribeiro A, et al. Coordination of progenitor specification and growth in mouse and chick spinal cord. Science. 2014;345(6204). doi:10.1126/science.1254927","short":"A. Kicheva, M.T. Bollenbach, A. Ribeiro, H. Pérez Valle, R. Lovell Badge, V. Episkopou, J. Briscoe, Science 345 (2014).","ista":"Kicheva A, Bollenbach MT, Ribeiro A, Pérez Valle H, Lovell Badge R, Episkopou V, Briscoe J. 2014. Coordination of progenitor specification and growth in mouse and chick spinal cord. Science. 345(6204), 1254927.","ieee":"A. Kicheva et al., “Coordination of progenitor specification and growth in mouse and chick spinal cord,” Science, vol. 345, no. 6204. American Association for the Advancement of Science, 2014.","apa":"Kicheva, A., Bollenbach, M. T., Ribeiro, A., Pérez Valle, H., Lovell Badge, R., Episkopou, V., & Briscoe, J. (2014). Coordination of progenitor specification and growth in mouse and chick spinal cord. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1254927","chicago":"Kicheva, Anna, Mark Tobias Bollenbach, Ana Ribeiro, Helena Pérez Valle, Robin Lovell Badge, Vasso Episkopou, and James Briscoe. “Coordination of Progenitor Specification and Growth in Mouse and Chick Spinal Cord.” Science. American Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1254927.","mla":"Kicheva, Anna, et al. “Coordination of Progenitor Specification and Growth in Mouse and Chick Spinal Cord.” Science, vol. 345, no. 6204, 1254927, American Association for the Advancement of Science, 2014, doi:10.1126/science.1254927."},"day":"26","department":[{"_id":"ToBo"}],"month":"09","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5011","date_published":"2014-09-26T00:00:00Z","date_created":"2018-12-11T11:55:22Z","oa_version":"Submitted Version","scopus_import":1,"publisher":"American Association for the Advancement of Science","intvolume":" 345","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4228193/"}],"volume":345,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Coordination of progenitor specification and growth in mouse and chick spinal cord","oa":1,"author":[{"last_name":"Kicheva","full_name":"Kicheva, Anna","first_name":"Anna"},{"full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias","orcid":"0000-0003-4398-476X"},{"first_name":"Ana","last_name":"Ribeiro","full_name":"Ribeiro, Ana"},{"first_name":"Helena","full_name":"Pérez Valle, Helena","last_name":"Pérez Valle"},{"full_name":"Lovell Badge, Robin","last_name":"Lovell Badge","first_name":"Robin"},{"full_name":"Episkopou, Vasso","last_name":"Episkopou","first_name":"Vasso"},{"full_name":"Briscoe, James","last_name":"Briscoe","first_name":"James"}],"_id":"2040","abstract":[{"text":"Development requires tissue growth as well as cell diversification. To address how these processes are coordinated, we analyzed the development of molecularly distinct domains of neural progenitors in the mouse and chick neural tube. We show that during development, these domains undergo changes in size that do not scale with changes in overall tissue size. Our data show that domain proportions are first established by opposing morphogen gradients and subsequently controlled by domain-specific regulation of differentiation rate but not differences in proliferation rate. Regulation of differentiation rate is key to maintaining domain proportions while accommodating both intra- and interspecies variations in size. Thus, the sequential control of progenitor specification and differentiation elaborates pattern without requiring that signaling gradients grow as tissues expand. ","lang":"eng"}],"year":"2014","issue":"6204","doi":"10.1126/science.1254927","publication":"Science","date_updated":"2021-01-12T06:54:55Z","status":"public","publication_status":"published","article_number":"1254927"},{"author":[{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas"},{"first_name":"John","full_name":"Lisman, John","last_name":"Lisman"}],"title":"Structure, function and plasticity of hippocampal dentate gyrus microcircuits","_id":"2041","abstract":[{"text":"The hippocampus mediates several higher brain functions, such as learning, memory, and spatial coding. The input region of the hippocampus, the dentate gyrus, plays a critical role in these processes. Several lines of evidence suggest that the dentate gyrus acts as a preprocessor of incoming information, preparing it for subsequent processing in CA3. For example, the dentate gyrus converts input from the entorhinal cortex, where cells have multiple spatial fields, into the spatially more specific place cell activity characteristic of the CA3 region. Furthermore, the dentate gyrus is involved in pattern separation, transforming relatively similar input patterns into substantially different output patterns. Finally, the dentate gyrus produces a very sparse coding scheme in which only a very small fraction of neurons are active at any one time.","lang":"eng"}],"doi":"10.3389/fncir.2014.00107","publication_status":"published","status":"public","day":"10","pubrep_id":"424","citation":{"mla":"Jonas, Peter M., and John Lisman. “Structure, Function and Plasticity of Hippocampal Dentate Gyrus Microcircuits.” Frontiers in Neural Circuits, vol. 8, 2p, Frontiers Research Foundation, 2014, doi:10.3389/fncir.2014.00107.","chicago":"Jonas, Peter M, and John Lisman. “Structure, Function and Plasticity of Hippocampal Dentate Gyrus Microcircuits.” Frontiers in Neural Circuits. Frontiers Research Foundation, 2014. https://doi.org/10.3389/fncir.2014.00107.","apa":"Jonas, P. M., & Lisman, J. (2014). Structure, function and plasticity of hippocampal dentate gyrus microcircuits. Frontiers in Neural Circuits. Frontiers Research Foundation. https://doi.org/10.3389/fncir.2014.00107","ieee":"P. M. Jonas and J. Lisman, “Structure, function and plasticity of hippocampal dentate gyrus microcircuits,” Frontiers in Neural Circuits, vol. 8. Frontiers Research Foundation, 2014.","short":"P.M. Jonas, J. Lisman, Frontiers in Neural Circuits 8 (2014).","ista":"Jonas PM, Lisman J. 2014. Structure, function and plasticity of hippocampal dentate gyrus microcircuits. Frontiers in Neural Circuits. 8, 2p.","ama":"Jonas PM, Lisman J. Structure, function and plasticity of hippocampal dentate gyrus microcircuits. Frontiers in Neural Circuits. 2014;8. doi:10.3389/fncir.2014.00107"},"month":"09","file_date_updated":"2020-07-14T12:45:26Z","ddc":["570"],"oa_version":"Published Version","file":[{"file_name":"IST-2016-424-v1+1_fncir-08-00107.pdf","creator":"system","relation":"main_file","file_size":201110,"access_level":"open_access","checksum":"3ca57b164045523f876407e9f13a9fb8","content_type":"application/pdf","date_updated":"2020-07-14T12:45:26Z","file_id":"5294","date_created":"2018-12-12T10:17:38Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","volume":8,"oa":1,"year":"2014","publication":"Frontiers in Neural Circuits","date_updated":"2021-01-12T06:54:55Z","article_number":"2p","department":[{"_id":"PeJo"}],"publist_id":"5010","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2014-09-10T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:55:22Z","intvolume":" 8","publisher":"Frontiers Research Foundation","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}]},{"publication_status":"published","status":"public","doi":"10.1186/1471-2164-15-663","issue":"1","abstract":[{"text":"Background: CRISPR is a microbial immune system likely to be involved in host-parasite coevolution. It functions using target sequences encoded by the bacterial genome, which interfere with invading nucleic acids using a homology-dependent system. The system also requires protospacer associated motifs (PAMs), short motifs close to the target sequence that are required for interference in CRISPR types I and II. Here, we investigate whether PAMs are depleted in phage genomes due to selection pressure to escape recognition.Results: To this end, we analyzed two data sets. Phages infecting all bacterial hosts were analyzed first, followed by a detailed analysis of phages infecting the genus Streptococcus, where PAMs are best understood. We use two different measures of motif underrepresentation that control for codon bias and the frequency of submotifs. We compare phages infecting species with a particular CRISPR type to those infecting species without that type. Since only known PAMs were investigated, the analysis is restricted to CRISPR types I-C and I-E and in Streptococcus to types I-C and II. We found evidence for PAM depletion in Streptococcus phages infecting hosts with CRISPR type I-C, in Vibrio phages infecting hosts with CRISPR type I-E and in Streptococcus thermopilus phages infecting hosts with type II-A, known as CRISPR3.Conclusions: The observed motif depletion in phages with hosts having CRISPR can be attributed to selection rather than to mutational bias, as mutational bias should affect the phages of all hosts. This observation implies that the CRISPR system has been efficient in the groups discussed here.","lang":"eng"}],"_id":"2042","author":[{"full_name":"Kupczok, Anne","last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Anne"},{"last_name":"Bollback","full_name":"Bollback, Jonathan P","first_name":"Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612"}],"title":"Motif depletion in bacteriophages infecting hosts with CRISPR systems","volume":15,"has_accepted_license":"1","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"file":[{"file_name":"IST-2015-396-v1+1_1471-2164-15-663.pdf","relation":"main_file","creator":"system","file_size":1489769,"access_level":"open_access","checksum":"3f6d2776b90a842a28359cc957d3d04b","content_type":"application/pdf","date_updated":"2020-07-14T12:45:26Z","file_id":"4878","date_created":"2018-12-12T10:11:24Z"}],"oa_version":"Published Version","license":"https://creativecommons.org/publicdomain/zero/1.0/","file_date_updated":"2020-07-14T12:45:26Z","month":"08","ddc":["570"],"day":"08","citation":{"mla":"Kupczok, Anne, and Jonathan P. Bollback. “Motif Depletion in Bacteriophages Infecting Hosts with CRISPR Systems.” BMC Genomics, vol. 15, no. 1, 663, BioMed Central, 2014, doi:10.1186/1471-2164-15-663.","chicago":"Kupczok, Anne, and Jonathan P Bollback. “Motif Depletion in Bacteriophages Infecting Hosts with CRISPR Systems.” BMC Genomics. BioMed Central, 2014. https://doi.org/10.1186/1471-2164-15-663.","apa":"Kupczok, A., & Bollback, J. P. (2014). Motif depletion in bacteriophages infecting hosts with CRISPR systems. BMC Genomics. BioMed Central. https://doi.org/10.1186/1471-2164-15-663","ieee":"A. Kupczok and J. P. Bollback, “Motif depletion in bacteriophages infecting hosts with CRISPR systems,” BMC Genomics, vol. 15, no. 1. BioMed Central, 2014.","short":"A. Kupczok, J.P. Bollback, BMC Genomics 15 (2014).","ama":"Kupczok A, Bollback JP. Motif depletion in bacteriophages infecting hosts with CRISPR systems. BMC Genomics. 2014;15(1). doi:10.1186/1471-2164-15-663","ista":"Kupczok A, Bollback JP. 2014. Motif depletion in bacteriophages infecting hosts with CRISPR systems. BMC Genomics. 15(1), 663."},"pubrep_id":"396","article_number":"663","date_updated":"2021-01-12T06:54:56Z","publication":"BMC Genomics","year":"2014","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 15","publisher":"BioMed Central","scopus_import":1,"date_created":"2018-12-11T11:55:23Z","date_published":"2014-08-08T00:00:00Z","publist_id":"5009","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JoBo"}]},{"citation":{"mla":"Bauer, Ulrich, et al. “Distributed Computation of Persistent Homology.” Proceedings of the Workshop on Algorithm Engineering and Experiments, edited by Catherine McGeoch and Ulrich Meyer, Society of Industrial and Applied Mathematics, 2014, pp. 31–38, doi:10.1137/1.9781611973198.4.","chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Distributed Computation of Persistent Homology.” In Proceedings of the Workshop on Algorithm Engineering and Experiments, edited by Catherine McGeoch and Ulrich Meyer, 31–38. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973198.4.","apa":"Bauer, U., Kerber, M., & Reininghaus, J. (2014). Distributed computation of persistent homology. In C. McGeoch & U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 31–38). Portland, USA: Society of Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973198.4","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Distributed computation of persistent homology,” in Proceedings of the Workshop on Algorithm Engineering and Experiments, Portland, USA, 2014, pp. 31–38.","ama":"Bauer U, Kerber M, Reininghaus J. Distributed computation of persistent homology. In: McGeoch C, Meyer U, eds. Proceedings of the Workshop on Algorithm Engineering and Experiments. Society of Industrial and Applied Mathematics; 2014:31-38. doi:10.1137/1.9781611973198.4","short":"U. Bauer, M. Kerber, J. Reininghaus, in:, C. McGeoch, U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2014, pp. 31–38.","ista":"Bauer U, Kerber M, Reininghaus J. 2014. Distributed computation of persistent homology. Proceedings of the Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, 31–38."},"day":"01","month":"01","oa_version":"Submitted Version","conference":{"end_date":"2014-01-05","location":"Portland, USA","start_date":"2014-01-05","name":"ALENEX: Algorithm Engineering and Experiments"},"title":"Distributed computation of persistent homology","author":[{"orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","full_name":"Bauer, Ulrich","last_name":"Bauer"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael"},{"full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"editor":[{"first_name":"Catherine","last_name":" McGeoch","full_name":" McGeoch, Catherine"},{"last_name":"Meyer","full_name":"Meyer, Ulrich","first_name":"Ulrich"}],"_id":"2043","abstract":[{"text":"Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically – as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems [1], we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits the computation of much larger instances than on a single machine. Moreover, we observe that the parallelism at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms. In our experiments, we were able to compute the persistent homology of filtrations with more than a billion (109) elements within seconds on a cluster with 32 nodes using less than 6GB of memory per node.","lang":"eng"}],"doi":"10.1137/1.9781611973198.4","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"status":"public","publication_status":"published","ec_funded":1,"department":[{"_id":"HeEd"}],"publist_id":"5008","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-11T11:55:23Z","scopus_import":1,"publisher":"Society of Industrial and Applied Mathematics","main_file_link":[{"url":"http://arxiv.org/abs/1310.0710","open_access":"1"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","oa":1,"year":"2014","publication":"Proceedings of the Workshop on Algorithm Engineering and Experiments","date_updated":"2021-01-12T06:54:56Z","page":"31 - 38"},{"oa":1,"year":"2014","date_updated":"2021-01-12T06:54:56Z","publication":"Topological Methods in Data Analysis and Visualization III","page":"103 - 117","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5007","department":[{"_id":"HeEd"}],"scopus_import":1,"date_created":"2018-12-11T11:55:23Z","date_published":"2014-03-19T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.0477"}],"publisher":"Springer","series_title":"Mathematics and Visualization","quality_controlled":"1","language":[{"iso":"eng"}],"type":"book_chapter","_id":"2044","editor":[{"first_name":"Peer-Timo","last_name":"Bremer","full_name":"Bremer, Peer-Timo"},{"last_name":"Hotz","full_name":"Hotz, Ingrid","first_name":"Ingrid"},{"full_name":"Pascucci, Valerio","last_name":"Pascucci","first_name":"Valerio"},{"full_name":"Peikert, Ronald","last_name":"Peikert","first_name":"Ronald"}],"author":[{"full_name":"Bauer, Ulrich","last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","orcid":"0000-0002-9683-0724"},{"last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael","orcid":"0000-0002-8030-9299"},{"first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus","full_name":"Reininghaus, Jan"}],"title":"Clear and Compress: Computing Persistent Homology in Chunks","doi":"10.1007/978-3-319-04099-8_7","abstract":[{"text":"We present a parallel algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which uses discrete Morse Theory to compute persistence; we derive the same worst-case complexity bound in a more general context. The algorithm employs several practical optimization techniques, which are of independent interest. Our sequential implementation of the algorithm is competitive with state-of-the-art methods, and we further improve the performance through parallel computation.","lang":"eng"}],"project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"status":"public","publication_status":"published","month":"03","day":"19","citation":{"apa":"Bauer, U., Kerber, M., & Reininghaus, J. (2014). Clear and Compress: Computing Persistent Homology in Chunks. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (pp. 103–117). Springer. https://doi.org/10.1007/978-3-319-04099-8_7","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent Homology in Chunks,” in Topological Methods in Data Analysis and Visualization III, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Springer, 2014, pp. 103–117.","ama":"Bauer U, Kerber M, Reininghaus J. Clear and Compress: Computing Persistent Homology in Chunks. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III. Mathematics and Visualization. Springer; 2014:103-117. doi:10.1007/978-3-319-04099-8_7","ista":"Bauer U, Kerber M, Reininghaus J. 2014.Clear and Compress: Computing Persistent Homology in Chunks. In: Topological Methods in Data Analysis and Visualization III. , 103–117.","short":"U. Bauer, M. Kerber, J. Reininghaus, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III, Springer, 2014, pp. 103–117.","mla":"Bauer, Ulrich, et al. “Clear and Compress: Computing Persistent Homology in Chunks.” Topological Methods in Data Analysis and Visualization III, edited by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:10.1007/978-3-319-04099-8_7.","chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Clear and Compress: Computing Persistent Homology in Chunks.” In Topological Methods in Data Analysis and Visualization III, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 103–17. Mathematics and Visualization. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_7."},"oa_version":"Submitted Version"},{"volume":8383,"oa_version":"Submitted Version","conference":{"start_date":"2014-03-26","location":"Buenos Aires, Argentina","end_date":"2014-03-28","name":"PKC: Public Key Crypography"},"month":"01","citation":{"ieee":"D. Dachman Soled, G. Fuchsbauer, P. Mohassel, and A. O’Neill, “Enhanced chosen-ciphertext security and applications,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Buenos Aires, Argentina, 2014, vol. 8383, pp. 329–344.","apa":"Dachman Soled, D., Fuchsbauer, G., Mohassel, P., & O’Neill, A. (2014). Enhanced chosen-ciphertext security and applications. In H. Krawczyk (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383, pp. 329–344). Buenos Aires, Argentina: Springer. https://doi.org/10.1007/978-3-642-54631-0_19","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.","ama":"Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. Enhanced chosen-ciphertext security and applications. In: Krawczyk H, ed. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8383. Springer; 2014:329-344. doi:10.1007/978-3-642-54631-0_19","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 Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:329–44. Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_19.","mla":"Dachman Soled, Dana, et al. “Enhanced Chosen-Ciphertext Security and Applications.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 329–44, doi:10.1007/978-3-642-54631-0_19."},"day":"01","ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"The second author was supported by EPSRC grant EP/H043454/1.","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"doi":"10.1007/978-3-642-54631-0_19","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"}],"editor":[{"last_name":"Krawczyk","full_name":"Krawczyk, Hugo","first_name":"Hugo"}],"_id":"2045","title":"Enhanced chosen-ciphertext security and applications","author":[{"full_name":"Dachman Soled, Dana","last_name":"Dachman Soled","first_name":"Dana"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer"},{"last_name":"Mohassel","full_name":"Mohassel, Payman","first_name":"Payman"},{"full_name":"O’Neill, Adam","last_name":"O’Neill","first_name":"Adam"}],"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Springer","intvolume":" 8383","main_file_link":[{"url":"https://eprint.iacr.org/2012/543","open_access":"1"}],"date_created":"2018-12-11T11:55:24Z","scopus_import":1,"date_published":"2014-01-01T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5006","department":[{"_id":"KrPi"}],"page":"329 - 344","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)","year":"2014","alternative_title":["LNCS"],"oa":1},{"oa":1,"year":"2014","alternative_title":["LNCS"],"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)","page":"520 - 537","publist_id":"5005","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"scopus_import":1,"date_created":"2018-12-11T11:55:24Z","date_published":"2014-01-01T00:00:00Z","main_file_link":[{"url":"https://eprint.iacr.org/2013/413","open_access":"1"}],"intvolume":" 8383","publisher":"Springer","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"editor":[{"first_name":"Hugo","full_name":"Krawczyk, Hugo","last_name":"Krawczyk"}],"_id":"2046","author":[{"last_name":"Bellare","full_name":"Bellare, Mihir","first_name":"Mihir"},{"last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"}],"title":"Policy-based signatures","doi":"10.1007/978-3-642-54631-0_30","abstract":[{"lang":"eng","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."}],"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"ec_funded":1,"acknowledgement":"Part of his work was done while at Bristol University, supported by EPSRC grant EP/H043454/1.","status":"public","publication_status":"published","month":"01","day":"01","citation":{"ieee":"M. Bellare and G. Fuchsbauer, “Policy-based signatures,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Buenos Aires, Argentina, 2014, vol. 8383, pp. 520–537.","apa":"Bellare, M., & Fuchsbauer, G. (2014). Policy-based signatures. In H. Krawczyk (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383, pp. 520–537). Buenos Aires, Argentina: Springer. https://doi.org/10.1007/978-3-642-54631-0_30","ama":"Bellare M, Fuchsbauer G. Policy-based signatures. In: Krawczyk H, ed. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8383. Springer; 2014:520-537. doi:10.1007/978-3-642-54631-0_30","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.","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.","mla":"Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 520–37, doi:10.1007/978-3-642-54631-0_30.","chicago":"Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:520–37. Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_30."},"conference":{"end_date":"2014-05-28","start_date":"2014-05-26","location":"Buenos Aires, Argentina","name":"PKC: Public Key Crypography"},"oa_version":"Submitted Version","volume":8383},{"oa":1,"year":"2014","alternative_title":["LNCS"],"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)","page":"170 - 184","publist_id":"5004","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"},{"_id":"CaUh"}],"date_created":"2018-12-11T11:55:24Z","scopus_import":1,"date_published":"2014-01-01T00:00:00Z","external_id":{"arxiv":["1407.8067"]},"publisher":"Springer","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.8067"}],"intvolume":" 8744","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"2047","editor":[{"full_name":"Domingo Ferrer, Josep","last_name":"Domingo Ferrer","first_name":"Josep"}],"title":"Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases","author":[{"first_name":"Fei","full_name":"Yu, Fei","last_name":"Yu"},{"full_name":"Rybar, Michal","last_name":"Rybar","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","full_name":"Uhler, Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216"},{"full_name":"Fienberg, Stephen","last_name":"Fienberg","first_name":"Stephen"}],"doi":"10.1007/978-3-319-11257-2_14","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."}],"project":[{"_id":"25636330-B435-11E9-9278-68D0E5697425","grant_number":"11-NSF-1070","name":"ROOTS Genome-wide Analysis of Root Traits"}],"publication_status":"published","status":"public","acknowledgement":"This research was partially supported by BCS- 0941518 to the Department of Statistics at Carnegie Mellon University.","month":"01","citation":{"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. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8744. Springer; 2014:170-184. doi:10.1007/978-3-319-11257-2_14","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.","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.","apa":"Yu, F., Rybar, M., Uhler, C., & Fienberg, S. (2014). Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8744, pp. 170–184). Ibiza, Spain: Springer. https://doi.org/10.1007/978-3-319-11257-2_14","ieee":"F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Ibiza, Spain, 2014, vol. 8744, pp. 170–184.","mla":"Yu, Fei, et al. “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), edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:10.1007/978-3-319-11257-2_14.","chicago":"Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep Domingo Ferrer, 8744:170–84. Springer, 2014. https://doi.org/10.1007/978-3-319-11257-2_14."},"day":"01","oa_version":"Submitted Version","conference":{"start_date":"2014-09-17","location":"Ibiza, Spain","end_date":"2014-09-19","name":"PSD: Privacy in Statistical Databases"},"arxiv":1,"volume":8744},{"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Cambridge University Press","main_file_link":[{"url":"https://arxiv.org/abs/1508.06546","open_access":"1"}],"intvolume":" 738","date_created":"2018-12-11T11:55:25Z","scopus_import":1,"external_id":{"arxiv":["1508.06546"]},"date_published":"2014-01-10T00:00:00Z","publist_id":"5001","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BjHo"}],"page":"463 - 491","date_updated":"2021-01-12T06:54:59Z","publication":"Journal of Fluid Mechanics","year":"2014","oa":1,"article_processing_charge":"No","volume":738,"arxiv":1,"oa_version":"Submitted Version","month":"01","citation":{"chicago":"Kühnen, Jakob, Markus Holzner, Björn Hof, and Hendrik Kuhlmann. “Experimental Investigation of Transitional Flow in a Toroidal Pipe.” Journal of Fluid Mechanics. Cambridge University Press, 2014. https://doi.org/10.1017/jfm.2013.603.","mla":"Kühnen, Jakob, et al. “Experimental Investigation of Transitional Flow in a Toroidal Pipe.” Journal of Fluid Mechanics, vol. 738, Cambridge University Press, 2014, pp. 463–91, doi:10.1017/jfm.2013.603.","ieee":"J. Kühnen, M. Holzner, B. Hof, and H. Kuhlmann, “Experimental investigation of transitional flow in a toroidal pipe,” Journal of Fluid Mechanics, vol. 738. Cambridge University Press, pp. 463–491, 2014.","apa":"Kühnen, J., Holzner, M., Hof, B., & Kuhlmann, H. (2014). Experimental investigation of transitional flow in a toroidal pipe. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2013.603","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.","ama":"Kühnen J, Holzner M, Hof B, Kuhlmann H. Experimental investigation of transitional flow in a toroidal pipe. Journal of Fluid Mechanics. 2014;738:463-491. doi:10.1017/jfm.2013.603","short":"J. Kühnen, M. Holzner, B. Hof, H. Kuhlmann, Journal of Fluid Mechanics 738 (2014) 463–491."},"day":"10","publication_status":"published","status":"public","doi":"10.1017/jfm.2013.603","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."}],"_id":"2050","title":"Experimental investigation of transitional flow in a toroidal pipe","author":[{"full_name":"Kühnen, Jakob","last_name":"Kühnen","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","first_name":"Jakob","orcid":"0000-0003-4312-0179"},{"full_name":"Holzner, Markus","last_name":"Holzner","first_name":"Markus"},{"orcid":"0000-0003-2057-2754","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","full_name":"Hof, Björn"},{"first_name":"Hendrik","last_name":"Kuhlmann","full_name":"Kuhlmann, Hendrik"}]},{"date_published":"2014-09-01T00:00:00Z","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2014-09-05","location":"Rome, Italy","start_date":"2014-09-02"},"date_created":"2018-12-11T11:55:26Z","oa_version":"None","day":"01","department":[{"_id":"KrCh"}],"citation":{"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.","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.","ama":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking of rendezvous systems. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:109-124. doi:10.1007/978-3-662-44584-6_9","apa":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., & Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_9","ieee":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 109–124.","chicago":"Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut Veith. “Parameterized Model Checking of Rendezvous Systems.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_9.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:10.1007/978-3-662-44584-6_9."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4994","month":"09","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"volume":8704,"intvolume":" 8704","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"year":"2014","abstract":[{"lang":"eng","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."}],"doi":"10.1007/978-3-662-44584-6_9","author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin","full_name":"Aminof, Benjamin","last_name":"Aminof"},{"last_name":"Kotek","full_name":"Kotek, Tomer","first_name":"Tomer"},{"first_name":"Sacha","full_name":"Rubin, Sacha","last_name":"Rubin"},{"full_name":"Spegni, Francesco","last_name":"Spegni","first_name":"Francesco"},{"first_name":"Helmut","last_name":"Veith","full_name":"Veith, Helmut"}],"title":"Parameterized model checking of rendezvous systems","editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"first_name":"Daniele","full_name":"Gorla, Daniele","last_name":"Gorla"}],"_id":"2052","publication_status":"published","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.","status":"public","page":"109 - 124","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"},{"oa_version":"Submitted Version","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2014-09-02","location":"Rome, Italy","end_date":"2014-09-05"},"citation":{"ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:10.1007/978-3-662-44584-6_18","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.","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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.","apa":"Hermanns, H., Krčál, J., & Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_18","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18.","chicago":"Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_18."},"day":"01","month":"09","volume":8704,"abstract":[{"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.","lang":"eng"}],"doi":"10.1007/978-3-662-44584-6_18","title":"Probabilistic bisimulation: Naturally on distributions","author":[{"last_name":"Hermanns","full_name":"Hermanns, Holger","first_name":"Holger"},{"last_name":"Krčál","full_name":"Krčál, Jan","first_name":"Jan"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"_id":"2053","editor":[{"last_name":"Baldan","full_name":"Baldan, Paolo","first_name":"Paolo"},{"last_name":"Gorla","full_name":"Gorla, Daniele","first_name":"Daniele"}],"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.","publication_status":"published","status":"public","ec_funded":1,"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"date_published":"2014-09-01T00:00:00Z","date_created":"2018-12-11T11:55:27Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4993","type":"conference","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5084"}],"intvolume":" 8704","year":"2014","alternative_title":["LNCS"],"oa":1,"page":"249 - 265","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","date_updated":"2021-01-12T06:55:00Z"},{"day":"01","citation":{"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.","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.","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.","mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37."},"month":"09","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2014-09-05","start_date":"2014-09-02","location":"Rome, Italy"},"oa_version":"None","volume":8704,"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"title":"Qualitative concurrent parity games: Bounded rationality","_id":"2054","editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"full_name":"Gorla, Daniele","last_name":"Gorla","first_name":"Daniele"}],"abstract":[{"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.","lang":"eng"}],"doi":"10.1007/978-3-662-44584-6_37","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"status":"public","publication_status":"published","ec_funded":1,"department":[{"_id":"KrCh"}],"publist_id":"4992","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2014-09-01T00:00:00Z","date_created":"2018-12-11T11:55:27Z","intvolume":" 8704","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","alternative_title":["LNCS"],"year":"2014","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","date_updated":"2023-02-23T11:23:36Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3354"}]},"page":"544 - 559"},{"issue":"3","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"}],"doi":"10.1007/s00285-013-0738-7","author":[{"first_name":"Arnab","last_name":"Ganguly","full_name":"Ganguly, Arnab"},{"orcid":"0000-0002-9041-0905","last_name":"Petrov","full_name":"Petrov, Tatjana","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Koeppl","full_name":"Koeppl, Heinz","first_name":"Heinz"}],"title":"Markov chain aggregation and its applications to combinatorial reaction networks","_id":"2056","publication_status":"published","acknowledgement":"T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems Biology.","status":"public","oa_version":"Submitted Version","day":"20","citation":{"chicago":"Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” Journal of Mathematical Biology. Springer, 2014. https://doi.org/10.1007/s00285-013-0738-7.","mla":"Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” Journal of Mathematical Biology, vol. 69, no. 3, Springer, 2014, pp. 767–97, doi:10.1007/s00285-013-0738-7.","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.","ama":"Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. 2014;69(3):767-797. doi:10.1007/s00285-013-0738-7","short":"A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014) 767–797.","ieee":"A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications to combinatorial reaction networks,” Journal of Mathematical Biology, vol. 69, no. 3. Springer, pp. 767–797, 2014.","apa":"Ganguly, A., Petrov, T., & Koeppl, H. (2014). Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. Springer. https://doi.org/10.1007/s00285-013-0738-7"},"month":"11","volume":69,"year":"2014","oa":1,"page":"767 - 797","publication":"Journal of Mathematical Biology","date_updated":"2021-01-12T06:55:01Z","date_published":"2014-11-20T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:55:28Z","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"publist_id":"4990","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1303.4532","open_access":"1"}],"intvolume":" 69","publisher":"Springer"},{"project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"status":"public","publication_status":"published","ec_funded":1,"title":"Majority vote of diverse classifiers for late fusion","author":[{"orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","first_name":"Emilie","full_name":"Morvant, Emilie","last_name":"Morvant"},{"full_name":"Habrard, Amaury","last_name":"Habrard","first_name":"Amaury"},{"first_name":"Stéphane","last_name":"Ayache","full_name":"Ayache, Stéphane"}],"_id":"2057","abstract":[{"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.","lang":"eng"}],"doi":"10.1007/978-3-662-44415-3_16","arxiv":1,"volume":8621,"citation":{"apa":"Morvant, E., Habrard, A., & Ayache, S. (2014). Majority vote of diverse classifiers for late fusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8621, pp. 153–162). Joensuu, Finland: Springer. https://doi.org/10.1007/978-3-662-44415-3_16","ieee":"E. Morvant, A. Habrard, and S. Ayache, “Majority vote of diverse classifiers for late fusion,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 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.","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.","ama":"Morvant E, Habrard A, Ayache S. Majority vote of diverse classifiers for late fusion. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8621. Springer; 2014:153-162. doi:10.1007/978-3-662-44415-3_16","chicago":"Morvant, Emilie, Amaury Habrard, and Stéphane Ayache. “Majority Vote of Diverse Classifiers for Late Fusion.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8621:153–62. Springer, 2014. https://doi.org/10.1007/978-3-662-44415-3_16.","mla":"Morvant, Emilie, et al. “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), vol. 8621, Springer, 2014, pp. 153–62, doi:10.1007/978-3-662-44415-3_16."},"day":"01","month":"01","oa_version":"Preprint","conference":{"start_date":"2014-08-20","location":"Joensuu, Finland","end_date":"2014-08-22","name":"IAPR: International Workshop on Structural, Syntactic, and Statistical Pattern Recognition"},"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","date_updated":"2021-01-12T06:55:01Z","page":"153 - 162","oa":1,"alternative_title":["LNCS"],"year":"2014","publisher":"Springer","main_file_link":[{"url":"http://arxiv.org/abs/1404.7796","open_access":"1"}],"intvolume":" 8621","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4989","external_id":{"arxiv":["1404.7796"]},"date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-11T11:55:28Z","scopus_import":1},{"date_updated":"2022-08-25T14:02:46Z","publication":"ACM Transactions on Graphics","article_number":"137","oa":1,"year":"2014","intvolume":" 33","publisher":"ACM","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"4988","department":[{"_id":"ChWo"}],"scopus_import":"1","date_created":"2018-12-11T11:55:28Z","date_published":"2014-07-01T00:00:00Z","project":[{"grant_number":"11-NSF-1070","_id":"25636330-B435-11E9-9278-68D0E5697425","name":"ROOTS Genome-wide Analysis of Root Traits"}],"publication_status":"published","status":"public","_id":"2058","author":[{"last_name":"Raveendran","full_name":"Raveendran, Karthik","first_name":"Karthik"},{"first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546"},{"full_name":"Thuerey, Nils","last_name":"Thuerey","first_name":"Nils"},{"full_name":"Türk, Greg","last_name":"Türk","first_name":"Greg"}],"title":"Blending liquids","doi":"10.1145/2601097.2601126","issue":"4","abstract":[{"lang":"eng","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."}],"file":[{"checksum":"1752760a2e71e254537f31c0d10d9c6c","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:27Z","relation":"main_file","creator":"system","file_size":8387384,"file_name":"IST-2016-606-v1+1_BlendingLiquids-Preprint.pdf","date_created":"2018-12-12T10:08:27Z","file_id":"4688"}],"article_processing_charge":"No","volume":33,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:27Z","month":"07","ddc":["000"],"day":"01","pubrep_id":"606","citation":{"chicago":"Raveendran, Karthik, Chris Wojtan, Nils Thuerey, and Greg Türk. “Blending Liquids.” In ACM Transactions on Graphics, Vol. 33. ACM, 2014. https://doi.org/10.1145/2601097.2601126.","mla":"Raveendran, Karthik, et al. “Blending Liquids.” ACM Transactions on Graphics, vol. 33, no. 4, 137, ACM, 2014, doi:10.1145/2601097.2601126.","apa":"Raveendran, K., Wojtan, C., Thuerey, N., & Türk, G. (2014). Blending liquids. In ACM Transactions on Graphics (Vol. 33). Vancouver, Canada: ACM. https://doi.org/10.1145/2601097.2601126","ieee":"K. Raveendran, C. Wojtan, N. Thuerey, and G. Türk, “Blending liquids,” in ACM Transactions on Graphics, 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.","short":"K. Raveendran, C. Wojtan, N. Thuerey, G. Türk, in:, ACM Transactions on Graphics, ACM, 2014.","ama":"Raveendran K, Wojtan C, Thuerey N, Türk G. Blending liquids. In: ACM Transactions on Graphics. Vol 33. ACM; 2014. doi:10.1145/2601097.2601126"},"conference":{"name":"SIGGRAPH: International Conference and Exhibition on Computer Graphics and Interactive Techniques","start_date":"2014-08-10","location":"Vancouver, Canada","end_date":"2014-08-14"},"oa_version":"Submitted Version"},{"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Springer","intvolume":" 251","date_created":"2018-12-11T11:55:29Z","scopus_import":1,"date_published":"2014-02-20T00:00:00Z","publist_id":"4987","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"EvBe"}],"page":"1077 - 1087","date_updated":"2021-01-12T06:55:02Z","publication":"Protoplasma","year":"2014","oa":1,"volume":251,"has_accepted_license":"1","file":[{"date_created":"2018-12-12T10:18:31Z","file_id":"5353","relation":"main_file","file_size":6377990,"creator":"system","file_name":"IST-2015-394-v1+1_s00709-014-0616-1.pdf","checksum":"d570a6073765118fc0bb83c31d96fa53","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:27Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","ddc":["580"],"file_date_updated":"2020-07-14T12:45:27Z","month":"02","citation":{"mla":"Dubas, Ewa, et al. “The Influence of Heat Stress on Auxin Distribution in Transgenic B Napus Microspores and Microspore Derived Embryos.” Protoplasma, vol. 251, no. 5, Springer, 2014, pp. 1077–87, doi:10.1007/s00709-014-0616-1.","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.” Protoplasma. Springer, 2014. https://doi.org/10.1007/s00709-014-0616-1.","apa":"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. Springer. https://doi.org/10.1007/s00709-014-0616-1","ieee":"E. Dubas et al., “The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos,” Protoplasma, vol. 251, no. 5. Springer, pp. 1077–1087, 2014.","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. Protoplasma. 2014;251(5):1077-1087. doi:10.1007/s00709-014-0616-1","short":"E. Dubas, J. Moravčíková, J. Libantová, I. Matušíková, E. Benková, I. Zur, M. Krzewska, Protoplasma 251 (2014) 1077–1087.","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."},"pubrep_id":"394","day":"20","publication_status":"published","status":"public","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","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"}],"issue":"5","_id":"2059","title":"The influence of heat stress on auxin distribution in transgenic B napus microspores and microspore derived embryos","author":[{"first_name":"Ewa","last_name":"Dubas","full_name":"Dubas, Ewa"},{"first_name":"Jana","full_name":"Moravčíková, Jana","last_name":"Moravčíková"},{"first_name":"Jana","last_name":"Libantová","full_name":"Libantová, Jana"},{"full_name":"Matušíková, Ildikó","last_name":"Matušíková","first_name":"Ildikó"},{"orcid":"0000-0002-8510-9739","full_name":"Benková, Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"},{"first_name":"Iwona","last_name":"Zur","full_name":"Zur, Iwona"},{"first_name":"Monika","full_name":"Krzewska, Monika","last_name":"Krzewska"}]},{"intvolume":" 251","publisher":"Springer","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"volume":251,"month":"02","publist_id":"4985","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JiFr"}],"day":"14","citation":{"chicago":"Mazur, Ewa, Ewa Kurczyñska, and Jiří Friml. “Cellular Events during Interfascicular Cambium Ontogenesis in Inflorescence Stems of Arabidopsis.” Protoplasma. Springer, 2014. https://doi.org/10.1007/s00709-014-0620-5.","mla":"Mazur, Ewa, et al. “Cellular Events during Interfascicular Cambium Ontogenesis in Inflorescence Stems of Arabidopsis.” Protoplasma, vol. 251, no. 5, Springer, 2014, pp. 1125–39, doi:10.1007/s00709-014-0620-5.","ieee":"E. Mazur, E. Kurczyñska, and J. Friml, “Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis,” Protoplasma, vol. 251, no. 5. Springer, pp. 1125–1139, 2014.","apa":"Mazur, E., Kurczyñska, E., & Friml, J. (2014). Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis. Protoplasma. Springer. https://doi.org/10.1007/s00709-014-0620-5","ama":"Mazur E, Kurczyñska E, Friml J. Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis. Protoplasma. 2014;251(5):1125-1139. doi:10.1007/s00709-014-0620-5","short":"E. Mazur, E. Kurczyñska, J. Friml, Protoplasma 251 (2014) 1125–1139.","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."},"scopus_import":1,"date_created":"2018-12-11T11:55:29Z","oa_version":"None","date_published":"2014-02-14T00:00:00Z","date_updated":"2021-01-12T06:55:03Z","publication":"Protoplasma","page":"1125 - 1139","publication_status":"published","status":"public","_id":"2061","author":[{"first_name":"Ewa","last_name":"Mazur","full_name":"Mazur, Ewa"},{"full_name":"Kurczyñska, Ewa","last_name":"Kurczyñska","first_name":"Ewa"},{"full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596"}],"title":"Cellular events during interfascicular cambium ontogenesis in inflorescence stems of Arabidopsis","doi":"10.1007/s00709-014-0620-5","issue":"5","year":"2014","abstract":[{"lang":"eng","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."}]},{"file":[{"file_size":215514,"relation":"main_file","creator":"system","file_name":"IST-2017-821-v1+1_1255263JonasPVReviewTextR_Final.pdf","date_updated":"2020-07-14T12:45:27Z","checksum":"a0036a589037d37e86364fa25cc0a82f","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:16:00Z","file_id":"5185"},{"file_id":"5186","date_created":"2018-12-12T10:16:01Z","access_level":"open_access","checksum":"e1f57d2713725449cb898fdcb8ef47b8","content_type":"application/pdf","date_updated":"2020-07-14T12:45:27Z","file_name":"IST-2017-821-v1+2_1255263JonasPVReviewFigures_Final.pdf","relation":"main_file","file_size":1732723,"creator":"system"}],"has_accepted_license":"1","volume":345,"citation":{"chicago":"Hu, Hua, Jian Gan, and Peter M Jonas. “Fast-Spiking Parvalbumin^+ GABAergic Interneurons: From Cellular Design to Microcircuit Function.” Science. American Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1255263.","mla":"Hu, Hua, et al. “Fast-Spiking Parvalbumin^+ GABAergic Interneurons: From Cellular Design to Microcircuit Function.” Science, vol. 345, no. 6196, 1255263, American Association for the Advancement of Science, 2014, doi:10.1126/science.1255263.","ista":"Hu H, Gan J, Jonas PM. 2014. Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function. Science. 345(6196), 1255263.","short":"H. Hu, J. Gan, P.M. Jonas, Science 345 (2014).","ama":"Hu H, Gan J, Jonas PM. Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function. Science. 2014;345(6196). doi:10.1126/science.1255263","apa":"Hu, H., Gan, J., & Jonas, P. M. (2014). Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1255263","ieee":"H. Hu, J. Gan, and P. M. Jonas, “Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function,” Science, vol. 345, no. 6196. American Association for the Advancement of Science, 2014."},"pubrep_id":"821","day":"01","month":"08","file_date_updated":"2020-07-14T12:45:27Z","ddc":["570"],"oa_version":"Submitted Version","project":[{"call_identifier":"FWF","name":"Mechanisms of transmitter release at GABAergic synapses","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","grant_number":"P24909-B24"},{"call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","_id":"25C0F108-B435-11E9-9278-68D0E5697425","grant_number":"268548"}],"status":"public","publication_status":"published","ec_funded":1,"title":"Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to microcircuit function","author":[{"id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","first_name":"Hua","full_name":"Hu, Hua","last_name":"Hu"},{"first_name":"Jian","id":"3614E438-F248-11E8-B48F-1D18A9856A87","last_name":"Gan","full_name":"Gan, Jian"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"_id":"2062","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."}],"issue":"6196","doi":"10.1126/science.1255263","publisher":"American Association for the Advancement of Science","intvolume":" 345","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"PeJo"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4984","date_published":"2014-08-01T00:00:00Z","date_created":"2018-12-11T11:55:29Z","scopus_import":1,"publication":"Science","date_updated":"2021-01-12T06:55:03Z","article_number":"1255263","oa":1,"year":"2014"},{"date_published":"2014-07-01T00:00:00Z","conference":{"location":"Vienna, Austria","start_date":"2014-07-18","end_date":"2014-07-22","name":"CAV: Computer Aided Verification"},"date_created":"2018-12-11T11:55:30Z","oa_version":"None","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"01","citation":{"mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31.","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:10.1007/978-3-319-08867-9_31","short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.","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.","apa":"Chatterjee, K., Chmelik, M., & 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. https://doi.org/10.1007/978-3-319-08867-9_31"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","publist_id":"4978","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"volume":8559,"intvolume":" 8559","publisher":"Springer","alternative_title":["LNCS"],"year":"2014","abstract":[{"lang":"eng","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."}],"doi":"10.1007/978-3-319-08867-9_31","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw"}],"title":"CEGAR for qualitative analysis of probabilistic systems","_id":"2063","status":"public","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5412"},{"relation":"earlier_version","status":"public","id":"5413"},{"id":"5414","relation":"earlier_version","status":"public"},{"relation":"dissertation_contains","status":"public","id":"1155"}]},"ec_funded":1,"page":"473 - 490","date_updated":"2023-09-07T11:58:33Z","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}]},{"volume":522,"month":"07","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.” Journal of Comparative Neurology. Wiley-Blackwell, 2014. https://doi.org/10.1002/cne.23654.","mla":"Rubio, Maía, et al. “Target- and Input-Dependent Organization of AMPA and NMDA Receptors in Synaptic Connections of the Cochlear Nucleus.” Journal of Comparative Neurology, vol. 522, no. 18, Wiley-Blackwell, 2014, pp. 4023–42, doi:10.1002/cne.23654.","short":"M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, R. Shigemoto, Journal of Comparative Neurology 522 (2014) 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. Journal of Comparative Neurology. 2014;522(18):4023-4042. doi:10.1002/cne.23654","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.","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,” Journal of Comparative Neurology, vol. 522, no. 18. Wiley-Blackwell, pp. 4023–4042, 2014.","apa":"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. Wiley-Blackwell. https://doi.org/10.1002/cne.23654"},"day":"29","oa_version":"Submitted Version","publication_status":"published","acknowledgement":"National Institutes of Health (NIH) Grant Number: 1R01DC013048‐0; Biotechnology and Biological Sciences Research Council, UK Grant Number: BB/J015938/1\r\n","status":"public","_id":"2064","title":"Target- and input-dependent organization of AMPA and NMDA receptors in synaptic connections of the cochlear nucleus","author":[{"first_name":"Maía","last_name":"Rubio","full_name":"Rubio, Maía"},{"first_name":"Yugo","last_name":"Fukazawa","full_name":"Fukazawa, Yugo"},{"first_name":"Naomi","full_name":"Kamasawa, Naomi","last_name":"Kamasawa"},{"full_name":"Clarkson, Cheryl","last_name":"Clarkson","first_name":"Cheryl"},{"last_name":"Molnár","full_name":"Molnár, Elek","first_name":"Elek"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto"}],"doi":"10.1002/cne.23654","abstract":[{"lang":"eng","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."}],"issue":"18","publisher":"Wiley-Blackwell","intvolume":" 522","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4198489/","open_access":"1"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4974","department":[{"_id":"RySh"}],"date_created":"2018-12-11T11:55:30Z","scopus_import":1,"date_published":"2014-07-29T00:00:00Z","date_updated":"2021-01-12T06:55:05Z","publication":"Journal of Comparative Neurology","page":"4023 - 4042","oa":1,"year":"2014"}]