--- _id: '1528' abstract: - lang: eng text: 'We consider N×N Hermitian random matrices H consisting of blocks of size M≥N6/7. The matrix elements are i.i.d. within the blocks, close to a Gaussian in the four moment matching sense, but their distribution varies from block to block to form a block-band structure, with an essential band width M. We show that the entries of the Green’s function G(z)=(H−z)−1 satisfy the local semicircle law with spectral parameter z=E+iη down to the real axis for any η≫N−1, using a combination of the supersymmetry method inspired by Shcherbina (J Stat Phys 155(3): 466–499, 2014) and the Green’s function comparison strategy. Previous estimates were valid only for η≫M−1. The new estimate also implies that the eigenvectors in the middle of the spectrum are fully delocalized.' acknowledgement: "Z. Bao was supported by ERC Advanced Grant RANMAT No. 338804; L. Erdős was partially supported by ERC Advanced Grant RANMAT No. 338804.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). The authors are very grateful to the anonymous referees for careful reading and valuable comments, which helped to improve the organization." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Zhigang full_name: Bao, Zhigang id: 442E6A6C-F248-11E8-B48F-1D18A9856A87 last_name: Bao orcid: 0000-0003-3036-1475 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 citation: ama: Bao Z, Erdös L. Delocalization for a class of random block band matrices. Probability Theory and Related Fields. 2017;167(3-4):673-776. doi:10.1007/s00440-015-0692-y apa: Bao, Z., & Erdös, L. (2017). Delocalization for a class of random block band matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-015-0692-y chicago: Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” Probability Theory and Related Fields. Springer, 2017. https://doi.org/10.1007/s00440-015-0692-y. ieee: Z. Bao and L. Erdös, “Delocalization for a class of random block band matrices,” Probability Theory and Related Fields, vol. 167, no. 3–4. Springer, pp. 673–776, 2017. ista: Bao Z, Erdös L. 2017. Delocalization for a class of random block band matrices. Probability Theory and Related Fields. 167(3–4), 673–776. mla: Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block Band Matrices.” Probability Theory and Related Fields, vol. 167, no. 3–4, Springer, 2017, pp. 673–776, doi:10.1007/s00440-015-0692-y. short: Z. Bao, L. Erdös, Probability Theory and Related Fields 167 (2017) 673–776. date_created: 2018-12-11T11:52:32Z date_published: 2017-04-01T00:00:00Z date_updated: 2023-09-20T09:42:12Z day: '01' ddc: - '530' department: - _id: LaEr doi: 10.1007/s00440-015-0692-y ec_funded: 1 external_id: isi: - '000398842700004' file: - access_level: open_access checksum: 67afa85ff1e220cbc1f9f477a828513c content_type: application/pdf creator: system date_created: 2018-12-12T10:08:05Z date_updated: 2020-07-14T12:45:00Z file_id: '4665' file_name: IST-2016-489-v1+1_s00440-015-0692-y.pdf file_size: 1615755 relation: main_file file_date_updated: 2020-07-14T12:45:00Z has_accepted_license: '1' intvolume: ' 167' isi: 1 issue: 3-4 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 673 - 776 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Probability Theory and Related Fields publication_identifier: issn: - '01788051' publication_status: published publisher: Springer publist_id: '5644' pubrep_id: '489' quality_controlled: '1' scopus_import: '1' status: public title: Delocalization for a class of random block band matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 167 year: '2017' ... --- _id: '1433' abstract: - lang: eng text: Phat is an open-source C. ++ library for the computation of persistent homology by matrix reduction, targeted towards developers of software for topological data analysis. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. We provide numerous different reduction strategies as well as data types to store and manipulate the boundary matrix. We compare the different combinations through extensive experimental evaluation and identify optimization techniques that work well in practical situations. We also compare our software with various other publicly available libraries for persistent homology. article_processing_charge: No article_type: original author: - first_name: Ulrich full_name: Bauer, Ulrich last_name: Bauer - first_name: Michael full_name: Kerber, Michael last_name: Kerber - first_name: Jan full_name: Reininghaus, Jan last_name: Reininghaus - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: ama: Bauer U, Kerber M, Reininghaus J, Wagner H. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 2017;78:76-90. doi:10.1016/j.jsc.2016.03.008 apa: Bauer, U., Kerber, M., Reininghaus, J., & Wagner, H. (2017). Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. Academic Press. https://doi.org/10.1016/j.jsc.2016.03.008 chicago: Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “Phat - Persistent Homology Algorithms Toolbox.” Journal of Symbolic Computation. Academic Press, 2017. https://doi.org/10.1016/j.jsc.2016.03.008. ieee: U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology algorithms toolbox,” Journal of Symbolic Computation, vol. 78. Academic Press, pp. 76–90, 2017. ista: Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology algorithms toolbox. Journal of Symbolic Computation. 78, 76–90. mla: Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.” Journal of Symbolic Computation, vol. 78, Academic Press, 2017, pp. 76–90, doi:10.1016/j.jsc.2016.03.008. short: U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation 78 (2017) 76–90. date_created: 2018-12-11T11:51:59Z date_published: 2017-01-01T00:00:00Z date_updated: 2023-09-20T09:42:40Z day: '01' department: - _id: HeEd doi: 10.1016/j.jsc.2016.03.008 ec_funded: 1 external_id: isi: - '000384396000005' intvolume: ' 78' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jsc.2016.03.008 month: '01' oa: 1 oa_version: Published Version page: 76 - 90 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: Journal of Symbolic Computation publication_identifier: issn: - ' 07477171' publication_status: published publisher: Academic Press publist_id: '5765' quality_controlled: '1' related_material: record: - id: '10894' relation: earlier_version status: public scopus_import: '1' status: public title: Phat - Persistent homology algorithms toolbox type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 78 year: '2017' ... --- _id: '1407' abstract: - lang: eng text: We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study. article_processing_charge: No author: - first_name: Mária full_name: Svoreňová, Mária last_name: Svoreňová - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ivana full_name: Cěrná, Ivana last_name: Cěrná - first_name: Cǎlin full_name: Belta, Cǎlin last_name: Belta citation: ama: 'Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 2017;23(2):230-253. doi:10.1016/j.nahs.2016.04.006' apa: 'Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.04.006' chicago: 'Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.' ieee: 'M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.' ista: 'Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.' mla: 'Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.' short: 'M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.' date_created: 2018-12-11T11:51:50Z date_published: 2017-02-01T00:00:00Z date_updated: 2023-09-20T09:43:09Z day: '01' department: - _id: ToHe - _id: KrCh doi: 10.1016/j.nahs.2016.04.006 ec_funded: 1 external_id: arxiv: - '1410.5387' isi: - '000390637000014' intvolume: ' 23' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1410.5387 month: '02' oa: 1 oa_version: Preprint page: 230 - 253 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: 'Nonlinear Analysis: Hybrid Systems' publication_status: published publisher: Elsevier publist_id: '5800' quality_controlled: '1' related_material: record: - id: '1689' relation: earlier_version status: public scopus_import: '1' status: public title: Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 23 year: '2017' ... --- _id: '1367' abstract: - lang: eng text: One of the major challenges in physically based modelling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes and particles. Applications range from fluids, through deformable bodies, to articulated solids. acknowledgement: This work was partly supported by the starting grants ADAPT and BigSplash, as well as the advanced grant EXPRESSIVE from the European Research Council (ERC-2012-StG_20111012, ERC-2014-StG_638176 and ERC-2011-ADG_20110209). article_processing_charge: No author: - first_name: Pierre full_name: Manteaux, Pierre last_name: Manteaux - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Rahul full_name: Narain, Rahul last_name: Narain - first_name: Stéphane full_name: Redon, Stéphane last_name: Redon - first_name: François full_name: Faure, François last_name: Faure - first_name: Marie full_name: Cani, Marie last_name: Cani citation: ama: Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. Adaptive physically based models in computer graphics. Computer Graphics Forum. 2017;36(6):312-337. doi:10.1111/cgf.12941 apa: Manteaux, P., Wojtan, C., Narain, R., Redon, S., Faure, F., & Cani, M. (2017). Adaptive physically based models in computer graphics. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12941 chicago: Manteaux, Pierre, Chris Wojtan, Rahul Narain, Stéphane Redon, François Faure, and Marie Cani. “Adaptive Physically Based Models in Computer Graphics.” Computer Graphics Forum. Wiley-Blackwell, 2017. https://doi.org/10.1111/cgf.12941. ieee: P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, and M. Cani, “Adaptive physically based models in computer graphics,” Computer Graphics Forum, vol. 36, no. 6. Wiley-Blackwell, pp. 312–337, 2017. ista: Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. 2017. Adaptive physically based models in computer graphics. Computer Graphics Forum. 36(6), 312–337. mla: Manteaux, Pierre, et al. “Adaptive Physically Based Models in Computer Graphics.” Computer Graphics Forum, vol. 36, no. 6, Wiley-Blackwell, 2017, pp. 312–37, doi:10.1111/cgf.12941. short: P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, M. Cani, Computer Graphics Forum 36 (2017) 312–337. date_created: 2018-12-11T11:51:37Z date_published: 2017-09-01T00:00:00Z date_updated: 2023-09-20T11:05:36Z day: '01' ddc: - '000' department: - _id: ChWo doi: 10.1111/cgf.12941 external_id: isi: - '000408634200019' file: - access_level: open_access checksum: 7676e9a9ead6d58c3000988c97deb2ef content_type: application/pdf creator: system date_created: 2018-12-12T10:16:21Z date_updated: 2020-07-14T12:44:47Z file_id: '5208' file_name: IST-2016-634-v1+1_starAdaptivity-cgf.pdf file_size: 1434439 relation: main_file file_date_updated: 2020-07-14T12:44:47Z has_accepted_license: '1' intvolume: ' 36' isi: 1 issue: '6' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 312 - 337 publication: Computer Graphics Forum publication_identifier: issn: - '01677055' publication_status: published publisher: Wiley-Blackwell publist_id: '5873' pubrep_id: '634' quality_controlled: '1' scopus_import: '1' status: public title: Adaptive physically based models in computer graphics type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 36 year: '2017' ... --- _id: '1338' abstract: - lang: eng text: We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively. article_processing_charge: No author: - first_name: Pavol full_name: Cerny, Pavol id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87 last_name: Cerny - first_name: Edmund full_name: Clarke, Edmund last_name: Clarke - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Arjun full_name: Radhakrishna, Arjun id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87 last_name: Radhakrishna - first_name: Leonid full_name: Ryzhyk, Leonid last_name: Ryzhyk - first_name: Roopsha full_name: Samanta, Roopsha id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87 last_name: Samanta - first_name: Thorsten full_name: Tarrach, Thorsten id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87 last_name: Tarrach orcid: 0000-0003-4409-8487 citation: ama: Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 2017;50(2-3):97-139. doi:10.1007/s10703-016-0256-5 apa: Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-016-0256-5 chicago: Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design. Springer, 2017. https://doi.org/10.1007/s10703-016-0256-5. ieee: P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” Formal Methods in System Design, vol. 50, no. 2–3. Springer, pp. 97–139, 2017. ista: Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2017. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 50(2–3), 97–139. mla: Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:10.1007/s10703-016-0256-5. short: P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, Formal Methods in System Design 50 (2017) 97–139. date_created: 2018-12-11T11:51:27Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-09-20T11:13:51Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/s10703-016-0256-5 ec_funded: 1 external_id: isi: - '000399888900001' file: - access_level: open_access checksum: 1163dfd997e8212c789525d4178b1653 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:05Z date_updated: 2020-07-14T12:44:44Z file_id: '4985' file_name: IST-2016-656-v1+1_s10703-016-0256-5.pdf file_size: 1416170 relation: main_file file_date_updated: 2020-07-14T12:44:44Z has_accepted_license: '1' intvolume: ' 50' isi: 1 issue: 2-3 language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 97 - 139 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Formal Methods in System Design publication_status: published publisher: Springer publist_id: '5929' pubrep_id: '656' quality_controlled: '1' related_material: record: - id: '1729' relation: earlier_version status: public scopus_import: '1' status: public title: From non-preemptive to preemptive scheduling using synchronization synthesis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 50 year: '2017' ... --- _id: '1351' abstract: - lang: eng text: The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs—an important problem of interest in evolutionary biology—more efficiently than the classical simulation method. We specify the property in linear temporal logic. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights. article_processing_charge: No author: - first_name: Mirco full_name: Giacobbe, Mirco id: 3444EA5E-F248-11E8-B48F-1D18A9856A87 last_name: Giacobbe orcid: 0000-0001-8180-0904 - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 - first_name: Tatjana full_name: Petrov, Tatjana id: 3D5811FC-F248-11E8-B48F-1D18A9856A87 last_name: Petrov orcid: 0000-0002-9041-0905 citation: ama: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking the evolution of gene regulatory networks. Acta Informatica. 2017;54(8):765-787. doi:10.1007/s00236-016-0278-x apa: Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov, T. (2017). Model checking the evolution of gene regulatory networks. Acta Informatica. Springer. https://doi.org/10.1007/s00236-016-0278-x chicago: Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking the Evolution of Gene Regulatory Networks.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-016-0278-x. ieee: M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking the evolution of gene regulatory networks,” Acta Informatica, vol. 54, no. 8. Springer, pp. 765–787, 2017. ista: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2017. Model checking the evolution of gene regulatory networks. Acta Informatica. 54(8), 765–787. mla: Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.” Acta Informatica, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:10.1007/s00236-016-0278-x. short: M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta Informatica 54 (2017) 765–787. date_created: 2018-12-11T11:51:32Z date_published: 2017-12-01T00:00:00Z date_updated: 2023-09-20T11:06:03Z day: '01' ddc: - '006' - '576' department: - _id: ToHe - _id: CaGu - _id: NiBa doi: 10.1007/s00236-016-0278-x ec_funded: 1 external_id: isi: - '000414343200003' file: - access_level: open_access checksum: 4e661d9135d7f8c342e8e258dee76f3e content_type: application/pdf creator: dernst date_created: 2019-01-17T15:57:29Z date_updated: 2020-07-14T12:44:46Z file_id: '5841' file_name: 2017_ActaInformatica_Giacobbe.pdf file_size: 755241 relation: main_file file_date_updated: 2020-07-14T12:44:46Z has_accepted_license: '1' intvolume: ' 54' isi: 1 issue: '8' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 765 - 787 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25B1EC9E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618091' name: Speed of Adaptation in Population Genetics and Evolutionary Computation - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Acta Informatica publication_identifier: issn: - '00015903' publication_status: published publisher: Springer publist_id: '5898' pubrep_id: '649' quality_controlled: '1' related_material: record: - id: '1835' relation: earlier_version status: public scopus_import: '1' status: public title: Model checking the evolution of gene regulatory networks tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 54 year: '2017' ... --- _id: '1336' abstract: - lang: eng text: Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse the runtimes of EAs on many illustrative problems. Here we apply this theory to a simple model of natural evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between occurrences of new mutations is much longer than the time it takes for a mutated genotype to take over the population. In this situation, the population only contains copies of one genotype and evolution can be modelled as a stochastic process evolving one genotype by means of mutation and selection between the resident and the mutated genotype. The probability of accepting the mutated genotype then depends on the change in fitness. We study this process, SSWM, from an algorithmic perspective, quantifying its expected optimisation time for various parameters and investigating differences to a similar evolutionary algorithm, the well-known (1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking advantage of information on the fitness gradient. article_processing_charge: No author: - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 - first_name: Jorge full_name: Pérez Heredia, Jorge last_name: Pérez Heredia - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt - first_name: Barbora full_name: Trubenova, Barbora id: 42302D54-F248-11E8-B48F-1D18A9856A87 last_name: Trubenova orcid: 0000-0002-6873-2967 citation: ama: Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. Towards a runtime comparison of natural and artificial evolution. Algorithmica. 2017;78(2):681-713. doi:10.1007/s00453-016-0212-1 apa: Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2017). Towards a runtime comparison of natural and artificial evolution. Algorithmica. Springer. https://doi.org/10.1007/s00453-016-0212-1 chicago: Paixao, Tiago, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “Towards a Runtime Comparison of Natural and Artificial Evolution.” Algorithmica. Springer, 2017. https://doi.org/10.1007/s00453-016-0212-1. ieee: T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “Towards a runtime comparison of natural and artificial evolution,” Algorithmica, vol. 78, no. 2. Springer, pp. 681–713, 2017. ista: Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2017. Towards a runtime comparison of natural and artificial evolution. Algorithmica. 78(2), 681–713. mla: Paixao, Tiago, et al. “Towards a Runtime Comparison of Natural and Artificial Evolution.” Algorithmica, vol. 78, no. 2, Springer, 2017, pp. 681–713, doi:10.1007/s00453-016-0212-1. short: T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 78 (2017) 681–713. date_created: 2018-12-11T11:51:27Z date_published: 2017-06-01T00:00:00Z date_updated: 2023-09-20T11:14:42Z day: '01' ddc: - '576' department: - _id: NiBa - _id: CaGu doi: 10.1007/s00453-016-0212-1 ec_funded: 1 external_id: isi: - '000400379500013' file: - access_level: open_access checksum: 7873f665a0c598ac747c908f34cb14b9 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:19Z date_updated: 2020-07-14T12:44:44Z file_id: '4805' file_name: IST-2016-658-v1+1_s00453-016-0212-1.pdf file_size: 710206 relation: main_file file_date_updated: 2020-07-14T12:44:44Z has_accepted_license: '1' intvolume: ' 78' isi: 1 issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 681 - 713 project: - _id: 25B1EC9E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618091' name: Speed of Adaptation in Population Genetics and Evolutionary Computation publication: Algorithmica publication_identifier: issn: - '01784617' publication_status: published publisher: Springer publist_id: '5931' pubrep_id: '658' quality_controlled: '1' scopus_import: '1' status: public title: Towards a runtime comparison of natural and artificial evolution tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 78 year: '2017' ... --- _id: '1337' abstract: - lang: eng text: We consider the local eigenvalue distribution of large self-adjoint N×N random matrices H=H∗ with centered independent entries. In contrast to previous works the matrix of variances sij=\mathbbmE|hij|2 is not assumed to be stochastic. Hence the density of states is not the Wigner semicircle law. Its possible shapes are described in the companion paper (Ajanki et al. in Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We show that as N grows, the resolvent, G(z)=(H−z)−1, converges to a diagonal matrix, diag(m(z)), where m(z)=(m1(z),…,mN(z)) solves the vector equation −1/mi(z)=z+∑jsijmj(z) that has been analyzed in Ajanki et al. (Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We prove a local law down to the smallest spectral resolution scale, and bulk universality for both real symmetric and complex hermitian symmetry classes. acknowledgement: 'Open access funding provided by Institute of Science and Technology (IST Austria). ' article_processing_charge: Yes (via OA deal) author: - first_name: Oskari H full_name: Ajanki, Oskari H id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87 last_name: Ajanki - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 citation: ama: Ajanki OH, Erdös L, Krüger TH. Universality for general Wigner-type matrices. Probability Theory and Related Fields. 2017;169(3-4):667-727. doi:10.1007/s00440-016-0740-2 apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2017). Universality for general Wigner-type matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-016-0740-2 chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Universality for General Wigner-Type Matrices.” Probability Theory and Related Fields. Springer, 2017. https://doi.org/10.1007/s00440-016-0740-2. ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Universality for general Wigner-type matrices,” Probability Theory and Related Fields, vol. 169, no. 3–4. Springer, pp. 667–727, 2017. ista: Ajanki OH, Erdös L, Krüger TH. 2017. Universality for general Wigner-type matrices. Probability Theory and Related Fields. 169(3–4), 667–727. mla: Ajanki, Oskari H., et al. “Universality for General Wigner-Type Matrices.” Probability Theory and Related Fields, vol. 169, no. 3–4, Springer, 2017, pp. 667–727, doi:10.1007/s00440-016-0740-2. short: O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 169 (2017) 667–727. date_created: 2018-12-11T11:51:27Z date_published: 2017-12-01T00:00:00Z date_updated: 2023-09-20T11:14:17Z day: '01' ddc: - '510' - '530' department: - _id: LaEr doi: 10.1007/s00440-016-0740-2 ec_funded: 1 external_id: isi: - '000414358400002' file: - access_level: open_access checksum: 29f5a72c3f91e408aeb9e78344973803 content_type: application/pdf creator: system date_created: 2018-12-12T10:08:25Z date_updated: 2020-07-14T12:44:44Z file_id: '4686' file_name: IST-2017-657-v1+2_s00440-016-0740-2.pdf file_size: 988843 relation: main_file file_date_updated: 2020-07-14T12:44:44Z has_accepted_license: '1' intvolume: ' 169' isi: 1 issue: 3-4 language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 667 - 727 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Probability Theory and Related Fields publication_identifier: issn: - '01788051' publication_status: published publisher: Springer publist_id: '5930' pubrep_id: '657' quality_controlled: '1' scopus_import: '1' status: public title: Universality for general Wigner-type matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 169 year: '2017' ... --- _id: '1294' abstract: - lang: eng text: We study controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize the expected mean-payoff performance and stability (also known as variability in the literature). We argue that the basic notion of expressing the stability using the statistical variance of the mean payoff is sometimes insufficient, and propose an alternative definition. We show that a strategy ensuring both the expected mean payoff and the variance below given bounds requires randomization and memory, under both the above definitions. We then show that the problem of finding such a strategy can be expressed as a set of constraints. article_processing_charge: No author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Vojtěch full_name: Forejt, Vojtěch last_name: Forejt - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera citation: ama: Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 2017;84:144-170. doi:10.1016/j.jcss.2016.09.009 apa: Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2017). Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.09.009 chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences. Elsevier, 2017. https://doi.org/10.1016/j.jcss.2016.09.009. ieee: T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84. Elsevier, pp. 144–170, 2017. ista: Brázdil T, Chatterjee K, Forejt V, Kučera A. 2017. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 84, 144–170. mla: Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences, vol. 84, Elsevier, 2017, pp. 144–70, doi:10.1016/j.jcss.2016.09.009. short: T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, Journal of Computer and System Sciences 84 (2017) 144–170. date_created: 2018-12-11T11:51:12Z date_published: 2017-03-01T00:00:00Z date_updated: 2023-09-20T11:15:31Z day: '01' ddc: - '004' - '006' department: - _id: KrCh doi: 10.1016/j.jcss.2016.09.009 ec_funded: 1 external_id: isi: - '000388430000011' file: - access_level: open_access checksum: 91271b23cf884d7c06d33bef0cd623b1 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:30Z date_updated: 2020-07-14T12:44:42Z file_id: '4885' file_name: IST-2016-717-v1+1_1-s2.0-S0022000016300897-main.pdf file_size: 708657 relation: main_file file_date_updated: 2020-07-14T12:44:42Z has_accepted_license: '1' intvolume: ' 84' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 144 - 170 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Journal of Computer and System Sciences publication_status: published publisher: Elsevier publist_id: '6009' pubrep_id: '717' quality_controlled: '1' related_material: record: - id: '2305' relation: earlier_version status: public scopus_import: '1' status: public title: Trading performance for stability in Markov decision processes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 84 year: '2017' ... --- _id: '1228' abstract: - lang: eng text: Since 2006, reprogrammed cells have increasingly been used as a biomedical research technique in addition to neuro-psychiatric methods. These rapidly evolving techniques allow for the generation of neuronal sub-populations, and have sparked interest not only in monogenetic neuro-psychiatric diseases, but also in poly-genetic and poly-aetiological disorders such as schizophrenia (SCZ) and bipolar disorder (BPD). This review provides a summary of 19 publications on reprogrammed adult somatic cells derived from patients with SCZ, and five publications using this technique in patients with BPD. As both disorders are complex and heterogeneous, there is a plurality of hypotheses to be tested in vitro. In SCZ, data on alterations of dopaminergic transmission in vitro are sparse, despite the great explanatory power of the so-called DA hypothesis of SCZ. Some findings correspond to perturbations of cell energy metabolism, and observations in reprogrammed cells suggest neuro-developmental alterations. Some studies also report on the efficacy of medicinal compounds to revert alterations observed in cellular models. However, due to the paucity of replication studies, no comprehensive conclusions can be drawn from studies using reprogrammed cells at the present time. In the future, findings from cell culture methods need to be integrated with clinical, epidemiological, pharmacological and imaging data in order to generate a more comprehensive picture of SCZ and BPD. acknowledgement: This work was supported by grants of the Austrian Science Fund (FWF) P23585B09 to M.W. and F3506 to H.H.S. and the “Wiener Wissenschafts-, Forschungs- und Technologiefonds” (Vienna Science and Technology Fund; WWTF) CS15-033 to M.W. article_processing_charge: No article_type: review author: - first_name: Ulrich full_name: Sauerzopf, Ulrich last_name: Sauerzopf - first_name: Roberto full_name: Sacco, Roberto id: 42C9F57E-F248-11E8-B48F-1D18A9856A87 last_name: Sacco - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 - first_name: Marco full_name: Niello, Marco last_name: Niello - first_name: Ana full_name: Weidenauer, Ana last_name: Weidenauer - first_name: Nicole full_name: Praschak Rieder, Nicole last_name: Praschak Rieder - first_name: Harald full_name: Sitte, Harald last_name: Sitte - first_name: Matthaeus full_name: Willeit, Matthaeus last_name: Willeit citation: ama: Sauerzopf U, Sacco R, Novarino G, et al. Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. European Journal of Neuroscience. 2017;45(1):45-57. doi:10.1111/ejn.13418 apa: Sauerzopf, U., Sacco, R., Novarino, G., Niello, M., Weidenauer, A., Praschak Rieder, N., … Willeit, M. (2017). Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1111/ejn.13418 chicago: Sauerzopf, Ulrich, Roberto Sacco, Gaia Novarino, Marco Niello, Ana Weidenauer, Nicole Praschak Rieder, Harald Sitte, and Matthaeus Willeit. “Are Reprogrammed Cells a Useful Tool for Studying Dopamine Dysfunction in Psychotic Disorders? A Review of the Current Evidence.” European Journal of Neuroscience. Wiley-Blackwell, 2017. https://doi.org/10.1111/ejn.13418. ieee: U. Sauerzopf et al., “Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence,” European Journal of Neuroscience, vol. 45, no. 1. Wiley-Blackwell, pp. 45–57, 2017. ista: Sauerzopf U, Sacco R, Novarino G, Niello M, Weidenauer A, Praschak Rieder N, Sitte H, Willeit M. 2017. Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence. European Journal of Neuroscience. 45(1), 45–57. mla: Sauerzopf, Ulrich, et al. “Are Reprogrammed Cells a Useful Tool for Studying Dopamine Dysfunction in Psychotic Disorders? A Review of the Current Evidence.” European Journal of Neuroscience, vol. 45, no. 1, Wiley-Blackwell, 2017, pp. 45–57, doi:10.1111/ejn.13418. short: U. Sauerzopf, R. Sacco, G. Novarino, M. Niello, A. Weidenauer, N. Praschak Rieder, H. Sitte, M. Willeit, European Journal of Neuroscience 45 (2017) 45–57. date_created: 2018-12-11T11:50:50Z date_published: 2017-01-01T00:00:00Z date_updated: 2023-09-20T11:16:01Z day: '01' ddc: - '616' department: - _id: GaNo doi: 10.1111/ejn.13418 external_id: isi: - '000392487100005' pmid: - '27690184' file: - access_level: open_access checksum: c572cf02be8fbb7020cfcfb892182e4c content_type: application/pdf creator: system date_created: 2018-12-12T10:10:48Z date_updated: 2020-07-14T12:44:39Z file_id: '4838' file_name: IST-2017-738-v1+1_Sauerzopf_et_al-2017-European_Journal_of_Neuroscience.pdf file_size: 169145 relation: main_file file_date_updated: 2020-07-14T12:44:39Z has_accepted_license: '1' intvolume: ' 45' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 45 - 57 pmid: 1 publication: European Journal of Neuroscience publication_status: published publisher: Wiley-Blackwell publist_id: '6106' pubrep_id: '738' quality_controlled: '1' scopus_import: '1' status: public title: Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 45 year: '2017' ... --- _id: '1213' abstract: - lang: eng text: Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal structure that assembles at the site of division. Its primary component is FtsZ, a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various models for the role of FtsZ have been suggested. However, important information about the architecture and dynamics of FtsZ filaments during cytokinesis is still missing. One reason for this lack of knowledge has been the small size of bacteria, which has made it difficult to resolve the orientation and dynamics of individual FtsZ filaments in the Z-ring. While superresolution microscopy experiments have helped to gain more information about the organization of the Z-ring in the dividing cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize during assembly and disassembly of the Z-ring. In this chapter, we explain how to use an in vitro reconstitution approach to investigate the self-organization of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor FtsA. We show how to perform single-molecule experiments to study the behavior of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA filament network. We describe how to analyze the dynamics of single molecules and explain why this information can help to shed light onto possible mechanism of Z-ring constriction. We believe that similar experimental approaches will be useful to study the mechanism of membrane-based polymerization of other cytoskeletal systems, not only from prokaryotic but also eukaryotic origin. acknowledged_ssus: - _id: Bio acknowledgement: Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell). alternative_title: - Methods in Cell Biology article_processing_charge: No author: - first_name: Natalia full_name: Baranova, Natalia id: 38661662-F248-11E8-B48F-1D18A9856A87 last_name: Baranova orcid: 0000-0002-3086-9124 - first_name: Martin full_name: Loose, Martin id: 462D4284-F248-11E8-B48F-1D18A9856A87 last_name: Loose orcid: 0000-0001-7309-9724 citation: ama: 'Baranova NS, Loose M. Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. Cytokinesis. Vol 137. Academic Press; 2017:355-370. doi:10.1016/bs.mcb.2016.03.036' apa: Baranova, N. S., & Loose, M. (2017). Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), Cytokinesis (Vol. 137, pp. 355–370). Academic Press. https://doi.org/10.1016/bs.mcb.2016.03.036 chicago: Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In Cytokinesis, edited by Arnaud Echard, 137:355–70. Academic Press, 2017. https://doi.org/10.1016/bs.mcb.2016.03.036. ieee: N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers,” in Cytokinesis, vol. 137, A. Echard, Ed. Academic Press, 2017, pp. 355–370. ista: 'Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol. 137, 355–370.' mla: Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” Cytokinesis, edited by Arnaud Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:10.1016/bs.mcb.2016.03.036. short: N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press, 2017, pp. 355–370. date_created: 2018-12-11T11:50:45Z date_published: 2017-12-01T00:00:00Z date_updated: 2023-09-20T11:16:30Z day: '01' department: - _id: MaLo doi: 10.1016/bs.mcb.2016.03.036 ec_funded: 1 editor: - first_name: 'Arnaud ' full_name: 'Echard, Arnaud ' last_name: Echard external_id: isi: - '000403542900022' intvolume: ' 137' isi: 1 language: - iso: eng month: '12' oa_version: None page: 355 - 370 project: - _id: 2596EAB6-B435-11E9-9278-68D0E5697425 grant_number: ALTF 2015-1163 name: Synthesis of bacterial cell wall - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Cytokinesis publication_identifier: issn: - 0091679X publication_status: published publisher: Academic Press publist_id: '6134' quality_controlled: '1' scopus_import: '1' status: public title: Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers type: book_chapter user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 137 year: '2017' ... --- _id: '1198' abstract: - lang: eng text: We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles. acknowledgement: 'Open access funding provided by Institute of Science and Technology (IST Austria). ' article_processing_charge: Yes (via OA deal) author: - first_name: Thomas full_name: Moser, Thomas id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87 last_name: Moser - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Moser T, Seiringer R. Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. 2017;107(3):533-552. doi:10.1007/s11005-016-0915-x apa: Moser, T., & Seiringer, R. (2017). Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-016-0915-x chicago: Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” Letters in Mathematical Physics. Springer, 2017. https://doi.org/10.1007/s11005-016-0915-x. ieee: T. Moser and R. Seiringer, “Triviality of a model of particles with point interactions in the thermodynamic limit,” Letters in Mathematical Physics, vol. 107, no. 3. Springer, pp. 533–552, 2017. ista: Moser T, Seiringer R. 2017. Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. 107(3), 533–552. mla: Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” Letters in Mathematical Physics, vol. 107, no. 3, Springer, 2017, pp. 533–52, doi:10.1007/s11005-016-0915-x. short: T. Moser, R. Seiringer, Letters in Mathematical Physics 107 (2017) 533–552. date_created: 2018-12-11T11:50:40Z date_published: 2017-03-01T00:00:00Z date_updated: 2023-09-20T11:18:13Z day: '01' ddc: - '510' - '539' department: - _id: RoSe doi: 10.1007/s11005-016-0915-x external_id: isi: - '000394280200007' file: - access_level: open_access checksum: c0c835def162c1bc52f978fad26e3c2f content_type: application/pdf creator: system date_created: 2018-12-12T10:17:40Z date_updated: 2020-07-14T12:44:38Z file_id: '5296' file_name: IST-2016-723-v1+1_s11005-016-0915-x.pdf file_size: 587207 relation: main_file file_date_updated: 2020-07-14T12:44:38Z has_accepted_license: '1' intvolume: ' 107' isi: 1 issue: '3' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: ' 533 - 552' project: - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Letters in Mathematical Physics publication_identifier: issn: - '03779017' publication_status: published publisher: Springer publist_id: '6152' pubrep_id: '723' quality_controlled: '1' related_material: record: - id: '52' relation: dissertation_contains status: public scopus_import: '1' status: public title: Triviality of a model of particles with point interactions in the thermodynamic limit tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 107 year: '2017' ... --- _id: '1207' abstract: - lang: eng text: The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix. article_processing_charge: Yes (via OA deal) author: - first_name: Zhigang full_name: Bao, Zhigang id: 442E6A6C-F248-11E8-B48F-1D18A9856A87 last_name: Bao orcid: 0000-0003-3036-1475 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Kevin full_name: Schnelli, Kevin id: 434AD0AE-F248-11E8-B48F-1D18A9856A87 last_name: Schnelli orcid: 0000-0003-0954-3231 citation: ama: Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. 2017;349(3):947-990. doi:10.1007/s00220-016-2805-6 apa: Bao, Z., Erdös, L., & Schnelli, K. (2017). Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-016-2805-6 chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition of Random Matrices on Optimal Scale.” Communications in Mathematical Physics. Springer, 2017. https://doi.org/10.1007/s00220-016-2805-6. ieee: Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices on optimal scale,” Communications in Mathematical Physics, vol. 349, no. 3. Springer, pp. 947–990, 2017. ista: Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. 349(3), 947–990. mla: Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.” Communications in Mathematical Physics, vol. 349, no. 3, Springer, 2017, pp. 947–90, doi:10.1007/s00220-016-2805-6. short: Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349 (2017) 947–990. date_created: 2018-12-11T11:50:43Z date_published: 2017-02-01T00:00:00Z date_updated: 2023-09-20T11:16:57Z day: '01' ddc: - '530' department: - _id: LaEr doi: 10.1007/s00220-016-2805-6 ec_funded: 1 external_id: isi: - '000393696700005' file: - access_level: open_access checksum: ddff79154c3daf27237de5383b1264a9 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:47Z date_updated: 2020-07-14T12:44:39Z file_id: '5102' file_name: IST-2016-722-v1+1_s00220-016-2805-6.pdf file_size: 1033743 relation: main_file file_date_updated: 2020-07-14T12:44:39Z has_accepted_license: '1' intvolume: ' 349' isi: 1 issue: '3' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 947 - 990 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Communications in Mathematical Physics publication_identifier: issn: - '00103616' publication_status: published publisher: Springer publist_id: '6141' pubrep_id: '722' quality_controlled: '1' scopus_import: '1' status: public title: Local law of addition of random matrices on optimal scale tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 349 year: '2017' ... --- _id: '1196' abstract: - lang: eng text: 'We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M'' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model.' acknowledgement: "This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this article is available via: https://repository.ist.ac.at/171/" article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: 'Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 2017;23:166-190. doi:10.1016/j.nahs.2016.09.001' apa: 'Henzinger, T. A., & Otop, J. (2017). Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.09.001' chicago: 'Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.09.001.' ieee: 'T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” Nonlinear Analysis: Hybrid Systems, vol. 23. Elsevier, pp. 166–190, 2017.' ista: 'Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190.' mla: 'Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” Nonlinear Analysis: Hybrid Systems, vol. 23, Elsevier, 2017, pp. 166–90, doi:10.1016/j.nahs.2016.09.001.' short: 'T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.' date_created: 2018-12-11T11:50:39Z date_published: 2017-02-01T00:00:00Z date_updated: 2023-09-20T11:18:50Z day: '01' department: - _id: ToHe doi: 10.1016/j.nahs.2016.09.001 ec_funded: 1 external_id: isi: - '000390637000011' intvolume: ' 23' isi: 1 language: - iso: eng month: '02' oa_version: None page: 166 - 190 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 'Nonlinear Analysis: Hybrid Systems' publication_status: published publisher: Elsevier publist_id: '6154' quality_controlled: '1' scopus_import: '1' status: public title: Model measuring for discrete and hybrid systems type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 23 year: '2017' ... --- _id: '1199' abstract: - lang: eng text: Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects. article_processing_charge: No author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Barton NH. How does epistasis influence the response to selection? Heredity. 2017;118:96-109. doi:10.1038/hdy.2016.109 apa: Barton, N. H. (2017). How does epistasis influence the response to selection? Heredity. Nature Publishing Group. https://doi.org/10.1038/hdy.2016.109 chicago: Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” Heredity. Nature Publishing Group, 2017. https://doi.org/10.1038/hdy.2016.109. ieee: N. H. Barton, “How does epistasis influence the response to selection?,” Heredity, vol. 118. Nature Publishing Group, pp. 96–109, 2017. ista: Barton NH. 2017. How does epistasis influence the response to selection? Heredity. 118, 96–109. mla: Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” Heredity, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:10.1038/hdy.2016.109. short: N.H. Barton, Heredity 118 (2017) 96–109. date_created: 2018-12-11T11:50:40Z date_published: 2017-01-01T00:00:00Z date_updated: 2023-09-20T11:17:47Z day: '01' department: - _id: NiBa doi: 10.1038/hdy.2016.109 ec_funded: 1 external_id: isi: - '000392229100011' intvolume: ' 118' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/ month: '01' oa: 1 oa_version: Submitted Version page: 96 - 109 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Heredity publication_status: published publisher: Nature Publishing Group publist_id: '6151' quality_controlled: '1' related_material: record: - id: '9710' relation: research_data status: public scopus_import: '1' status: public title: How does epistasis influence the response to selection? type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 118 year: '2017' ... --- _id: '1208' abstract: - lang: eng text: We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ>1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd. article_processing_charge: No author: - first_name: Piotr full_name: Zwiernik, Piotr last_name: Zwiernik - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Donald full_name: Richards, Donald last_name: Richards citation: ama: 'Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society Series B: Statistical Methodology. 2017;79(4):1269-1292. doi:10.1111/rssb.12217' apa: 'Zwiernik, P., Uhler, C., & Richards, D. (2017). Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society. Series B: Statistical Methodology. Wiley-Blackwell. https://doi.org/10.1111/rssb.12217' chicago: 'Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” Journal of the Royal Statistical Society. Series B: Statistical Methodology. Wiley-Blackwell, 2017. https://doi.org/10.1111/rssb.12217.' ieee: 'P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for linear Gaussian covariance models,” Journal of the Royal Statistical Society. Series B: Statistical Methodology, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292, 2017.' ista: 'Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 79(4), 1269–1292.' mla: 'Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” Journal of the Royal Statistical Society. Series B: Statistical Methodology, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:10.1111/rssb.12217.' short: 'P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society. Series B: Statistical Methodology 79 (2017) 1269–1292.' date_created: 2018-12-11T11:50:43Z date_published: 2017-09-01T00:00:00Z date_updated: 2023-09-20T11:17:21Z day: '01' department: - _id: CaUh doi: 10.1111/rssb.12217 external_id: isi: - '000411712300012' intvolume: ' 79' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1408.5604 month: '09' oa: 1 oa_version: Submitted Version page: 1269 - 1292 project: - _id: 2530CA10-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Y 903-N35 name: 'Gaussian Graphical Models: Theory and Applications' publication: 'Journal of the Royal Statistical Society. Series B: Statistical Methodology' publication_identifier: issn: - '13697412' publication_status: published publisher: Wiley-Blackwell publist_id: '6142' quality_controlled: '1' scopus_import: '1' status: public title: Maximum likelihood estimation for linear Gaussian covariance models type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 79 year: '2017' ... --- _id: '1174' abstract: - lang: eng text: Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the "RT-bound", extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a "weak" key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for "weak" keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\'13, CRYPTO\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices. alternative_title: - LIPIcs article_number: '57' article_processing_charge: No author: - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski citation: ama: 'Skórski M. Lower bounds on key derivation for square-friendly applications. In: Vol 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.STACS.2017.57' apa: 'Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2017.57' chicago: Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.STACS.2017.57. ieee: 'M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.' ista: 'Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.' mla: Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57. short: M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-03-11 location: Hannover, Germany name: 'STACS: Symposium on Theoretical Aspects of Computer Science' start_date: 2017-03-08 date_created: 2018-12-11T11:50:32Z date_published: 2017-03-01T00:00:00Z date_updated: 2023-09-20T11:23:15Z day: '01' department: - _id: KrPi doi: 10.4230/LIPIcs.STACS.2017.57 ec_funded: 1 external_id: isi: - '000521077300057' intvolume: ' 66' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: http://drops.dagstuhl.de/opus/volltexte/2017/6976 month: '03' oa: 1 oa_version: Submitted Version project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '6180' quality_controlled: '1' scopus_import: '1' status: public title: Lower bounds on key derivation for square-friendly applications type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 66 year: '2017' ... --- _id: '1176' abstract: - lang: eng text: The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the "paranoid" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A. article_number: '7961977' article_processing_charge: No author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Jeremiah full_name: Blocki, Jeremiah last_name: Blocki citation: ama: 'Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:10.1109/EuroSP.2017.47' apa: 'Alwen, J. F., & Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France: IEEE. https://doi.org/10.1109/EuroSP.2017.47' chicago: Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. https://doi.org/10.1109/EuroSP.2017.47. ieee: 'J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France, 2017.' ista: 'Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy, 7961977.' mla: Alwen, Joel F., and Jeremiah Blocki. Towards Practical Attacks on Argon2i and Balloon Hashing. 7961977, IEEE, 2017, doi:10.1109/EuroSP.2017.47. short: J.F. Alwen, J. Blocki, in:, IEEE, 2017. conference: end_date: 2017-04-28 location: Paris, France name: 'EuroS&P: European Symposium on Security and Privacy' start_date: 2017-04-26 date_created: 2018-12-11T11:50:33Z date_published: 2017-07-03T00:00:00Z date_updated: 2023-09-20T11:22:25Z day: '03' department: - _id: KrPi doi: 10.1109/EuroSP.2017.47 external_id: isi: - '000424197300011' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/759 month: '07' oa: 1 oa_version: Submitted Version publication_identifier: isbn: - 978-150905761-0 publication_status: published publisher: IEEE publist_id: '6178' quality_controlled: '1' scopus_import: '1' status: public title: Towards practical attacks on Argon2i and balloon hashing type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2017' ... --- _id: '1187' abstract: - lang: eng text: We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol. article_processing_charge: No article_type: original author: - first_name: Eike full_name: Kiltz, Eike last_name: Kiltz - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Daniele full_name: Venturi, Daniele last_name: Venturi - first_name: David full_name: Cash, David last_name: Cash - first_name: Abhishek full_name: Jain, Abhishek last_name: Jain citation: ama: Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. Journal of Cryptology. 2017;30(4):1238-1275. doi:10.1007/s00145-016-9247-3 apa: Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., & Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-016-9247-3 chicago: Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology. Springer, 2017. https://doi.org/10.1007/s00145-016-9247-3. ieee: E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4. Springer, pp. 1238–1275, 2017. ista: Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275. mla: Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3. short: E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275. date_created: 2018-12-11T11:50:37Z date_published: 2017-10-01T00:00:00Z date_updated: 2023-09-20T11:20:58Z day: '01' ddc: - '000' department: - _id: KrPi doi: 10.1007/s00145-016-9247-3 ec_funded: 1 external_id: isi: - '000410788600007' file: - access_level: open_access checksum: c647520d115b772a1682fc06fa273eb1 content_type: application/pdf creator: dernst date_created: 2020-05-14T16:30:17Z date_updated: 2020-07-14T12:44:37Z file_id: '7843' file_name: 2017_JournalCrypto_Kiltz.pdf file_size: 516959 relation: main_file file_date_updated: 2020-07-14T12:44:37Z has_accepted_license: '1' intvolume: ' 30' isi: 1 issue: '4' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 1238 - 1275 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography publication: Journal of Cryptology publication_status: published publisher: Springer publist_id: '6166' quality_controlled: '1' related_material: record: - id: '3238' relation: earlier_version status: public scopus_import: '1' status: public title: Efficient authentication from hard learning problems type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 30 year: '2017' ... --- _id: '1192' abstract: - lang: eng text: The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary. article_processing_charge: No author: - first_name: Alexandr full_name: Kazda, Alexandr id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87 last_name: Kazda - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Michal full_name: Rolinek, Michal id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87 last_name: Rolinek citation: ama: 'Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20' apa: 'Kazda, A., Kolmogorov, V., & Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. https://doi.org/10.1137/1.9781611974782.20' chicago: Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. https://doi.org/10.1137/1.9781611974782.20. ieee: 'A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.' ista: 'Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.' mla: Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20. short: A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326. conference: end_date: 2017-01019 location: Barcelona, Spain name: 'SODA: Symposium on Discrete Algorithms' start_date: 2017-01-16 date_created: 2018-12-11T11:50:38Z date_published: 2017-01-01T00:00:00Z date_updated: 2023-09-20T11:20:26Z day: '01' department: - _id: VlKo doi: 10.1137/1.9781611974782.20 ec_funded: 1 external_id: isi: - '000426965800020' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1602.03124 month: '01' oa: 1 oa_version: Submitted Version page: 307 - 326 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_identifier: isbn: - 978-161197478-2 publication_status: published publisher: SIAM publist_id: '6159' quality_controlled: '1' related_material: record: - id: '6032' relation: later_version status: public status: public title: Even delta-matroids and the complexity of planar Boolean CSPs type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2017' ...