--- _id: '3329' abstract: - lang: eng text: 'We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance µ in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution shape P; then, P''s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(n log n)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. An alternative algorithm, based purely on rational arithmetic, answers the same deconstruction problem, up to an uncertainty parameter, and its running time depends on the parameter δ (in addition to the other input parameters: n, δ and the radius of the disk). If the input shape is found to be approximable, the rational-arithmetic algorithm also computes an approximate solution shape for the problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution shape P with at most one more vertex than a vertex-minimal one. Our study is motivated by applications from two different domains. However, since the offset operation has numerous uses, we anticipate that the reverse question that we study here will be still more broadly applicable. We present results obtained with our implementation of the rational-arithmetic algorithm.' author: - first_name: Eric full_name: Berberich, Eric last_name: Berberich - first_name: Dan full_name: Halperin, Dan last_name: Halperin - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Roza full_name: Pogalnikova, Roza last_name: Pogalnikova citation: ama: 'Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry. ACM; 2011:187-196. doi:10.1145/1998196.1998225' apa: 'Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225' chicago: Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” In Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, 187–96. ACM, 2011. https://doi.org/10.1145/1998196.1998225. ieee: E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196. ista: 'Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.' mla: Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–96, doi:10.1145/1998196.1998225. short: E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–196. conference: end_date: 2011-06-15 location: Paris, France name: 'SCG: Symposium on Computational Geometry' start_date: 2011-06-13 date_created: 2018-12-11T12:02:42Z date_published: 2011-06-13T00:00:00Z date_updated: 2023-02-23T11:12:57Z day: '13' department: - _id: HeEd doi: 10.1145/1998196.1998225 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1109.2158 month: '06' oa: 1 oa_version: Preprint page: 187 - 196 publication: Proceedings of the twenty-seventh annual symposium on Computational geometry publication_status: published publisher: ACM publist_id: '3306' quality_controlled: '1' related_material: record: - id: '3115' relation: later_version status: public scopus_import: 1 status: public title: Deconstructing approximate offsets type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3332' abstract: - lang: eng text: Given an algebraic hypersurface O in ℝd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the complex must lie on O. We give asymptotically tight worst-case bounds for algebraic plane curves. Our results gradually improve known bounds in higher dimensions; however, the question for tight bounds remains unsolved for d ≥ 3. article_processing_charge: No article_type: original author: - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Michael full_name: Sagraloff, Michael last_name: Sagraloff citation: ama: Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 2011;27(3):419-430. doi:10.1007/s00373-011-1020-7 apa: Kerber, M., & Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer. https://doi.org/10.1007/s00373-011-1020-7 chicago: Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics. Springer, 2011. https://doi.org/10.1007/s00373-011-1020-7. ieee: M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011. ista: Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430. mla: Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:10.1007/s00373-011-1020-7. short: M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430. date_created: 2018-12-11T12:02:43Z date_published: 2011-03-17T00:00:00Z date_updated: 2021-01-12T07:42:43Z day: '17' ddc: - '500' department: - _id: HeEd doi: 10.1007/s00373-011-1020-7 file: - access_level: open_access checksum: a63a1e3e885dcc68f1e3dea68dfbe213 content_type: application/pdf creator: dernst date_created: 2020-05-19T16:11:36Z date_updated: 2020-07-14T12:46:08Z file_id: '7869' file_name: 2011_GraphsCombi_Kerber.pdf file_size: 143976 relation: main_file file_date_updated: 2020-07-14T12:46:08Z has_accepted_license: '1' intvolume: ' 27' issue: '3' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 419 - 430 publication: Graphs and Combinatorics publication_status: published publisher: Springer publist_id: '3301' quality_controlled: '1' scopus_import: 1 status: public title: A note on the complexity of real algebraic hypersurfaces type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2011' ... --- _id: '3330' abstract: - lang: eng text: We consider the problem of approximating all real roots of a square-free polynomial f. Given isolating intervals, our algorithm refines each of them to a width at most 2-L, that is, each of the roots is approximated to L bits after the binary point. Our method provides a certified answer for arbitrary real polynomials, only requiring finite approximations of the polynomial coefficient and choosing a suitable working precision adaptively. In this way, we get a correct algorithm that is simple to implement and practically efficient. Our algorithm uses the quadratic interval refinement method; we adapt that method to be able to cope with inaccuracies when evaluating f, without sacrificing its quadratic convergence behavior. We prove a bound on the bit complexity of our algorithm in terms of degree, coefficient size and discriminant. Our bound improves previous work on integer polynomials by a factor of deg f and essentially matches best known theoretical bounds on root approximation which are obtained by very sophisticated algorithms. article_processing_charge: No author: - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 - first_name: Michael full_name: Sagraloff, Michael last_name: Sagraloff citation: ama: 'Kerber M, Sagraloff M. Root refinement for real polynomials. In: Springer; 2011:209-216. doi:10.1145/1993886.1993920' apa: 'Kerber, M., & Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer. https://doi.org/10.1145/1993886.1993920' chicago: Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,” 209–16. Springer, 2011. https://doi.org/10.1145/1993886.1993920. ieee: 'M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.' ista: 'Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.' mla: Kerber, Michael, and Michael Sagraloff. Root Refinement for Real Polynomials. Springer, 2011, pp. 209–16, doi:10.1145/1993886.1993920. short: M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216. conference: end_date: 2011-06-11 location: California, USA name: 'ISSAC: International Symposium on Symbolic and Algebraic Computation' start_date: 2011-06-08 date_created: 2018-12-11T12:02:43Z date_published: 2011-06-08T00:00:00Z date_updated: 2021-01-12T07:42:42Z day: '08' department: - _id: HeEd doi: 10.1145/1993886.1993920 external_id: arxiv: - '1104.1362' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.1362 month: '06' oa: 1 oa_version: Preprint page: 209 - 216 publication_status: published publisher: Springer publist_id: '3304' quality_controlled: '1' scopus_import: 1 status: public title: Root refinement for real polynomials type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3328' abstract: - lang: eng text: 'We report on a generic uni- and bivariate algebraic kernel that is publicly available with CGAL 3.7. It comprises complete, correct, though efficient state-of-the-art implementations on polynomials, roots of polynomial systems, and the support to analyze algebraic curves defined by bivariate polynomials. The kernel design is generic, that is, various number types and substeps can be exchanged. It is accompanied with a ready-to-use interface to enable arrangements induced by algebraic curves, that have already been used as basis for various geometric applications, as arrangements on Dupin cyclides or the triangulation of algebraic surfaces. We present two novel applications: arrangements of rotated algebraic curves and Boolean set operations on polygons bounded by segments of algebraic curves. We also provide experiments showing that our general implementation is competitive and even often clearly outperforms existing implementations that are explicitly tailored for specific types of non-linear curves that are available in CGAL.' article_processing_charge: No author: - first_name: Eric full_name: Berberich, Eric last_name: Berberich - first_name: Michael full_name: Hemmer, Michael last_name: Hemmer - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 citation: ama: 'Berberich E, Hemmer M, Kerber M. A generic algebraic kernel for non linear geometric applications. In: ACM; 2011:179-186. doi:10.1145/1998196.1998224' apa: 'Berberich, E., Hemmer, M., & Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998224' chicago: Berberich, Eric, Michael Hemmer, and Michael Kerber. “A Generic Algebraic Kernel for Non Linear Geometric Applications,” 179–86. ACM, 2011. https://doi.org/10.1145/1998196.1998224. ieee: 'E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.' ista: 'Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.' mla: Berberich, Eric, et al. A Generic Algebraic Kernel for Non Linear Geometric Applications. ACM, 2011, pp. 179–86, doi:10.1145/1998196.1998224. short: E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186. conference: end_date: 2011-06-15 location: Paris, France name: 'SCG: Symposium on Computational Geometry' start_date: 2011-06-13 date_created: 2018-12-11T12:02:42Z date_published: 2011-06-13T00:00:00Z date_updated: 2021-01-12T07:42:41Z day: '13' department: - _id: HeEd doi: 10.1145/1998196.1998224 language: - iso: eng main_file_link: - open_access: '1' url: https://hal.inria.fr/inria-00480031/file/RR-7274.pdf month: '06' oa: 1 oa_version: Published Version page: 179 - 186 publication_status: published publisher: ACM publist_id: '3307' quality_controlled: '1' scopus_import: 1 status: public title: A generic algebraic kernel for non linear geometric applications type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3334' article_type: letter_note author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: János full_name: Pach, János last_name: Pach - first_name: Günter full_name: Ziegler, Günter last_name: Ziegler citation: ama: Edelsbrunner H, Pach J, Ziegler G. Letter from the new editors-in-chief. Discrete & Computational Geometry. 2011;45(1):1-2. doi:10.1007/s00454-010-9313-9 apa: Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9 chicago: Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry. Springer, 2011. https://doi.org/10.1007/s00454-010-9313-9. ieee: H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete & Computational Geometry, vol. 45, no. 1. Springer, pp. 1–2, 2011. ista: Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete & Computational Geometry. 45(1), 1–2. mla: Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9. short: H. Edelsbrunner, J. Pach, G. Ziegler, Discrete & Computational Geometry 45 (2011) 1–2. date_created: 2018-12-11T12:02:44Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:44Z day: '01' department: - _id: HeEd doi: 10.1007/s00454-010-9313-9 intvolume: ' 45' issue: '1' language: - iso: eng month: '01' oa_version: None page: 1 - 2 publication: Discrete & Computational Geometry publication_status: published publisher: Springer publist_id: '3297' quality_controlled: '1' scopus_import: 1 status: public title: Letter from the new editors-in-chief type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 45 year: '2011' ... --- _id: '3353' abstract: - lang: eng text: 'Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces.' article_number: '14' author: - first_name: Stavros full_name: Tripakis, Stavros last_name: Tripakis - first_name: Ben full_name: Lickly, Ben last_name: Lickly - 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: Edward full_name: Lee, Edward last_name: Lee citation: ama: Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 2011;33(4). doi:10.1145/1985342.1985345 apa: Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM. https://doi.org/10.1145/1985342.1985345 chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011. https://doi.org/10.1145/1985342.1985345. ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011. ista: Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14. mla: Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345. short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011). date_created: 2018-12-11T12:02:51Z date_published: 2011-07-01T00:00:00Z date_updated: 2021-01-12T07:42:52Z day: '01' ddc: - '000' - '005' department: - _id: ToHe doi: 10.1145/1985342.1985345 ec_funded: 1 file: - access_level: open_access checksum: 5d44a8aa81e33210649beae507602138 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:45Z date_updated: 2020-07-14T12:46:09Z file_id: '5235' file_name: IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf file_size: 775662 relation: main_file file_date_updated: 2020-07-14T12:46:09Z has_accepted_license: '1' intvolume: ' 33' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version project: - _id: 25EFB36C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '215543' name: COMponent-Based Embedded Systems design Techniques - _id: 25F1337C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '214373' name: Design for Embedded Systems - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication: ACM Transactions on Programming Languages and Systems (TOPLAS) publication_status: published publisher: ACM publist_id: '3263' pubrep_id: '85' quality_controlled: '1' scopus_import: 1 status: public title: A theory of synchronous relational interfaces type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2011' ... --- _id: '3355' abstract: - lang: eng text: Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems. author: - first_name: Raluca full_name: Halalai, Raluca id: 584C6850-E996-11E9-805B-F01764644770 last_name: Halalai - 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: Vasu full_name: Singh, Vasu id: 4DAE2708-F248-11E8-B48F-1D18A9856A87 last_name: Singh citation: ama: 'Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40' apa: 'Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40' chicago: Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40. ieee: 'R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.' ista: 'Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.' mla: Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40. short: R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264. conference: end_date: 2011-09-08 location: Aachen, Germany name: 'QEST: Quantitative Evaluation of Systems' start_date: 2011-09-05 date_created: 2018-12-11T12:02:51Z date_published: 2011-10-13T00:00:00Z date_updated: 2021-01-12T07:42:53Z day: '13' ddc: - '000' - '004' department: - _id: ToHe doi: 10.1109/QEST.2011.40 file: - access_level: open_access checksum: 4dc8750ab7921f51de992000b13d1b01 content_type: application/pdf creator: system date_created: 2018-12-12T10:07:49Z date_updated: 2020-07-14T12:46:09Z file_id: '4648' file_name: IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf file_size: 272017 relation: main_file file_date_updated: 2020-07-14T12:46:09Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 255 - 264 publication_status: published publisher: IEEE publist_id: '3260' pubrep_id: '84' quality_controlled: '1' scopus_import: 1 status: public title: Quantitative evaluation of BFT protocols type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3350' abstract: - lang: eng text: A controller for a discrete game with ω-regular objectives requires attention if, intuitively, it requires measuring the state and switching from the current control action. Minimum attention controllers are preferable in modern shared implementations of cyber-physical systems because they produce the least burden on system resources such as processor time or communication bandwidth. We give algorithms to compute minimum attention controllers for ω-regular objectives in imperfect information discrete two-player games. We show a polynomial-time reduction from minimum attention controller synthesis to synthesis of controllers for mean-payoff parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete synthesis algorithm. We show that the minimum attention controller problem is decidable for infinite state systems with finite bisimulation quotients. In particular, the problem is decidable for timed and rectangular automata. alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ritankar full_name: Majumdar, Ritankar last_name: Majumdar citation: ama: 'Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159. doi:10.1007/978-3-642-24310-3_11' apa: 'Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11' chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11. ieee: 'K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.' ista: 'Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.' mla: Chatterjee, Krishnendu, and Ritankar Majumdar. Minimum Attention Controller Synthesis for Omega Regular Objectives. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11. short: K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159. conference: end_date: 2011-09-23 location: Aalborg, Denmark name: 'FORMATS: Formal Modeling and Analysis of Timed Systems' start_date: 2011-09-21 date_created: 2018-12-11T12:02:49Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:51Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-642-24310-3_11 editor: - first_name: Uli full_name: Fahrenberg, Uli last_name: Fahrenberg - first_name: Stavros full_name: Tripakis, Stavros last_name: Tripakis intvolume: ' 6919' language: - iso: eng month: '01' oa_version: None page: 145 - 159 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: Springer publist_id: '3271' quality_controlled: '1' scopus_import: 1 status: public title: Minimum attention controller synthesis for omega regular objectives type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6919 year: '2011' ... --- _id: '3351' abstract: - lang: eng text: In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and the discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions. alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Rohit full_name: Singh, Rohit last_name: Singh citation: ama: 'Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:10.1007/978-3-642-22953-4_13' apa: 'Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. https://doi.org/10.1007/978-3-642-22953-4_13' chicago: Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13. ieee: 'K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.' ista: 'Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.' mla: Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13. short: K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159. conference: end_date: 2011-08-25 location: Oslo, Norway name: 'FCT: Fundamentals of Computation Theory' start_date: 2011-08-22 date_created: 2018-12-11T12:02:50Z date_published: 2011-04-16T00:00:00Z date_updated: 2021-01-12T07:42:52Z day: '16' department: - _id: KrCh doi: 10.1007/978-3-642-22953-4_13 editor: - first_name: Olaf full_name: Owe, Olaf last_name: Owe - first_name: Martin full_name: Steffen, Martin last_name: Steffen - first_name: Jan Arne full_name: Telle, Jan Arne last_name: Telle intvolume: ' 6914' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.3211 month: '04' oa: 1 oa_version: Submitted Version page: 148 - 159 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: Springer publist_id: '3270' quality_controlled: '1' scopus_import: 1 status: public title: On memoryless quantitative objectives type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6914 year: '2011' ... --- _id: '3354' abstract: - lang: eng text: 'We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory.' article_number: '28' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404 apa: Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404 chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404. ieee: K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011. ista: Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28. mla: Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404. short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011). date_created: 2018-12-11T12:02:51Z date_published: 2011-07-04T00:00:00Z date_updated: 2023-02-23T10:26:18Z day: '04' department: - _id: KrCh - _id: ToHe doi: 10.1145/1970398.1970404 intvolume: ' 12' issue: '4' language: - iso: eng month: '07' oa_version: None project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: ACM Transactions on Computational Logic (TOCL) publication_status: published publisher: ACM publist_id: '3262' quality_controlled: '1' related_material: record: - id: '2054' relation: later_version status: public scopus_import: 1 status: public title: Qualitative concurrent parity games type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2011' ... --- _id: '3349' abstract: - lang: eng text: 'Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions. In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena.' alternative_title: - EPTCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nathanaël full_name: Fijalkow, Nathanaël last_name: Fijalkow citation: ama: 'Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games. In: Vol 54. EPTCS; 2011:74-86. doi:10.4204/EPTCS.54.6' apa: 'Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6' chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6. ieee: 'K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.' ista: 'Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.' mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6. short: K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86. conference: end_date: 2011-06-17 location: Minori, Italy name: 'GandALF: Games, Automata, Logic, and Formal Verification' start_date: 2011-06-15 date_created: 2018-12-11T12:02:49Z date_published: 2011-06-04T00:00:00Z date_updated: 2021-01-12T07:42:51Z day: '04' department: - _id: KrCh doi: 10.4204/EPTCS.54.6 intvolume: ' 54' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1106.1232 month: '06' oa: 1 oa_version: Submitted Version page: 74 - 86 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: EPTCS publist_id: '3272' scopus_import: 1 status: public title: A reduction from parity games to simple stochastic games type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2011' ... --- _id: '335' abstract: - lang: eng text: 'Recently reported synthetic routes for the production of hollow nanoparticles have stimulated significant interest for the possibilities this novel geometry offers. While advantageous properties have been found and innovative applications have been proposed, the development of the full potential of these new nanostructures is still strongly tied to the extent of control that can be accomplished over their characteristics (e.g., composition, size, shell thickness, and nanocrystalline structure). In the present work, we investigate the means and limits of control over these parameters that can be obtained by the Kirkendall effect synthetic route on cadmium chalcogenide nanocrystalline shells. We demonstrate that the selection of the reactants and oxidation conditions allows some extent of control of the nanocrystalline structure and thickness of the shell. However, the tuning range is limited by the intrinsic restrictions of the synthetic procedure and by the dependence of the particle geometry on the same reaction conditions. Thus, we further explore the range of control over the shell parameters that can be accomplished through post-synthesis processes, such as chemical etching and thermal annealing. ' article_processing_charge: No article_type: original author: - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Jiandong full_name: Fan, Jiandong last_name: Fan - first_name: Wenhua full_name: Li, Wenhua last_name: Li - first_name: Doris full_name: Cadavid, Doris last_name: Cadavid - first_name: Raquel full_name: Nafria, Raquel last_name: Nafria - first_name: Alex full_name: Carrete, Alex last_name: Carrete - first_name: Andreu full_name: Cabot, Andreu last_name: Cabot citation: ama: Ibáñez M, Fan J, Li W, et al. Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. Chemistry of Materials. 2011;23(12):3095-3104. doi:10.1021/cm2006633 apa: Ibáñez, M., Fan, J., Li, W., Cadavid, D., Nafria, R., Carrete, A., & Cabot, A. (2011). Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/cm2006633 chicago: Ibáñez, Maria, Jiandong Fan, Wenhua Li, Doris Cadavid, Raquel Nafria, Alex Carrete, and Andreu Cabot. “Means and Limits of Control of the Shell Parameters in Hollow Nanoparticles Obtained by the Kirkendall Effect.” Chemistry of Materials. American Chemical Society, 2011. https://doi.org/10.1021/cm2006633. ieee: M. Ibáñez et al., “Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect,” Chemistry of Materials, vol. 23, no. 12. American Chemical Society, pp. 3095–3104, 2011. ista: Ibáñez M, Fan J, Li W, Cadavid D, Nafria R, Carrete A, Cabot A. 2011. Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. Chemistry of Materials. 23(12), 3095–3104. mla: Ibáñez, Maria, et al. “Means and Limits of Control of the Shell Parameters in Hollow Nanoparticles Obtained by the Kirkendall Effect.” Chemistry of Materials, vol. 23, no. 12, American Chemical Society, 2011, pp. 3095–104, doi:10.1021/cm2006633. short: M. Ibáñez, J. Fan, W. Li, D. Cadavid, R. Nafria, A. Carrete, A. Cabot, Chemistry of Materials 23 (2011) 3095–3104. date_created: 2018-12-11T11:45:53Z date_published: 2011-05-24T00:00:00Z date_updated: 2021-01-12T07:42:51Z day: '24' doi: 10.1021/cm2006633 extern: '1' intvolume: ' 23' issue: '12' language: - iso: eng month: '05' oa_version: None page: 3095 - 3104 publication: Chemistry of Materials publication_status: published publisher: American Chemical Society publist_id: '7492' quality_controlled: '1' status: public title: Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2011' ... --- _id: '3352' abstract: - lang: eng text: Exploring the connection of biology with reactive systems to better understand living systems. author: - first_name: Jasmin full_name: Fisher, Jasmin last_name: Fisher - first_name: David full_name: Harel, David last_name: Harel - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: Fisher J, Harel D, Henzinger TA. Biology as reactivity. Communications of the ACM. 2011;54(10):72-82. doi:10.1145/2001269.2001289 apa: Fisher, J., Harel, D., & Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM. https://doi.org/10.1145/2001269.2001289 chicago: Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” Communications of the ACM. ACM, 2011. https://doi.org/10.1145/2001269.2001289. ieee: J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011. ista: Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82. mla: Fisher, Jasmin, et al. “Biology as Reactivity.” Communications of the ACM, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289. short: J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82. date_created: 2018-12-11T12:02:50Z date_published: 2011-10-01T00:00:00Z date_updated: 2021-01-12T07:42:52Z day: '01' department: - _id: ToHe doi: 10.1145/2001269.2001289 ec_funded: 1 intvolume: ' 54' issue: '10' language: - iso: eng month: '10' oa_version: None page: 72 - 82 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: Communications of the ACM publication_status: published publisher: ACM publist_id: '3267' quality_controlled: '1' status: public title: Biology as reactivity type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2011' ... --- _id: '3362' abstract: - lang: eng text: State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables. alternative_title: - LNCS article_processing_charge: No author: - first_name: Jasmin full_name: Fisher, Jasmin last_name: Fisher - 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: Dejan full_name: Nickovic, Dejan id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87 last_name: Nickovic - first_name: Nir full_name: Piterman, Nir last_name: Piterman - first_name: Anmol full_name: Singh, Anmol last_name: Singh - first_name: Moshe full_name: Vardi, Moshe last_name: Vardi citation: ama: 'Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:10.1007/978-3-642-23217-6_27' apa: 'Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27' chicago: Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. https://doi.org/10.1007/978-3-642-23217-6_27. ieee: 'J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.' ista: 'Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.' mla: Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27. short: J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418. conference: end_date: 2011-09-09 location: Aachen, Germany name: 'CONCUR: Concurrency Theory' start_date: 2011-09-06 date_created: 2018-12-11T12:02:54Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:57Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-23217-6_27 ec_funded: 1 file: - access_level: open_access checksum: 6bf2453d8e52e979ddb58d17325bad26 content_type: application/pdf creator: dernst date_created: 2020-05-19T16:17:48Z date_updated: 2020-07-14T12:46:10Z file_id: '7870' file_name: 2011_CONCUR_Fisher.pdf file_size: 337125 relation: main_file file_date_updated: 2020-07-14T12:46:10Z has_accepted_license: '1' intvolume: ' 6901' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 404 - 418 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '3253' quality_controlled: '1' scopus_import: 1 status: public title: Dynamic reactive modules type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6901 year: '2011' ... --- _id: '3365' abstract: - lang: eng text: We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives. alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - 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: Barbara full_name: Jobstmann, Barbara last_name: Jobstmann - first_name: Rohit full_name: Singh, Rohit last_name: Singh citation: ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24' apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24' chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.' ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.' ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.' mla: 'Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.' short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271. conference: end_date: 2011-04-03 location: Saarbrucken, Germany name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2011-03-26 date_created: 2018-12-11T12:02:55Z date_published: 2011-09-29T00:00:00Z date_updated: 2021-01-12T07:42:58Z day: '29' ddc: - '000' - '005' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-642-19835-9_24 file: - access_level: open_access checksum: 762e52eb296f6dbfbf2a75d98b8ebaee content_type: application/pdf creator: system date_created: 2018-12-12T10:13:37Z date_updated: 2020-07-14T12:46:10Z file_id: '5022' file_name: IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf file_size: 475661 relation: main_file file_date_updated: 2020-07-14T12:46:10Z has_accepted_license: '1' intvolume: ' 6605' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 267 - 271 publication_status: published publisher: Springer publist_id: '3248' pubrep_id: '77' quality_controlled: '1' scopus_import: 1 status: public title: 'QUASY: quantitative synthesis tool' type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6605 year: '2011' ... --- _id: '3367' abstract: - lang: eng text: In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ>0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via column operations, our algorithm performs rank computations on submatrices of the boundary matrix. For an arbitrary constant δ ∈ (0,1), the running time is O(C(1-δ)ΓR(n)log n), where C(1-δ)Γ is the number of homology classes with persistence at least (1-δ)Γ, n is the total number of simplices, and R(n) is the complexity of computing the rank of an n x n matrix with O(n) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O(C(1-δ)Γn2.376) algorithm, a O(C(1-δ)Γn2.28) Las-Vegas algorithm, or a O(C(1-δ)Γn2+ε) Monte-Carlo algorithm for an arbitrary ε>0. article_processing_charge: No author: - first_name: Chao full_name: Chen, Chao id: 3E92416E-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 citation: ama: 'Chen C, Kerber M. An output sensitive algorithm for persistent homology. In: ACM; 2011:207-216. doi:10.1145/1998196.1998228' apa: 'Chen, C., & Kerber, M. (2011). An output sensitive algorithm for persistent homology (pp. 207–216). Presented at the SoCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998228' chicago: Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology,” 207–16. ACM, 2011. https://doi.org/10.1145/1998196.1998228. ieee: 'C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.' ista: 'Chen C, Kerber M. 2011. An output sensitive algorithm for persistent homology. SoCG: Symposium on Computational Geometry, 207–216.' mla: Chen, Chao, and Michael Kerber. An Output Sensitive Algorithm for Persistent Homology. ACM, 2011, pp. 207–16, doi:10.1145/1998196.1998228. short: C. Chen, M. Kerber, in:, ACM, 2011, pp. 207–216. conference: end_date: 2011-06-15 location: Paris, France name: 'SoCG: Symposium on Computational Geometry' start_date: 2011-06-13 date_created: 2018-12-11T12:02:56Z date_published: 2011-06-13T00:00:00Z date_updated: 2023-02-23T11:05:04Z day: '13' department: - _id: HeEd doi: 10.1145/1998196.1998228 language: - iso: eng month: '06' oa_version: None page: 207 - 216 publication_status: published publisher: ACM publist_id: '3245' quality_controlled: '1' related_material: record: - id: '2939' relation: later_version status: public scopus_import: 1 status: public title: An output sensitive algorithm for persistent homology type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3363' abstract: - lang: eng text: We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words. author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - 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: Mathieu full_name: Tracol, Mathieu id: 3F54FA38-F248-11E8-B48F-1D18A9856A87 last_name: Tracol citation: ama: Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. apa: Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv. chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d. ieee: K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv. ista: Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. mla: Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv. short: K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.). date_created: 2018-12-11T12:02:54Z date_published: 2011-04-01T00:00:00Z date_updated: 2020-01-21T13:20:24Z day: '01' department: - _id: KrCh - _id: ToHe ec_funded: 1 external_id: arxiv: - '1104.0127' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1104.0127 month: '04' oa: 1 oa_version: Preprint page: '19' project: - _id: 25EFB36C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '215543' name: COMponent-Based Embedded Systems design Techniques - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship - _id: 25F1337C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '214373' name: Design for Embedded Systems publication_status: submitted publisher: ArXiv publist_id: '3251' status: public title: The decidability frontier for probabilistic automata on infinite words type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3372' abstract: - lang: eng text: Nowak et al.1 argue that inclusive fitness theory has been of little value in explaining the natural world, and that it has led to negligible progress in explaining the evolution of eusociality. However, we believe that their arguments are based upon a misunderstanding of evolutionary theory and a misrepresentation of the empirical literature. We will focus our comments on three general issues. author: - first_name: Patrick full_name: Abbot, Patrick last_name: Abbot - first_name: Jun full_name: Abe, Jun last_name: Abe - first_name: John full_name: Alcock, John last_name: Alcock - first_name: Samuel full_name: Alizon, Samuel last_name: Alizon - first_name: Joao full_name: Alpedrinha, Joao last_name: Alpedrinha - first_name: Malte full_name: Andersson, Malte last_name: Andersson - first_name: Jean full_name: Andre, Jean last_name: Andre - first_name: Minus full_name: Van Baalen, Minus last_name: Van Baalen - first_name: Francois full_name: Balloux, Francois last_name: Balloux - first_name: Sigal full_name: Balshine, Sigal last_name: Balshine - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Leo full_name: Beukeboom, Leo last_name: Beukeboom - first_name: Jay full_name: Biernaskie, Jay last_name: Biernaskie - first_name: Trine full_name: Bilde, Trine last_name: Bilde - first_name: Gerald full_name: Borgia, Gerald last_name: Borgia - first_name: Michael full_name: Breed, Michael last_name: Breed - first_name: Sam full_name: Brown, Sam last_name: Brown - first_name: Redouan full_name: Bshary, Redouan last_name: Bshary - first_name: Angus full_name: Buckling, Angus last_name: Buckling - first_name: Nancy full_name: Burley, Nancy last_name: Burley - first_name: Max full_name: Burton Chellew, Max last_name: Burton Chellew - first_name: Michael full_name: Cant, Michael last_name: Cant - first_name: Michel full_name: Chapuisat, Michel last_name: Chapuisat - first_name: Eric full_name: Charnov, Eric last_name: Charnov - first_name: Tim full_name: Clutton Brock, Tim last_name: Clutton Brock - first_name: Andrew full_name: Cockburn, Andrew last_name: Cockburn - first_name: Blaine full_name: Cole, Blaine last_name: Cole - first_name: Nick full_name: Colegrave, Nick last_name: Colegrave - first_name: Leda full_name: Cosmides, Leda last_name: Cosmides - first_name: Iain full_name: Couzin, Iain last_name: Couzin - first_name: Jerry full_name: Coyne, Jerry last_name: Coyne - first_name: Scott full_name: Creel, Scott last_name: Creel - first_name: Bernard full_name: Crespi, Bernard last_name: Crespi - first_name: Robert full_name: Curry, Robert last_name: Curry - first_name: Sasha full_name: Dall, Sasha last_name: Dall - first_name: Troy full_name: Day, Troy last_name: Day - first_name: Janis full_name: Dickinson, Janis last_name: Dickinson - first_name: Lee full_name: Dugatkin, Lee last_name: Dugatkin - first_name: Claire full_name: El Mouden, Claire last_name: El Mouden - first_name: Stephen full_name: Emlen, Stephen last_name: Emlen - first_name: Jay full_name: Evans, Jay last_name: Evans - first_name: Regis full_name: Ferriere, Regis last_name: Ferriere - first_name: Jeremy full_name: Field, Jeremy last_name: Field - first_name: Susanne full_name: Foitzik, Susanne last_name: Foitzik - first_name: Kevin full_name: Foster, Kevin last_name: Foster - first_name: William full_name: Foster, William last_name: Foster - first_name: Charles full_name: Fox, Charles last_name: Fox - first_name: Juergen full_name: Gadau, Juergen last_name: Gadau - first_name: Sylvain full_name: Gandon, Sylvain last_name: Gandon - first_name: Andy full_name: Gardner, Andy last_name: Gardner - first_name: Michael full_name: Gardner, Michael last_name: Gardner - first_name: Thomas full_name: Getty, Thomas last_name: Getty - first_name: Michael full_name: Goodisman, Michael last_name: Goodisman - first_name: Alan full_name: Grafen, Alan last_name: Grafen - first_name: Rick full_name: Grosberg, Rick last_name: Grosberg - first_name: Christina full_name: Grozinger, Christina last_name: Grozinger - first_name: Pierre full_name: Gouyon, Pierre last_name: Gouyon - first_name: Darryl full_name: Gwynne, Darryl last_name: Gwynne - first_name: Paul full_name: Harvey, Paul last_name: Harvey - first_name: Ben full_name: Hatchwell, Ben last_name: Hatchwell - first_name: Jürgen full_name: Heinze, Jürgen last_name: Heinze - first_name: Heikki full_name: Helantera, Heikki last_name: Helantera - first_name: Ken full_name: Helms, Ken last_name: Helms - first_name: Kim full_name: Hill, Kim last_name: Hill - first_name: Natalie full_name: Jiricny, Natalie last_name: Jiricny - first_name: Rufus full_name: Johnstone, Rufus last_name: Johnstone - first_name: Alex full_name: Kacelnik, Alex last_name: Kacelnik - first_name: E Toby full_name: Kiers, E Toby last_name: Kiers - first_name: Hanna full_name: Kokko, Hanna last_name: Kokko - first_name: Jan full_name: Komdeur, Jan last_name: Komdeur - first_name: Judith full_name: Korb, Judith last_name: Korb - first_name: Daniel full_name: Kronauer, Daniel last_name: Kronauer - first_name: Rolf full_name: Kümmerli, Rolf last_name: Kümmerli - first_name: Laurent full_name: Lehmann, Laurent last_name: Lehmann - first_name: Timothy full_name: Linksvayer, Timothy last_name: Linksvayer - first_name: Sébastien full_name: Lion, Sébastien last_name: Lion - first_name: Bruce full_name: Lyon, Bruce last_name: Lyon - first_name: James full_name: Marshall, James last_name: Marshall - first_name: Richard full_name: Mcelreath, Richard last_name: Mcelreath - first_name: Yannis full_name: Michalakis, Yannis last_name: Michalakis - first_name: Richard full_name: Michod, Richard last_name: Michod - first_name: Douglas full_name: Mock, Douglas last_name: Mock - first_name: Thibaud full_name: Monnin, Thibaud last_name: Monnin - first_name: Robert full_name: Montgomerie, Robert last_name: Montgomerie - first_name: Allen full_name: Moore, Allen last_name: Moore - first_name: Ulrich full_name: Mueller, Ulrich last_name: Mueller - first_name: Ronald full_name: Noë, Ronald last_name: Noë - first_name: Samir full_name: Okasha, Samir last_name: Okasha - first_name: Pekka full_name: Pamilo, Pekka last_name: Pamilo - first_name: Geoff full_name: Parker, Geoff last_name: Parker - first_name: Jes full_name: Pedersen, Jes last_name: Pedersen - first_name: Ido full_name: Pen, Ido last_name: Pen - first_name: David full_name: Pfennig, David last_name: Pfennig - first_name: David full_name: Queller, David last_name: Queller - first_name: Daniel full_name: Rankin, Daniel last_name: Rankin - first_name: Sarah full_name: Reece, Sarah last_name: Reece - first_name: Hudson full_name: Reeve, Hudson last_name: Reeve - first_name: Max full_name: Reuter, Max last_name: Reuter - first_name: Gilbert full_name: Roberts, Gilbert last_name: Roberts - first_name: Simon full_name: Robson, Simon last_name: Robson - first_name: Denis full_name: Roze, Denis last_name: Roze - first_name: Francois full_name: Rousset, Francois last_name: Rousset - first_name: Olav full_name: Rueppell, Olav last_name: Rueppell - first_name: Joel full_name: Sachs, Joel last_name: Sachs - first_name: Lorenzo full_name: Santorelli, Lorenzo last_name: Santorelli - first_name: Paul full_name: Schmid Hempel, Paul last_name: Schmid Hempel - first_name: Michael full_name: Schwarz, Michael last_name: Schwarz - first_name: Tom full_name: Scott Phillips, Tom last_name: Scott Phillips - first_name: Janet full_name: Shellmann Sherman, Janet last_name: Shellmann Sherman - first_name: Paul full_name: Sherman, Paul last_name: Sherman - first_name: David full_name: Shuker, David last_name: Shuker - first_name: Jeff full_name: Smith, Jeff last_name: Smith - first_name: Joseph full_name: Spagna, Joseph last_name: Spagna - first_name: Beverly full_name: Strassmann, Beverly last_name: Strassmann - first_name: Andrew full_name: Suarez, Andrew last_name: Suarez - first_name: Liselotte full_name: Sundström, Liselotte last_name: Sundström - first_name: Michael full_name: Taborsky, Michael last_name: Taborsky - first_name: Peter full_name: Taylor, Peter last_name: Taylor - first_name: Graham full_name: Thompson, Graham last_name: Thompson - first_name: John full_name: Tooby, John last_name: Tooby - first_name: Neil full_name: Tsutsui, Neil last_name: Tsutsui - first_name: Kazuki full_name: Tsuji, Kazuki last_name: Tsuji - first_name: Stefano full_name: Turillazzi, Stefano last_name: Turillazzi - first_name: Francisco full_name: Úbeda, Francisco last_name: Úbeda - first_name: Edward full_name: Vargo, Edward last_name: Vargo - first_name: Bernard full_name: Voelkl, Bernard last_name: Voelkl - first_name: Tom full_name: Wenseleers, Tom last_name: Wenseleers - first_name: Stuart full_name: West, Stuart last_name: West - first_name: Mary full_name: West Eberhard, Mary last_name: West Eberhard - first_name: David full_name: Westneat, David last_name: Westneat - first_name: Diane full_name: Wiernasz, Diane last_name: Wiernasz - first_name: Geoff full_name: Wild, Geoff last_name: Wild - first_name: Richard full_name: Wrangham, Richard last_name: Wrangham - first_name: Andrew full_name: Young, Andrew last_name: Young - first_name: David full_name: Zeh, David last_name: Zeh - first_name: Jeanne full_name: Zeh, Jeanne last_name: Zeh - first_name: Andrew full_name: Zink, Andrew last_name: Zink citation: ama: Abbot P, Abe J, Alcock J, et al. Inclusive fitness theory and eusociality. Nature. 2011;471(7339):E1-E4. doi:10.1038/nature09831 apa: Abbot, P., Abe, J., Alcock, J., Alizon, S., Alpedrinha, J., Andersson, M., … Zink, A. (2011). Inclusive fitness theory and eusociality. Nature. Nature Publishing Group. https://doi.org/10.1038/nature09831 chicago: Abbot, Patrick, Jun Abe, John Alcock, Samuel Alizon, Joao Alpedrinha, Malte Andersson, Jean Andre, et al. “Inclusive Fitness Theory and Eusociality.” Nature. Nature Publishing Group, 2011. https://doi.org/10.1038/nature09831. ieee: P. Abbot et al., “Inclusive fitness theory and eusociality,” Nature, vol. 471, no. 7339. Nature Publishing Group, pp. E1–E4, 2011. ista: Abbot P et al. 2011. Inclusive fitness theory and eusociality. Nature. 471(7339), E1–E4. mla: Abbot, Patrick, et al. “Inclusive Fitness Theory and Eusociality.” Nature, vol. 471, no. 7339, Nature Publishing Group, 2011, pp. E1–4, doi:10.1038/nature09831. short: P. Abbot, J. Abe, J. Alcock, S. Alizon, J. Alpedrinha, M. Andersson, J. Andre, M. Van Baalen, F. Balloux, S. Balshine, N.H. Barton, L. Beukeboom, J. Biernaskie, T. Bilde, G. Borgia, M. Breed, S. Brown, R. Bshary, A. Buckling, N. Burley, M. Burton Chellew, M. Cant, M. Chapuisat, E. Charnov, T. Clutton Brock, A. Cockburn, B. Cole, N. Colegrave, L. Cosmides, I. Couzin, J. Coyne, S. Creel, B. Crespi, R. Curry, S. Dall, T. Day, J. Dickinson, L. Dugatkin, C. El Mouden, S. Emlen, J. Evans, R. Ferriere, J. Field, S. Foitzik, K. Foster, W. Foster, C. Fox, J. Gadau, S. Gandon, A. Gardner, M. Gardner, T. Getty, M. Goodisman, A. Grafen, R. Grosberg, C. Grozinger, P. Gouyon, D. Gwynne, P. Harvey, B. Hatchwell, J. Heinze, H. Helantera, K. Helms, K. Hill, N. Jiricny, R. Johnstone, A. Kacelnik, E.T. Kiers, H. Kokko, J. Komdeur, J. Korb, D. Kronauer, R. Kümmerli, L. Lehmann, T. Linksvayer, S. Lion, B. Lyon, J. Marshall, R. Mcelreath, Y. Michalakis, R. Michod, D. Mock, T. Monnin, R. Montgomerie, A. Moore, U. Mueller, R. Noë, S. Okasha, P. Pamilo, G. Parker, J. Pedersen, I. Pen, D. Pfennig, D. Queller, D. Rankin, S. Reece, H. Reeve, M. Reuter, G. Roberts, S. Robson, D. Roze, F. Rousset, O. Rueppell, J. Sachs, L. Santorelli, P. Schmid Hempel, M. Schwarz, T. Scott Phillips, J. Shellmann Sherman, P. Sherman, D. Shuker, J. Smith, J. Spagna, B. Strassmann, A. Suarez, L. Sundström, M. Taborsky, P. Taylor, G. Thompson, J. Tooby, N. Tsutsui, K. Tsuji, S. Turillazzi, F. Úbeda, E. Vargo, B. Voelkl, T. Wenseleers, S. West, M. West Eberhard, D. Westneat, D. Wiernasz, G. Wild, R. Wrangham, A. Young, D. Zeh, J. Zeh, A. Zink, Nature 471 (2011) E1–E4. date_created: 2018-12-11T12:02:57Z date_published: 2011-03-23T00:00:00Z date_updated: 2021-01-12T07:43:02Z day: '23' department: - _id: NiBa doi: 10.1038/nature09831 external_id: pmid: - '21430721' intvolume: ' 471' issue: '7339' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3836173/ month: '03' oa: 1 oa_version: Submitted Version page: E1 - E4 pmid: 1 publication: Nature publication_status: published publisher: Nature Publishing Group publist_id: '3237' quality_controlled: '1' scopus_import: 1 status: public title: Inclusive fitness theory and eusociality type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 471 year: '2011' ... --- _id: '3371' abstract: - lang: eng text: The Minisymposium “Cell Migration and Motility” was attended by approximately 500 visitors and covered a broad range of questions in the field using diverse model systems. Topics comprised actin dynamics, cell polarity, force transduction, signal transduction, bar- rier transmigration, and chemotactic guidance. article_type: original author: - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Carole full_name: Parent, Carole last_name: Parent citation: ama: Sixt MK, Parent C. Cells on the move in Philadelphia. Molecular Biology and Evolution. 2011;22(6):724. doi:10.1091/mbc.E10-12-0958 apa: Sixt, M. K., & Parent, C. (2011). Cells on the move in Philadelphia. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1091/mbc.E10-12-0958 chicago: Sixt, Michael K, and Carole Parent. “Cells on the Move in Philadelphia.” Molecular Biology and Evolution. Oxford University Press, 2011. https://doi.org/10.1091/mbc.E10-12-0958. ieee: M. K. Sixt and C. Parent, “Cells on the move in Philadelphia,” Molecular Biology and Evolution, vol. 22, no. 6. Oxford University Press, p. 724, 2011. ista: Sixt MK, Parent C. 2011. Cells on the move in Philadelphia. Molecular Biology and Evolution. 22(6), 724. mla: Sixt, Michael K., and Carole Parent. “Cells on the Move in Philadelphia.” Molecular Biology and Evolution, vol. 22, no. 6, Oxford University Press, 2011, p. 724, doi:10.1091/mbc.E10-12-0958. short: M.K. Sixt, C. Parent, Molecular Biology and Evolution 22 (2011) 724. date_created: 2018-12-11T12:02:57Z date_published: 2011-03-15T00:00:00Z date_updated: 2021-01-12T07:43:01Z day: '15' ddc: - '570' department: - _id: MiSi doi: 10.1091/mbc.E10-12-0958 file: - access_level: open_access checksum: 3467986ab7a64e7694ffd1013b5d9da9 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:29Z date_updated: 2020-07-14T12:46:11Z file_id: '5283' file_name: IST-2015-373-v1+1_Mol._Biol._Cell-2011-Sixt-724.pdf file_size: 105421 relation: main_file file_date_updated: 2020-07-14T12:46:11Z has_accepted_license: '1' intvolume: ' 22' issue: '6' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '03' oa: 1 oa_version: Published Version page: '724' publication: Molecular Biology and Evolution publication_status: published publisher: Oxford University Press publist_id: '3238' pubrep_id: '373' quality_controlled: '1' scopus_import: 1 status: public title: Cells on the move in Philadelphia tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2011' ... --- _id: '3374' abstract: - lang: eng text: Genetic regulatory networks enable cells to respond to changes in internal and external conditions by dynamically coordinating their gene expression profiles. Our ability to make quantitative measurements in these biochemical circuits has deepened our understanding of what kinds of computations genetic regulatory networks can perform, and with what reliability. These advances have motivated researchers to look for connections between the architecture and function of genetic regulatory networks. Transmitting information between a network's inputs and outputs has been proposed as one such possible measure of function, relevant in certain biological contexts. Here we summarize recent developments in the application of information theory to gene regulatory networks. We first review basic concepts in information theory necessary for understanding recent work. We then discuss the functional complexity of gene regulation, which arises from the molecular nature of the regulatory interactions. We end by reviewing some experiments that support the view that genetic networks responsible for early development of multicellular organisms might be maximizing transmitted 'positional information'. article_number: '153102' author: - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Aleksandra full_name: Walczak, Aleksandra last_name: Walczak citation: ama: 'Tkačik G, Walczak A. Information transmission in genetic regulatory networks a review. Journal of Physics: Condensed Matter. 2011;23(15). doi:10.1088/0953-8984/23/15/153102' apa: 'Tkačik, G., & Walczak, A. (2011). Information transmission in genetic regulatory networks a review. Journal of Physics: Condensed Matter. IOP Publishing Ltd. https://doi.org/10.1088/0953-8984/23/15/153102' chicago: 'Tkačik, Gašper, and Aleksandra Walczak. “Information Transmission in Genetic Regulatory Networks a Review.” Journal of Physics: Condensed Matter. IOP Publishing Ltd., 2011. https://doi.org/10.1088/0953-8984/23/15/153102.' ieee: 'G. Tkačik and A. Walczak, “Information transmission in genetic regulatory networks a review,” Journal of Physics: Condensed Matter, vol. 23, no. 15. IOP Publishing Ltd., 2011.' ista: 'Tkačik G, Walczak A. 2011. Information transmission in genetic regulatory networks a review. Journal of Physics: Condensed Matter. 23(15), 153102.' mla: 'Tkačik, Gašper, and Aleksandra Walczak. “Information Transmission in Genetic Regulatory Networks a Review.” Journal of Physics: Condensed Matter, vol. 23, no. 15, 153102, IOP Publishing Ltd., 2011, doi:10.1088/0953-8984/23/15/153102.' short: 'G. Tkačik, A. Walczak, Journal of Physics: Condensed Matter 23 (2011).' date_created: 2018-12-11T12:02:58Z date_published: 2011-04-01T00:00:00Z date_updated: 2021-01-12T07:43:03Z day: '01' department: - _id: GaTk doi: 10.1088/0953-8984/23/15/153102 intvolume: ' 23' issue: '15' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1101.4240 month: '04' oa: 1 oa_version: Submitted Version publication: 'Journal of Physics: Condensed Matter' publication_status: published publisher: IOP Publishing Ltd. publist_id: '3233' quality_controlled: '1' scopus_import: 1 status: public title: Information transmission in genetic regulatory networks a review type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2011' ...