[{"_id":"631","status":"public","pubrep_id":"966","type":"conference","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2017-04-22","location":"Uppsala, Sweden","end_date":"2017-04-29"},"ddc":["000"],"date_updated":"2023-09-07T12:53:00Z","file_date_updated":"2020-07-14T12:47:27Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata."}],"month":"03","intvolume":" 10205","scopus_import":1,"alternative_title":["LNCS"],"file":[{"date_created":"2018-12-12T10:11:41Z","file_name":"IST-2017-741-v1+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:47:27Z","file_size":569863,"checksum":"f395d0d20102b89aeaad8b4ef4f18f4f","file_id":"4897","access_level":"open_access","relation":"main_file","content_type":"application/pdf"},{"date_created":"2018-12-12T10:11:42Z","file_name":"IST-2018-741-v2+2_main.pdf","creator":"system","date_updated":"2020-07-14T12:47:27Z","file_size":563276,"checksum":"f416ee1ae4497b23ecdf28b1f18bb8df","file_id":"4898","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-366254576-8"]},"publication_status":"published","volume":10205,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6894"}]},"project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger. “Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_34.","ista":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 589–606.","mla":"Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra. Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34.","short":"S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606.","ieee":"S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 589–606.","apa":"Bogomolov, S., Frehse, G., Giacobbe, M., & Henzinger, T. A. (2017). Counterexample guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_34","ama":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:10.1007/978-3-662-54577-5_34"},"title":"Counterexample guided refinement of template polyhedra","author":[{"first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov"},{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7162","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project DP140104219 (Robust AI Planning for Hybrid Systems).","publisher":"Springer","quality_controlled":"1","oa":1,"day":"31","has_accepted_license":"1","year":"2017","doi":"10.1007/978-3-662-54577-5_34","date_published":"2017-03-31T00:00:00Z","date_created":"2018-12-11T11:47:36Z","page":"589 - 606"},{"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"86","publist_id":"6214","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","last_name":"Schröder"}],"title":"Fluctuations of functions of Wigner matrices","citation":{"chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner Matrices.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/16-ECP38.","ista":"Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. 21, 86.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner Matrices.” Electronic Communications in Probability, vol. 21, 86, Institute of Mathematical Statistics, 2017, doi:10.1214/16-ECP38.","ama":"Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. 2017;21. doi:10.1214/16-ECP38","apa":"Erdös, L., & Schröder, D. J. (2017). Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/16-ECP38","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,” Electronic Communications in Probability, vol. 21. Institute of Mathematical Statistics, 2017.","short":"L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Institute of Mathematical Statistics","quality_controlled":"1","acknowledgement":"Partially supported by the IST Austria Excellence Scholarship.","date_created":"2018-12-11T11:50:23Z","doi":"10.1214/16-ECP38","date_published":"2017-01-02T00:00:00Z","year":"2017","has_accepted_license":"1","publication":"Electronic Communications in Probability","day":"02","tmp":{"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)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"747","status":"public","_id":"1144","file_date_updated":"2018-12-12T10:18:10Z","department":[{"_id":"LaEr"}],"date_updated":"2023-09-07T12:54:12Z","ddc":["510"],"scopus_import":1,"intvolume":" 21","month":"01","abstract":[{"lang":"eng","text":"We show that matrix elements of functions of N × N Wigner matrices fluctuate on a scale of order N−1/2 and we identify the limiting fluctuation. Our result holds for any function f of the matrix that has bounded variation thus considerably relaxing the regularity requirement imposed in [7, 11]."}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"volume":21,"related_material":{"record":[{"relation":"dissertation_contains","id":"6179","status":"public"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:18:10Z","file_name":"IST-2017-747-v1+1_euclid.ecp.1483347665.pdf","date_updated":"2018-12-12T10:18:10Z","file_size":440770,"creator":"system","file_id":"5329","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}]},{"article_number":"241","project":[{"call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","grant_number":"642841"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"citation":{"ista":"Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 36(6), 241.","chicago":"Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3130800.3130890.","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 2017;36(6). doi:10.1145/3130800.3130890","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3130800.3130890","short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","ieee":"O. Elek et al., “Scattering-aware texture reproduction for 3D printing,” ACM Transactions on Graphics, vol. 36, no. 6. ACM, 2017.","mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics, vol. 36, no. 6, 241, ACM, 2017, doi:10.1145/3130800.3130890."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publist_id":"7334","author":[{"last_name":"Elek","full_name":"Elek, Oskar","first_name":"Oskar"},{"full_name":"Sumin, Denis","last_name":"Sumin","first_name":"Denis"},{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","first_name":"Ran","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","last_name":"Zhang"},{"last_name":"Weyrich","full_name":"Weyrich, Tim","first_name":"Tim"},{"full_name":"Myszkowski, Karol","last_name":"Myszkowski","first_name":"Karol"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"first_name":"Alexander","last_name":"Wilkie","full_name":"Wilkie, Alexander"},{"first_name":"Jaroslav","full_name":"Krivanek, Jaroslav","last_name":"Krivanek"}],"title":"Scattering-aware texture reproduction for 3D printing","oa":1,"quality_controlled":"1","publisher":"ACM","year":"2017","has_accepted_license":"1","publication":"ACM Transactions on Graphics","day":"20","date_created":"2018-12-11T11:46:44Z","doi":"10.1145/3130800.3130890","date_published":"2017-11-20T00:00:00Z","_id":"486","type":"journal_article","article_type":"original","pubrep_id":"1052","status":"public","date_updated":"2023-09-07T13:11:15Z","ddc":["003","000","005"],"department":[{"_id":"BeBi"}],"file_date_updated":"2020-07-14T12:46:35Z","abstract":[{"text":"Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"intvolume":" 36","month":"11","publication_status":"published","publication_identifier":{"issn":["07300301"]},"language":[{"iso":"eng"}],"file":[{"file_id":"4836","checksum":"48386fa6956c3645fc89594dc898b147","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","date_created":"2018-12-12T10:10:46Z","file_size":107349827,"date_updated":"2020-07-14T12:46:35Z","creator":"system"},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"7189","checksum":"21c89c28fb8d70f6602f752bf997aa0f","date_updated":"2020-07-14T12:46:35Z","file_size":4683145,"creator":"bbickel","date_created":"2019-12-16T14:48:57Z","file_name":"ElekSumin2017SGA_reduced_file_size.pdf"}],"ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8386"}]},"issue":"6","volume":36},{"doi":"10.1007/978-3-319-63688-7_5","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:38Z","page":"133 - 163","day":"01","year":"2017","quality_controlled":"1","publisher":"Springer","oa":1,"editor":[{"first_name":"Jonathan","last_name":"Katz","full_name":"Katz, Jonathan"},{"first_name":"Hovav","last_name":"Shacham","full_name":"Shacham, Hovav"}],"title":"Be adaptive avoid overcommitting","author":[{"first_name":"Zahra","last_name":"Jafargholi","full_name":"Jafargholi, Zahra"},{"full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen","last_name":"Klein"},{"first_name":"Ilan","full_name":"Komargodski, Ilan","last_name":"Komargodski"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","last_name":"Wichs","full_name":"Wichs, Daniel"}],"publist_id":"7151","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.","ista":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401, 133–163.","mla":"Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.","short":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.","ieee":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.","ama":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:10.1007/978-3-319-63688-7_5","apa":"Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., & Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz & H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-319-63688-7_5"},"project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10035"}]},"volume":10401,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331963687-0"]},"publication_status":"published","month":"01","intvolume":" 10401","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://eprint.iacr.org/2017/515","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2n. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m ≪ n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs."}],"department":[{"_id":"KrPi"}],"date_updated":"2023-09-07T13:32:11Z","status":"public","type":"conference","conference":{"start_date":"2017-07-20","end_date":"2017-07-24","location":"Santa Barbara, CA, United States","name":"CRYPTO: Cryptology"},"_id":"637"},{"title":"Data for: Establishment in a new habitat by polygenic adaptation","department":[{"_id":"NiBa"}],"article_processing_charge":"No","author":[{"first_name":"Alison","full_name":"Etheridge, Alison","last_name":"Etheridge"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ieee":"A. Etheridge and N. H. Barton, “Data for: Establishment in a new habitat by polygenic adaptation.” Mendeley Data, 2017.","short":"A. Etheridge, N.H. Barton, (2017).","ama":"Etheridge A, Barton NH. Data for: Establishment in a new habitat by polygenic adaptation. 2017. doi:10.17632/nw68fxzjpm.1","apa":"Etheridge, A., & Barton, N. H. (2017). Data for: Establishment in a new habitat by polygenic adaptation. Mendeley Data. https://doi.org/10.17632/nw68fxzjpm.1","mla":"Etheridge, Alison, and Nicholas H. Barton. Data for: Establishment in a New Habitat by Polygenic Adaptation. Mendeley Data, 2017, doi:10.17632/nw68fxzjpm.1.","ista":"Etheridge A, Barton NH. 2017. Data for: Establishment in a new habitat by polygenic adaptation, Mendeley Data, 10.17632/nw68fxzjpm.1.","chicago":"Etheridge, Alison, and Nicholas H Barton. “Data for: Establishment in a New Habitat by Polygenic Adaptation.” Mendeley Data, 2017. https://doi.org/10.17632/nw68fxzjpm.1."},"date_updated":"2023-09-11T13:41:21Z","status":"public","type":"research_data_reference","_id":"9842","date_created":"2021-08-09T13:18:55Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"564"}]},"date_published":"2017-12-29T00:00:00Z","doi":"10.17632/nw68fxzjpm.1","day":"29","year":"2017","month":"12","oa":1,"main_file_link":[{"url":"https://doi.org/10.17632/nw68fxzjpm.1","open_access":"1"}],"publisher":"Mendeley Data","oa_version":"Published Version","abstract":[{"text":"Mathematica notebooks used to generate figures.","lang":"eng"}]}]