[{"_id":"3265","doi":"10.1109/ICCV.2011.6126486","article_number":"6126486","date_updated":"2021-01-12T07:42:15Z","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and scales, into larger interpretations (tilings) of the entire image. Inference is cast as optimization over sets of maximal cliques sampled from a graph connecting all non-overlapping figure-ground segment hypotheses. Potential functions over cliques combine unary, Gestalt-based figure qualities, and pairwise compatibilities among spatially neighboring segments, constrained by T-junctions and the boundary interface statistics of real scenes. Learning the model parameters is based on maximum likelihood, alternating between sampling image tilings and optimizing their potential function parameters. State of the art results are reported on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where a 28% improvement was achieved."}],"quality_controlled":"1","date_published":"2012-01-12T00:00:00Z","publication_status":"published","year":"2012","type":"conference","status":"public","conference":{"name":"ICCV: International Conference on Computer Vision","end_date":"2011-11-13","location":"Barcelona, Spain","start_date":"2011-11-06"},"publisher":"IEEE","language":[{"iso":"eng"}],"title":"Image segmentation by figure-ground composition into maximal cliques","oa_version":"None","month":"01","publist_id":"3382","citation":{"mla":"Ion, Adrian, et al. <i>Image Segmentation by Figure-Ground Composition into Maximal Cliques</i>. 6126486, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>.","ista":"Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.","ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.","chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.","ama":"Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition into maximal cliques. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>"},"date_created":"2018-12-11T12:02:21Z","day":"12","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Adrian","last_name":"Ion","id":"29F89302-F248-11E8-B48F-1D18A9856A87","full_name":"Ion, Adrian"},{"full_name":"Carreira, Joao","last_name":"Carreira","first_name":"Joao"},{"last_name":"Sminchisescu","first_name":"Cristian","full_name":"Sminchisescu, Cristian"}]},{"publist_id":"3369","month":"01","citation":{"apa":"de Vladar, H., &#38; Chela Flores, J. (2012). Can the evolution of multicellularity be anticipated in the exploration of the solar system? In <i>Life on Earth and other planetary bodies</i> (Vol. 24, pp. 387–405). Springer. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>","ama":"de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: <i>Life on Earth and Other Planetary Bodies</i>. Vol 24. Springer; 2012:387-405. doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>","short":"H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405.","chicago":"Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” In <i>Life on Earth and Other Planetary Bodies</i>, 24:387–405. Springer, 2012. <a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">https://doi.org/10.1007/978-94-007-4966-5_22</a>.","ieee":"H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be anticipated in the exploration of the solar system?,” in <i>Life on Earth and other planetary bodies</i>, vol. 24, Springer, 2012, pp. 387–405.","ista":"de Vladar H, Chela Flores J. 2012.Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and other planetary bodies. Cellular Origin, Life in Extreme Habitats and Astrobiology, vol. 24, 387–405.","mla":"de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” <i>Life on Earth and Other Planetary Bodies</i>, vol. 24, Springer, 2012, pp. 387–405, doi:<a href=\"https://doi.org/10.1007/978-94-007-4966-5_22\">10.1007/978-94-007-4966-5_22</a>."},"volume":24,"intvolume":"        24","oa_version":"None","title":"Can the evolution of multicellularity be anticipated in the exploration of the solar system?","language":[{"iso":"eng"}],"page":"387 - 405","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Life on Earth and other planetary bodies","author":[{"last_name":"de Vladar","first_name":"Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5985-7653","full_name":"de Vladar, Harold"},{"full_name":"Chela Flores, Julian","last_name":"Chela Flores","first_name":"Julian"}],"date_created":"2018-12-11T12:02:25Z","corr_author":"1","day":"01","department":[{"_id":"NiBa"}],"date_updated":"2024-10-09T20:54:39Z","abstract":[{"text":"The problem of the origin of metazoa is becoming more urgent in the context of astrobiology. By now it is clear that clues to the understanding of this crucial transition in the evolution of life can arise in a fourth pathway besides the three possibilities in the quest for simplicity outlined by Bonner in his classical book. In other words, solar system exploration seems to be one way in the long-term to elucidate the simplicity of evolutionary development. We place these ideas in the context of different inheritance systems, namely the genotypic and phenotypic replicators with limited or unlimited heredity, and ask which of these can support multicellular development, and to which degree of complexity. However, the quest for evidence on the evolution of biotas from planets around other stars does not seem to be feasible with present technology with direct visualization of living organisms on exoplanets. But this may be attempted on the Galilean moons of Jupiter where there is a possibility of detecting reliable biomarkers in the next decade with the Europa Jupiter System Mission, in view of recent progress by landing micropenetrators on planetary, or satellite surfaces. Mars is a second possibility in the inner Solar System, in spite of the multiple difficulties faced by the fleet of past, present and future missions. We discuss a series of preliminary ideas for elucidating the origin of metazoan analogues with available instrumentation in potential payloads of feasible space missions to the Galilean moons.","lang":"eng"}],"doi":"10.1007/978-94-007-4966-5_22","_id":"3277","alternative_title":["Cellular Origin, Life in Extreme Habitats and Astrobiology"],"publisher":"Springer","date_published":"2012-01-01T00:00:00Z","quality_controlled":"1","type":"book_chapter","status":"public","year":"2012","publication_status":"published"},{"day":"04","date_created":"2018-12-11T12:02:25Z","ec_funded":1,"acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","scopus_import":1,"volume":7194,"month":"05","page":"369 - 382","title":"Hardness preserving constructions of pseudorandom functions","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"intvolume":"      7194","alternative_title":["LNCS"],"status":"public","type":"conference","publication_status":"published","year":"2012","quality_controlled":"1","doi":"10.1007/978-3-642-28914-9_21","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"_id":"3279","author":[{"full_name":"Jain, Abhishek","first_name":"Abhishek","last_name":"Jain"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Aris","last_name":"Tentes","full_name":"Tentes, Aris"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.","ama":"Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom functions. In: Vol 7194. Springer; 2012:369-382. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>","apa":"Jain, A., Pietrzak, K. Z., &#38; Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>","ista":"Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 369–382.","mla":"Jain, Abhishek, et al. <i>Hardness Preserving Constructions of Pseudorandom Functions</i>. Vol. 7194, Springer, 2012, pp. 369–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">10.1007/978-3-642-28914-9_21</a>.","ieee":"A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.","chicago":"Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_21\">https://doi.org/10.1007/978-3-642-28914-9_21</a>."},"publist_id":"3367","oa_version":"None","language":[{"iso":"eng"}],"publisher":"Springer","conference":{"end_date":"2012-03-21","name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy","start_date":"2012-03-19"},"date_published":"2012-05-04T00:00:00Z","abstract":[{"lang":"eng","text":"We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially secure if queried at most q = exp(√n)times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions. \r\n"}],"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T07:42:21Z"},{"doi":"10.1007/978-3-642-28914-9_31","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf"}],"_id":"3280","oa":1,"quality_controlled":"1","status":"public","type":"conference","publication_status":"published","year":"2012","alternative_title":["LNCS"],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"intvolume":"      7194","page":"548 - 563","title":"Subspace LWE","month":"05","volume":7194,"date_created":"2018-12-11T12:02:26Z","ec_funded":1,"acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).","scopus_import":"1","day":"04","department":[{"_id":"KrPi"}],"date_updated":"2024-10-21T06:02:59Z","abstract":[{"text":"The (decisional) learning with errors problem (LWE) asks to distinguish &quot;noisy&quot; inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography. In this paper we introduce a (seemingly) much stronger adaptive assumption, called &quot;subspace LWE&quot; (SLWE), where the adversary can learn the inner product of the secret and random vectors after they were projected into an adaptively and adversarially chosen subspace. We prove that, surprisingly, the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE using secrets of length d (the other direction is trivial.) This result immediately implies that several existing cryptosystems whose security is based on the hardness of the LWE/LPN problems are provably secure in a much stronger sense than anticipated. As an illustrative example we show that the standard way of using LPN for symmetric CPA secure encryption is even secure against a very powerful class of related key attacks. ","lang":"eng"}],"date_published":"2012-05-04T00:00:00Z","conference":{"start_date":"2012-03-19","location":"Taormina, Sicily, Italy","end_date":"2012-03-21","name":"TCC: Theory of Cryptography Conference"},"publisher":"Springer","oa_version":"Submitted Version","language":[{"iso":"eng"}],"publist_id":"3366","citation":{"ieee":"K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.","chicago":"Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>.","ista":"Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 548–563.","mla":"Pietrzak, Krzysztof Z. <i>Subspace LWE</i>. Vol. 7194, Springer, 2012, pp. 548–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>.","short":"K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.","ama":"Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">10.1007/978-3-642-28914-9_31</a>","apa":"Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_31\">https://doi.org/10.1007/978-3-642-28914-9_31</a>"},"corr_author":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}]},{"alternative_title":["LNCS"],"conference":{"end_date":"2012-03-21","name":"TCC: Theory of Cryptography Conference","location":"Taormina, Sicily, Italy","start_date":"2012-03-19"},"publisher":"Springer","date_published":"2012-05-04T00:00:00Z","quality_controlled":"1","type":"conference","status":"public","year":"2012","publication_status":"published","department":[{"_id":"KrPi"}],"date_updated":"2024-10-21T06:03:00Z","abstract":[{"text":"We consider the problem of amplifying the &quot;lossiness&quot; of functions. We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f has image size at most 2 m-L. The question is whether such C* exists for L/m ≫ ℓ/n. This problem arises naturally in the context of cryptographic &quot;lossy functions,&quot; where the relative lossiness is the key parameter. We show that for every circuit C* that makes at most t queries to f, the relative lossiness of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making a polynomial t = poly(n) number of queries can amplify relative lossiness by more than an O(logn)/n additive term. We show that this is tight by giving a simple construction (cascading with some randomization) that achieves such amplification.","lang":"eng"}],"doi":"10.1007/978-3-642-28914-9_26","_id":"3281","main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rosen, Alon","last_name":"Rosen","first_name":"Alon"},{"full_name":"Segev, Gil","last_name":"Segev","first_name":"Gil"}],"date_created":"2018-12-11T12:02:26Z","acknowledgement":"We would like to thank Oded Goldreich and Omer Rein- gold for discussions at an early stage of this project, and Scott Aaronson for clarifications regarding the collision problem.\r\n","scopus_import":"1","day":"04","publist_id":"3365","month":"05","citation":{"apa":"Pietrzak, K. Z., Rosen, A., &#38; Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>","ama":"Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol 7194. Springer; 2012:458-475. doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>","short":"K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.","chicago":"Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,” 7194:458–75. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">https://doi.org/10.1007/978-3-642-28914-9_26</a>.","ieee":"K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.","ista":"Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.","mla":"Pietrzak, Krzysztof Z., et al. <i>Lossy Functions Do Not Amplify Well</i>. Vol. 7194, Springer, 2012, pp. 458–75, doi:<a href=\"https://doi.org/10.1007/978-3-642-28914-9_26\">10.1007/978-3-642-28914-9_26</a>."},"volume":7194,"intvolume":"      7194","oa_version":"None","title":"Lossy functions do not amplify well","page":"458 - 475","language":[{"iso":"eng"}]},{"day":"10","pubrep_id":"686","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ec_funded":1,"date_created":"2018-12-11T12:02:27Z","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","scopus_import":"1","title":"Message authentication, revisited","page":"355 - 374","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"intvolume":"      7237","file":[{"date_updated":"2020-07-14T12:46:06Z","content_type":"application/pdf","file_size":372292,"file_name":"IST-2016-686-v1+1_059.pdf","access_level":"open_access","checksum":"8557c17a8c2586d06ebfe62d934f5c5f","date_created":"2018-12-12T10:14:23Z","relation":"main_file","file_id":"5074","creator":"system"}],"volume":7237,"month":"03","status":"public","type":"conference","file_date_updated":"2020-07-14T12:46:06Z","publication_status":"published","year":"2012","quality_controlled":"1","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-29011-4_22","_id":"3282","oa":1,"has_accepted_license":"1","author":[{"full_name":"Dodis, Yevgeniy","first_name":"Yevgeniy","last_name":"Dodis"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","language":[{"iso":"eng"}],"citation":{"apa":"Dodis, Y., Pietrzak, K. Z., Kiltz, E., &#38; Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>","ama":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited. In: Vol 7237. Springer; 2012:355-374. doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>","short":"Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,” 7237:355–74. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">https://doi.org/10.1007/978-3-642-29011-4_22</a>.","ieee":"Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.","mla":"Dodis, Yevgeniy, et al. <i>Message Authentication, Revisited</i>. Vol. 7237, Springer, 2012, pp. 355–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_22\">10.1007/978-3-642-29011-4_22</a>.","ista":"Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237, 355–374."},"publist_id":"3364","date_published":"2012-03-10T00:00:00Z","publisher":"Springer","license":"https://creativecommons.org/licenses/by/4.0/","conference":{"end_date":"2012-04-19","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Cambridge, UK","start_date":"2012-04-15"},"ddc":["000","004"],"abstract":[{"text":"Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient MACs, without going through a PRF first. In particular, unlike deterministic PRF-based MACs, where each message has a unique valid tag, we give a number of probabilistic MAC constructions from various other primitives/assumptions. Our main results are summarized as follows: We show several new probabilistic MAC constructions from a variety of general assumptions, including CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating these frameworks under concrete number theoretic assumptions, we get several schemes which are more efficient than just using a state-of-the-art PRF instantiation under the corresponding assumption. For probabilistic MACs, unlike deterministic ones, unforgeability against a chosen message attack (uf-cma ) alone does not imply security if the adversary can additionally make verification queries (uf-cmva ). We give an efficient generic transformation from any uf-cma secure MAC which is &quot;message-hiding&quot; into a uf-cmva secure MAC. This resolves the main open problem of Kiltz et al. from Eurocrypt'11; By using our transformation on their constructions, we get the first efficient MACs from the LPN assumption. While all our new MAC constructions immediately give efficient actively secure, two-round symmetric-key identification schemes, we also show a very simple, three-round actively secure identification protocol from any weak PRF. In particular, the resulting protocol is much more efficient than the trivial approach of building a regular PRF from a weak PRF. © 2012 International Association for Cryptologic Research.","lang":"eng"}],"department":[{"_id":"KrPi"}],"date_updated":"2024-10-21T06:02:59Z"},{"scopus_import":"1","acknowledgement":"This work was supported by grants from Fundação de Amparo a Pesquisa do Estado de Minas Gerais (FAPEMIG), the Brazilian Federal Agency for Support and Evaluation of Graduate Education (CAPES), and the National Council for Scientific and Technological Development (CNPq). A.C.T.C.P., B.S.A.F.B., F.G.G.L., and J.A.P.S.-M. were recipients of predoctoral fellowships from CNPq. C.A.B., E.G.K., T.S.-P., P.F.P.P., and P.C.P.F. are recipients of research fellowships from CNPq. \r\n\r\n\r\nWe are grateful to Angela S. Lopes, Ilda M. V. Gama, João R. dos Santos, and Andreza A. Carvalho for their secretarial/technical assistance and to Fernanda Gambogi for help with immunofluorescence microscopy. We also thank M. C. Sogayar (Department of Biochemistry, University of São Paulo, São Paulo, Brazil), who kindly provided us with the A31 cell line, and R. Davis (Howard Hughes Medical Institute, University of Massachusetts Medical School, Worcester, MA) for the WT and JNK1/2-, MKK4-, MKK7-, and MKK4/7-KO cells. VACV WR was from C. Jungwirth (Universität Würzburg, Würzburg, Germany). The recombinant VACV vF13L-GFP and the rabbit polyclonal antibodies against viral proteins, B5R, D8L, L1R, and A36R, were from B. Moss (NIAID, Bethesda, MD). The pcDNA3-Myc-JNK2-MKK7 WT plasmid was from Eugen Kerkhoff (Universität Würzburg, Würzburg, Germany). We also thank Flávio G. da Fonseca (UFMG, Belo Horizonte, MG, Brazil) and Kathleen A. Boyle (Medical College of Wisconsin, Milwaukee, WI) for critically reading the manuscript.","date_created":"2018-12-11T12:02:29Z","pmid":1,"day":"01","publication":"Journal of Virology","intvolume":"        86","title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","page":"172 - 184","article_processing_charge":"No","month":"01","volume":86,"quality_controlled":"1","publication_status":"published","year":"2012","type":"journal_article","status":"public","_id":"3289","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/"}],"doi":"10.1128/JVI.05638-11","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Anna","last_name":"Pereira","full_name":"Pereira, Anna"},{"id":"36705F98-F248-11E8-B48F-1D18A9856A87","last_name":"Leite","first_name":"Flávia","full_name":"Leite, Flávia"},{"first_name":"Bruno","last_name":"Brasil","full_name":"Brasil, Bruno"},{"full_name":"Soares Martins, Jamaria","last_name":"Soares Martins","first_name":"Jamaria"},{"full_name":"Torres, Alice","first_name":"Alice","last_name":"Torres"},{"last_name":"Pimenta","first_name":"Paulo","full_name":"Pimenta, Paulo"},{"full_name":"Souto Padrón, Thais","last_name":"Souto Padrón","first_name":"Thais"},{"last_name":"Tranktman","first_name":"Paula","full_name":"Tranktman, Paula"},{"full_name":"Ferreira, Paulo","first_name":"Paulo","last_name":"Ferreira"},{"last_name":"Kroon","first_name":"Erna","full_name":"Kroon, Erna"},{"last_name":"Bonjardim","first_name":"Cláudio","full_name":"Bonjardim, Cláudio"}],"language":[{"iso":"eng"}],"oa_version":"Submitted Version","publist_id":"3356","citation":{"apa":"Pereira, A., Leite, F., Brasil, B., Soares Martins, J., Torres, A., Pimenta, P., … Bonjardim, C. (2012). A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. ASM. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>","ama":"Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. <i>Journal of Virology</i>. 2012;86(1):172-184. doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>","short":"A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta, T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of Virology 86 (2012) 172–184.","chicago":"Pereira, Anna, Flávia Leite, Bruno Brasil, Jamaria Soares Martins, Alice Torres, Paulo Pimenta, Thais Souto Padrón, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>. ASM, 2012. <a href=\"https://doi.org/10.1128/JVI.05638-11\">https://doi.org/10.1128/JVI.05638-11</a>.","ieee":"A. Pereira <i>et al.</i>, “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization,” <i>Journal of Virology</i>, vol. 86, no. 1. ASM, pp. 172–184, 2012.","ista":"Pereira A, Leite F, Brasil B, Soares Martins J, Torres A, Pimenta P, Souto Padrón T, Tranktman P, Ferreira P, Kroon E, Bonjardim C. 2012. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 86(1), 172–184.","mla":"Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” <i>Journal of Virology</i>, vol. 86, no. 1, ASM, 2012, pp. 172–84, doi:<a href=\"https://doi.org/10.1128/JVI.05638-11\">10.1128/JVI.05638-11</a>."},"date_published":"2012-01-01T00:00:00Z","issue":"1","publisher":"ASM","external_id":{"isi":["000298347700017"],"pmid":["22031940"]},"isi":1,"date_updated":"2025-09-30T07:40:18Z","department":[{"_id":"JoBo"}],"abstract":[{"lang":"eng","text":"Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.\r\n"}]},{"oa_version":"Submitted Version","language":[{"iso":"eng"}],"publist_id":"3330","citation":{"ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>.","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” <i>Pattern Recognition Letters</i>, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>.","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. 2012;33(11):1436-1444. doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","apa":"Bendich, P., Cabello, S., &#38; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Bendich"},{"last_name":"Cabello","first_name":"Sergio","full_name":"Cabello, Sergio"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"}],"isi":1,"external_id":{"isi":["000307204300002"]},"ddc":["000"],"department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T07:39:47Z","abstract":[{"lang":"eng","text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology."}],"date_published":"2012-08-01T00:00:00Z","issue":"11","publisher":"Elsevier","intvolume":"        33","page":"1436 - 1444","title":"A point calculus for interlevel set homology","month":"08","article_processing_charge":"No","file":[{"access_level":"open_access","date_created":"2018-12-12T10:15:00Z","checksum":"d65f79775b51258a604ca5ec741297cc","file_id":"5116","creator":"system","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","file_size":280280,"file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf"}],"volume":33,"date_created":"2018-12-11T12:02:36Z","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","scopus_import":"1","pubrep_id":"542","day":"01","publication":"Pattern Recognition Letters","doi":"10.1016/j.patrec.2011.10.007","_id":"3310","has_accepted_license":"1","oa":1,"quality_controlled":"1","type":"journal_article","status":"public","publication_status":"published","file_date_updated":"2020-07-14T12:46:06Z","year":"2012"},{"_id":"3314","doi":"10.1142/S0129054112400308","quality_controlled":"1","year":"2012","publication_status":"published","type":"journal_article","status":"public","intvolume":"        23","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Discounting and averaging in games across time scales","page":"609 - 625","article_processing_charge":"No","month":"04","volume":23,"scopus_import":"1","acknowledgement":"This research was funded in part by the US National Science Foundation grants CCF-0546170, CNS-0702881, DARPA grant HR0011-09-1-0037, Austrian Science Fund (FWF) NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.","date_created":"2018-12-11T12:02:37Z","day":"01","publication":"International Journal of Foundations of Computer Science","isi":1,"external_id":{"isi":["000304003000004"]},"date_updated":"2025-09-30T07:38:00Z","department":[{"_id":"KrCh"}],"abstract":[{"text":"We introduce two-level discounted and mean-payoff games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted or mean-payoff game and the lower level game is a (undiscounted) reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. For both discounted and mean-payoff two-level games, we show the existence of pure memoryless optimal strategies for both players and an ordered field property. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP. We also give an alternate strategy improvement algorithm to compute the value. © 2012 World Scientific Publishing Company.","lang":"eng"}],"date_published":"2012-04-01T00:00:00Z","issue":"3","publisher":"World Scientific Publishing","language":[{"iso":"eng"}],"oa_version":"None","publist_id":"3326","citation":{"chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2012. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>.","ieee":"K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.","ista":"Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” <i>International Journal of Foundations of Computer Science</i>, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>.","apa":"Chatterjee, K., &#38; Majumdar, R. (2012). Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054112400308\">https://doi.org/10.1142/S0129054112400308</a>","ama":"Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. <i>International Journal of Foundations of Computer Science</i>. 2012;23(3):609-625. doi:<a href=\"https://doi.org/10.1142/S0129054112400308\">10.1142/S0129054112400308</a>","short":"K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}]},{"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:07Z","publication_status":"published","year":"2012","type":"journal_article","status":"public","_id":"3317","doi":"10.1038/nrn3125","has_accepted_license":"1","oa":1,"scopus_import":"1","date_created":"2018-12-11T12:02:38Z","acknowledgement":"Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A. Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial support. We apologize that owing to space constraints, not all relevant papers could be cited.\r\n","pubrep_id":"820","day":"01","publication":"Nature Reviews Neuroscience","intvolume":"        13","project":[{"_id":"25BC64A8-B435-11E9-9278-68D0E5697425","grant_number":"JO_780/A5","name":"Synaptic Mechanisms of Neuronal Network Function"},{"grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","page":"7 - 21","article_processing_charge":"No","month":"01","volume":13,"file":[{"file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:07Z","file_size":314246,"checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f","date_created":"2018-12-12T10:12:13Z","creator":"system","file_id":"4931","relation":"main_file","access_level":"open_access"},{"access_level":"open_access","relation":"main_file","file_id":"4932","creator":"system","checksum":"bceb2efdd49d115f4dde8486bc1be3f2","date_created":"2018-12-12T10:12:14Z","file_size":1840216,"date_updated":"2020-07-14T12:46:07Z","content_type":"application/pdf","file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf"}],"date_published":"2012-01-01T00:00:00Z","issue":"1","publisher":"Nature Publishing Group","ddc":["570"],"isi":1,"external_id":{"isi":["000298323200008"]},"date_updated":"2025-09-30T07:34:43Z","department":[{"_id":"PeJo"}],"abstract":[{"lang":"eng","text":"The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission."}],"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Eggermann, Emmanuel","last_name":"Eggermann","first_name":"Emmanuel","id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C"},{"full_name":"Bucurenciu, Iancu","last_name":"Bucurenciu","first_name":"Iancu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A"},{"full_name":"Goswami, Sarit","last_name":"Goswami","first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"language":[{"iso":"eng"}],"oa_version":"Submitted Version","publist_id":"3322","citation":{"ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. 2012;13(1):7-21. doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21.","apa":"Eggermann, E., Bucurenciu, I., Goswami, S., &#38; Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>","ieee":"E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","chicago":"Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>.","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>.","ista":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21."}},{"abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with \\omega-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity gameswith respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition function is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal)."}],"department":[{"_id":"KrCh"}],"date_updated":"2024-10-09T20:54:38Z","external_id":{"arxiv":["1107.2009"]},"related_material":{"record":[{"id":"5382","status":"public","relation":"earlier_version"}]},"publisher":"Springer","conference":{"start_date":"2012-03-24","location":"Tallinn, Estonia","name":"FoSSaCS: Foundations of Software Science and Computation Structures","end_date":"2012-04-01"},"arxiv":1,"date_published":"2012-03-22T00:00:00Z","citation":{"short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285.","ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>","ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. Vol. 7213, Springer, 2012, pp. 270–85, doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>.","ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>."},"publist_id":"3284","oa_version":"Preprint","language":[{"iso":"eng"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","oa":1,"doi":"10.1007/978-3-642-28729-9_18","_id":"3341","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2009"}],"alternative_title":["LNCS"],"status":"public","type":"conference","publication_status":"published","year":"2012","quality_controlled":"1","volume":7213,"month":"03","title":"Robustness of structurally equivalent concurrent parity games","page":"270 - 285","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"intvolume":"      7213","day":"22","date_created":"2018-12-11T12:02:46Z","ec_funded":1,"scopus_import":1},{"type":"journal_article","status":"public","year":"2012","publication_status":"published","quality_controlled":"1","doi":"10.1016/j.scico.2010.06.004","_id":"3836","publication":"Science of Computer Programming","day":"01","date_created":"2018-12-11T12:05:26Z","scopus_import":"1","volume":77,"month":"02","article_processing_charge":"No","title":"Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code","page":"96 - 112","intvolume":"        77","publisher":"Elsevier","issue":"2","date_published":"2012-02-01T00:00:00Z","abstract":[{"lang":"eng","text":"Hierarchical Timing Language (HTL) is a coordination language for distributed, hard real-time applications. HTL is a hierarchical extension of Giotto and, like its predecessor, based on the logical execution time (LET) paradigm of real-time programming. Giotto is compiled into code for a virtual machine, called the EmbeddedMachine (or E machine). If HTL is targeted to the E machine, then the hierarchicalprogram structure needs to be flattened; the flattening makes separatecompilation difficult, and may result in E machinecode of exponential size. In this paper, we propose a generalization of the E machine, which supports a hierarchicalprogram structure at runtime through real-time trigger mechanisms that are arranged in a tree. We present the generalized E machine, and a modular compiler for HTL that generates code of linear size. The compiler may generate code for any part of a given HTL program separately in any order."}],"department":[{"_id":"ToHe"}],"date_updated":"2025-09-30T07:33:11Z","isi":1,"external_id":{"isi":["000298464800003"]},"author":[{"full_name":"Ghosal, Arkadeb","last_name":"Ghosal","first_name":"Arkadeb"},{"last_name":"Iercan","first_name":"Daniel","full_name":"Iercan, Daniel"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Alberto","last_name":"Sangiovanni Vincentelli","full_name":"Sangiovanni Vincentelli, Alberto"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ama":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. <i>Science of Computer Programming</i>. 2012;77(2):96-112. doi:<a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">10.1016/j.scico.2010.06.004</a>","short":"A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.","apa":"Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., &#38; Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. <i>Science of Computer Programming</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">https://doi.org/10.1016/j.scico.2010.06.004</a>","ieee":"A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code,” <i>Science of Computer Programming</i>, vol. 77, no. 2. Elsevier, pp. 96–112, 2012.","chicago":"Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” <i>Science of Computer Programming</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">https://doi.org/10.1016/j.scico.2010.06.004</a>.","mla":"Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” <i>Science of Computer Programming</i>, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:<a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">10.1016/j.scico.2010.06.004</a>.","ista":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112."},"publist_id":"2370","oa_version":"None","language":[{"iso":"eng"}]},{"date_updated":"2025-09-30T07:32:39Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications."}],"ddc":["000"],"external_id":{"isi":["000299719100002"]},"isi":1,"issue":"2","publisher":"Elsevier","date_published":"2012-03-02T00:00:00Z","publist_id":"2341","citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” <i>Journal of Computer and System Sciences</i>, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:<a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">10.1016/j.jcss.2011.05.002</a>.","ista":"Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">https://doi.org/10.1016/j.jcss.2011.05.002</a>.","ieee":"K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” <i>Journal of Computer and System Sciences</i>, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2012). A survey of stochastic ω regular games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">https://doi.org/10.1016/j.jcss.2011.05.002</a>","short":"K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.","ama":"Chatterjee K, Henzinger TA. A survey of stochastic ω regular games. <i>Journal of Computer and System Sciences</i>. 2012;78(2):394-413. doi:<a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">10.1016/j.jcss.2011.05.002</a>"},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"corr_author":"1","has_accepted_license":"1","article_type":"original","oa":1,"_id":"3846","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jcss.2011.05.002"}],"doi":"10.1016/j.jcss.2011.05.002","quality_controlled":"1","publication_status":"published","file_date_updated":"2020-07-14T12:46:17Z","year":"2012","status":"public","type":"journal_article","article_processing_charge":"No","month":"03","volume":78,"file":[{"file_name":"a_survey_of_stochastic_omega-regular_games.pdf","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_size":336450,"date_created":"2019-01-29T10:54:28Z","checksum":"241b939deb4517cdd4426d49c67e3fa2","relation":"main_file","creator":"kschuh","file_id":"5897","access_level":"open_access"}],"intvolume":"        78","page":"394 - 413","title":"A survey of stochastic ω regular games","publication":"Journal of Computer and System Sciences","scopus_import":"1","acknowledgement":"This research was supported in part by the ONR grant N00014-02-1-0671, by the AFOSR MURI grant F49620-00-1-0327, and by the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610.","date_created":"2018-12-11T12:05:29Z","day":"02"},{"publisher":"EMS Press","issue":"3","arxiv":1,"date_published":"2012-06-24T00:00:00Z","abstract":[{"lang":"eng","text":"We show that bosons interacting via pair potentials with negative scattering length form bound states for a suitable number of particles. In other words, the absence of many-particle bound states of any kind implies the non-negativity of the scattering length of the interaction potential. "}],"department":[{"_id":"RoSe"}],"date_updated":"2026-07-06T11:57:04Z","external_id":{"arxiv":["1204.0435"],"isi":["000209021900004"]},"isi":1,"author":[{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","citation":{"short":"R. Seiringer, Journal of Spectral Theory 2 (2012) 321–328.","ama":"Seiringer R. Absence of bound states implies non-negativity of the scattering length. <i>Journal of Spectral Theory</i>. 2012;2(3):321-328. doi:<a href=\"https://doi.org/10.4171/JST/31\">10.4171/JST/31</a>","apa":"Seiringer, R. (2012). Absence of bound states implies non-negativity of the scattering length. <i>Journal of Spectral Theory</i>. EMS Press. <a href=\"https://doi.org/10.4171/JST/31\">https://doi.org/10.4171/JST/31</a>","ista":"Seiringer R. 2012. Absence of bound states implies non-negativity of the scattering length. Journal of Spectral Theory. 2(3), 321–328.","mla":"Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering Length.” <i>Journal of Spectral Theory</i>, vol. 2, no. 3, EMS Press, 2012, pp. 321–28, doi:<a href=\"https://doi.org/10.4171/JST/31\">10.4171/JST/31</a>.","ieee":"R. Seiringer, “Absence of bound states implies non-negativity of the scattering length,” <i>Journal of Spectral Theory</i>, vol. 2, no. 3. EMS Press, pp. 321–328, 2012.","chicago":"Seiringer, Robert. “Absence of Bound States Implies Non-Negativity of the Scattering Length.” <i>Journal of Spectral Theory</i>. EMS Press, 2012. <a href=\"https://doi.org/10.4171/JST/31\">https://doi.org/10.4171/JST/31</a>."},"publist_id":"4609","oa_version":"Preprint","language":[{"iso":"eng"}],"das_tickbox":"1","type":"journal_article","status":"public","publication_status":"published","year":"2012","quality_controlled":"1","oa":1,"doi":"10.4171/JST/31","_id":"2318","main_file_link":[{"url":"http://arxiv.org/abs/1204.0435","open_access":"1"}],"publication":"Journal of Spectral Theory","day":"24","date_created":"2018-12-11T11:56:58Z","acknowledgement":"Partial financial support by NSERC ","volume":2,"article_processing_charge":"No","month":"06","title":"Absence of bound states implies non-negativity of the scattering length","page":"321-328","intvolume":"         2"},{"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pernia-Andrade, Alejandro","first_name":"Alejandro","last_name":"Pernia-Andrade","id":"36963E98-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goswami, Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","last_name":"Goswami","first_name":"Sarit"},{"last_name":"Stickler","first_name":"Yvonne","id":"63B76600-E9CC-11E9-9B5F-82450873F7A1","full_name":"Stickler, Yvonne"},{"last_name":"Fröbe","first_name":"Ulrich","full_name":"Fröbe, Ulrich"},{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"language":[{"iso":"eng"}],"oa_version":"Submitted Version","publist_id":"3774","citation":{"ama":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. 2012;103(7):1429-1439. doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>","short":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas, Biophysical Journal 103 (2012) 1429–1439.","apa":"Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &#38; Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>","ieee":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M. Jonas, “A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo,” <i>Biophysical Journal</i>, vol. 103, no. 7. Biophysical Society, pp. 1429–1439, 2012.","chicago":"Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe, Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>. Biophysical Society, 2012. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>.","mla":"Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>, vol. 103, no. 7, Biophysical Society, 2012, pp. 1429–39, doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>.","ista":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 103(7), 1429–1439."},"date_published":"2012-10-03T00:00:00Z","issue":"7","publisher":"Biophysical Society","external_id":{"pmid":["23062335"],"isi":["000309571400005"]},"isi":1,"date_updated":"2026-07-06T12:32:51Z","department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"abstract":[{"text":"Spontaneous postsynaptic currents (PSCs) provide key information about the mechanisms of synaptic transmission and the activity modes of neuronal networks. However, detecting spontaneous PSCs in vitro and in vivo has been challenging, because of the small amplitude, the variable kinetics, and the undefined time of generation of these events. Here, we describe a, to our knowledge, new method for detecting spontaneous synaptic events by deconvolution, using a template that approximates the average time course of spontaneous PSCs. A recorded PSC trace is deconvolved from the template, resulting in a series of delta-like functions. The maxima of these delta-like events are reliably detected, revealing the precise onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based method has a unique temporal resolution, allowing the detection of individual events in high-frequency bursts. Furthermore, the deconvolution-based method has a high amplitude resolution, because deconvolution can substantially increase the signal/noise ratio. When tested against previously published methods using experimental data, the deconvolution-based method was superior for spontaneous PSCs recorded in vivo. Using the high-resolution deconvolution-based detection algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.","lang":"eng"}],"scopus_import":"1","date_created":"2018-12-11T12:00:32Z","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10) and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J. Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n","pmid":1,"day":"03","publication":"Biophysical Journal","intvolume":"       103","project":[{"grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"title":"A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo","page":"1429 - 1439","month":"10","article_processing_charge":"No","volume":103,"quality_controlled":"1","publication_status":"published","year":"2012","status":"public","type":"journal_article","das_tickbox":"1","_id":"2954","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/","open_access":"1"}],"doi":"10.1016/j.bpj.2012.08.039","oa":1},{"date_updated":"2026-07-07T05:34:50Z","department":[{"_id":"ToBo"}],"abstract":[{"lang":"eng","text":"There is a long-running controversy about how early cell fate decisions are made in the developing mammalian embryo. 1,2 In particular, it is controversial when the first events that can predict the establishment of the pluripotent and extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur. It has long been proposed that the position and polarity of cells at the 16- to 32-cell stage embryo influence their decision to either give rise to the pluripotent cell lineage that eventually contributes to the inner cell mass (ICM), comprising the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm (TE) surrounding the blastocoel. The positioning of cells in the embryo at this developmental stage could largely be the result of random events, making this a stochastic model of cell lineage allocation. Contrary to such a stochastic model, some studies have detected putative differences in the lineage potential of individual blastomeres before compaction, indicating that the first cell fate decisions may occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a key transcription factor (TF) controlling pre-implantation development in the mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications of such molecular heterogeneities in early development and offer potential avenues toward a mechanistic understanding of these observations, contributing to the resolution of the controversy of developmental cell lineage allocation."}],"isi":1,"external_id":{"isi":["000304770100011"]},"issue":"11","publisher":"Taylor & Francis","date_published":"2012-06-01T00:00:00Z","publist_id":"3531","citation":{"ieee":"P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo,” <i>Cell Cycle</i>, vol. 11, no. 11. Taylor &#38; Francis, pp. 2055–2058, 2012.","chicago":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>. Taylor &#38; Francis, 2012. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>.","ista":"Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.","mla":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>, vol. 11, no. 11, Taylor &#38; Francis, 2012, pp. 2055–58, doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>.","ama":"Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. 2012;11(11):2055-2058. doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>","short":"P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058.","apa":"Pantazis, P., &#38; Bollenbach, M. T. (2012). Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>"},"language":[{"iso":"eng"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pantazis, Periklis","last_name":"Pantazis","first_name":"Periklis"},{"full_name":"Bollenbach, Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Tobias"}],"corr_author":"1","_id":"3160","doi":"10.4161/cc.20118","das_tickbox":"1","quality_controlled":"1","publication_status":"published","year":"2012","status":"public","type":"journal_article","month":"06","article_processing_charge":"No","volume":11,"intvolume":"        11","page":"2055 - 2058","title":"Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo","publication":"Cell Cycle","scopus_import":"1","date_created":"2018-12-11T12:01:44Z","day":"01"},{"department":[{"_id":"KrPi"}],"date_updated":"2026-07-07T13:05:30Z","abstract":[{"lang":"eng","text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively."}],"conference":{"name":"CHES: Cryptographic Hardware and Embedded Systems","end_date":"2012-09-12","start_date":"2012-09-09","location":"Leuven, Belgium"},"publisher":"Springer","date_published":"2012-09-01T00:00:00Z","publist_id":"5003","citation":{"mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i>Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i>Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>.","ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i>Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i>Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:, Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i>Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>"},"oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Faust","first_name":"Sebastian","full_name":"Faust, Sebastian"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"id":"7BE863D4-E9CF-11E9-9EDB-90527418172C","last_name":"Schipper","first_name":"Joachim","full_name":"Schipper, Joachim"}],"oa":1,"doi":"10.1007/978-3-642-33027-8_13","main_file_link":[{"url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf","open_access":"1"}],"_id":"2048","alternative_title":["LNCS"],"das_tickbox":"1","quality_controlled":"1","type":"conference","status":"public","publication_status":"published","year":"2012","article_processing_charge":"No","month":"09","volume":7428,"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"intvolume":"      7428","page":"213 - 232","title":"Practical leakage-resilient symmetric cryptography","publication":"Conference proceedings CHES 2012","date_created":"2018-12-11T11:55:25Z","acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n","ec_funded":1,"scopus_import":"1","day":"01"},{"citation":{"apa":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In <i>Conference proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>","short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.","ama":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: <i>Conference Proceedings FSE 2012</i>. Vol 7549. Springer; 2012:346-365. doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>","chicago":"Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In <i>Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>.","ieee":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in <i>Conference proceedings FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.","mla":"Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” <i>Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012, pp. 346–65, doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>.","ista":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549, 346–365."},"publist_id":"5002","oa_version":"Preprint","language":[{"iso":"eng"}],"author":[{"first_name":"Stefan","last_name":"Heyse","full_name":"Heyse, Stefan"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"full_name":"Lyubashevsky, Vadim","last_name":"Lyubashevsky","first_name":"Vadim"},{"full_name":"Paar, Christof","first_name":"Christof","last_name":"Paar"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.\r\n"}],"department":[{"_id":"KrPi"}],"date_updated":"2026-07-07T13:06:19Z","publisher":"Springer","conference":{"name":"FSE: Fast Software Encryption","end_date":"2012-03-21","location":"Washington, DC, USA","start_date":"2012-03-19"},"date_published":"2012-03-01T00:00:00Z","volume":7549,"article_processing_charge":"No","month":"03","page":"346 - 365","title":"Lapin: An efficient authentication protocol based on ring-LPN","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7"}],"intvolume":"      7549","publication":"Conference proceedings FSE 2012","day":"01","acknowledgement":"Supported by the European Research Council / ERC Starting Grant (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer- ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful comments, and in particular for the suggestion that the scheme is somewhat vulnerable to a man-in-the-middle attack whenever an adversary observes two reader challenges that are the same. We hope that the attack we described in Appendix A corresponds to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the pa- per of [Kir11] and for discussions of some of her recent work. ","date_created":"2018-12-11T11:55:25Z","ec_funded":1,"scopus_import":"1","oa":1,"doi":"10.1007/978-3-642-34047-5_20","main_file_link":[{"url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf","open_access":"1"}],"_id":"2049","alternative_title":["LNCS"],"das_tickbox":"1","type":"conference","status":"public","publication_status":"published","year":"2012","quality_controlled":"1"},{"_id":"2942","doi":"10.1007/978-3-642-34059-8_20","publication_status":"published","year":"2012","type":"conference","status":"public","quality_controlled":"1","das_tickbox":"1","alternative_title":["LNCS"],"page":"380 - 395","title":"Independent implementability of viewpoints","intvolume":"      7539","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"volume":7539,"article_processing_charge":"No","month":"09","day":"16","scopus_import":"1","date_created":"2018-12-11T12:00:28Z","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","ec_funded":1,"publication":"Conference proceedings Monterey Workshop 2012","abstract":[{"text":"Interface theories provide a formal framework for component-based development of software and hardware which supports the incremental design of systems and the independent implementability of components. These capabilities are ensured through mathematical properties of the parallel composition operator and the refinement relation for components. More recently, a conjunction operation was added to interface theories in order to provide support for handling multiple viewpoints, requirements engineering, and component reuse. Unfortunately, the conjunction operator does not allow independent implementability in general. In this paper, we study conditions that need to be imposed on interface models in order to enforce independent implementability with respect to conjunction. We focus on multiple viewpoint specifications and propose a new compatibility criterion between two interfaces, which we call orthogonality. We show that orthogonal interfaces can be refined separately, while preserving both orthogonality and composability with other interfaces. We illustrate the independent implementability of different viewpoints with a FIFO buffer example.","lang":"eng"}],"date_updated":"2026-07-07T13:08:58Z","department":[{"_id":"ToHe"}],"date_published":"2012-09-16T00:00:00Z","publisher":"Springer","conference":{"location":"Oxford, UK","start_date":"2012-03-19","name":"Monterey Workshop 2012","end_date":"2012-03-21"},"language":[{"iso":"eng"}],"oa_version":"None","citation":{"ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: <i>Conference Proceedings Monterey Workshop 2012</i>. Vol 7539. Springer; 2012:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>","short":"T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.","apa":"Henzinger, T. A., &#38; Nickovic, D. (2012). Independent implementability of viewpoints. In <i>Conference proceedings Monterey Workshop 2012</i> (Vol. 7539, pp. 380–395). Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>","ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in <i>Conference proceedings Monterey Workshop 2012</i>, Oxford, UK, 2012, vol. 7539, pp. 380–395.","chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In <i>Conference Proceedings Monterey Workshop 2012</i>, 7539:380–95. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>.","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” <i>Conference Proceedings Monterey Workshop 2012</i>, vol. 7539, Springer, 2012, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>."},"publist_id":"3791","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nickovic, Dejan","first_name":"Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_published":"2012-06-01T00:00:00Z","issue":"6","publisher":"Elsevier","external_id":{"isi":["000301691600005"]},"isi":1,"department":[{"_id":"GaTk"}],"date_updated":"2026-07-07T13:10:10Z","abstract":[{"lang":"eng","text":"A boundary element model of a tunnel running through horizontally layered soil with anisotropic material properties is presented. Since there is no analytical fundamental solution for wave propagation inside a layered orthotropic medium in 3D, the fundamental displacements and stresses have to be calculated numerically. In our model this is done in the Fourier domain with respect to space and time. The assumption of a straight tunnel with infinite extension in the x direction makes it possible to decouple the system for every wave number kx, leading to a 2.5D-problem, which is suited for parallel computation. The special form of the fundamental solution, resulting from our Fourier ansatz, and the fact, that the calculation of the boundary integral equation is performed in the Fourier domain, enhances the stability and efficiency of the numerical calculations."}],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Rieckh, Georg","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","last_name":"Rieckh","first_name":"Georg"},{"first_name":"Wolfgang","last_name":"Kreuzer","full_name":"Kreuzer, Wolfgang"},{"first_name":"Holger","last_name":"Waubke","full_name":"Waubke, Holger"},{"last_name":"Balazs","first_name":"Peter","full_name":"Balazs, Peter"}],"oa_version":"None","language":[{"iso":"eng"}],"publist_id":"3372","citation":{"apa":"Rieckh, G., Kreuzer, W., Waubke, H., &#38; Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering Analysis with Boundary Elements</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>","short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967.","ama":"Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. <i>Engineering Analysis with Boundary Elements</i>. 2012;36(6):960-967. doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary Elements</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">https://doi.org/10.1016/j.enganabound.2011.12.014</a>.","ieee":"G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil,” <i>Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” <i>Engineering Analysis with Boundary Elements</i>, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:<a href=\"https://doi.org/10.1016/j.enganabound.2011.12.014\">10.1016/j.enganabound.2011.12.014</a>.","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 36(6), 960–967."},"quality_controlled":"1","status":"public","type":"journal_article","year":"2012","publication_status":"published","das_tickbox":"1","doi":"10.1016/j.enganabound.2011.12.014","_id":"3274","acknowledgement":"This work was supported by the Austrian Federal Ministry of Transport, Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project Pr. Nr. 809089.","date_created":"2018-12-11T12:02:24Z","scopus_import":"1","day":"01","publication":"Engineering Analysis with Boundary Elements","intvolume":"        36","title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","page":"960 - 967","article_processing_charge":"No","month":"06","volume":36}]